CADE 2000: Automated Deduction - CADE-17 pp 291-296 | Cite as

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

  • Enrico Giunchiglia
  • Armando Tacchella
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1831)

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.

Keywords

Modal Logic Decision Procedure Automate Deduction Normal Modal Logic Propositional Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT-Based Decision Procedures for Classical Modal Logics. Journal of Automated Reasoning (to appear)Google Scholar
  3. 3.
    Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS(LNAI), vol. 1249. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Giunchiglia, E., Tacchella, A.: Subset-matching Size-bounded Caching for Satisfiability in Modal Logics, (2000)Google Scholar
  5. 5.
    A system for verification and synthesis. In: Proc. CAV-96, LNAI (1996)Google Scholar
  6. 6.
    Davis, M., Longemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5(7) (1962)Google Scholar
  7. 7.
    Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation 2, 293–304 (1986)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Horrocks,I.: Optimizing Tableaux Decision Procedures for Description Logics. PhD thesis. University of Manchester (1997) Google Scholar
  9. 9.
    Chellas, B.F.: Modal Logic - an Introduction. Cambridge University Press, Cambridge (1980)MATHGoogle Scholar
  10. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Enrico Giunchiglia
    • 1
  • Armando Tacchella
    • 1
  1. 1.DISTUniversità di GenovaGenovaItaly

Personalised recommendations