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(P, D) from a given default theory (P, D), give some examples, and derive soundness and completeness results.
Original language | English |
---|---|
Pages (from-to) | 25-46 |
Number of pages | 22 |
Journal | Journal of Automated Reasoning |
Volume | 18 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Feb 1997 |
Externally published | Yes |