Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
From MaRDI portal
Publication:3534658
Recommendations
- Embedding prioritized circumscription in disjunctive logic programs
- scientific article; zbMATH DE number 1090099
- Logic Programming
- scientific article; zbMATH DE number 4164169
- scientific article; zbMATH DE number 1407680
- scientific article; zbMATH DE number 1696794
- Theory and Applications of Models of Computation
- scientific article; zbMATH DE number 2090537
Cites work
- scientific article; zbMATH DE number 4106291 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- A theory of diagnosis from first principles
- An efficient method for eliminating varying predicates from a circumscription
- Circumscription - a form of non-monotonic reasoning
- Eliminating the fixed predicates from a circumscription
- Embedding circumscriptive theories in general disjunctive programs
- Logic Programming
- Logics in Artificial Intelligence
- Loop formulas for circumscription
- Modularity Aspects of Disjunctive Stable Models
- On the computational cost of disjunctive logic programming: Propositional case
- Prioritized logic programming and its application to commonsense reasoning
- The DLV system for knowledge representation and reasoning
- The complexity of default reasoning under the stationary fixed point semantics
- Unfolding partiality and disjunctions in stable model semantics
Cited in
(5)
This page was built for publication: Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534658)