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

Manifold answer-set programs and their applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6565 LNAI卷 44-63页

作者： Faber, Wolfgang Woltran, Stefan University of Calabria Italy Vienna University of Technology Austria

ISBN: (纸本)9783642208317

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P1 currently has to be decoupled from the evaluation of P2 using an intermediate step which collects the desired consequences of P1 and provides them as input to P2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P1 into a so-called manifold program, which allows for accessing all desired consequences of P 1 within a single answer set. then, this manifold program can be evaluated jointly with P2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2nd international Workshop on Software Engineering for Answer Set programming, SEA 2009 - Co-located Event with the 10th international conference on logic programming and nonmonotonic reasoning, LPNMR 2009

Proceedings of the 2nd International Workshop on Software En...

引用

2nd international Workshop on Software Engineering for Answer Set programming, SEA 2009 - Co-located with the 10th international conference on logic programming and nonmonotonic reasoning, LPNMR 2009

the proceedings contain 6 papers. the topics discussed include: on building a competitive comformant planner;a preference meta-model for logic programs with possibilistic ordered disjunction;a framework for programming with module consequences;a pragmatic programmer's guide for answer set programming;yet another modular action language;and a visual tracer for DLV.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic programming and nonmonotonic reasoning - 10th international conference, LPNMR 2009, Proceedings

引用

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

ISBN: (纸本)3642042376

the proceedings contain 65 papers. the topics discussed include: logic-based modeling in systems biology;integrating answer set programming and satisfiability modulo theories;splitting a CR-prolog pro;contextual argumentation in ambient intelligence;argumentation context systems: a framework for abstract group argumentation;a revised concept of safety for general answer set programs;magic sets for the bottom-up evaluation of finitely recursive programs;relevance-driven evaluation of modular nonmonotonic logic programs;complexity of the stable model semantics for queries on incomplete databases;manifold answer-set programs for meta-reasoning;computing stable models through reductions to difference logic;module-based framework for multi-language constraint modeling;and induction on failure: learning connected horn theories.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards closed world reasoning in dynamic open worlds

引用

thEORY AND PRACTICE OF logic programming 2010年第4-6期10卷 547-563页

作者： Slota, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal

the need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge bases composed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. these semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve. In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties. To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.

关键词： belief change belief update hybrid knowledge bases ontologies rules description logics answer set programming semantic web

来源：评论

学校读者我要写书评

暂无评论

Towards closed world reasoning in dynamic open worlds

Towards closed world reasoning in dynamic open worlds

引用

26th international conference on logic programming (ICLP)

作者： Slota, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal

关键词： belief change belief update hybrid knowledge bases ontologies rules description logics answer set programming semantic web

来源：评论

学校读者我要写书评

暂无评论

A nonmonotonic extension of KLM preferential logic P

A nonmonotonic extension of KLM preferential logic P

引用

17th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR-17

作者： Giordano, Laura Gliozzi, Valentina Olivetti, Nicola Pozzato, Gian Luca Dip. di Informatica U. Piemonte O. Alessandria Italy Dip. Informatica Univ. di Torino Italy LSIS-UMR CNRS 6168 Marseille France

ISBN: (纸本)364216241X

In this paper, we propose the logic P min , which is a nonmonotonic extension of Preferential logic P defined by Kraus, Lehmann and Magidor (KLM). In order to perform nonmonotonic inferences, we define a "minimal model" semantics. Given a modal interpretation of a minimal A-world as A ∧ ¬A, the intuition is that preferred, or minimal models are those that minimize the number of worlds where ¬¬A holds, that is of A-worlds which are not minimal. We also present a tableau calculus for deciding entailment in P min . © 2010 Springer-Verlag.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

INDUCTIVE logic programming AS ABDUCTIVE SEARCH

INDUCTIVE LOGIC PROGRAMMING AS ABDUCTIVE SEARCH

引用

26th international conference on logic programming (ICLP)

作者： Corapi, Domenico Russo, Alessandra Lupu, Emil Imperial Coll London Dept Comp 180 Queens Gate London SW7 2AZ England

ISBN: (纸本)9783939897170

We present a novel approach to non-monotonic ILP and its implementation called TAL (Top-directed Abductive Learning). TAL overcomes some of the completeness problems of ILP systems based on Inverse Entailment and is the first top-down ILP system that allows background theories and hypotheses to be normal logic programs. the approach relies on mapping an ILP problem into an equivalent ALP one. this enables the use of established ALP proof procedures and the specification of richer language bias with integrity constraints. the mapping provides a principled search space for an ILP problem, over which an abductive search is used to compute inductive solutions.

