Computing extensions of default logic - Preliminary report

Grigoris Antoniou; Elmar Langetepe; Volker Sperschneider

doi:10.1007/3-540-56944-8_38

Computing extensions of default logic - Preliminary report

Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present an operational process model for default logic that allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. Then we present an improved approach for realizing the process model in logic programming making direct use of Prolog’s deductive power. In particular, we give a translation of finite default theories T into logic programs P(T) such that P(T) computes exactly the extensions of T.

Original language	English
Title of host publication	Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings
Editors	Andrei Voronkov
Publisher	Springer Verlag
Pages	19-27
Number of pages	9
ISBN (Print)	9783540569442
DOIs	https://doi.org/10.1007/3-540-56944-8_38
Publication status	Published - 1993
Externally published	Yes
Event	4th International Conference on Logic Programming and Automated Reasoning - St. Petersburg, Russian Federation Duration: 13 Jul 1993 → 20 Jul 1993 Conference number: 4 https://dblp.org/db/conf/lpar/lpar93

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	698 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Conference on Logic Programming and Automated Reasoning
Abbreviated title	LPAR 1993
Country/Territory	Russian Federation
City	St. Petersburg
Period	13/07/93 → 20/07/93
Internet address	https://dblp.org/db/conf/lpar/lpar93

Access to Document

10.1007/3-540-56944-8_38Licence: Unspecified

Cite this

Antoniou, G., Langetepe, E., & Sperschneider, V. (1993). Computing extensions of default logic - Preliminary report. In A. Voronkov (Ed.), Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings (pp. 19-27). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 698 LNAI). Springer Verlag. https://doi.org/10.1007/3-540-56944-8_38

Antoniou, Grigoris ; Langetepe, Elmar ; Sperschneider, Volker. / Computing extensions of default logic - Preliminary report. Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings. editor / Andrei Voronkov. Springer Verlag, 1993. pp. 19-27 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8d59ca662fc74701904dc0afd048b258,

title = "Computing extensions of default logic - Preliminary report",

abstract = "We present an operational process model for default logic that allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. Then we present an improved approach for realizing the process model in logic programming making direct use of Prolog{\textquoteright}s deductive power. In particular, we give a translation of finite default theories T into logic programs P(T) such that P(T) computes exactly the extensions of T.",

author = "Grigoris Antoniou and Elmar Langetepe and Volker Sperschneider",

year = "1993",

doi = "10.1007/3-540-56944-8_38",

language = "English",

isbn = "9783540569442",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "19--27",

editor = "Andrei Voronkov",

booktitle = "Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings",

address = "Germany",

note = "4th International Conference on Logic Programming and Automated Reasoning, LPAR 1993 ; Conference date: 13-07-1993 Through 20-07-1993",

url = "https://dblp.org/db/conf/lpar/lpar93",

}

Antoniou, G, Langetepe, E & Sperschneider, V 1993, Computing extensions of default logic - Preliminary report. in A Voronkov (ed.), Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 698 LNAI, Springer Verlag, pp. 19-27, 4th International Conference on Logic Programming and Automated Reasoning, St. Petersburg, Russian Federation, 13/07/93. https://doi.org/10.1007/3-540-56944-8_38

Computing extensions of default logic - Preliminary report. / Antoniou, Grigoris; Langetepe, Elmar; Sperschneider, Volker.
Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings. ed. / Andrei Voronkov. Springer Verlag, 1993. p. 19-27 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 698 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computing extensions of default logic - Preliminary report

AU - Antoniou, Grigoris

AU - Langetepe, Elmar

AU - Sperschneider, Volker

N1 - Conference code: 4

PY - 1993

Y1 - 1993

N2 - We present an operational process model for default logic that allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. Then we present an improved approach for realizing the process model in logic programming making direct use of Prolog’s deductive power. In particular, we give a translation of finite default theories T into logic programs P(T) such that P(T) computes exactly the extensions of T.

AB - We present an operational process model for default logic that allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. Then we present an improved approach for realizing the process model in logic programming making direct use of Prolog’s deductive power. In particular, we give a translation of finite default theories T into logic programs P(T) such that P(T) computes exactly the extensions of T.

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

U2 - 10.1007/3-540-56944-8_38

DO - 10.1007/3-540-56944-8_38

M3 - Conference contribution

AN - SCOPUS:85028949711

SN - 9783540569442

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 27

BT - Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings

A2 - Voronkov, Andrei

PB - Springer Verlag

T2 - 4th International Conference on Logic Programming and Automated Reasoning

Y2 - 13 July 1993 through 20 July 1993

ER -

Antoniou G, Langetepe E, Sperschneider V. Computing extensions of default logic - Preliminary report. In Voronkov A, editor, Logic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings. Springer Verlag. 1993. p. 19-27. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-56944-8_38

Computing extensions of default logic - Preliminary report

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this