Implementing Prioritized Circumscription by Computing Disjunctive Stable Models

DOI10.1007/978-3-540-85776-1_15zbMath1169.68623OpenAlexW2156015704MaRDI QIDQ3534658

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

zbMATH Keywords

linear transformationanswer set programmingdisjunctive stable modelsprioritized circumscription

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (1)

Complex optimization in answer set programming

Uses Software

• DLV
• circ2dlp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of diagnosis from first principles
• Eliminating the fixed predicates from a circumscription
• Circumscription - a form of non-monotonic reasoning
• An efficient method for eliminating varying predicates from a circumscription
• Prioritized logic programming and its application to commonsense reasoning
• The complexity of default reasoning under the stationary fixed point semantics
• On the computational cost of disjunctive logic programming: Propositional case
• Loop formulas for circumscription
• Embedding circumscriptive theories in general disjunctive programs
• Unfolding partiality and disjunctions in stable model semantics
• The DLV system for knowledge representation and reasoning
• Logic Programming
• Logics in Artificial Intelligence
• Modularity Aspects of Disjunctive Stable Models

This page was built for publication: Implementing Prioritized Circumscription by Computing Disjunctive Stable Models