Skip to main content
SpringerLink
Log in

Evaluating Optimized Decision Procedures for Propositional Modal K (m) Satisfiability

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Heavily optimized decision procedures for propositional modal satisfiability are now becoming available. Two systems incorporating such procedures for modal K, DLP and KSATC, are tested on randomly generated CNF formulae with several sets of parameters, varying the maximum modal depth and ratio of propositional variable to modal subformulae. The results show some easy-hard-easy behavior, but there is as yet no sharp peak as in propositional satisfiability.

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. Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles, in Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), 1991, pp. 446–451.

  2. Baader, F. and Hanschke, P.: A scheme for integrating concrete domains into concept languages, in Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), 1991, pp. 452–457.

  3. Baader, F. and Hollunder, B.: A terminological knowledge representation system with complete inference algorithms, in Processing Declarative Knowledge: International Workshop PDK'91, Berlin, 1991, pp. 67–86.

  4. Baader, F. and Sattler, U.: Number restrictions on complex roles in description logics, in Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96), 1996, pp. 328–339.

  5. Baker, A. B.: Intelligent backtracking on constraint satisfaction problems: Experimental and theoretical results, Ph.D. Thesis, University of Oregon, 1995.

  6. Balsiger, P. and Heuerding, A.: Comparison of theorem provers for modal logics — introduction and Summary, in H. de Swart (ed.), Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux'98, 1998, pp. 25–26.

  7. Buchheit, M., Donini, F.M. and Schaerf, A.: Decidable reasoning in terminological knowledge representation systems, J. Artificial Intelligence Res. 1 (1993), 109–138.

    Google Scholar 

  8. Buro, M. and Buning, H.: Report on a SAT competition, Technical Report 110, University of Paderborn, Germany, 1992.

    Google Scholar 

  9. Davis, M., Logemann, G. and Loveland, D.: A machine program for theorem proving, Comm. ACM 5 (1962), 394–397.

    Google Scholar 

  10. Donini, F., Giacomo, G. D. and Massacci, F.: EXPTIME tableaux for ALC, in L. Padgham, E. Franconi, M. Gehrke, D. L. McGuinness, and P. F. Patel-Schneider (eds.), Collected Papers from the International Description Logics Workshop (DL'96), 1996, pp. 107–110.

  11. Franco, J. and Paull, M.: Probabilistic analysis of the Davis—Putnam procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983), 77–87.

    Google Scholar 

  12. Franconi, E., Giacomo, G. D., MacGregor, R. M., Nutt, W., Welty, C. A. and Sebastiani, F. (eds.), Collected Papers from the International Description Logics Workshop (DL'98), 1998.

  13. Freeman, J. W.: Improvements to propositional satisfiability search algorithms, Ph.D. Thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA.

  14. Freeman, J. W.: Hard random 3-SAT problems and the Davis—Putnam procedure, Artificial Intelligence 81 (1996), 183–198.

    Google Scholar 

  15. Gent, I. P. and Walsh, T.: Beyond NP: The QSAT phase transition, in Proceedings of AAAI'99, Orlando, Florida, 1999.

  16. Giacomo, G. D. and Massacci, F.: Tableaux and algorithms for propositional dynamic logic with converse, in [34], pp. 613–628.

  17. Ginsberg, M. L.: Dynamic backtracking, J. Artificial Intelligence Res. 1 (1993), 25–46.

    Google Scholar 

  18. Giunchiglia, E., Giunchiglia, F., Sebastiani, R. and Tacchella, A.: More evaluation of decision procedures for modal logics, in A. G. Cohn, L. Schubert, and S. C. Shapiro (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), 1998, pp. 626–635.

  19. Giunchiglia, F. and Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures — the case study of modal K, in [34], pp. 583–597.

  20. Giunchiglia, F. and Sebastiani, R.: A SAT-based decision procedure for ALC, in Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR'96), 1996, pp. 304–314.

  21. Haarslev, V., Möller, R. and Turhan, A.-Y.: Implementing an ALCRP(D) ABox Reasoner — Progress Report, in [12], pp. 82–86.

  22. Heuerding, A. and Schwendimann, S.: A benchmark method for the propositional modal logics K, KT, and S4, Technical Report IAM-96-015, University of Bern, Switzerland, 1996.

    Google Scholar 

  23. Hollunder, B. and Nutt, W.: Subsumption algorithms for concept languages, Research Report RR-90-04, Deutsches Forschungszentrum für Künstliche Intelligenz GmbH (DFKI), 1990.

  24. Horrocks, I.: Optimising tableaux decision procedures for description logics, Ph.D. Thesis, University of Manchester, 1997.

  25. Horrocks, I.: Using an expressive description logic: FaCT or fiction?, in A. G. Cohn, L. Schubert, and S. C. Shapiro (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), 1998, pp. 636–647.

  26. Horrocks, I. and Patel-Schneider, P. F.: Comparing subsumption optimizations, in [12], pp. 90–94.

  27. Horrocks, I. and Patel-Schneider, P. F.: FaCT and DLP, in H. de Swart (ed.), Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux'98, 1998, pp. 27–30.

  28. Horrocks, I. and Patel-Schneider, P. F.: Optimising propositional modal satisfiability for description logic subsumption, in International Conference AISC'98, 1998.

  29. Horrocks, I. and Patel-Schneider, P. F.: Optimizing description logic subsumption, J. Logic Comput. 9 (1999), 267–293.

    Google Scholar 

  30. Horrocks, I. and Sattler, U.: A description logic with transitive and inverse roles and role hierarchies, J. Logic Comput. 9 (1999), 385–410.

    Google Scholar 

  31. Hustadt, U. and Schmidt, R. A.: On evaluating decision procedures for modal logic, Technical Report MPI-I-97-2-003, Max-Planck-Institut für Informatik, Im Stadtwald, D 66123 Saarbrücken, Germany, 1997.

  32. Hustadt, U. and Schmidt, R. A.: On evaluating decision procedures for modal logic, in Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Vol. 1, 1997, pp. 202–207.

    Google Scholar 

  33. Jeroslow, R. and Wang, J.: Solving propositional satisfiability problems, Ann. Math. Artif. Intell. 1 (1990), 167–187.

    Google Scholar 

  34. McRobbie, M. and Slaney, J. (eds.): Proceedings of the Thirteenth International Conference on Automated Deduction (CADE-13), Lecture Notes in Artificial Intelligence 1104, Springer-Verlag, 1996.

  35. Oppacher, F. and Suen, E.: HARP: A tableau-based theorem prover, J. Automated Reasoning 4 (1988), 69–100.

    Google Scholar 

  36. Patel-Schneider, P. F.: DLP system description, in [12], pp. 87–89.

  37. Sattler, U.: A concept language extended with different kinds of transitive roles, in G. Görz and S. Hölldobler (eds.), 20. Deutsche Jahrestagung für Künstliche Intelligenz, 1996, pp. 333–345.

  38. Selman, B., Mitchell, D. G. and Levesque, H. J.: Generating hard satisfiability problems, Artificial Intelligence 81 (1996), 17–29.

    Google Scholar 

  39. Vellino, A.: The complexity of automated reasoning, Ph.D. Thesis, University of Toronto, 1989.

  40. Weidenbach, C., Gaede, B., and Rock, G.: SPASS & FLOTTER version 0.42, in [34], pp. 141–145.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manchester, UK. e-mail

    Ian Horrocks

  2. Bell Labs Research, Murray Hill, NJ, USA. e-mail

    Peter F. Patel-Schneider

Authors
  1. Ian Horrocks
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter F. Patel-Schneider
    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

Horrocks, I., Patel-Schneider, P.F. Evaluating Optimized Decision Procedures for Propositional Modal K (m) Satisfiability. Journal of Automated Reasoning 28, 173–204 (2002). https://doi.org/10.1023/A:1015063215934

Download citation

  • Issue Date:

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

Search

Navigation