Department of Computer Sciences, University of Texas at Austin, USA
Michael Gelfond, Vladimir Lifschitz
ICLP/SLP 1988: Seattle, 1988 – ICLP
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs ...
Michael Gelfond, Vladimir Lifschitz
New Generation Computing, vol. 9,no. 3/4,1991 – NGC
An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this ...
Vladimir Lifschitz, David Pearce, Agustín Valverde
ACM Transactions on Computational Logic, vol. 2,no. 4,2001 – TOCL
A logic program P1 is said to be equivalent to a logic program P2 in the sense of the answer set semantics if P1 and P2 have the same answer sets. We are interested in the following stronger condition: for every logic program, P, P1, ∪ P has ...
Foundations of Deductive Databases and Logic Programming , Morgan Kaufmann, 1988
Michael Gelfond, Vladimir Lifschitz
Electronic Transactions on Artificial Intelligence, vol. 2,1998 – ETAI
Action languages are formal models of parts of the natural language that are used for talking about the effects of actions. This article is a collection of definitions related to action languages that may be useful as a reference in future ...
Artificial Intelligence, vol. 138,no. 1-2,2002 – AI
The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as smodels or dlv, to nd an answer set for this program. ...
Vladimir Lifschitz, Lappoon R. Tang, Hudson Turner
Annals of Mathematics and Artificial Intelligence, vol. 25,no. 3-4,1999 – AMAI
this paper, we restrict attention to propositional programs; the semantics can be extended to programs with variables by grounding. Both the heads and bodies of the rules in such programs are formed from literals (atoms possibly preceded by the ...