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

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

作者： Anwar, Saadat Baral, Chitta Inoue, Katsumi Arizona State Univ SCIDSE 699 S Mill Ave Tempe AZ 85281 USA Natl Inst Informat Principles Informat Res Div Tokyo Japan

ISBN: (纸本)9783642405648

Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these questions require simulation based reasoning. In this paper, we show how higher level extensions of Petri Nets, such as colored tokens can be encoded in Answer Set programming, thereby providing the right formalisms to model and reason about such questions with relative ease. Our approach can be adapted to other domains.

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

来源：评论

学校读者我要写书评

暂无评论

Linear logic programming for Narrative Generation

Linear Logic Programming for Narrative Generation

引用

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

来源：评论

学校读者我要写书评

暂无评论

Declarative Local Search for Predicate logic 15th

Declarative Local Search for Predicate Logic

引用

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

作者： Pham, Tu-San Devriendt, Jo De Causmaecker, Patrick Katholieke Univ Leuven Leuven Belgium KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9783030205287;9783030205270

In this paper we introduce a framework built on top of the Knowledge Base System IDP, which allows local search heuristics to be synthesized from their formal descriptions. It is introduced as a new inference to solve optimization problems in IDP. To model a local search heuristic, users need to specify its components, among which neighbourhood moves are the most important. Two types of neighbourhood moves, namely standard moves and Large Neighbourhood Search moves, are supported. A set of built-in local search heuristics are provided, allowing users to combine neighbourhoods in different ways. We demonstrate how the new local search inference can be used to complement the existing solving mechanisms for logic programming.

关键词： Heuristics Local search Knowledge representation Predicate logic

来源：评论

学校读者我要写书评

暂无评论

Approximation Fixpoint theory for Non-Deterministic Operators and Its Application in Disjunctive logic programming 18

Approximation Fixpoint Theory for Non-Deterministic Operator...

引用

18th international conference on Principles of Knowledge Representation and reasoning, KR 2021

作者： Heyninck, Jesse Arieli, Ofer Department of Computer Science TU Dortmund Germany University of Cape Town CAIR South Africa School of Computer Science Tel-Aviv Academic College Israel

ISBN: (纸本)9781956792997

Approximation fixpoint theory (AFT) constitutes an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic reasoning, such as logic programming, default logic and autoepistemic logic. In this paper we extend AFT to non-deterministic constructs such as disjunctive information. this is done by generalizing the main constructions and corresponding results to non-deterministic operators, whose ranges are sets of elements rather than single elements. the applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming. Copyright © 2021, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An ASP System with Functions, Lists, and Sets

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Calimeri, Francesco Cozza, Susanna Ianni, Giovambattista Leone, Nicola Univ Calabria Dept Math I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783642042379

We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation. Any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on all programs belonging to the recently introduced class of finitely-ground programs furthermore, termination can be "a priori" guaranteed on demand by means of a syntactic restriction check that ensures a finite-domain property. the system, which is already successfully used in many universities and reinstitutes, comes also equipped with a rich library of built-in functions and predicates for the manipulation of complex terms.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A case study in using preference logic grammars for knowledge representation 5th

引用

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

作者： Cui, BQ Swift, T Warren, DS SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)3540667490

Data standardization is the commercially important process of extracting useful information from poorly structured textual data. this process includes correcting misspellings and truncations, extraction of data via parsing, and correcting inconsistencies in extracted data. Prolog programming offers natural advantages for standardizing: definite clause grammars can be used to parse data;Prolog rules can be used to correct inconsistencies;and Prolog's simple syntax allows rules to be generated to correct misspellings and truncations of keywords. these advantages can be seen as rudimentary mechanisms for knowledge representation and at least one commercial standardizer has exploited these advantages. However advances in implementation and in knowledge representation - in particular the addition of preferences to logical formalisms - allow even more powerful and declarative standardizers to be constructed. In this paper a simple preference logic, that of [7] is considered. A fixed point semantics is defined for this logic and its tabled implementation within XSB is described. Development of a commercial standardizer using the preference logic of [7] is then documented. Finally, detailed comparisons are made between the preference logic standardizer and the previous Prolog standardizer illustrating how an advance in knowledge representation can lead to improved commercial software.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Event-Object reasoning with Curated Knowledge Bases: Deriving Missing Information

Event-Object Reasoning with Curated Knowledge Bases: Derivin...

引用

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

作者： Baral, Chitta Vo, Nguyen H. Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85069 USA

ISBN: (纸本)9783642405648

the broader goal of our research is to formulate answers to why and how questions with respect to knowledge bases, such as AURA. One issue we face when reasoning with many available knowledge bases is that at times needed information is missing. Examples of this include partially missing information about next sub-event, first sub-event, last sub-event, result of an event, input to an event, destination of an event, and raw material involved in an event. In many cases one can recover part of the missing knowledge through reasoning. In this paper we give a formal definition about how such missing information can be recovered and then give an ASP implementation of it. We then discuss the implication of this with respect to answering why and how questions.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

LUPS - A language for updating logic programs

引用

ARTIFICIAL INTELLIGENCE 2002年第1-2期138卷 87-116页

作者： Alferes, JJ Pereira, LM Przymusinska, H Przymusinski, TC Univ Nova Lisboa FCT Ctr Inteligencia Artificial P-2829516 Caparica Portugal Calif State Polytech Univ Pomona Pomona CA 91768 USA Univ Calif Riverside Riverside CA 92521 USA

Most of the work conducted so far in the field of logic programming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced dynamic logic programming. there, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs). Each program in the sequence contains knowledge about some given state, where different states may, for example, represent different time periods or different sets of priorities. But how, in concrete situations, is a sequence of logic programs built? For instance, in the domain of actions, what are the appropriate sequences of programs that represent the performed actions and their effects? Whereas dynamic logic programming provides a way for, given the sequence, determining what should follow, it does not provide a good practical language for the specification of the sequence of updates which may be conditional on the intervening states. Here we define the language LUPS-"Language for dynamic updates"-designed for specifying changes to logic programs. Given an initial knowledge base (as a logic program) LUPS provides a way for sequentially updating it. the declarative meaning of a sequence of sets of update actions in LUPS is defined by the semantics of the dynamic logic program generated by those actions. Additionally, we provide a translation of the sequence of update statements sets into a single logic program written in a meta-language, in such a way that the stable models of the resulting program correspond to the previously defined declarative semantics. Finally, we exhibit the usage of LUPS in several application domains. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： logic programming knowledge updates

来源：评论

学校读者我要写书评

暂无评论

A logic Program Characterization of Causal theories

A Logic Program Characterization of Causal Theories

引用

20th international Joint conference on Artificial Intelligence

作者： Ferraris, Paolo Univ Texas Austin Dept Comp Sci Austin TX 78705 USA

nonmonotonic causal logic, invented by McCain and Turner, is a formalism well suited for representing knowledge about actions, and the definite fragment of that formalism has been implemented in the reasoning and planning system called CCalc. A 1997 theorem due to McCain shows how to translate definite causal theories into logic programming under the answer set semantics, and thus opens the possibility of using answer set programming for the implementation of such theories. In this paper we propose a generalization of McCain's theorem that extends it in two directions. First, it is applicable to arbitrary causal theories, not only definite. Second, it covers causal theories of a more general kind, which can describe non-Boolean fluents.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：