Is intractability of nonmonotonic reasoning a real drawback?

Artificial Intelligence

Volumn 88, Issue 1-2, 1996, Pages 215-251

  Cadoli, Marco ^a   Donini, Francesco M ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Compact representations; Computational complexity; Knowledge representation; Nonmonotonic reasoning

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC;

COMPACT REPRESENTATIONS; DEFAULT LOGIC; NONMONOTONIC REASONING;

KNOWLEDGE REPRESENTATION;

EID: 0030409709     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00009-4     Document Type: Article

References (54)

1. F. Baader and B. Hollunder, Embedding defaults into terminological knowledge representation formalisms, in: Proceedings Third International Conference on the Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 306-317.
2. A. Borgida and D.W. Etherington, Hierarchical knowledge bases and efficient disjunctive reasoning, in: Proceedings First International Conference on the Principles of Knowledge Representation and Reasoning, Toronto, Ont. (1989) 33-43.
3. R.J. Brachman, The future of knowledge representation, in: Proceedings AAAI-90, Boston, MA (1990) 1082-1092.
4. M. Cadoli, On the complexity of model finding for nonmonotonic propositional logics, in: A. Marchetti Spaccamela, P. Mentrasti and M. Venturini Zilli, eds., Proceedings of the Fourth Italian Conference on Theoretical Computer Science (World Scientific Publishing, Teaneck, NJ, 1992) 125-139.
5. M. Cadoli, Semantical and computational aspects of Horn approximations, in: Proceedings IJCAI-93, Chambery (1993) 39-44.
6. M. Cadoli, F.M. Donini, P. Liberatore and M. Schaerf, The size of a revised knowledge base, in: Proceedings Fourteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (1995) 151-162.
7. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback?, in: Proceedings AAAI-94, Seattle, WA (1994) 946-951; extended version: RAP.09.95 DIS, University of Roma "La Sapienza", Rome (1995).
8. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback?, in: Proceedings AAAI-94, Seattle, WA (1994) 946-951; extended version: RAP.09.95 DIS, University of Roma "La Sapienza", Rome (1995).
9. M. Cadoli, F.M. Donini and M. Schaerf, On compact representations of propositional circumscription, in: Proceedings Twelfth Symposium on Theoretical Aspects of Computer Science (1995) 205-216; extended version: RAP.14.95 DIS, University of Roma "La Sapienza", Rome (1995); also: Theoret. Comput. Sci. (to appear).
10. M. Cadoli, F.M. Donini and M. Schaerf, On compact representations of propositional circumscription, in: Proceedings Twelfth Symposium on Theoretical Aspects of Computer Science (1995) 205-216; extended version: RAP.14.95 DIS, University of Roma "La Sapienza", Rome (1995); also: Theoret. Comput. Sci. (to appear).
11. M. Cadoli, F.M. Donini and M. Schaerf, On compact representations of propositional circumscription, in: Proceedings Twelfth Symposium on Theoretical Aspects of Computer Science (1995) 205-216; extended version: RAP.14.95 DIS, University of Roma "La Sapienza", Rome (1995); also: Theoret. Comput. Sci. (to appear).
12. M. Cadoli and M. Lenzerini, The complexity of propositional closed world reasoning and circumscription, J. Comput. Syst. Sci. 48 (1994) 255-310.
13. M. Cadoli and M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Programming 17 (1993) 127-160.
14. W.P. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 1 (1984) 267-284.
15. D.V. Etherington, Relating default logic and circumscription, in: Proceedings IJCAI-87, Milan (1987) 489-494.
16. S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
17. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
18. M. Gelfond and H. Przymusinska, Negation as failure: careful closure procedure, Artif. Intell. 30 (1986) 273-287.
19. M. Gelfond, H. Przymusinska and T. Przymusinski, On the relationship between circumscription and negation as failure, Artif. Intell. 38 (1989) 75-94.
20. G. Gogic, H. Kautz, C. Papadimitriou and B. Selman, The comparative linguistics of knowledge representation, in: Proceedings IJCAI-95, Montreal, Que. (1995) 862-869.
21. G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2 (1992) 397-425.
22. T. Imielinski, Incomplete deductive databases, Ann. Math. Artif. Intell. 3 (1991) 259-294.
23. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science Vol. A (North-Holland, Amsterdam, 1990) Chapter 2.
24. R.M. Karp and R.J. Lipton, Some connections between non-uniform and uniform complexity classes, in: Proceedings Twelfth ACM Symposium on Theory of Computing (1980) 302-309.
25. H.A. Kautz, M.J. Kearns and B. Selman, Reasoning with characteristic models, in: Proceedings AAAI-93, Washington, DC (1993) 34-39.
26. H.A. Kautz and B. Selman, Hard problems for simple default logics, Artif. Intell. 49 (1991) 243-279.
27. H.A. Kautz and B. Selman, Forming concepts for fast inference, in: Proceedings AAAI-92, San Jose, CA (1992) 786-793.
28. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; extended version: TR-02-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994).
29. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; extended version: TR-02-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994).
30. R. Khardon and D. Roth, Reasoning with models, in: Proceedings AAAI-94, Seattle, WA (1994) 1148-1153; extended version: TR-01-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994); also: Artif. Intell. 87 (1996) 187-213.
31. R. Khardon and D. Roth, Reasoning with models, in: Proceedings AAAI-94, Seattle, WA (1994) 1148-1153; extended version: TR-01-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994); also: Artif. Intell. 87 (1996) 187-213.
32. R. Khardon and D. Roth, Reasoning with models, in: Proceedings AAAI-94, Seattle, WA (1994) 1148-1153; extended version: TR-01-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994); also: Artif. Intell. 87 (1996) 187-213.
33. H.J. Levesque, Foundations of a functional approach to knowledge representation, Artif. Intell. 23 (1984) 155-212.
34. V. Lifschitz, Closed-world databases and circumscription, Artif. Intell. 27 (1985) 229-235.
35. V. Lifschitz, Computing circumscription, in: Proceedings IJCAI-85, Los Angeles, CA (1985) 121-127.
36. J. McCarthy, Applications of circumscription to formalizing common-sense knowledge, Artif. Intell. 28 (1986) 89-116.
37. J. Minker, On indefinite databases and the closed world assumption, in: Proceedings Sixth Conference on Automated Deduction, New York (1982) 292-308.
38. Y. Moses and M. Tennenholtz, Off-line reasoning for on-line efficiency, Artif. Intell. 83 (1996) 229-239.
39. A. Nerode, R.T. Ng and V.S. Subrahmanian, Computing circumscriptive databases I: theory and algorithms, Inform. Comput. 116 (1995) 58-80.
40. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
41. A. Rajasekar, J. Lobo and J. Minker, Weak generalized closed world assumption, J. Autom. Reasoning 5 (1989) 293-307.
42. R. Reiter, On closed world data bases, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum, New York, 1978) 119-140.
43. R. Reiter, A logic for default reasoning, Artif. Intell. 13 (1980) 81-132.
44. R. Reiter, Circumscription implies predicate completion (sometimes), in: Proceedings AAAI-82, Pittsburgh, PA (1982) 418-420.
45. J.S. Schlipf, Decidability and definability with circumscription, Ann. Pure Appl. Logic 35 (1987) 173-191.
46. B. Selman, Near-optimal plans, tractability, and reactivity, in: Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn (1994) 521-529.
47. B. Selman and H.A. Kautz, Knowledge compilation using Horn approximations, in: Proceedings AAAI-91, Anaheim, CA (1991) 904-909.
48. L. Sterling and E. Shapiro, The Art of Prolog (MIT Press, Cambridge, MA, 1986).
49. J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logics, in: Proceedings AAAI-90, Boston, MA (1990) 571-578.
50. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620-650.
51. M.Y. Vardi, The complexity of relational query languages, in: Proceedings Fourteenth ACM Symposium on Theory of Computing (1982) 137-146.
52. M.Y. Vardi, On the complexity of bounded-variable queries, in: Proceedings Fourteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (1995).
53. A. Yahya and L.J. Henschen, Deduction in non-Horn databases, J. Autom. Reasoning 1 (1985) 141-160.
54. C.K. Yap, Some consequences of non-uniform conditions on uniform classes, Theoret. Comput. Sci. 26 (1983) 287-300.