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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 719 条记录，以下是321-330 订阅

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

详细简洁

排序：

Debugging ASP programs by means of ASP

Debugging ASP programs by means of ASP

引用

9th international conference on logic programming and nonmonotonic reasoning

作者： Brain, Martin Gebser, Martin Puehrer, Jorg Schaub, Torsten Tompits, Hans Woltran, Stefan Univ Potsdam Inst Informat D-14482 Potsdam Germany Univ Bath Dept Comp Sci Bath BA2 7AY Avon England Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783540721994

Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the development of software-engineering tools is vital. In particular, the area of debugging provides a challenge in both theoretical and practical terms. this is due to the purely declarative nature of ASP that, on the one hand, calls for solver-independent methodologies and, on the other hand, does not directly apply to tracing techniques. In this paper, we propose a novel methodology, which rests within ASP itself, to sort out errors on the conceptual level. Our method makes use of tagging, where the program to be analyzed is rewritten using dedicated control atoms. this provides a flexible way to specify different types of debugging requests and a first step towards a dedicated (meta level) debugging language.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Interpretability and equivalence in quantified equilibrium logic

Interpretability and equivalence in quantified equilibrium l...

引用

Workshop on Correspondence and Equivalence for nonmonotonic theories, CENT 2007, Colocated with 9th international conference on logic programming and nonmonotonic reasoning, LPNMR 2007

作者： Pearce, David Valverde, Agustín Computing Science and Artificial Intelligence Univ. Rey Juan Carlos Móstoles Madrid Spain Dept. of Applied Mathematics Univ. of Malaga Spain

the study of synonymy among propositional theories in equilibrium logic, begun in [36], is extended to the first-order case.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

ActhEX: Implementing HEX Programs with Action Atoms

ActHEX: Implementing HEX Programs with Action Atoms

引用

12th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Fink, Michael Germano, Stefano Ianni, Giovambattista Redl, Christoph Schuller, Peter Vienna Univ Technol Inst Informationssyst Vienna Austria Univ Calabria Dipartimento Matemat & Informat I-87030 Commenda Di Rende Italy Sabanci Univ Fac Engn & Natl Sci Istanbul Turkey

ISBN: (纸本)9783642405648

acthex programs are a convenient tool for connecting stateful external environments to logic programs. In the acthex framework, actual actions on an external environment can be declaratively selected, rearranged, scheduled and then executed depending on intelligence specified in an ASP-based language. We report in this paper about recent improvements of the formal and of the operational acthex programming framework. Besides yielding a significant increase in versatility of the framework, we also present illustrative application showcases and a short evaluation thereof exhibiting computational acthex strengths.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

nonmonotonic reasoning with quantified boolean constraints 4th

Nonmonotonic reasoning with quantified boolean constraints

引用

4th international conference on logic programming and Non-Monotonic reasoning, LPNMR 1997

作者： Pollett, Chris Remmel, Jeffrey B. Department of Mathematics University of California at San Diego La JollaCA92903 United States Sagent Corporation BellvueWA98004 United States

ISBN: (纸本)9783540632559

In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of Marek, Nerode, and Remmel [15] and of the natural extension of their theory to default logic. We also introduce a new formalism which adds constraints to circumscription. We show that standard complexity results for each of these formalisms generalize in the quantified constraint case. Gogic, Kautz, Papadimitriou, and Selman [8] have introduced a new method for measuring the strengths of reasoning formalisms based on succinctness of model representation. We show a natural hierarchy based on this measure exists between our versions of logic programming, circumscription, and default logic. Finally, we discuss some results about the relative succinctness of our reasoning formalisms versus any formalism for which model checking can be done somewhere in the polynomial time hierarchy. © 1997, Springer Verlag. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

LP2NORMAL-A Normalization Tool for Extended logic Programs 14th

LP2NORMAL-A Normalization Tool for Extended Logic Programs

引用

14th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Bomanson, Jori Aalto Univ Dept Comp Sci Espoo Finland

ISBN: (纸本)9783319616605;9783319616599

Answer set programming (ASP) features a rich rule-based modeling language for encoding search problems. While normal rules form the simplest rule type in the language, various forms of extended rules have been introduced in order to ease modeling of complex conditions and constraints. Normalization means replacing such extended rules with identically functioning sets of normal rules. In this system description, we present LP2NORMAL, which is a state-of-the-art normalizer that acts as a filter on ground logic programs produced by grounders, such as gringo. It provides options to translate away choice rules, cardinality rules, and weight rules, and to rewrite optimization statements using comparable techniques. the produced logic programs are suitable inputs to tools that lack support for extended rules, in particular. We give an overview of the normalization techniques currently supported by the tool and summarize its features. Moreover, we discuss the typical application scenarios of normalization, such as when implementing the search for answer sets using a back-end solver without direct support for cardinality constraints or pseudo-Boolean constraints.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Experimenting with look-back heuristics for hard ASP programs

Experimenting with look-back heuristics for hard ASP program...

引用

9th international conference on logic programming and nonmonotonic reasoning

