Soundness and Completeness of a Logic Programming Approach to Default Logic

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.

• Type: Conference
• Year: 1994
• Where: AAAI
• Authors: Grigoris Antoniou, Elmar Langetepe
• Keywords: AAAI 1994, Computes Answer Substitutions, Default Theory, Intelligent Agents, Logic Program