### 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 |

### Fingerprint

### Cite this

*Journal of Automated Reasoning*,

*18*(1), 25-46. https://doi.org/10.1023/A:1005771523328

}

*Journal of Automated Reasoning*, vol. 18, no. 1, pp. 25-46. https://doi.org/10.1023/A:1005771523328

**A Correct Logic Programming Computation of Default Logic Extensions.** / Antoniou, Grigoris; Langetepe, Elmar.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A Correct Logic Programming Computation of Default Logic Extensions

AU - Antoniou, Grigoris

AU - Langetepe, Elmar

PY - 1997/2/1

Y1 - 1997/2/1

N2 - 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.

AB - 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.

KW - Default logic

KW - Logic programming

KW - SLDNF-resolution

UR - http://www.scopus.com/inward/record.url?scp=0031079459&partnerID=8YFLogxK

U2 - 10.1023/A:1005771523328

DO - 10.1023/A:1005771523328

M3 - Article

AN - SCOPUS:0031079459

VL - 18

SP - 25

EP - 46

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

SN - 0168-7433

IS - 1

ER -