Skip to main content

A new method for testing decision procedures in modal logics

  • Conference paper
  • First Online:
  • 234 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1249))

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader, E. Franconi, B. Hollonder, 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.

    Google Scholar 

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

    Google Scholar 

  3. L. Catach. TABLEAUX: a general theorem prover for modal logics. Journal of Automated Reasoning, 7, 1991.

    Google Scholar 

  4. S. Demri. Uniform and Nonuniform strategies for tableaux calculi for modal logics. Journal of Applied Nonclassical Logics, 5(1):77–98, 1995.

    Article  MathSciNet  Google Scholar 

  5. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from prepositional decision procedures — the case study of modal K. In Proc. of the 13th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, New Brunswick, NJ, USA, August 1996. Springer Verlag. Also DIST-Technical Report 96-0037 and IRST-Technical Report 9601-02.

    Google Scholar 

  6. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures — the case study of modal K(m). Technical Report 9611-06, IRST, Trento, Italy, 1996. A shorter version is submitted to “Information and Computation”.

    Google Scholar 

  7. J. Y. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(3):361–372, 1995.

    Article  MathSciNet  Google Scholar 

  8. J.Y. Halpern and Y. Moses. A guide to the completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319–379, 1992.

    Article  MathSciNet  Google Scholar 

  9. S. Kirkpatrick and B. Selman. Critical behaviour in the satisfiability of random boolean expressions. Science, 264:1297–1301, 1994.

    Article  MathSciNet  Google Scholar 

  10. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proc. of the 10th National Conference on Artificial Intelligence, pages 459–465, 1992.

    Google Scholar 

  11. C. P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73–117, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William McCune

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giunchiglia, F., Roveri, M., Sebastiani, R. (1997). A new method for testing decision procedures in modal logics. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-63104-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63104-0

  • Online ISBN: 978-3-540-69140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics