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

  • Anatoly Chebotarev
  • Sergey Krivoi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Chebotarev, A.: Determinisations of logical specifications of automata (translated from Russian). Cybernetics and Systems Analysis 31(1), 1–7 (1995)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chebotarev, A.N., Morokhovets, M.K.: Resolution-based approach to compatibility analysis of interacting automata. Theoretical Computer Science 194, 183–205 (1998)MATHCrossRefMathSciNetGoogle Scholar
  4. 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. 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)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chang, C.L., Lee, R.C.T.: Symbolic Logic and mechanical theorem proving. Academic Press, London (1973)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Anatoly Chebotarev
    • 1
  • Sergey Krivoi
    • 1
  1. 1.Glushkov Institute of Cybernetics Ukrainian Academy of Sciences, Glushkov’s pr., 40, Kiev, 03187Ukraine

Personalised recommendations