An incremental algorithm for generating all minimal models

Artificial Intelligence

Volumn 169, Issue 1, 2005, Pages 1-22

  Ben Eliyahu Zohary, Rachel ^a  

^a JERUSALEM COLLEGE OF ENGINEERING   (Israel)

Author keywords

Datalog; Diagnosis; Knowledge representation; Logic programming; Minimal models; Nonmonotonic reasoning; Propositional statisfiability

Indexed keywords

DIAGNOSIS; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; MAINTENANCE; MATHEMATICAL MODELS; POLYNOMIALS;

DATALOG; MINIMAL MODELS; NONMONOTONIC REASONING; PROPOSITIONAL SATISFYABILITY;

ALGORITHMS;

EID: 27144484155     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.06.003     Document Type: Article

References (30)

1. R. Ben-Eliyahu A hierarchy of tractable subsets for computing stable models J. Artificial Intelligence Res. 5 1996 27 52
2. R. Ben-Eliyahu, and R. Dechter Propositional semantics for disjunctive logic programs Ann. Math. Artificial Intelligence 12 1994 53 87 A short version appears in JICSLP-92: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming
3. R. Ben-Eliyahu, and R. Dechter On computing minimal models Ann. Math. Artificial Intelligence 18 1996 3 27 A short version in AAAI-93: Proceedings of the 11th National Conference on Artificial Intelligence
4. R. Ben-Eliyahu, and L. Palopoli Reasoning with minimal models: Efficient algorithms and applications Artificial Intelligence 96 1997 421 449 A short version in KR-94
5. N. Bidoit, and C. Froidevaux Minimalism subsumes default logic and circumscription in stratified logic programming Proceedings of the IEEE Symposium on Logic in Computer Science LICS-87 1987 IEEE Computer Science Press Los Alamitos, CA 89 97
6. C. Bell, A. Nerode, R.T. Ng, and V.S. Subrahmanian Mixed integer programming methods for computing non-monotonic deductive databases J. ACM 41 6 1994 1178 1215
7. F. Bry, and A. Yahya Positive unit hyperresolution tableaux and their application to minimal model generation J. Autom. Reason. 25 1 2000 35 82
8. M. Cadoli The complexity of model checking for circumscriptive formulae Inform. Process. Lett. 44 3 1992 113 118
9. M. Cadoli On the complexity of model finding for nonmonotonic propositional logics A. Marchetti Spaccamela P. Mentrasti M. Venturini Zilli Proceedings of the 4th Italian Conference on Theoretical Computer Science 1992 World Scientific Singapore 125 139
10. Z. Chen, S. Toda, The complexity of selecting maximal solutions, in: Proc. 8th IEEE Int. Conf. on Structures in Complexity Theory, 1993, pp. 313-325
11. W.F. Dowling, and J.H. Gallier Linear time algorithms for testing the satisfiability of propositional Horn formulae J. Logic Programming 3 1984 267 284
12. J. de Kleer, A.K. Mackworth, and R. Reiter Characterizing diagnosis and systems Artificial Intelligence 56 1992 197 222
13. J. de Kleer, and B.C. Williams Diagnosis multiple faults Artificial Intelligence 32 1987 97 130
14. T. Eiter, and G. Gottlob Propositional circumscription and extended closed-world reasoning are Π 2 p -complete Theoret. Comput. Sci. 114 1993 231 245
15. C. Elkan A rational reconstruction of nonmonotonic truth maintenance systems Artificial Intelligence 43 1990 219 234
16. K. Fine The justification of negation as failure Logic, Methodology and Philosophy of Science 8 1989 263 301
17. M. Gelfond, and V. Lifschitz The stable model semantics for logic programming R.A. Kowalski K.A. Bowen Logic Programming: Proceedings of the 5th International Conference 1988 MIT Press Cambridge, MA 1070 1080
18. M. Gelfond, and V. Lifschitz Classical negation in logic programs and disjunctive databases New Gen. Comput. 9 1991 365 385
19. A. Itai, and J.A. Makowsky Unification as a complexity measure for logic programming J. Logic Programming 4 1987 105 117
20. T. Janhunen, I. Niemelä, D. Seipel, P. Simons, J.-H. You, Unfolding partiality and disjunctions in stable model semantics, CoRR cs.AI/0303009, 2003
21. C. Koch, N. Leone, and G. Pfeifer Enhancing disjunctive logic programming systems by sat checkers Artificial Intelligence 151 1-2 2003 177 212
22. P.G. Kolaitis, and C.H. Papadimitriou Some computational aspects of circumscription J. ACM 37 1990 1 14
23. V. Lifshitz, Computing circumscription, in: IJCAI-85: Proceedings of the International Joint Conference on AI, Los Angeles, CA, 1985, pp. 121-127
24. N. Leone, G. Pfeifer, W. Faber, F. Calimeri, T. Dell'Armi, T. Eiter, G. Gottlob, G. Ianni, G. Ielpa, C. Koch, S. Perri, and A. Polleres The dlv system Proc. JELIA 2002 537 540
25. J. McCarthy Circumscription - a form of non-monotonic reasoning Artificial Intelligence 13 1980 27 39
26. J. McCarthy Application of circumscription to formalizing common-sense knowledge Artificial Intelligence 28 1986 89 116
27. J. Minker On indefinite databases and the closed world assumption Proceedings of the 6th Conference on Automated Deduction Lecture Notes in Computer Science vol. 138 1982 Springer Berlin 292 308
28. R. Reiter A logic for default reasoning Artificial Intelligence 13 1980 81 132
29. P. Simons, I. Niemelä, and T. Soininen Extending and implementing the stable model semantics Artificial Intelligence 138 1-2 2002 181 234
30. R. Tarjan Depth-first search and linear graph algorithms SIAM J. Computing 1 1972 146 160