A theory of diagnosis from first principles
Artificial Intelligence
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
Compiling circumscriptive theories into logic programs
Proceedings of the 2nd international workshop on Non-monotonic reasoning
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence
The complexity of default reasoning under the stationary fixed point semantics
Information and Computation
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Embedding Circumscriptive Theories in General Disjunctive Programs
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Loop formulas for circumscription
Artificial Intelligence
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A linear transformation from prioritized circumscription to disjunctive logic programming
ICLP'07 Proceedings of the 23rd international conference on Logic programming
CIRC2DLP: translating circumscription into disjunctive logic programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz' parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed values while others are falsified. Prioritized circumscription further refines this setting in terms of priority classes for atoms being falsified. In this paper, we present a linear and faithful transformation to embed prioritized circumscription into disjunctive logic programming in a systematic fashion. The implementation of the method enables the use of disjunctive solvers for computing prioritized circumscription. The results of an experimental evaluation indicate that the method proposed herein compares favorably with other existing implementations.