Recent research on applications of nonmonotonic reasoning to the semantics of logic programs demonstrates that some nonmonotonic formalisms are bet? ter suited for such use than others. Circumscription is applicable as long as the programs under consideration are stratified. To describe the semantics of general logic programs without the stratification assumption, one has to use autoepistemic logic or default logic. When Gelfond and Lifschitz extended this work to programs with classical negation, they used default logic, be? cause it was not clear whether autoepistemic logic could be applied in that wider domain. In this paper we show that programs with classical negation can be, in fact, easily represented by autoepistemic theories. We also prove that an even simpler embedding is possible if reflexive autoepistemic logic is used. Both translations are applicable to disjunctive programs as well.

PDF

In Logic Programming and Non-monotonic Reasoning: Proceedings of the Second Int'l Workshop, Pereira, Luis Moniz and Nerode, Anil (Eds.), pp. 101-114 1993.

@inproceedings{lif93b, title={Extended Logic Programs as Autoepistemic Theories}, author={Vladimir Lifschitz and Grigori Schwarz}, booktitle={Logic Programming and Non-monotonic Reasoning: Proceedings of the Second Int'l Workshop}, editor={Pereira, Luis Moniz and Nerode and Anil}, pages={101-114}, url="http://www.cs.utexas.edu/users/ai-lab?lif93b", year={1993} }