作者： Faber, Wolfgang Leone, Nicola Maratea, Marco Ricca, Francesco Univ Calabria Dept Math I-87036 Arcavacata Di Rende Italy

ISBN: (纸本)9783540721994

Competitive native solvers for Answer Set programming (ASP) perform a backtracking search by assuming the truth of literals. the choice of literals (the heuristic) is fundamental for the performance of these systems. Most of the efficient ASP systems employ a heuristic based on look-ahead, that is, a literal is tentatively assumed and its heuristic value is based on its deterministic consequences. However, looking ahead is a costly operation, and indeed look-ahead often accounts for the majority of time taken by ASP solvers. For Satisfiability (SAT), a radically different approach, called look-back heuristic, proved to be quite successful: Instead of looking ahead, one uses information gathered during the computation performed so far, thus looking back. In this approach, atoms which have been frequently involved in inconsistencies are preferred. In this paper, we carry over this approach to the framework of disjunctive ASP. We design a number of look-back heuristics exploiting peculiarities of ASP and implement them in the ASP system DLV. We compare their performance on a collection of hard ASP programs both structured and randomly generated. these experiments indicate that a very basic approach works well, outperforming all of the prominent disjunctive ASP systems - DLV (with its traditional heuristic), GnT, and CModels3 - on many of the instances considered.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Revised Concept of Safety for General Answer Set Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Cabalar, Pedro Pearce, David Valverde, Agustin Univ A Coruna La Coruna Spain Univ Politecn Madrid Madrid Spain Univ Malaga E-29071 Malaga Spain

ISBN: (纸本)9783642042379

To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas in quantified equilibrium logic where answer sets can be defined for arbitrary first-order formulas. the new concept captures and generalises two recently proposed safety definitions: that of Lee, Lifschitz and Palla (2008) as well as that of Bria, Faber and Leone (2008). We Study the main metalogical properties of safe formulas.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing preferred answer sets in answer set programming 1

引用

10th international conference on logic for programming, Artificial Intelligence, and reasoning (LPAR2003)

作者： Wakaki, T Inoue, K Sakama, C Nitta, K Shibaura Inst Technol Dept Elect Informat Syst Minuma Ku Saitama City Saitama 3378570 Japan Kobe Univ Dept Elect & Elect Engn Kobe Hyogo 6578501 Japan Wakayama Univ Ctr Informat Sci Wakayama 6408510 Japan Tokyo Inst Technol Dept Computat Intelligence & Syst Sci Midori Ku Yokohama Kanagawa 2268502 Japan

ISBN: (数字)9783540398134

ISBN: (纸本)3540201017

Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. the declarative semantics of a PLP is given as preferred answer sets which are used for representing nonmonotonic reasoning as well as preference abduction. From the computational viewpoint, however, its implementation issues have little been studied and no sound procedure is known for computing preferred answer sets of PLPs. In this paper, we present a sound and complete procedure to compute all preferred answer sets of a PLP in answer set programming. the procedure is based on a program transformation from a PLP to a logic program and is realized on top of any procedure for answer set programming. the proposed technique also extends PLPs to handle dynamic preference and we address its application to legal reasoning.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Integrating Temporal Extensions of Answer Set programming

Integrating Temporal Extensions of Answer Set Programming

引用

12th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Aguado, Felicidad Perez, Gilberto Vidal, Concepcion Univ A Coruna Dept Comp Sci La Coruna Spain

ISBN: (纸本)9783642405648

In this paper we study the relation between the two main extensions of Answer Set programming with temporal modal operators: Temporal Equilibrium logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a complete non-monotonic logic that results from the combination of Linear-time Temporal logic (LTL) with Equilibrium logic. On the other hand, TAS is based on a richer modal approach, Dynamic LTL (DLTL), whereas its non-monotonic part relies on a reduct-based definition for a particular limited syntax. To integrate both approaches, we propose a Dynamic Linear-time extension of Equilibrium logic (DTEL) that allows accommodating both TEL and TAS as particular cases. With respect to TEL, DTEL incorporates more expressiveness thanks to the addition of dynamic logic operators, whereas with respect to TAS, DTEL provides a complete non-monotonic semantics applicable to arbitrary theories. In the paper, we identify cases in which both formalisms coincide and explain how this relation can be exploited for adapting existing TEL and TAS computation methods to the general case of DTEL.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Puehrer, Joerg Tompits, Hans Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria

ISBN: (纸本)9783642042379

In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at studying conditions under which certain syntactic constructs can be eliminated from programs preserving some given equivalence relation. In this paper, we continue this endeavour introducing novel conditions under which disjunction and negation can be eliminated from answer-set programs under relativised strong equivalence with projection. this notion is a generalisation of the usual strong-equivalence relation, as introduced by Lifschitz. Pearce, and Valverde, by allowing parametrisable context and Output alphabets, which is an important feature in view of practical programming techniques like the use of local variables and modules. We provide model-theoretic conditions that hold for a disjunctive logic program P precisely when there is a program Q, equivalent to P under our considered notion, Such that Q is either positive, normal, or Horn, respectively. Moreover, we outline how such a Q, called a casting of P, can be obtained, and consider complexity issues.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：