A Correct Logic Programming Computation of Default Logic Extensions

Authors:
Grigoris Antoniou;Elmar Langetepe
Affiliations:
School of Computing and Information Technology, Griffith University, QLD 4111, Australia. e-mail: ga@cit.gu.edu.au;Fern Universität Hagen, Praktische Informatik VI, D-58084 Hagen, Germany. e-mail: elmar.langetepe@fernuni-hagen.de
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 9
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A logical framework for default reasoning

Artificial Intelligence
General logical databases and programs: default logic semantics and stratification

Information and Computation
Negation by default and unstratifiable logic programs

Selected papers of the workshop on Deductive database theory
The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Theoretical Computer Science
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning

Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Computing extensions of nonmonotonic logics

SCAI93 Proceedings of the Fourth Scandinavian Conference on Artificial intelligence---93
Soundness and completeness of a logic programming approach to default logic

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Logic; A Foundation for Computer Science (International Computer Science Series)

Logic; A Foundation for Computer Science (International Computer Science Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method of representing some classes of default theories as normal logic programs. The main point is that the standart semantics (i.e., SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. This means that we give a correct implementation of default logic. We explain the steps of constructing a logic program LogProg({\rm P},{\rm D}) from a given default theory ({\rm P},{\rm D}), give some examples, and derive soundness and completeness results.