Computing extensions of default logic - Preliminary report

Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationLogic Programming and Automated Reasoning - 4th International Conference, LPAR 1993, Proceedings
EditorsAndrei Voronkov
PublisherSpringer Verlag
Pages19-27
Number of pages9
ISBN (Print)9783540569442
DOIs
Publication statusPublished - 1993
Externally publishedYes
Event4th International Conference on Logic Programming and Automated Reasoning - St. Petersburg, Russian Federation
Duration: 13 Jul 199320 Jul 1993
Conference number: 4
https://dblp.org/db/conf/lpar/lpar93

Publication series

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

Conference

Conference4th International Conference on Logic Programming and Automated Reasoning
Abbreviated titleLPAR 1993
CountryRussian Federation
CitySt. Petersburg
Period13/07/9320/07/93
Internet address

Fingerprint Dive into the research topics of 'Computing extensions of default logic - Preliminary report'. Together they form a unique fingerprint.

Cite this