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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

67 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

65 篇 工学
- 65 篇 计算机科学与技术...
- 24 篇 软件工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 食品科学与工程（可...
9 篇 理学
- 9 篇 数学
- 1 篇 生物学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

26 篇 logic programmin...
7 篇 semantics
3 篇 computer circuit...
3 篇 answer-set progr...
3 篇 artificial intel...
2 篇 mathematical log...
2 篇 constraint progr...
2 篇 temporal logic
2 篇 knowledge repres...
1 篇 object oriented ...
1 篇 modeling other a...
1 篇 aggregates
1 篇 belief revision
1 篇 message passing
1 篇 theory of comput...
1 篇 software enginee...
1 篇 formal logic
1 篇 strong negation
1 篇 programming
1 篇 minimal model

机构

3 篇 vienna universit...
3 篇 university of ca...
3 篇 univ potsdam ins...
3 篇 univ kentucky de...
2 篇 sabanci univ fac...
2 篇 department of co...
2 篇 univ a coruna de...
2 篇 sabanci univ fac...
2 篇 univ calabria de...
2 篇 vienna univ tech...
1 篇 eastman kodak co...
1 篇 new mexico state...
1 篇 tech univ inst s...
1 篇 univ a coruna la...
1 篇 univ politecn ma...
1 篇 univ nova lisboa...
1 篇 nii tokyo
1 篇 tokyo inst techn...
1 篇 univ a coruna co...
1 篇 suny stony brook...

作者

7 篇 woltran stefan
5 篇 gebser martin
5 篇 schaub torsten
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 tompits hans
4 篇 leone nicola
4 篇 erdem esra
4 篇 de vos marina
3 篇 ianni giovambatt...
3 篇 calimeri frances...
3 篇 oetsch johannes
3 篇 brain martin
3 篇 cozza susanna
3 篇 puehrer joerg
2 篇 cliffe owen
2 篇 perez gilberto
2 篇 dovier agostino
2 篇 kifer michael
2 篇 eiter thomas

语言

71 篇 英文

检索条件"任意字段=10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009"

共 71 条记录，以下是41-50 订阅

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

详细简洁

排序：

Strong and uniform equivalence of nonmonotonic theories-An algebraic approach

Strong and uniform equivalence of nonmonotonic theories-An a...

引用

10th international conference on Principles of Knowledge Representation and reasoning, KR 2006

作者： Truszczyński, Miroslaw Department of Computer Science University of Kentucky Lexington KY 40506-0046 United States

ISBN: (纸本)9781577352716

We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and uniform equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic. Copyright © 2006, American Association for Artificial Intelligence.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing Stable Models via Reductions to Difference logic

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Janhunen, Tomi Niemela, Ilkka Sevalnev, Mark Aalto Univ Dept Informat & Comp Sci FI-02015 Helsinki Finland

ISBN: (纸本)9783642042379

Propositional satisfiability (SAT) solvers provide a promising computational platform for logic programs under the stable model semantics. However. computing stable models of a logic program using a SAT solver presumes translating the program into a set of clauses which is the input form accepted by most SAT solvers. this leads to fairly complex super-linear translations. there are, however, interesting extensions to plain clausal propositional representations Such as difference logic. A number of solvers have been developed for difference logic, in particular in the context of the satisfiability modulo theories (SMT) framework. and the goal of the paper is to study whether Such engines could be harnessed to the computation of stable models for logic programs in an effective way. To this end, we provide succinct translations front logic programs to theories of difference logic and evaluate the potential of SMT solvers in the computation of stable models using, these translations and a selection of benchmarks.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Deductive System for FO(ID) Based on Least Fixpoint logic

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Hou, Ping Denecker, Marc Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

ISBN: (纸本)9783642042379

the logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. the goal of this paper is to extend Gentzen's sequeut calculus to obtain a deductive inference method for FO(ID). the main difficulty in building Such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounded sets by least fixpoint expressions borrowed from stratified least fixpoint logic (SLFP), which is a logic with a least fixpoint operator and characterizes the expressibility of stratified logic programs. therefore, in this paper, we integrate least fixpoint expressions into FO(ID) and define the logic FO(ID,SLFP). We investigate a sequeut calculus for FO(ID,SLFP), which extends the sequent calculus for SLFP with inference rules for the inductive definitions of FO(ID). We show that this proof system is sound with respect to a slightly restricted fragment of FO(ID) and complete for a more restricted fragment of FO(ID).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

AQL : AAA query language for action domains modelled using answer set programming

引用

10th international conference on logic programming and nonmonotonic reasoning, lpnmr 2009

作者： Hopton, Luke Cliffe, Owen De Vos, Marina Padget, Julian Department of Computer Science University of Bath BATH BA2 7AY United Kingdom

ISBN: (纸本)3642042376

We present a new general purpose query and abduction language for reasoning about action domains that allows the processing of simultaneous actions, definition of conditions and reasoning about fluents and actions. AQL provides a simple declarative syntax for the specification of constraints on the histories (the combination of action traces and state transitions) within the modelled domain. Its semantics, provided by the translation of AQL queries into Ans-Prolog, acquires the benefits of the reasoning power provided by Answer Set programming (ASP). the answer sets obtained from combining the query and the domain description correspond to those histories of the domain changing over time that satisfy the query. the result is a simple, high-level query and constraint language that builds on ASP. through the synthesis of features it offers a more flexible, versatile and intuitive approach compared to existing languages. Due to the use of ASP, AQL can also be used to reason about partial histories. © 2009 Springer Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Translating Preferred Answer Set Programs to Propositional logic

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Asuncion, Vernon Zhang, Yan Univ Western Sydney Sch Comp & Math Intelligent Syst Lab Penrith NSW 1797 Australia

ISBN: (纸本)9783642042379

We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and practical interests: on one hand, it will shed new insights to understand the expressive power of preferred answer set programs on the other hand, it may also lead to efficient implementations for computing preferred answer sets of logic programs. In this paper, we focus on Brewka and Eiter's preferred answer set programs. We propose a translation from preferred answer set programs to propositional logic and show that there is one-to-one correspondence between the preferred answer sets of the program to the models of the resulting propositional theory. We then link this result to Brewka and Eiter's weakly preferred answer set semantics.

关键词： answer set semantics prioritized logic programs answer set computations

来源：评论

学校读者我要写书评

暂无评论

Splitting Epistemic logic Programs 15th

Splitting Epistemic Logic Programs

引用

15th international conference on logic programming and nonmonotonic reasoning (lpnmr)

作者： Cabalar, Pedro Fandinno, Jorge Farinas del Cerro, Luis Univ A Coruna Corunna Spain Univ Toulouse CNRS IRIT Toulouse France

ISBN: (纸本)9783030205287;9783030205270

Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, as the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing proposals fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond in 1991.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Ishebabi, Harold Mahr, Philipp Bobda, Christophe Gebser, Martin Schaub, Torsten Univ Potsdam Inst Informat D-14482 Potsdam Germany

ISBN: (纸本)9783642042379

Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility Of field-programmable devices to customize architectures for parallel programs, thereby alleviating technological limitations due to memory bandwidth and power Consumption. Given the huge size of the design Space Of Such Systems, it is important to automatically optimize design parameters in order to facilitate wide and disciplined explorations. Being a combinatorial problem. system design can be modeled and solved as Such, but the amount of parameters renders the problem difficult to Solve for large instances. However. its the synthesis problem usually exhibits structure, Answer Set programming (ASP), for which solvers utilizing techniques from the propositional satisfiability domain are available, can be effectively employed. this paper presents a design flow based on ASP that uses the solver clasp as back-end engine. Synthesis experiments demonstrate the effectiveness of the approach.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Relevance-Driven Evaluation of Modular nonmonotonic logic Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Dao-Tran, Minh Eiter, thomas Fink, Michael Krennwallner, thomas Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642042379

Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. this call be used for more Succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at all efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally. we discuss syntactic conditions for its exploitation.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：