[go: up one dir, main page]

Skip to main content

System Description: *sat: A Platform for the Development of Modal Decision Procedures

  • Conference paper
Automated Deduction - CADE-17 (CADE 2000)

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

Included in the following conference series:

Abstract

*sat is a platform for the development of modal decision procedures. Currently, *sat features decision procedures for the normal modal logic K(m) and for the classical modal logic E(m). *sat embodies a state of the art sat solver, and includes techniques for optimizing automated deduction in modal and temporal logics. Owing to its modular design and to the extensive reuse of software components, *sat provides an open, easy to maintain, yet efficient implementation framework.

We wish to thank Fausto Giunchiglia, Peter Patel-Schneider and Roberto Sebastiani for useful discussions related to *sat. This work is supported by MURST.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Giunchiglia, F., Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS(LNAI), vol. 1104. Springer, Heidelberg (1996)

    Google Scholar 

  2. Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT-Based Decision Procedures for Classical Modal Logics. Journal of Automated Reasoning (to appear)

    Google Scholar 

  3. Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS(LNAI), vol. 1249. Springer, Heidelberg (1997)

    Google Scholar 

  4. Giunchiglia, E., Tacchella, A.: Subset-matching Size-bounded Caching for Satisfiability in Modal Logics, (2000)

    Google Scholar 

  5. A system for verification and synthesis. In: Proc. CAV-96, LNAI (1996)

    Google Scholar 

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

    Google Scholar 

  7. Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation 2, 293–304 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  8. Horrocks,I.: Optimizing Tableaux Decision Procedures for Description Logics. PhD thesis. University of Manchester (1997)

    Google Scholar 

  9. Chellas, B.F.: Modal Logic - an Introduction. Cambridge University Press, Cambridge (1980)

    MATH  Google Scholar 

  10. Hustadt, U., Schmidt, R.A.: On evaluating decision procedures for modal logic. In: L. Ralescu, A. (ed.) IJCAI-WS 1997. LNCS, vol. 1566. Springer, Heidelberg (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giunchiglia, E., Tacchella, A. (2000). System Description: *sat: A Platform for the Development of Modal Decision Procedures. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_22

Download citation

  • DOI: https://doi.org/10.1007/10721959_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67664-5

  • Online ISBN: 978-3-540-45101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics