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

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

作者： Martens, Chris Bosser, Anne-Gwenn Ferreira, Joao F. Cavazza, Marc Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Teesside Middlesbrough Cleveland England

ISBN: (纸本)9783642405648

In this paper, we explore the use of Linear logic programming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. this approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms.

关键词： Linear logic programming Narrative Modelling Celf

来源：评论

学校读者我要写书评

暂无评论

Prolog and ASP Inference under One Roof

Prolog and ASP Inference under One Roof

引用

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

作者： Balduccini, Marcello Lierler, Yuliya Schuller, Peter Eastman Kodak Co Rochester NY 14650 USA Univ Nebraska Omaha NE USA Sabancuy Univ Istanbul Turkey

ISBN: (纸本)9783642405648

Answer set programming (ASP) is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. the proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from PROLOG. Using PROLOG inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.

关键词： Answer Set programming Prolog Grounding Bottleneck.

来源：评论

学校读者我要写书评

暂无评论

Concrete Results on Abstract Rules

Concrete Results on Abstract Rules

引用

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

作者： Kroetzsch, Markus Magka, Despoina Horrocks, Ian Univ Oxford Dept Comp Sci Oxford OX1 2JD England

ISBN: (纸本)9783642405648

there are many different notions of "rule" in the literature. A key feature and main intuition of any such notion is that rules can be "applied" to derive conclusions from certain premises. More formally, a rule is viewed as a function that, when invoked on a set of known facts, can produce new facts. In this paper, we show that this extreme simplification is still sufficient to obtain a number of useful results in concrete cases. We define abstract rules as a certain kind of functions, provide them with a semantics in terms of (abstract) stable models, and explain how concrete normal logic programming rules can be viewed as abstract rules in a variety of ways. We further analyse dependencies between abstract rules to recognise classes of logic programs for which stable models are guaranteed to be unique.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Belief Change in nonmonotonic Multi-Context Systems

Belief Change in Nonmonotonic Multi-Context Systems

引用

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

作者： Wang, Yisong Zhuang, Zhiqiang Wang, Kewen Guizhou Univ Dept Comp Sci Guiyang 550025 Peoples R China Griffith Univ Sch Informat & Communicat Technol Nathan Qld 4111 Australia

ISBN: (纸本)9783642405648

Brewka and Eiter's nonmonotonic multi-context system is an elegant knowledge representation framework to model heterogeneous and nonmonotonic multiple contexts. Belief change is a central problem in knowledge representation and reasoning. In this paper we follow the classical AGM approach to investigate belief change in multi-context systems. Specifically, we formulate semantically the AGM postulates of belief expansion, revision and contraction for multi-context systems. We show that the change operations can be characterized in terms of minimal change by ordering equilibria of multi-context systems. Two distance based revision operators are obtained and related to the classical Satoh and Dalal revision operators (via loop formulas).

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Accurate Computation of Sensitizable Paths Using Answer Set programming

Accurate Computation of Sensitizable Paths Using Answer Set ...

引用

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

作者： Andres, Benjamin Sauer, Matthias Gebser, Martin Schubert, Tobias Becker, Bernd Schaub, Torsten Univ Potsdam August Bebel Str 89 D-14482 Potsdam Germany Univ Freiburg D-79110 Freiburg Germany

ISBN: (纸本)9783642405648

Precise knowledge of the longest sensitizable paths in a circuit is crucial for various tasks in computer-aided design, including timing analysis, performance optimization, delay testing, and speed binning. As delays in today's nanoscale technologies are increasingly affected by statistical parameter variations, there is significant interest in obtaining sets of paths that are within a length range. For instance, such path sets can be used in the emerging areas of Post-silicon validation and characterization and Adaptive Test. We present an ASP-based method for computing well-defined sets of sensitizable paths within a length range. Unlike previous approaches, the method is accurate and does not rely on a priori relaxations. Experimental results demonstrate the applicability and scalability of our method.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Characterization of logic program revision as an extension of propositional revision

引用

thEORY AND PRACTICE OF logic programming 2016年第1期16卷 111-138页

作者： Schwind, Nicolas Inoue, Katsumi Transdisciplinary Res Integrat Ctr Chiyoda Ku Tokyo 1018430 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11th international conference on Principles of Knowledge Representation and reasoning (KR'08), 411-421;2013b. Proc. of the 12th international conference on logic programming and nonmonotonic reasoning (lpnmr'13), 264-276) adapted the well-known AGM framework (Alchourron et al. 1985. Journal of Symbolic logic 50, 2, 510-530) to LP revision. they identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result t

关键词： belief revision logic programming characterization theorems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set programming

Flexible Combinatory Categorial Grammar Parsing Using the CY...

引用

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

作者： Schuller, Peter Sabanci Univ Cognit Robot Lab Istanbul Turkey

ISBN: (纸本)9783642405648

Combinatory Categorial Grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories in order to parse sentences. In this work we describe and implement a new approach to CCG parsing that relies on Answer Set programming (ASP) - a declarative programming paradigm. Different from previous work, we present an encoding that is inspired by the algorithm due to Cocke, Younger, and Kasami (CYK). We also show encoding extensions for parse tree normalization and best-effort parsing and outline possible future extensions which are possible due to the usage of ASP as computational mechanism. We analyze performance of our approach on a part of the Brown corpus and discuss lessons learned during experiments with the ASP tools dlv, gringo, and clasp. the new approach is available in the open source CCG parsing toolkit AspCcgTk which uses the C&C supertagger as a preprocessor to achieve wide-coverage natural language parsing.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

the Complexity Boundary of Answer Set programming with Generalized Atoms under the FLP Semantics

The Complexity Boundary of Answer Set Programming with Gener...

引用

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

作者： Alviano, Mario Faber, Wolfgang Univ Calabria Dept Math I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)9783642405648

In recent years, Answer Set programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized quantifiers, or abstract constraints, the idea is to have more complicated satisfaction patterns in the lattice of Herbrand interpretations than traditional, simple atoms. In this paper we refer to any of these constructs as generalized atoms. It is known that programs with generalized atoms that have monotonic or antimonotonic satisfaction patterns do not increase complexity with respect to programs with simple atoms (if satisfaction of the generalized atoms can be decided in polynomial time) under most semantics. It is also known that generalized atoms that are nonmonotonic (being neither monotonic nor antimonotonic) can, but need not, increase the complexity by one level in the polynomial hierarchy if non-disjunctive programs under the FLP semantics are considered. In this paper we provide the precise boundary of this complexity gap: programs with convex generalized atom never increase complexity, while allowing a single non-convex generalized atom (under reasonable conditions) always does. We also discuss several implications of this result in practice.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：