Embedding prioritized circumscription in logic programs
The author presents a method for embedding \textit{prioritized circumscription} of a clausal theory into general disjunctive logic programs with negation as failure in the head. Based on this embedding the models of the circumscription are precisely captured by the stable models of a suitable program. Because of many pointers to the current literature as well as historical comments, the paper may be of special value to specialists interested in this branch of theoretical logic programming. For the entire collection see [Zbl 0951.00051].
- Prioritized logic programming and its application to commonsense reasoning
- scientific article; zbMATH DE number 1696794 (Why is no real title available?)
- Circumscription and projection as primitives of logic programming
- An embedding of input-output logic in deontic logic programs
- scientific article; zbMATH DE number 4210121 (Why is no real title available?)
- scientific article; zbMATH DE number 4164169 (Why is no real title available?)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- scientific article; zbMATH DE number 4106291 (Why is no real title available?)
- scientific article; zbMATH DE number 88998 (Why is no real title available?)
- Circumscribing embedded implications (without stratifications)
- Embedding prioritized circumscription in disjunctive logic programs
- Embedding circumscriptive theories in general disjunctive programs
- Logic Programming
- Logics in Artificial Intelligence
- From answer set logic programming to circumscription via logic of GK
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
This page was built for publication: Embedding prioritized circumscription in logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366600)