Soundness and Completeness of a Logic Programming Approach to Default Logic
Abstract
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. We explain the steps of constructing a logic program LogProg(P,D) from a given default theory (P,D), and present the proof ideas of the soundness and completeness results for the approach.
Cite
Text
Antoniou and Langetepe. "Soundness and Completeness of a Logic Programming Approach to Default Logic." AAAI Conference on Artificial Intelligence, 1994.Markdown
[Antoniou and Langetepe. "Soundness and Completeness of a Logic Programming Approach to Default Logic." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/antoniou1994aaai-soundness/)BibTeX
@inproceedings{antoniou1994aaai-soundness,
title = {{Soundness and Completeness of a Logic Programming Approach to Default Logic}},
author = {Antoniou, Grigoris and Langetepe, Elmar},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1994},
pages = {934-939},
url = {https://mlanthology.org/aaai/1994/antoniou1994aaai-soundness/}
}