A subset-matching size-bounded cache for satisfiability in modal logics

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

Volumn 1847 LNAI, Issue , 2000, Pages 237-251

  Giunchiglia, Enrico ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BETTER PERFORMANCE; BIT MATRIXES; CACHING MECHANISM; CONSISTENCY RESULT; HASH TABLE; MODAL LOGIC; SATISFIABILITY; SPACE AND TIME; DATA TYPE;

FORMAL LOGIC;

MATRIX ALGEBRA;

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

References (23)

1. B. Hollunder, W. Nutt, and M. Schmidt-Schauß. Subsumption Algorithms for Concept Description Languages. In Proc. 8th European Conference on Artificial Intelligence, pages 348-353, 1990.
2. F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.J. Profitlich. An Empirical Analysis of Optimization Techniques for Terminological Representation Systems or: Making KRIS get a move on. Applied Artificial Intelligence. Special Issue on Knowledge Base Management, 4:109-132, 1994.
3. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proc. CADE-96, Lecture Notes in Artificial Intelligence, New Brunswick, NJ, USA, August 1996. Springer Verlag.
4. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998.
5. A. Heuerding, G. Jager, S. Schwendimann, and M. Seyfried. The Logics Workbench LWB: A Snapshot. Euromath Bulletin, 2(1):177-186, 1996.
6. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 636-647, 1998.
7. Armando Tacchella. *sat system description. In P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel-Schneider, editors, Collected Papers from the International Description Logics Workshop (DL'99). CEUR, July 1999.
8. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT-Based Decision Procedures for Classical Modal Logics. Journal of Automated Reasoning, 2000. To appear.
9. Andrei Voronkov. KK: a theorem prover for K. In Harald Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), volume 1632 of LNAI, pages 383-387, Berlin, July 7-10, 1999. Springer-Verlag.
10. P. F. Patel-Schneider. DLP system description. In E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, C. A. Welty, and F. Sebastiani, editors, Collected Papers from the International Description Logics Workshop (DL'98), pages 87-89. CEUR, May 1998.
11. V. Haarslev and R. Moeller. HAM-ALC. In E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, C. A. Welty, and F. Sebastiani, editors, Collected Papers from the International Description Logics Workshop (DL'98). CEUR, May 1998.
12. Vijay Boyapati and Rajeev Goré. KtSeqC: System description. In Neil V. Murray, editor, Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), volume 1617 of LNAI, pages 29-31, Berlin, June 07-11 1999. Springer.
13. U. Hustadt, R. A. Schmidt, and C. Weidenbach. MSPASS: Subsumption testing with SPASS. In P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel- Schneider, editors, Collected Papers from the International Description Logics Workshop (DL'99), pages 136-137. CEUR, July 1999.
14. Fabio Massacci. Results of the TANCS comparison. http://www.dis.uniroma1. it/~tancs/results.shtml, 1999. Accessed March 9, 2000.
15. I. Horrocks and P. F. Patel-Schneider. Advances in propositional modal satisfiability, 1999. Manuscript.
16. B. F. Chellas. Modal Logic - an Introduction. Cambridge University Press, 1980.
17. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
18. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293-304, 1986.
19. Joseph Y. Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
20. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comp., 6(3):467-480, 1977.
21. Fabio Massacci. Design and results of the Tableaux-99 Non-classical (Modal) Systems comparison. In Neil V. Murray, editor, Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), volume 1617 of LNAI, pages 14-18, Berlin, June 07-11 1999. Springer.
22. Jörg Hoffman and Jana Koehler. A new method to index and query sets. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 462-467, 1999.
23. Armando Tacchella. Evaluating *sat on TANCS2000 benchmarks. In Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-2000), LNAI, Berlin, July 2000. Springer.