The complexity of nested counterfactuals and iterated knowledge base revisions

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 497-512

  Eiter, Thomas ^a   Gottlob, Georg ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; QUERY LANGUAGES;

NESTED COUNTERFACTUALS;

KNOWLEDGE BASED SYSTEMS;

EID: 0030422195     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0083     Document Type: Article

References (40)

1. S. Abiteboul, P. Kanellakis, and G. Grahne, On the representation and querying of sets of possible worlds, Theoret. Comput. Sci. 78 (1991), 159-187.
2. A. Bonner, Hypthetical datalog: Negation and linear recursion, in "Proceedings, PODS-89," pp. 289-300.
3. A. Bonner, Hypothetical datalog: Complexity and expressibility, Theoret. Comput. Sci. 76 (1990), 3-51.
4. A. Bonner, "Hypothetical Reasoning in Deductive Databases," Ph.D. thesis, Dept. of Computer Science, Rutgers University, 1991.
5. M. Cadoli and M. Lenzerini, The complexity of closed world reasoning and circumscription, J. Comput. Systems Sci. 43 (1994), 165-211.
6. M. Cadoli and M. Schaerf, A survey on complexity results for non-monotonic logics, J. Logic Programming 17 (1993), 127-160.
7. M. Cadoli and M. Schaerf, Tractable reasoning via approximation, Artif. Intell. 74(2) (1995), 249-310.
8. A. Condon, Approximate solutions to problems in PSPACE, SIGACT News 26(2) (1995), 4-13.
9. T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, in "Proceedings, PODS-92," pp. 261-273; Extended version, Artif. Intell. 57(2-3) (1992), 227-270.
10. T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, in "Proceedings, PODS-92," pp. 261-273; Extended version, Artif. Intell. 57(2-3) (1992), 227-270.
11. R. Fagin, G. Kuper, J. Ullman, and M. Y. Vardi, Updating logical databases, in "Advances in Computing Research" (G. Kanellakis and F. Preparata, Eds.), Vol. 3, pp. 1-18, JAI Press, Greenwich, CT, 1986.
12. R. Fagin, J. D. Ullman, and M. Y. Vardi, On the semantics of updates in databases, in "Proceedings PODS-83," pp. 352-365.
13. P. Gärdenfors, "Knowledge in Flux," Bradford Books, MIT Press, Cambridge, MA, 1988.
14. M. Garey and D. S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
15. M. L. Ginsberg, Counterfactuals, Art. Intell. 30 (1986), 35-79.
16. M. L. Ginsberg and D. E. Smith, Reasoning about action I: A possible worlds approach, Art. Intell. 35 (1988), 165-195.
17. G. Grahne, Updates and counterfactuals, in "Proceedings, KR-91," pp. 269-276.
18. G. Grahne and A. O. Mendelzon, "Updates and Subjunctive Queries," Technical Report KRR-TR-91-4, CS Dept., University of Toronto, July 1991; Inform, and Comput. 116(2) (1995), 241-252.
19. G. Grahne and A. O. Mendelzon, "Updates and Subjunctive Queries," Technical Report KRR-TR-91-4, CS Dept., University of Toronto, July 1991; Inform, and Comput. 116(2) (1995), 241-252.
20. D. S. Johnson, A catalog of complexity classes, in "Handbook of Theoretical Computer Science A" (J. van Leeuwen, Ed.), Chap. 2, Elsevier Science, New York, 1990.
21. H. Katsuno and A. O. Mendelzon, Propositional knowledge base revision and minimal change, Artif. Intell. 52 (1991), 253-294.
22. H. Kautz and B. Selman, Hard problems for simple default logics, Artif. Intell. 49 (1991), 243-279.
23. M. Krentel, Generalizations of OptP to the polynomial hierarchy, Theoret. Comput. Sci. 97(2) (1992), 183-198.
24. L. T. McCarty, Clausal intuitionistic logic. I. Fixed-point semantics, J. Logic Programming 5 (1993), 1-31.
25. B. Nebel, Belief revision and default reasoning: Syntax-based approaches, in "Proceedings, KR-91," pp. 417-428.
26. I. Niemelä, Towards automatic reasoning, in "Proceedings, Europ. Workshop on Logics in AI, Amsterdam, September 1990," Lect. Notes in Comput. Sci., Vol. 478, Springer-Verlag, New York/Berlin, 1991.
27. M. Rabin and D. Scott, Finite automata and their decision problem, IBM J. Res. Dev. 3 (1959), 114-125.
28. R. Reiter, A theory of diagnosis from first principles, Artif. Intell. 32 (1987), 57-95.
29. V. Rutenburg, Complexity classification in truth maintenance systems, in "Proceedings STACS-91," Lect. Notes in Comput. Sci., Vol. 480, pp. 373-383, Springer-Verlag, New York/Berlin, 1991;
30. extended version, Ann. Math. Artif. Intell. 10 (1994), 207-231.
31. B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, in "Proceedings, AAAI-92," pp. 440-446.
32. B. Selman and H. J. Levesque, Abductive and default reasoning: A computational core, in "Proceedings, AAAI-90," pp. 343-348.
33. R. Statman, Intuitionistic propositional logic is polynomial-space complete, Theoret. Comput. Sci. 9(2) (1979), 67-72.
34. J. Stillman, It's not my default: The complexity of membership problems in restricted propositional default logic, in "Proceedings, AAAI-90," pp. 571-579.
35. J. Stillman, The complexity of propositional default logic, in "Proceedings AAAI-92," pp. 794-799.
36. L. Stockmeyer, Classifying the computational complexity of problems, J. Symbolic Logic 52(1) (1987), 1-43.
37. M. Vardi, On the complexity of epistemic reasoning, in "Proceedings, Fourth Annual Symposium on Logic in Computer Science LICS-89," pp. 243-252, IEEE Comput. Sci. Press, New York, 1989.
38. K. Wagner, Bounded query classes, SIAM J. Comput. 19(5) (1990), 833-846.
39. M. Winslett, Reasoning about action using a possible models approach, in "Proceedings AAAI-88," pp. 89-93.
40. M. Winslett, "Updating Logical Databases," Cambridge Univ. Press, Cambridge, 1990.