Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
From MaRDI portal
Publication:3534658
DOI10.1007/978-3-540-85776-1_15zbMATH Open1169.68623OpenAlexW2156015704MaRDI QIDQ3534658FDOQ3534658
Authors: Emilia Oikarinen, Tomi Janhunen
Publication date: 4 November 2008
Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_15
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
- On the computational cost of disjunctive logic programming: Propositional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- The DLV system for knowledge representation and reasoning
- A theory of diagnosis from first principles
- Modularity Aspects of Disjunctive Stable Models
- Circumscription - a form of non-monotonic reasoning
- Prioritized logic programming and its application to commonsense reasoning
- Unfolding partiality and disjunctions in stable model semantics
- Loop formulas for circumscription
- Title not available (Why is that?)
- Eliminating the fixed predicates from a circumscription
- Embedding circumscriptive theories in general disjunctive programs
- Logic Programming
- Logics in Artificial Intelligence
- An efficient method for eliminating varying predicates from a circumscription
- The complexity of default reasoning under the stationary fixed point semantics
Cited In (5)
Uses Software
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)