Tableau calculus for only knowing and knowing at most

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1847 LNAI, Issue , 2000, Pages 383-397

  Rosati, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLICIT REPRESENTATION; LOWER BOUNDS; MODAL LOGIC; POSSIBLE WORLD SEMANTICS; SATISFIABILITY PROBLEMS; TABLEAU METHOD; WORST-CASE COMPLEXITY;

BIOMINERALIZATION; CALCULATIONS; FORMAL LOGIC; SEMANTICS;

FORMAL LOGIC; CALCULATIONS;

EID: 52549123235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_30     Document Type: Conference Paper

References (25)

1. P. A. Bonatti and N. Olivetti. A sequent calculus for circumscription. In Proc. of CSL'97, vol. 1414 of LNAI, pp. 98-114. Springer-Verlag, 1997.
2. P. A. Bonatti and N. Olivetti. A sequent calculus for skeptical default logic. In Proc. of TABLEAUX'97, vol. 1227 of LNAI, pp. 107-121. Springer-Verlag, 1997.
3. J. Chen. The logic of only knowing as a unified framework for non-monotonic reasoning. Fundamenta Informaticae, 21:205-220, 1994.
4. F. M. Donini, F. Massacci, D. Nardi, and R. Rosati. A uniform tableaux method for nonmonotonic modal logics. In Proc. of JELIA'96, vol. 1126 of LNAI, pp. 87-103. Springer-Verlag, 1996.
5. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, 1983.
6. R. Goré. Semi-analytic tableaux for modal logics with application to nonmonotonicity. Logique et Analyse, 133-134, 1991.
7. J. Y. Halpern and G. Lakemeyer. Levesque's axiomatization of only knowing is incomplete. Artificial Intelligence, 74(2):381-387, 1995.
8. J. Y. Halpern and G. Lakemeyer. Multi-agent only knowing. In Proc. of TARK'96. Morgan Kaufmann, 1996.
9. J. Y. Halpern and Y. Moses. Towards a theory of knowledge and ignorance: Preliminary report. In K. Apt, ed., Logic and models of concurrent systems. Springer-Verlag, 1985.
10. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
11. D. S. Johnson. A catalog of complexity classes. In J. van Leuven, ed., Handbook of Theoretical Computer Science, vol. A, chapter 2. Elsevier, 1990.
12. G. Lakemeyer. Limited reasoning in first-order knowledge bases with full introspection. Artificial Intelligence, 84:209-255, 1996.
13. G. Lakemeyer. Only knowing in the situation calculus. In Proc. of KR'96, pp. 14-25. Morgan Kaufmann, 1996.
14. G. Lakemeyer and H. J. Levesque. A tractable knowledge representation service with full introspection. In Proc. of TARK'88, pp. 145-159. Morgan Kaufmann, Los Altos, 1988.
15. H. J. Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42:263-310, 1990.
16. V. Lifschitz. Minimal belief and negation as failure. Artificial Intelligence, 70:53-72, 1994.
17. W. Marek and M. Truszczyński. Nonmonotonic Logics - Context-Dependent Reasoning. Springer-Verlag, 1993.
18. F. Massacci. Strongly analytic tableaux for normal modal logics. In Proc. of CADE'94, vol. 814 of LNAI, pp. 723-737. Springer-Verlag, 1994.
19. R. C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25:75-94, 1985.
20. I. Niemelä. Decision procedure for autoepistemic logic. In Proc. of CADE'88, vol. 310 of LNCS, pp. 675-684. Springer-Verlag, 1988.
21. I. Niemelä. A tableau calculus for minimal model reasoning. In Proc. of TABLEAUX' 96, vol. 1071 of LNAI, pp. 278-294. Springer-Verlag, 1996.
22. N. Olivetti. Tableaux and sequent calculus for minimal entailment. J. of Automated Reasoning, 9:99-139, 1992.
23. R. Reiter. What should a database know? J. of Logic Programming, 14:127-153, 1990.
24. R. Rosati. On the decidability and complexity of reasoning about only knowing. Artificial Intelligence, 116:193-215, 2000.
25. C. B. Schwind. A tableaux-based theorem prover for a decidable subset of default logic. In Proc. of CADE'90, vol. 449 of LNCS, pp. 528-542. Springer-Verlag, 1990.