Skip to main content

Evaluating *SAT on TANCS 2000 Benchmarks

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000)

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

Abstract

In this paper we evaluate *SAT performance on TANCS 2000 benchmarks for the modal logic K. After a brief overview of *SAT implementation, we detail which *SAT options are more relevant in the context of our analysis. Then we present the experimental results: collected data include the CPU time, the number of consistency checks, and the allocated memory, to give a complete picture of *SAT behaviour on the selected benchmarks.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. 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, vol. 1104. Springer, Heidelberg (1996)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. Tacchella, A.: *sat system description. In: Lambrix, P., Borgida, A., Lenzerini, M., Möller, R., Patel-Schneider, P. (eds.) Collected Papers from the International Description Logics Workshop (DL 1999). CEUR (July 1999)

    Google Scholar 

  6. Tacchella, A.: *sat User’s Manual (1999)

    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. Giunchiglia, E., Tacchella, A.: A Subset-matching Size-bounded Cache for Satisfiaability in Modal Logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847. Springer, Heidelberg (2000)

    Chapter  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

Tacchella, A. (2000). Evaluating *SAT on TANCS 2000 Benchmarks. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_9

Download citation

  • DOI: https://doi.org/10.1007/10722086_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

  • Online ISBN: 978-3-540-45008-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics