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

@inproceedings{Chebotarev2006ImprovedRM,
  title={Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L},
  author={Anatoly Chebotarev and Sergey Krivoi},
  booktitle={Ershov Memorial Conference},
  year={2006}
}
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… CONTINUE READING
BETA

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Provably-correct development of reactive algorithms

A. Chebotarev
  • Proc. Int. Workshop ”Rewriting Techniques and Efficient Theorem Proving” (RTETP-2000), P
  • 2000
VIEW 1 EXCERPT

Provably-correct development of reactive algorithms

A. Chebotarev
  • Proc. Int. Workshop ”Rewriting Techniques and Efficient Theorem Proving” (RTETP-2000), P
  • 2000
VIEW 1 EXCERPT

Morokhovets. Resolution-based approach to compatibility analysis of interacting automata

M.K.A.N. Chebotarev
  • Theoretical Computer Science,
  • 1998
VIEW 1 EXCERPT

Similar Papers