Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
An algorithm to compute circumscription
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
A circumscriptive theorem prover
Artificial Intelligence
Journal of Automated Reasoning
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Computing answers with model elimination
Artificial Intelligence
Calculi for disjunctive logic programming
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
An Abductive Framework for Negation in Disjunctive Logic Programming
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Minimal Model Generation Based on E-hyper Tableaux
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Embedding Negation as Failure into a Model Generation Theorem Prover
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
PROTEIN: A PROver with a Theory Extension INterface
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper presents an alternative view on propositional disjunctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new propositional atoms and controls the "execution" of the Horn program. The relationship between original and transformed programs is established by using circumscription. Based on this relationship a new minimal model reasoning approach is developed. Due to the transformation it is straightforward to incorporate SLD-resolution into the proof procedure.