检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

503 篇 期刊文献
350 篇 会议
11 篇 学位论文

馆藏范围

864 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

815 篇 工学
- 781 篇 计算机科学与技术...
- 399 篇 软件工程
- 57 篇 电气工程
- 24 篇 信息与通信工程
- 24 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
406 篇 理学
- 387 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
5 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
4 篇 法学
- 3 篇 法学
- 1 篇 社会学
3 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

864 篇 answer set progr...
77 篇 logic programmin...
68 篇 knowledge repres...
33 篇 knowledge repres...
31 篇 nonmonotonic rea...
27 篇 artificial intel...
26 篇 equilibrium logi...
24 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
16 篇 aggregates
16 篇 computational co...
16 篇 stream reasoning
15 篇 strong equivalen...
12 篇 stable model sem...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

33 篇 univ potsdam pot...
18 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

47 篇 schaub torsten
44 篇 alviano mario
42 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
27 篇 gebser martin
26 篇 leone nicola
25 篇 calimeri frances...
24 篇 fandinno jorge
22 篇 erdem esra
20 篇 ianni giovambatt...
20 篇 gupta gopal
19 篇 lifschitz vladim...
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 zangari jessica
18 篇 faber wolfgang
17 篇 woltran stefan

语言

841 篇 英文
18 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer Set Programming"

共 864 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Recongo: Bounded Combinatorial Reconfiguration with answer set programming 18th

Recongo: Bounded Combinatorial Reconfiguration with Answer S...

引用

18th European Conference on Logics in Artificial Intelligence (JELIA)

作者： Yamada, Yuya Banbara, Mutsunori Inoue, Katsumi Schaub, Torsten Nagoya Univ Furo ChoChikusa Ku Nagoya 4648601 Japan Natl Inst Informat HitotsubashiChiyoda Ku Tokyo 1018430 Japan Univ Potsdam Bahn 2 D-14476 Potsdam Germany

ISBN: (纸本)9783031436185;9783031436192

We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on answer set programming. The general task is to study the solution spaces of source combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track.

关键词： answer set programming Multi-shot ASP solving Combinatorial Reconfiguration Independent set Reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Grammatical Inference by answer set programming 1

引用

20th Annual International Conference on Computational Science (ICCS)

作者： Wieczorek, Wojciech Strak, Lukasz Nowakowski, Arkadiusz Unold, Olgierd Univ Silesia Katowice Inst Comp Sci Sosnowiec Poland Wroclaw Univ Sci & Technol Dept Comp Engn Wroclaw Poland

ISBN: (数字)9783030504236

ISBN: (纸本)9783030504236;9783030504229

In this paper, the identification of context-free grammars based on the presentation of samples is investigated. The main idea of solving this problem proposed in the literature is reformulated in two different ways: in terms of general constrains and as an answer set program. In a series of experiments, we showed that our answer set programming approach is much faster than our alternative method and the original SAT encoding method. Similarly to a pioneer work, some well-known context-free grammars have been induced correctly, and we also followed its test procedure with randomly generated grammars, making it clear that using our answer set programs increases computational efficiency. The research can be regarded as another evidence that solutions based on the stable model (answer set) semantics of logic programming may be a right choice for complex problems.

关键词： Grammatical inference answer set programming Constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

Detecting inconsistencies in large biological networks with answer set programming

Detecting inconsistencies in large biological networks with ...

引用

24th International Conference on Logic programming (ICLP)

作者： Gebser, Martin Schaub, Torsten Thiele, Sven Veber, Philippe Univ Potsdam Inst Informat Potsdam Germany Inst Cochin Paris France

We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and high-throughput profiles of cell activity. We then present an approach based on answer set programming to check the consistency of large-scale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions.

关键词： answer set programming bioinformatics consistency diagnosis

来源：评论

学校读者我要写书评

暂无评论

Functional answer set programming

Functional answer set programming

引用

24th International Conference on Logic programming (ICLP)

作者： Cabalar, Pedro Univ A Coruna Dept Comp Sci Corunna Spain

In this paper we propose an extension of answer set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

关键词： answer set programming equilibrium logic partial functions functional logic programming

来源：评论

学校读者我要写书评

暂无评论

An answer set programming Based Framework for High-Utility Pattern Mining Extended with Facets and Advanced Utility Functions 5th

An Answer Set Programming Based Framework for High-Utility P...

引用

5th International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Cauteruccio, Francesco Terracina, Giorgio Univ Calabria DEMACS Arcavacata Di Rende Italy

ISBN: (纸本)9783030911676;9783030911669

In the context of pattern mining, the utility of a pattern can be described as a preference ordering over a choice set;it can be actually assessed from very different perspectives and at different abstraction levels. However, while the topic of High-Utility Pattern Mining (HUPM) has been widely studied, the basic assumption is that each item in a knowledge base is associated with one, static utility. In this paper we introduce, among others, the notion of facets for items, which allows to cope with this limitation and, moreover, we show how a more structured representation of available information, coupled with facets defined also for higher abstraction levels, paves the way to new opportunities for HUPM. In particular, the proposed framework allows to introduce some new advanced classes of utility functions in the detection process, whose relevance is also experimentally evaluated. A real use case on paper reviews is exploited to analyze the potentiality of the proposed framework in knowledge creation and discovery. Given the wide variety of analytical scenarios that can be envisioned in this new setting, we take full advantage of the capabilities of answer set programming and its extensions for a fast encoding and testing of the framework.

关键词： High-utility pattern mining answer set programming Facets Advanced utility functions

来源：评论

学校读者我要写书评

暂无评论

An Advanced answer set programming Encoding for Nurse Scheduling 16th

An Advanced Answer Set Programming Encoding for Nurse Schedu...

引用

