Embedding prioritized circumscription in logic programs

Document Type

Conference Proceeding

Publication Date

1-1-1997

Abstract

In this papery we present a method for embedding prioritized circumscription of a clausal theory into general disjunctive logic programs (GDP) with negation as failure in the head. In recent works, Sakama and Inoue show that parallel circumscription can be embedded in GDP. They also show that prioritized circumscription of a clausal theory can be represented in the framework of GDP extended with priorities. In our method, the priorities of minimization in the circumscription policy axe translated into the syntactical form of logic program rules, and the models of the circumscription are precisely captured by the stable models of the program. Thus we show that prioritized circumscription can be directly embedded in GDP without extending the GDP logic programming framework. This result further asserts the expressive power of the class of general disjunctive programs and supports its use for knowledge representation in Artificial Intelligence.

Publication Source (Journal or Book title)

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

First Page

50

Last Page

59

This document is currently not available here.

Share

COinS