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

Abductive logic programming and disjunctive logic programming: their relationship and transferability

JOURNAL OF logic programming 2000年第1-3期44卷 75-100页

作者： Sakama, C Inoue, K Wakayama Univ Dept Comp & Communicat Sci Wakayama 6408510 Japan Kobe Univ Dept Elect & Elect Engn Nada Ku Kobe Hyogo 6578501 Japan

Abductive logic programming (ALP) and disjunctive logic programming (DLP) are two different extensions of logic programming. This paper investigates the relationship between ALP and DLP from the program transformation viewpoint. It is shown that the belief set semantics of an abductive program is expressed by the answer set semantics and the possible model semantics of a disjunctive program. In converse, the possible model semantics of a disjunctive program is equivalently expressed by the belief set semantics of an abductive program, while such a transformation is generally impossible for the answer set semantics. Moreover, it is shown that abductive disjunctive programs are always reducible to disjunctive programs both under the answer set semantics and the possible model semantics. These transformations are verified from the complexity viewpoint, The results of this paper turn out that ALP and DLP are just different ways of looking at the same problem if we choose an appropriate semantics. (C) 2000 Elsevier Science Inc. All rights reserved.

关键词： abductive logic programming disjunctive logic programming program transformation

来源：评论

学校读者我要写书评

暂无评论

Pruning operators for disjunctive logic programming systems

引用

FUNDAMENTA INFORMATICAE 2006年第2-3期71卷 183-214页

作者： Calimeri, Francesco Faber, Wolfgang Pfeifer, Gerald Leone, Nicola Univ Calabria Dept Math I-87030 Arcavacata Di Rende CS Italy

disjunctive logic programming (DLP) is an advanced formalism for knowledge representation and reasoning. The language of DLP is very expressive and supports the representation of problems of high computational complexity (specifically, all problems in the complexity class Sigma(P)(2) = Np-NP). The DLP encoding of a large variety of problems is often very concise, simple, and elegant. In this paper, we explain the computational process commonly performed by DLP systems, with a focus on search space pruning, which is crucial for the efficiency of such systems. We present two suitable operators for pruning (Fitting's and Well-founded), discuss their peculiarities and differences with respect to efficiency and effectiveness. We design an intelligent strategy for combining the two operators, exploiting the advantages of both. We implement our approach in DLV - the state-of-the-art DLP system - and perform some experiments. These experiments show interesting results, and evidence how the choice of the pruning operator affects the performance of DLP systems.

关键词： Artificial Intelligence disjunctive logic programming DLP non-monotonic reasoning DLP computation

来源：评论

学校读者我要写书评

暂无评论

DisLoP: a research project on disjunctive logic programming

引用

AI COMMUNICATIONS 1997年第3-4期10卷 151-165页

作者： Aravindan, C Dix, J Niemela, I Univ Koblenz Dept Comp Sci D-56075 Koblenz Germany

This paper gives a brief high-level description of what has been done in the disjunctive logic programming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz, Germany since July 1995. Presented are the main ideas, the implemented systems and how to access them, and the relevant papers are cited. This paper also serves as a brief survey of the current status of disjunctive logic programming by highlighting important developments and provides enough pointers for further reading.

关键词： disjunctive logic programming semantics non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Temporal disjunctive logic programming

引用

NEW GENERATION COMPUTING 2001年第1期19卷 87-100页

作者： Gergatsoulis, M Rondogiannis, P Panayiotopoulos, T NCSR Demokritos Inst Informat & Telecommun GR-15310 Athens Greece Univ Ioannina Dept Comp Sci GR-45110 Ioannina Greece Univ Piraeus Dept Informat Piraeus 18534 Greece

In this paper we introduce the logic programming language disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to disjunctive Chronolog programs.

关键词： temporal logic programming disjunctive logic programming semantics proof procedures

来源：评论

学校读者我要写书评

暂无评论

Collective argumentation and disjunctive logic programming

引用

JOURNAL OF logic AND COMPUTATION 2003年第3期13卷 405-428页

作者： Bochman, A Holon Acad Inst Technol Dept Comp Sci Holon Israel

An extension of an abstract argumentation framework is introduced that provides a direct representation of global conflicts between sets of arguments. The extension, called collective argumentation, turns out to be suitable for representing semantics of disjunctive logic programs. Collective argumentation theories are shown to possess a four-valued semantics, and are closely related to multiple-conclusion (Scott) consequence relations. Two special kinds of collective argumentation, positive and negative argumentation, are considered in which the opponents can share their arguments. Negative argumentation turns out to be especially appropriate for analysing stable sets of arguments. Positive argumentation generalizes certain alternative semantics for logic programs.

关键词： argumentation theory disjunctive logic programming

来源：评论

学校读者我要写书评

暂无评论

Template programs for disjunctive logic programming: An operational semantics

引用

AI COMMUNICATIONS 2006年第3期19卷 193-206页

作者： Calimeri, Francesco Ianni, Giovambattista Univ Calabria Dept Math I-87030 Arcavacata Di Rende CS Italy

disjunctive logic programming is nowadays a mature formalism which has been successfully applied to a variety of practical problems, such as information integration, knowledge representation, planning, diagnosis, optimization and configuration. Although current DLP systems have been extended in many directions, they still miss features which may be helpful towards industrial applications, like the capability of quickly introducing new predefined constructs or of dealing with modules. Indeed, in spite of the fact that a wide literature about modular logic programming is known, code reusability has never been considered as a critical point in disjunctive logic programming. In this work we extend disjunctive logic programming, under stable model semantics, with the notion of "template" predicates. A template predicate may be instantiated to an ordinary predicate by means of template atoms, thus allowing to define reusable modules, to define new constructs and aggregates without any syntactic limitation.

关键词： disjunctive logic programming Modular logic programming Knowledge Representation

来源：评论

学校读者我要写书评

暂无评论

Enhancing disjunctive logic programming systems by SAT checkers

引用

ARTIFICIAL INTELLIGENCE 2003年第1-2期151卷 177-212页

作者： Koch, C Leone, N Pfeifer, G Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria Univ Calabria Dept Math I-87030 Arcavacata Di Rende CS Italy

disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and reasoning. Reasoning with DLP is harder than with normal (boolean OR-free) logic programs, because stable model checking-deciding whether a given model is a stable model of a propositional DLP program-is co-NP-complete, while it is polynomial for normal logic programs. This paper proposes a new transformation Gamma(M) (P), which reduces stable model checking to UNSAT-i.e., to deciding whether a given CNF formula is unsatisfiable. The stability of a model M of a program P thus can be verified by calling a Satisfiability Checker on the CNF formula Gamma(M) (P). The transformation is parsimonious (i.e., no new symbol is added), and efficiently computable, as it runs in logarithmic space (and therefore in polynomial time). Moreover, the size of the generated CNF formula never exceeds the size of the input (and is usually much smaller). We complement this transformation with modular evaluation results, which allow for efficient handling of large real-world reasoning problems. The proposed approach to stable model checking has been implemented in DLV-a state-of-the-art implementation of DLP. A number of experiments and benchmarks have been run using SATZ as Satisfiability checker. The results of the experiments are very positive and confirm the usefulness of our techniques. (C) 2003 Elsevier B.V. All rights reserved.

关键词： disjunctive logic programming nonmonotonic reasoning head-cycle-free programs answer set programs stable model checking

来源：评论

学校读者我要写书评

暂无评论

A game semantics for disjunctive logic programming

引用

ANNALS OF PURE AND APPLIED logic 2013年第11期164卷 1144-1175页

作者： Tsouanas, Thanos Univ Lyon Ecole Normale Super Lyon Lab Informat Parallelisme LIP UMR CNRS ENS Lyon UCBL INRIA 5668 F-69364 Lyon 07 France

Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, a game semantics was given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later it was extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent to the traditional semantics. In this paper we define a game semantics for disjunctive logic programs and prove soundness and completeness with respect to the minimal model semantics of Minker. The overall development has been influenced by the games studied for PCF and functional programming in general, in the styles of Abramsky-Jagadeesan-Malacaria and Hyland-Ong-Nickau. (C) 2013 Elsevier B.V. All rights reserved.

关键词： logic programming disjunctive logic programming Game semantics logic programming semantics

来源：评论

学校读者我要写书评

暂无评论

An Argumentative Characterization of disjunctive logic programming 19th

An Argumentative Characterization of Disjunctive Logic Progr...

引用

19th EPIA Conference on Artificial Intelligence (EPIA)

作者： Heyninck, Jesse Arieli, Ofer Ruhr Univ Bochum Inst Philosophy 2 Bochum Germany Acad Coll Tel Aviv Sch Comp Sci Tel Aviv Israel

ISBN: (纸本)9783030302443;9783030302436

This paper extends the result of Caminada and Schulz [6,7] by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs. For this, we incorporate a previous work of ours (see [19,20]), in which reasoning with assumption-based argumentation frameworks is based on certain core logics and the strict/defeasible assumptions may be arbitrary formulas in those logics. In our case, the core logic respects some inference rules for disjunction, which allows disjunctions in the heads of the programs' rules to be handled properly.

关键词： Knowledge representation and reasoning Non-monotonic reasoning Computational models of argument disjunctive logic programming Structured argumentation

来源：评论

学校读者我要写书评

暂无评论

Computation of non-ground disjunctive well-founded semantics with constraint logic programming 2nd

引用

2nd International Workshop on Non-Monotonic Extensions of logic programming

作者： Dix, J Stolzenburg, F Univ Koblenz Dept Comp Sci D-56075 Koblenz Germany

ISBN: (纸本)3540628436

Impressive work has been done in the last;years concerning the meaning of negation and disjunction in logic programs, but most of this research concentrated on propositional programs only. While it suffices to consider the propositional case for investigating general properties and the overall behaviour of a semantics, we feel that for real applications and for computational purposes an implementation should be able to handle first-order programs without grounding them. In this paper we present a theoretical framework by defining a calculus of program transformations that apply directly to rules with variables and function symbols. Our main results are that (1) this calculus is confluent for arbitrary programs, (2) for finite ground programs it is equivalent to a terminating calculus introduced by Brass and Dir (1995), and (3) it approximates a generalisation of D-WFS for arbitrary programs. We achieve this by transforming program rules into rules with equational constraints thereby using heavily methods and techniques from constraint logic programming. In particular, disconnection-methods play a crucial role. In principle, any constraint theory known from the field of constraint logic programming can be exploited in the context of nonmonotonic reasoning, not only equational constraints over the Herbrand domain. However, the respective constraint solver must be able to treat negative constraints of the considered constraint domain. In summary, this work yields the basis for a general combination of two paradigms: constraint logic programming and non-monotonic reasoning.

关键词： constraint logic programming equational constraints disjunctive logic programming well-founded semantics non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：