Default reasoning from conditional knowledge bases: Complexity and tractable cases

Artificial Intelligence

Volumn 124, Issue 2, 2000, Pages 169-241

  Eiter, Thomas ^a   Lukasiewicz, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DECISION THEORY; ENTROPY; KNOWLEDGE BASED SYSTEMS;

HORN CONDITIONAL KNOWLEDGE BASES;

ARTIFICIAL INTELLIGENCE;

EID: 0034501527     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00073-4     Document Type: Article

References (90)

1. Adams E.W. The Logic of Conditionals. Synthese Library. Vol. 86:1975;Reidel, Dordrecht.
2. Alchourrón C., Gärdenfors P., Makinson D. On the logic of theory change: Partial meet contraction and revision functions. J. Symbolic Logic. Vol. 50:1985;510-530.
3. Bacchus F., Grove A., Halpern J.Y., Koller D. From statistical knowledge bases to degrees of belief. Artificial Intelligence. Vol. 87:1996;75-143.
4. Bell C., Nerode A., Ng R., Subrahmanian V.S. Mixed integer programming methods for computing non-monotonic deductive databases. J. ACM. Vol. 41:(6):1994;1178-1215.
5. Ben-Eliyahu R. NP-complete problems in optimal Horn clauses satisfiability. 1991;Technical Report R-158, UCLA, Computer Science Department, Los Angeles, CA.
6. Benferhat S., Cayrol C., Dubois D., Lang J., Prade H. Inconsistency management and prioritized syntax-based entailment. Proc. IJCAI-93, Chambéry, France. 1993;640-645 Morgan Kaufmann, San Mateo, CA.
7. Benferhat S., Dubois D., Prade H. Representing default rules in possibilistic logic. Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;673-684 Morgan Kaufmann, San Mateo, CA.
8. Benferhat S., Dubois D., Prade H. Nonmonotonic reasoning, conditional objects and possibility theory. Artificial Intelligence. Vol. 92:(1-2):1997;259-276.
9. Benferhat S., Saffiotti A., Smets P. Belief functions and default reasoning. Artificial Intelligence. Vol. 122:2000;1-69.
10. Boros E., Crama Y., Hammer P.L. Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. Artificial Intelligence. Vol. 1:1990;21-32.
11. Boros E., Hammer P.L., Sun X. Recognition of q-Horn formulae in linear time. Discrete Appl. Math. Vol. 55:1994;1-13.
12. Bourne R.A. Default reasoning using maximum entropy and variable strength defaults, Ph.D. Thesis. 1999;University of London, London.
13. Bourne R.A., Parsons S. Maximum entropy and variable strength defaults. Proc. IJCAI-99, Stockholm, Sweden. 1999;50-55 Morgan Kaufmann, San Mateo, CA.
14. Boutilier C. Conditional logics of normality as modal systems. Proc. AAAI-90, Boston, MA. 1990;594-599 AAAI Press/MIT Press.
15. Boutilier C. Conditional logics of normality: A modal approach. Artificial Intelligence. Vol. 68:1994;87-154.
16. Boutilier C. Unifying default reasoning and belief revision in a modal framework. Artificial Intelligence. Vol. 68:1994;33-85.
17. Buss S., Hay L. On truth-table reducibility to SAT. Inform. and Comput. Vol. 91:1991;86-102.
18. Cadoli M. The complexity of model checking for circumscriptive formulae. Inform. Process. Lett. Vol. 44:1992;113-118.
19. Cadoli M., Donini F.M., Liberatore P., Schaerf M. Feasibility and unfeasibility of off-line processing. Proc. 4th Israeli Symposium on Theory of Computing and Systems (ISTCS'96), Jerusalem, Israel. 1996;100-109 IEEE Computer Society.
20. Cadoli M., Giovanardi A., Schaerf M. An algorithm to evaluate quantified Boolean formulae. Proc. AAAI-98, Madison, WI. 1998;262-267 AAAI Press/MIT Press.
21. Cadoli M., Lenzerini M. The complexity of propositional closed world reasoning and circumscription. J. Comput. System Sci. Vol. 43:1994;165-211.
22. Cayrol C., Lagasquie-Schiex M.-C., Schiex T. Nonmonotonic reasoning: From complexity to algorithms. Ann. Math. Artificial Intelligence. Vol. 22:(3-4):1998;207-236.
23. Cholewiński P., Marek V.W., Mikitiuk A., Truszczyński M. Computing with default logic. Artificial Intelligence. Vol. 112:(2-3):1999;105-147.
24. Dalal M. Investigations into a theory of knowledge base revision. Proc. AAAI-88, St. Paul, MN. 1988;475-479 AAAI Press/MIT Press.
25. Dantsin E., Eiter T., Gottlob G., Voronkov A. Complexity and expressive power of logic programming. Proc. 12th IEEE International Conference on Computational Complexity (CCC-97), Ulm, Germany. 1997;82-101.
26. Delgrande J. A first-order conditional logic for prototypical properties. Artificial Intelligence. Vol. 33:(1):1987;105-130.
27. Delgrande J. On first-order conditional logics. Artificial Intelligence. Vol. 105:(1-2):1998;105-137.
28. Downey R.G., Fellows M.F., Fellows M.R. Parameterized Complexity. 1998;Springer, Berlin.
29. Du D., Gu J., Pardalos P.M. Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 35:1997;American Mathematical Society, Providence, RI.
30. Dubois D., Prade H. Possibilistic logic, preferential models, non-monotonicity and related issues. Proc. IJCAI-91, Sydney, Australia. 1991;419-424 Morgan Kaufmann, San Mateo, CA.
31. Dubois D., Prade H. Conditional objects as non-monotonic consequence relationships. IEEE Trans. Systems Man Cybernet. Vol. 24:1994;1724-1740.
32. Egly U., Eiter T., Tompits H., Woltran S. Solving advanced reasoning tasks using quantified Boolean formulas. Proc. AAAI-00, Austin, TX. 2000;417-422 AAAI Press/MIT Press.
33. Eiter T., Gottlob G. On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence. Vol. 57:(2-3):1992;227-270.
34. 2 -complete. Theoret. Comput. Sci. Vol. 114:(2):1993;231-245. Addendum 118, 315.
35. Eiter T., Gottlob G. The complexity of logic-based abduction. J. ACM. Vol. 42:(1):1995;3-42.
36. Eiter T., Gottlob G., Leone N. Abduction from logic programs: Semantics and complexity. Theoret. Comput. Sci. Vol. 189:(1-2):1997;129-177.
37. Eiter T., Leone N., Mateis C., Pfeifer G., Scarcello F. The KR system dlv: Progress report, comparisons, and benchmarks. Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;406-417 Morgan Kaufmann, San Mateo, CA.
38. N. Friedman, J.Y. Halpern, Plausibility measures and default reasoning, J. ACM, to appear.
39. Friedman N., Halpern J.Y. On the complexity of conditional logics. Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;202-213 Morgan Kaufmann, San Mateo, CA.
40. Gabbay D.M., Hogger C.J., Robinson J.A. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III: Nonmonotonic Reasoning and Uncertain Reasoning. 1994;Clarendon Press, Oxford.
41. Gabbay D.M., Smets P. Handbook on Defeasible Reasoning and Uncertainty Management Systems. 1998;Kluwer Academic, Dordrecht.
42. Gärdenfors P., Rott H. Belief revision. Gabbay D.M., Hogger C.J., Robinson J.A. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. IV: Epistemic and Temporal Reasoning. 1995;35-132 Clarendon Press, Oxford.
43. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
44. Geffner H. Default Reasoning: Causal and Conditional Theories. 1992;MIT Press, Cambridge, MA.
45. Geffner H. High probabilities, model preference and default arguments. Mind and Machines. Vol. 2:1992;51-70.
46. Geffner H., Pearl J. Conditional entailment: Bridging two approaches to default reasoning. Artificial Intelligence. Vol. 53:(2-3):1992;209-244.
47. Gogic G., Kautz H., Papadimitriou C.H., Selman B. The comparative linguistics of knowledge representation. Proc. IJCAI-95, Montréal, Quebec. 1995;862-869 Morgan Kaufmann, San Mateo, CA.
48. Goldszmidt M., Morris P., Pearl J. A maximum entropy approach to nonmonotonic reasoning. IEEE Transactions on Pattern Analysis and Machine Intelligence. Vol. 15:(3):1993;220-232.
49. Goldszmidt M., Pearl J. On the consistency of defeasible databases. Artificial Intelligence. Vol. 52:(2):1991;121-149.
50. + : A formalism for reasoning with variable strength defaults. Proc. AAAI-91, Anaheim, CA. 1991;399-404 AAAI Press/MIT Press.
51. Goldszmidt M., Pearl J. Rank-based systems: A simple approach to belief revision, belief update and reasoning about evidence and actions. Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;661-672 Morgan Kaufmann, San Mateo, CA.
52. Goldszmidt M., Pearl J. Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artificial Intelligence. Vol. 84:(1-2):1996;57-112.
53. Gottlob G. Complexity results for nonmonotonic logics. J. Logic Comput. Vol. 2:(3):1992;397-425.
54. Gottlob G., Scarcello F., Sideri M. Fixed parameter complexity in AI and nonmonotonic reasoning. Proc. 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-99), El Paso, TX. Lecture Notes in Computer Science. Vol. 1730:1999;1-18 Springer, Berlin.
55. Janhunen T. On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. Proc. European Workshop on Logics in Artificial Intelligence (JELIA'98), Dagstuhl, Germany. Lecture Notes in Computer Science. Vol. 1489:1998;216-232 Springer, Berlin.
56. Jenner B., Toran J. Computing functions with parallel queries to NP. Theoret. Comput. Sci. Vol. 141:1995;175-193.
57. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. A, Chapter 2. 1990;67-161 MIT Press, Cambridge, MA.
58. Katsuno H., Mendelzon A.O. Propositional knowledge base revision and minimal change. Artificial Intelligence. Vol. 52:1991;253-294.
59. Kautz H., Selman B. Hard problems for simple default logics. Artificial Intelligence. Vol. 49:1991;243-279.
60. Kraus S., Lehmann D., Magidor M. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence. Vol. 14:(1):1990;167-207.
61. Krentel M.W. The complexity of optimization problems. J. Comput. System Sci. Vol. 36:(3):1988;490-509.
62. Lamarre P. S4 as the conditional logic of nonmonotonicity. Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;357-367 Morgan Kaufmann, San Mateo, CA.
63. Lamarre P. A promenade from monotonicity to non-monotonicity following a theorem prover. Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;572-580 Morgan Kaufmann, San Mateo, CA.
64. Lehmann D. What does a conditional knowledge base entail? Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ontario. 1989;212-222 Morgan Kaufmann, San Mateo, CA.
65. Lehmann D. Another perspective on default reasoning. Ann. Math. Artificial Intelligence. Vol. 15:(1):1995;61-82.
66. Lehmann D., Magidor M. What does a conditional knowledge base entail? Artificial Intelligence. Vol. 55:(1):1992;1-60.
67. Liberatore P. The complexity of belief update. Proc. IJCAI-97, Nagoya, Japan. 1997;68-73 Morgan Kaufmann, San Mateo, CA.
68. Lifschitz V. Computing circumscription. Proc. IJCAI-85, Los Angeles, CA. 1985;121-127 Morgan Kaufmann, San Mateo, CA.
69. Marek W., Truszczyński M. Nonmonotonic Logics - Context-Dependent Reasoning. 1993;Springer, Berlin.
70. McCarthy J. Circumscription - A form of non-monotonic reasoning. Artificial Intelligence. Vol. 13:1980;27-39.
71. McDermott D. Non-monotonic logic II: Nonmonotonic modal theories. J. ACM. Vol. 29:1982;33-57.
72. McDermott D., Doyle J. Non-monotonic logic I. Artificial Intelligence. Vol. 13:1980;41-72.
73. Moore R.C. Semantical considerations on nonmonotonic logics. Artificial Intelligence. Vol. 25:1985;75-94.
74. Nebel B. Belief revision and default reasoning: Syntax-based approaches. Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;417-428 Morgan Kaufmann, San Mateo, CA.
75. Nebel B. Base revision operators and schemes: Semantics, representation, and complexity. Proc. 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam, Netherlands. 1994;341-345.
76. Nebel B. How hard is it to revise a belief base? Gabbay D., Smets P. Handbook on Defeasible Reasoning and Uncertainty Management Systems, Vol. III: Belief Change. 1998;77-145 Kluwer Academic, Dordrecht.
77. Niemelä I. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae. Vol. 17:1992;117-155.
78. Niemelä I., Simons P. Smodels - An implementation of the stable model and well-founded semantics for normal logic programs. Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), Dagstuhl, Germany. Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. Vol. 1265:1997;420-429 Springer, Berlin.
79. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
80. Pearl J. Probabilistic semantics for nonmonotonic reasoning: A survey. Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ontario. 1989;505-516 Morgan Kaufmann, San Mateo, CA.
81. Pearl J. System Z: A natural ordering of defaults with tractable applications to default reasoning. Proc. 3rd Conference on Theoretical Aspects of Reasoning about Knowledge (TARK-90), Pacific Grove, CA. 1990;121-135 Morgan Kaufmann, San Mateo, CA.
82. Reiter R. A logic for default reasoning. Artificial Intelligence. Vol. 13:1980;81-132.
83. Rintanen J. Improvements to the evaluation of quantified Boolean formulae. Proc. IJCAI-99, Stockholm, Sweden. 1999;1192-1197 Morgan Kaufmann, San Mateo, CA.
84. Selman A. A taxonomy of complexity classes of functions. J. Comput. System Sci. Vol. 48:1994;357-381.
85. Shoham Y. A semantical approach to nonmonotonic logics. Proc. 2nd IEEE Symposium on Logic in Computer Science (LICS-87), Ithaca, NY. 1987;275-279.
86. Spohn W. Ordinal conditional functions: A dynamic theory of epistemic states. Harper W., Skyrms B. Causation in Decision, Belief Change, and Statistics, Vol. 2. 1988;105-134 Reidel, Dordrecht.
87. Stillman J. It's not my default: The complexity of membership problems in restricted propositional default logic. Proc. AAAI-90, Boston, MA. 1990;571-579 AAAI Press/MIT Press.
88. Stillman J. The complexity of propositional default logic. Proc. AAAI-92, San Jose, CA. 1992;794-799 AAAI Press/MIT Press.
89. Vossen T., Ball M., Lotem A., Nau D.S. On the use of integer programming models in AI planning. Proc. IJCAI-99, Stockholm, Sweden. 1999;304-309 Morgan Kaufmann, San Mateo, CA.
90. Wagner K. Bounded query classes. SIAM J. Comput. Vol. 19:(5):1990;833-846.