关键词： Inductive logic programming Abductive logic programming Non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

17th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2010

17th International Conference on Logic for Programming, Arti...

引用

17th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2010

ISBN: (纸本)9783642162411

the proceedings contain 45 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Characterising space complexity classes via Knuth-Bendix orders;focused natural deduction;how to universally close the existential rule;on the Complexity of the Bernays-Schönfinkel Class with Datalog;magically constraining the inverse method using dynamic polarity assignment;lazy abstraction for size-change termination;a syntactical approach to qualitative constraint networks merging;on the satisfiability of two-variable logic over data words;generic methods for formalising sequent calculi applied to provability logic;awareness in games, awareness in logic;characterising probabilistic processes logically: (Extended abstract);fCube: An efficient prover for Intuitionistic propositional logic;superposition-Based Analysis of First-Order Probabilistic Timed Automata;A nonmonotonic extension of KLM Preferential logic P;on strong normalization of the Calculus of Constructions with type-based termination;aligators for arrays (tool paper);Clause elimination procedures for CNF formulas;Partitioning SAT instances for distributed solving;infinite families of finite string rewriting systems and their confluence;polite theories revisited;human and unhuman commonsense reasoning;clausal graph tableaux for hybrid logic with eventualities and difference;the consistency of the CADIAG-2 knowledge base: A probabilistic approach;on the Complexity of Model Expansion;labelled Unit Superposition Calculi for Instantiation-Based reasoning;Boosting local search thanks to CDCL;interpolating quantifier-free Presburger Arithmetic;variable compression in ProbLog;Improving resource-unaware SAT solvers;expansion nets: Proof-nets for propositional classical logic;revisiting matrix interpretations for polynomial derivational complexity of term rewriting;Gödel logics – A SURVEY;bottom-up tree automata with term constraints.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Disjunctive Fuzzy logic Programs with Fuzzy Answer Set Semantics

Disjunctive Fuzzy Logic Programs with Fuzzy Answer Set Seman...

引用

4th Annual international conference on Scalable Uncertainty Management (SUM)

作者： Saad, Emad Gulf Univ Sci & Technol Dept Comp Sci Mishref Kuwait

ISBN: (纸本)9783642159503

reasoning under fuzzy uncertainty arises in many applications including planning and scheduling in fuzzy environments. In many real-world applications, it is necessary to define fuzzy uncertainty over qualitative uncertainty, where fuzzy values are assigned over the possible outcomes of qualitative uncertainty. However, current fuzzy logic programming frameworks support only reasoning under fuzzy uncertainty. Moreover, disjunctive logic programs, although used for reasoning under qualitative uncertainty it cannot be used for reasoning with fuzzy uncertainty. In this paper we combine extended and normal fuzzy logic programs [30, 23], for reasoning under fuzzy uncertainty, with disjunctive logic programs [7, 4], for reasoning under qualitative uncertainty, in a unified logic programming framework, namely extended and normal disjunctive fuzzy logic programs. this is to allow directly and intuitively to represent and reason in the presence of both fuzzy uncertainty and qualitative uncertainty. the syntax and semantics of extended and normal disjunctive fuzzy logic programs naturally extends and subsumes the syntax and semantics of extended and normal fuzzy logic programs [30, 23] and disjunctive logic programs [7, 4]. Moreover, we show that extended and normal disjunctive fuzzy logic programs can be intuitively used for representing and reasoning about scheduling with fuzzy preferences.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Constraint Models for reasoning on Unification in Inductive logic programming

Constraint Models for Reasoning on Unification in Inductive ...

引用

14th international conference on Artificial Intelligence - Methodology, Systems, Applications (AIMSA)

作者： Bartak, Roman Charles Univ Prague Fac Math & Phys Prague 11800 1 Czech Republic

ISBN: (纸本)9783642154300

Inductive logic programming (ILP) deals with the problem of finding a hypothesis covering all positive examples and excluding negative examples. One of the sub-problems is specifying the structure of the hypothesis, that is, the choice of atoms and position of variables in the atoms. In this paper we suggest using constraint satisfaction to describe which variables are unified in the hypotheses. this corresponds to finding the position of variables in atoms. In particular, we present a constraint model with index variables accompanied by a Boolean model to strengthen inference and hence improve efficiency. the efficiency of models is demonstrated experimentally.

关键词： constraint modelling inductive logic programming meta-reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：