16th International Conference of the Italian Association for Artificial Intelligence (AI*IA)

作者： Alviano, Mario Dodaro, Carmine Maratea, Marco Univ Calabria DEMACS Arcavacata Di Rende Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783319701691;9783319701684

The goal of the Nurse Scheduling Problem (NSP) is to find an assignment of nurses to shifts according to specific requirements. Given its practical relevance, many researchers have developed different strategies for solving several variants of the problem. One of such variants was recently addressed by an approach based on answer set programming (ASP), obtaining promising results. Nonetheless, the original ASP encoding presents some intrinsic weaknesses, which are identified and eventually circumvented in this paper. The new encoding is designed by taking into account both intrinsic properties of NSP and internal details of ASP solvers, such as cardinality and weight constraint propagators. The performance gain of CLINGO and wasp is empirically verified on instances from ASP literature. As an additional contribution, the performance of CLINGO and wasp is compared to other declarative frameworks, namely SAT and ILP;the best performance is obtained by CLINGO running the new ASP encoding.

关键词： answer set programming Knowledge representation and reasoning Nurse Scheduling

来源：评论

学校读者我要写书评

暂无评论

A New Tree-Decomposition Based Algorithm for answer set programming

A New Tree-Decomposition Based Algorithm for Answer Set Prog...

引用

23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Morak, Michael Musliu, Nysret Pichler, Reinhard Ruemmele, Stefan Woltran, Stefan Vienna Univ Technol Inst Informat Syst Vienna Austria

A promising approach to tackle intractable problems is given by combining decomposition methods with dynamic programming algorithms. One such decomposition concept is tree decomposition. In this paper, we provide a ne... 详细信息

ISBN: (纸本)9780769545967

关键词： Artificial intelligence Conferences answer set programming answer set programming computability dynamic programming dynamic programming dynamic programming inference mechanisms intractable problems reasoning problems tree decomposition tree-decomposition

来源：评论

学校读者我要写书评

暂无评论

Semantic Web Service Composition: From OWL-S to answer set programming

Semantic Web Service Composition: From OWL-S to Answer Set P...

引用

International Workshop on Computer Science for Environmental Engineering and EcoInformatics (CSEEE)

作者： Qian, Junyan Huang, Guowang Zhao, Lingzhong Guilin Univ Elect Technol Dept Comp Sci & Engn Guilin 541004 Peoples R China

ISBN: (纸本)9783642226915

This paper presents a method that adapting planning description to bring the semantic information into play for service composition through action language C. It shows how service descriptions can be expressed by preconditions and effects and the action language C provides a richer syntax and semantic for complex service descriptions. We also presents the algorithm of translating semantic web service described by OWL-S to action language C. Thanks to the structured description and the powerful expression of C. we only consider the initial Situation and the desired goal ignoring details of transition and planning. At last we use satisfiability planning to solve the planning problem by translating the action language into disjunctive logic program.

关键词： Service composition Action language answer set programming

来源：评论

学校读者我要写书评

暂无评论

Jury-Trial Story Construction and Analysis Using Goal-Directed answer set programming 25th

Jury-Trial Story Construction and Analysis Using Goal-Direct...

引用

25th International Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Xu, Zesheng Arias, Joaquin Salazar, Elmer Chen, Zhuo Varanasi, Sarat Chandra Basu, Kinjal Gupta, Gopal Univ Texas Dallas Richardson TX 75083 USA Univ Rey Juan Carlos CETINIA Madrid Spain

ISBN: (纸本)9783031248405;9783031248412

answer set programming (ASP) is a well known paradigm for knowledge representation and for automating commonsense reasoning. Query-driven implementations of Predicate ASP, e.g., the s(CASP) system, permit top-down execution of answer set programs without the need for grounding them. In this paper we consider the problem of analyzing a jury trial for the crime of homicide. We demonstrate how knowledge related to reaching a guilty/not-guilty verdict can be modeled in ASP, and how s(CASP) can be used to analyze the situations under various assumptions. Detailed justification can be provided for each possible verdict, thanks to s(CASP). The goal, and the main contribution, of this paper is to show how a complex situation-whose analysis has been traditionally considered to be within the purview of only humans-can be automatically analyzed using a query-driven predicate ASP system such as s(CASP). For illustration, we use the well-known fictional case of Commonwealth of Massachusetts v. Johnson used in the cognitive science literature. Frank Johnson and Alan Caldwell had a quarrel, which was later followed by Frank Johnson stabbing Alan Caldwell. However, this seemingly simple case was complex in many ways: the lack of critical information led to different verdicts from different jurors. This paper attempts to formalize the logic behind each story construction using s(CASP) and expanding it to similar situations.

关键词： answer set programming Commonsense reasoning Explanation-based decision making

来源：评论

学校读者我要写书评

暂无评论

Rethinking answer set programming Templates 26th

Rethinking Answer Set Programming Templates

引用

26th International Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Alviano, Mario Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031520372;9783031520389

In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest. Code is cleaner and more secure because any implicit assumption is removed in favor of invariants, thus enabling a fail fast mindset and the immediate reporting of unexpected conditions. This article introduces a notion of template for answer set programming that, in addition to the don't repeat yourself principle, enforces locality of some predicates by means of a simple naming convention. Local predicates are mapped to the usual global namespace adopted bymainstream engines, using universally unique identifiers to avoid name clashes. This way, local predicates can be used to enforce invariants on the expected outcome of a template in a possibly empty context of application, independently by other rules that can be added to such a context. Template applications transpiled this way can be processed by mainstream engines and safely shared with other knowledge designers, even when they have zero knowledge of templates.

关键词： answer set programming secure coding clean code Domain-Driven Design Test-Driven Development

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共87页 << < 15 16 17 18 19 20 21 22 23 24 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：