Skip to main content

Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4378)

Abstract

The language L is used for specifying finite automata, and is a fragment of a first order language with monadic predicates. Checking specification for satisfiability plays an important role in the development of reactive algorithms. Restricted syntax of this language and interpreting it over the integers make it possible to substantially improve resolution-based methods for satisfiability checking. This has been done in previous papers devoted to R- and S-resolution. In this paper, we present yet another improvement based on the restriction of the type of atoms upon which the resolution is allowed.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-70881-0_38
  • Chapter length: 5 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-70881-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chebotarev, A.: Provably-correct development of reactive algorithms. In: Proc. Int. Workshop ”Rewriting Techniques and Efficient Theorem Proving” (RTETP-2000), pp. 117–133 (2000)

    Google Scholar 

  2. Chebotarev, A.: Determinisations of logical specifications of automata (translated from Russian). Cybernetics and Systems Analysis 31(1), 1–7 (1995)

    MATH  CrossRef  MathSciNet  Google Scholar 

  3. Chebotarev, A.N., Morokhovets, M.K.: Resolution-based approach to compatibility analysis of interacting automata. Theoretical Computer Science 194, 183–205 (1998)

    MATH  CrossRef  MathSciNet  Google Scholar 

  4. Chebotarev, A.N., Morokhovets, M.K.: Consistency checking of automata functional specifications. In: Voronkov, A. (ed.) LPAR 1993. LNCS, vol. 698, pp. 76–85. Springer, Heidelberg (1993)

    Google Scholar 

  5. Chebotarev, A.: Separate Resolution Method for Checking the Satisfiability of Formulas in the Language L (translated from Russian). Cybernet. Systems Analysis 34(6), 794–799 (1998)

    MATH  CrossRef  MathSciNet  Google Scholar 

  6. Chang, C.L., Lee, R.C.T.: Symbolic Logic and mechanical theorem proving. Academic Press, London (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chebotarev, A., Krivoi, S. (2007). Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_38

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)