Skip to main content
SpringerLink
Log in

Constraint Programming for Modelling and Solving Modal Satisfiability

  • Conference paper
Principles and Practice of Constraint Programming – CP 2003 (CP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2833))

Abstract

We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-based Heuristics in Modal Theorem Proving. In: Proc. ECAI 2000, pp. 199–203. IOS Press, Amsterdam (2000)

    Google Scholar 

  2. Blackburn, P., De Rijke, M.: Zooming in, zooming out. Journal of Logic, Language and Information 6, 5–31 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  4. Giunchiglia, F., Sebastiani, R.: Building Decision Procedures for Modal Logics from Propositional Decision Procedures. The Case Study of Modal K(m). Information and Computation 162(1–2), 158–178 (2000)

    MATH  MathSciNet  Google Scholar 

  5. Haarslev, V., Möller, R.: RACER (September 2002), http://kogs-www.informatik.uni-hamburg.de/~race/

  6. Heuerding, A., Schwendimann, S.: A Benchmark Method for the Propositional Modal Logics K, KT, S4. Technical Report IAM-96-015, University of Bern (1996)

    Google Scholar 

  7. Horrocks, I.: FaCT (September 2002), http://www.cs.man.ac.uk/~horrocks/FaCT/

  8. Horrocks, I., Patel-Schneider, P.F., Sebastiani, R.: An Analysis of Empirical Testing for Modal Decision Procedures. Logic J. of the IGPL 8(3), 293–323 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. MSPASS V 1.0.0t.1.2.a. February 23 (2001), URL: http://www.cs.man.ac.uk/~schmidt/mspass

  10. Pan, G., Sattler, U., Vardi, M.Y.: BDD-Based Decision Procedures for K. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 16–30. Springer, Heidelberg (2002)

    Google Scholar 

  11. Patel-Schneider, P.F.: DLP (September 2002), URL: http://www.bell-labs.com.user/pfps/dlp/

  12. Tacchella, A.:  ∗ SAT System Description. In: Collected Papers from the International Description Logics Workshop 1999, CEUR (1999)

    Google Scholar 

  13. TANCS: Tableaux Non-Classical Systems Comparison, January 17 (2000), URL: http://www.dis.uniroma1.it/~tancs

Download references

Author information

Authors and Affiliations

  1. CWI, Amsterdam, The Netherlands

    Sebastian Brand

  2. ITC-irst, Trento, Italy

    Rosella Gennari

  3. Language and Inference Technology Group, ILLC, University of Amsterdam, The Netherlands

    Maarten de Rijke

Authors
  1. Sebastian Brand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rosella Gennari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maarten de Rijke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brand, S., Gennari, R., de Rijke, M. (2003). Constraint Programming for Modelling and Solving Modal Satisfiability. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20202-8

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation