TY - GEN
T1 - From disjunctive programs to abduction
AU - Lifschitz, Vladimir
AU - Turner, Hudson
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 1995
Y1 - 1995
N2 - The purpose of this work is to clarify the relationship between three approaches to representing incomplete information in logic programming. Classical negation and epistemic disjunction are used in the first of these approaches, abductive logic programs with classical negation in the second, and a simpler form of abductive logic programming — without classical negation — in the third. In the literature, these ideas have been illustrated with examples related to properties of actions, and in this paper we consider an action domain also. We formalize this domain as a disjunctive program with classical negation, and then show how two abductive formalizations can be obtained from that program by a series of simple syntactic transformations. The three approaches under consideration turn out to be parts of a whole spectrum of different, but equivalent, ways of representing incomplete information.
AB - The purpose of this work is to clarify the relationship between three approaches to representing incomplete information in logic programming. Classical negation and epistemic disjunction are used in the first of these approaches, abductive logic programs with classical negation in the second, and a simpler form of abductive logic programming — without classical negation — in the third. In the literature, these ideas have been illustrated with examples related to properties of actions, and in this paper we consider an action domain also. We formalize this domain as a disjunctive program with classical negation, and then show how two abductive formalizations can be obtained from that program by a series of simple syntactic transformations. The three approaches under consideration turn out to be parts of a whole spectrum of different, but equivalent, ways of representing incomplete information.
UR - http://www.scopus.com/inward/record.url?scp=21844505471&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=21844505471&partnerID=8YFLogxK
U2 - 10.1007/BFb0030658
DO - 10.1007/BFb0030658
M3 - Conference contribution
AN - SCOPUS:21844505471
SN - 3540594671
SN - 9783540594673
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 23
EP - 42
BT - Non-Monotonic Extensions of Logic Programming - ICLP 1994 Workshop, Selected Papers
A2 - Dix, Jürgen
A2 - Przymusinski, Teodor C.
A2 - Pereira, Louis Moniz
PB - Springer Verlag
T2 - Workshop on Non-Monotonic Extensions of Logic Programming, ICLP 1994
Y2 - 17 June 1994 through 17 June 1994
ER -