Advertisement
Published in:
2007 | OriginalPaper | Chapter
Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L
Authors : Anatoly Chebotarev, Sergey Krivoi
Published in: Perspectives of Systems Informatics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.