Improved resolution-based method for satisfiability checking formulas of the language L

Authors:
Anatoly Chebotarev;Sergey Krivoi
Affiliations:
Glushkov Institute of Cybernetics Ukrainian Academy of Sciences, Kiev, Ukraine;Glushkov Institute of Cybernetics Ukrainian Academy of Sciences, Kiev, Ukraine
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 3
Cited 0

Resolution-based approach to compatibility analysis of interacting automata

Theoretical Computer Science
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Consistency Checking of Automata Functional Specifications

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.