Compiling prioritized circumscription into extended logic programs

Authors:
Toshiko Wakaki;Ken Satoh
Affiliations:
Dept. of Computational Intelligence and Systems Science, Tokyo Institute of Technology, Yokohama, Japan;Division of Electronics and Information Engineering, Hokkaido University, Sapporo, Japan
Venue:
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Year:
1997

Citing 5
Cited 1

On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
A circumscriptive theorem prover

Artificial Intelligence
Eliminating the fixed predicates from a circumscription

Artificial Intelligence
Linear resolution for consequence finding

Artificial Intelligence
Embedding Circumscriptive Theories in General Disjunctive Programs

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning

Reasoning under minimal upper bounds in propositional logic

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated by deciding whether the literal is true in all answer sets of II, which can be computed by running II under the existing logic programming interpreter.