A Correct Logic Programming Computation of Default Logic Extensions

Grigoris Antoniou; Elmar Langetepe

doi:10.1023/A:1005771523328

A Correct Logic Programming Computation of Default Logic Extensions

Grigoris Antoniou, Elmar Langetepe

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1023/A:1005771523328
Publication status	Published - 1 Feb 1997
Externally published	Yes

Access to Document

10.1023/A:1005771523328Licence: Unspecified

Cite this

@article{5740b271df3f4fe2825cc6d826a7d8b9,

title = "A Correct Logic Programming Computation of Default Logic Extensions",

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.",

keywords = "Default logic, Logic programming, SLDNF-resolution",

author = "Grigoris Antoniou and Elmar Langetepe",

year = "1997",

month = feb,

day = "1",

doi = "10.1023/A:1005771523328",

language = "English",

volume = "18",

pages = "25--46",

journal = "Journal of Automated Reasoning",

issn = "0168-7433",

publisher = "Springer Netherlands",

number = "1",

}

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

SN - 0168-7433

VL - 18

SP - 25

EP - 46

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

IS - 1

ER -

A Correct Logic Programming Computation of Default Logic Extensions

Abstract

Access to Document

Other files and links

Fingerprint

Cite this