Skip to main content
SpringerLink
Log in

A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The implementation of efficient decision procedures for modal logics is a major research problem in automated deduction. Caching the result of intermediate consistency checks has experimentally proved to be a very important technique for attaining efficiency. Current state-of-the-art systems implement caching mechanisms based on hash tables. In this paper we present a data type – that we call “bit matrix” – for caching the (in)consistency of sets of formulas. Bit matrices have three distinguishing features: (i) they can be queried for subsets and supersets, (ii) they can be bounded in size, and (iii) if bounded, they can easily implement different policies to resolve which results have to be kept. We have implemented caching mechanisms based on bit matrices and hash tables in *SAT. In *SAT, the bit matrix cache is bounded, and keeps the latest obtained (in)consistency results. We experiment with the benchmarks proposed for the modal logic K at the “TABLEAUX Non Classical Systems Comparison (TANCS) 2000”. On the basis of the results, we conclude that *SAT performances are improved by (i) caching the results of intermediate consistency checks, (ii) using bit matrices instead of hash tables, and (iii) storing a small number of results in the bit matrices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Armando and E. Giunchiglia, Embedding complex decision procedures inside an interactive theorem prover, Annals of Mathematics and Artificial Intelligence 8(3-4) (1993) 475-502.

    Google Scholar 

  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 (1994) 109-132.

    Google Scholar 

  3. V. Boyapati and R. Goré, KtSeqC: System description, in: Proc. of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), 07-11 June 1999, ed. N.V. Murray, Lecture Notes in Artificial Intelligence, Vol. 1617 (Springer, Berlin, 1999) pp. 29-31.

    Google Scholar 

  4. B.F. Chellas, Modal Logic-An Introduction (Cambridge University Press, 1980).

  5. M. Davis, G. Longemann, and D. Loveland, A machine program for theorem proving, Journal of the ACM 5(7) (1962).

  6. T. Boy de la Tour, Minimizing the number of clauses by renaming, in: Proc. of 10th Conference on Automated Deduction (Springer, 1990) pp. 558-572.

  7. I.P. Gent, H. Van Maaren and T. Walsh (eds.), SAT2000. Highlights of Satisfiability Research in the Year 2000 (IOS Press, 2000).

  8. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella, More evaluation of decision procedures for modal logics, in: Proc. of 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98) (1998).

  9. E. Giunchiglia, F. Giunchiglia, R. Sebastiani and A. Tacchella, SAT vs. translation based decision procedures for modal logics: a comparative evaluation, Journal of Applied Non Classical Logics 10(2) (2000) 145-172.

    Google Scholar 

  10. E. Giunchiglia, F. Giunchiglia and A. Tacchella, SAT-based decision procedures for classical modal logics, Journal of Automated Reasoning, 2000, to appear. Reprinted in [7].

  11. E. Giunchiglia and A. Tacchella, A subset-matchig size-bounded cache for satisfiability in modal logics, in: Proc. of International Conference on Theorem Proving with Analytic Tableaux and Related Methods (Tableaux 2000) (July 2000).

  12. E. Giunchiglia and A. Tacchella, *SAT: a system for the development of modal decision procedures, in: Proc. of 17th International Conference on Automated Deduction (CADE'2000) (2000) pp. 291-296.

  13. F. Giunchiglia and R. Sebastiani, Building decision procedures for modal logics from propositional decision procedures-the case study of modal K, in: Proc. of CADE-96, New Brunswick, NJ, USA, August 1996, Lecture Notes in Artificial Intelligence (Springer, 1996).

  14. C.P. Gomes, B. Selman and H. Kautz, Boosting combinatorial search through randomization. in: Proc. of 15th National Conference on Artificial Intelligence (AAAI-98) and of 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 26-30 July (AAAI Press, Menlo Park, CA, 1998) pp. 431-437.

    Google Scholar 

  15. V. Haarslev and R. Möller, HAM-ALC, in: Collected Papers from the International Description Logics Workshop (DL'98), eds. E. Franconi, G. De Giacomo, R.M. MacGregor, W. Nutt, C.A. Welty and F. Sebastiani (CEUR, May 1998).

  16. J.Y. Halpern and Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54 (1992) 319-379.

    Google Scholar 

  17. A. Heuerding, G. Jager, S. Schwendimann and M. Seyfried, The logics workbench LWB: A snapshot, Euromath Bulletin 2(1) (1996) 177-186.

    Google Scholar 

  18. J. Hoffman and J. Koehler, A new method to index and query sets, in: Proc. of 16th International Joint Conference on Artificial Intelligence (IJCAI-99) (1999) pp. 462-467.

  19. B. Hollunder, W. Nutt and M. Schmidt-Schauß, Subsumption algorithms for concept description languages, in: Proc. of 8th European Conference on Artificial Intelligence (1990) pp. 348-353.

  20. I. Horrocks, Using an expressive description logic: FaCT or fiction?, in: Proc. of 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98) (1998) pp. 636-647.

  21. I. Horrocks and P.F. Patel-Schneider, Advances in propositional modal satisfiability, manuscript (1999).

  22. U. Hustadt, R.A. Schmidt and C. Weidenbach, MSPASS: Subsumption testing with SPASS. in: Collected Papers from the International Description Logics Workshop (DL'99), eds. P. Lambrix, A. Borgida, M. Lenzerini, R. Möller and P. Patel-Schneider (CEUR, July 1999) pp. 136-137.

  23. R. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM Journal on Computing 6(3) (1977) 467-480.

    Google Scholar 

  24. F. Massacci, Design and results of the Tableaux-99 non-classical (modal) systems comparison, in: Proc. of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), 07-11 June 1999, ed. N.V. Murray, Lecture Notes in Artificial Intelligence, Vol. 1617 (Springer, Berlin, 1999) pp. 14-18.

    Google Scholar 

  25. F. Massacci and F. Donini, Design and results of TANCS-2000 non-classical (molda) systems comparison, in: Proc. of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-2000), 3-7 July 2000, ed. R. Dyckhoff, Lecture Notes in Artificial Intelligence, Vol. 1847 (Springer, Berlin, 2000) pp. 52-56.

    Google Scholar 

  26. P.F. Patel-Schneider, DLP system description, in: Collected Papers from the International Description Logics Workshop (DL'98), eds. E. Franconi, G. De Giacomo, R.M. MacGregor, W. Nutt, C.A. Welty and F. Sebastiani (CEUR, May 1998) pp. 87-89.

  27. D.A. Plaisted and S. Greenbaum, A structure-preserving clause form translation, Journal of Symbolic Computation 2 (1986) 293-304.

    Google Scholar 

  28. M. Schmidt-Schauss and G. Smolka, Attributive concept descriptions with complements. Artificial Intelligence 54 (1992) 319-379.

    Google Scholar 

  29. J. Siekmann and G. Wrightson (eds.), Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, Vol. 2 (Springer, 1983).

  30. A. Tacchella, *SAT system description, in: Collected Papers from the International Description Logics Workshop (DL'99), eds. P. Lambrix, A. Borgida, M. Lenzerini, R. Möller and P. Patel-Schneider (CEUR, July 1999).

  31. G. Tseitin, On the complexity of proofs in propositional logics, Seminars in Mathematics 8 (1970). Reprinted in [29].

  32. M.Y. Vardi, On the complexity of epistemic reasoning. in: Proc. of 4th Annual Symposium on Logic in Computer Science, Asilomar Conference Center, 5-8 June 1989 (IEEE Computer Society Press, Pacific Grove, CA, 1989) pp. 243-252.

    Google Scholar 

  33. A. Voronkov, KK: a theorem prover for K, in: Proc. of 16th International Conference on Automated Deduction (CADE-16), 7-10 July 1999, ed. H. Ganzinger, Lecture Notes in Artificial Intelligence, Vol. 1632 (Springer, Berlin, 1999) pp. 383-387.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIST, V.le Causa 13, 16145, Genova, Italy

    Enrico Giunchiglia & Armando Tacchella

Authors
  1. Enrico Giunchiglia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Armando Tacchella
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giunchiglia, E., Tacchella, A. A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics. Annals of Mathematics and Artificial Intelligence 33, 39–67 (2001). https://doi.org/10.1023/A:1012380814999

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012380814999

Search

Navigation