Reasoning with minimal models: Efficient algorithms and applications

Artificial Intelligence

Volumn 96, Issue 2, 1997, Pages 421-449

  Ben Eliyahu Zohary, Rachel ^a   Palopoli, Luigi ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Disjunctive databases; Disjunctive default logic; Disjunctive logic programs; Linear time algorithms; Minimal models; Stable model semantics

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; QUERY LANGUAGES;

DISJUNCTIVE DATABASE; DISJUNCTIVE DEFAULT LOGIC;

KNOWLEDGE REPRESENTATION;

EID: 0031272679     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00060-X     Document Type: Article

References (47)

1. S. Abiteboul, E. Simon and V. Vianu, Non-deterministic languages to express deterministic transformations, in: Proceedings Ninth ACM Symposium on Principles of Database Systems, Nashville, TN (1990) 218-229.
2. K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988) 89-148.
3. 3: a semantics for negation in normal disjunctive logic programs, in: Z. W. Ras and M. Zemankova, eds., Methodologies for Intelligent Systems: Proceedings 6th International Symposium. ISMIS'91 (1991) 459-468.
4. 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.
5. R. Ben-Eliyahu, A hierarchy of tractable subsets for computing stable models, J. Artif. Intell. Res. 5 (1996) 27-52.
6. R. Ben-Eliyahu and R. Dechter, On computing minimal models, Ann. Math. Artif. Intell. 18 (1) (1996) 3-27; short version in: Proceedings AAAI-93, Washington, DC (1993) 2-8.
7. R. Ben-Eliyahu and R. Dechter, On computing minimal models, Ann. Math. Artif. Intell. 18 (1) (1996) 3-27; short version in: Proceedings AAAI-93, Washington, DC (1993) 2-8.
8. R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Ann. Math. Artif. Intell. 12 (1994) 53-87; short version in: Proceedings 1992 Joint International Conference and Symposium on Logic Programming (JICSLP-92), Washington, DC (1992).
9. R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Ann. Math. Artif. Intell. 12 (1994) 53-87; short version in: Proceedings 1992 Joint International Conference and Symposium on Logic Programming (JICSLP-92), Washington, DC (1992).
10. R. Ben-Eliyahu and R. Dechter, Default reasoning using classical logic, Artificial Intelligence 84 (1-2) (1996) 113-150.
11. M. Cadoli, The complexity of model checking for circumscriptive formulae, Inform. Process. Lett. 44 (3) (1992) 113-118.
12. M. Cadoli, On the complexity of model finding for nonmonotonic prepositional logics, in: A. Marchetti Spaccamela, P. Mentrasti and M. Venturini Zilli, eds., Proceedings 4th Italian Conference on Theoretical Computer Science (1992) 125-139.
13. Z. Chen and S. Toda, The complexity of selecting maximal solutions, Inform. and Comput. 119 (2) (1995) 313-325.
14. J. de Kleer, A.K. Mackworth and R. Reiter, Characterizing diagnoses and systems, Artificial Intelligence 56 (2-3) (1992) 197-222.
15. J. de Kleer and B.C. Williams, Diagnosing multiple faults, Artificial Intelligence 32 (1) (1987) 97-130.
16. R. Dechter, Personal communication (October 1993).
17. J. Dix, Classifying semantics of disjunctive logic programs, in: Proceedings 1992 Joint International Conference and Symposium on Logic Programming (JICSLP-92), Washington, DC (1992) 798-812.
18. J. Dix, G. Gottlob and V. Marek, Reducing disjunctive to non-disjunctive semantics by shift-operations, Fund. Inform. 28 (1-2) (1996) 87-100.
19. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 1 (3) (1984) 267-284.
20. 2-complete, Theoret. Comput. Sci. 114 (2) (1993) 231-245.
21. T. Eiter, N. Leone and D. Saccá, The expressive power of partial models for disjunctive deductive databases, in: Proceedings LID-96, San Miniato, Italy (1996); also: Theoret. Comput. Sci., to appear.
22. T. Eiter, N. Leone and D. Saccá, The expressive power of partial models for disjunctive deductive databases, in: Proceedings LID-96, San Miniato, Italy (1996); also: Theoret. Comput. Sci., to appear.
23. T. Eiter, Personal communication (October 1993).
24. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Comput. 9 (3-4) (1991) 365-385.
25. M. Gelfond, H. Przymusinska, V. Lifschitz and M. Truszczyński, Disjunctive defaults, in: Proceedings 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA (1991) 230-237.
26. F. Giannotti, D. Pedreschi, D. Saccá and C. Zaniolo, Non-determinism in deductive databases, in: Proceedings 2nd International Conference on Deductive and Object Oriented Databases (1991).
27. J. Halpern and M. Vardi, Model checking vs. theorem proving: A manifesto, in: Proceedings International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA (1991) 325-334.
28. A. Itai and J.A. Makowsky, Unification as a complexity measure for logic programming, J. Logic Programming 4 (2) (1987) 105-117.
29. P.G. Kolaitis and C.H. Papadimitriou, Some computational aspects of circumscription, J. ACM 37 (1) (1990) 1-14.
30. N. Leone, P. Rullo and F. Scarcello, Disjunctive stable models: unfounded sets, fixpoint semantics and computation, Inform, and Comput. 135 (2) (1997) 69-112.
31. H. Levesque, Making believers out of computers, Artificial Intelligence 30 (1) (1986) 81-108.
32. V. Lifschitz, Computing circumscription, in: Proceedings IJCAI-85, Los Angeles, CA (1985) 121-127.
33. J. McCarthy, Circumscription - a form of non-monotonic reasoning, Artificial Intelligence 13 (1-2) (1980) 27-39.
34. J. McCarthy, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence 28 (1) (19860 89-116.
35. J. Minker, On indefinite databases and the closed-world assumption, in: Proceedings 6th Conference on Automated Deduction, Lecture Notes in Computer Science, Vol. 138 (Springer, Berlin, 1982) 292-308.
36. I. Niemela and J. Rintanen, On the impact of stratification on the complexity of non-monotonic reasoning, J. Appl. Non-Classical Logics 2 (1994) 141-179.
37. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings 32nd Annual ACM Symposium on Foundations of Computer Science (1991) 163-169.
38. Y. Peng and J. Reggia, Plausibility of diagnostic hypothesis: The nature of simplicity, IEEE Trans. Systems Man Cybernet. 17 (1987) 146-162.
39. T. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988) 193-216.
40. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Comput. 9 (1991) 401-424.
41. R. Reiter, On closed-world databases, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum Press, New York, 1978) 55-76.
42. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1-2) (1980) 81-132.
43. D. Saccá and C. Zaniolo, Stable models and nondeterminism in logic programs with negation, in: Proceedings Ninth ACM Symposium on Principles of Database Systems, Nashville, TN (1990).
44. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings 10th Annual ACM Symposium on Theory of Computing (1978) 216-226.
45. M. Schaerf, Negation and minimality in disjunctive databases, J. Logic Programming 23 (1) (1995) 63-86.
46. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146-160.
47. M .Y. Vardi, The complexity of relational query languages, in: Proceedings 14th Annual ACM Symposium on Theory of Computing (STOC-82) (1982) 137-145.