Abstract
The method of testing satisfiability of a formula of the form∨tF(t) represented as a set of right-normalized disjuncts has been implemented by a resolution procedure in a system of verificational design of automata. The use of the set of integers as the interpretation domain for the specification language has enabled us to consider only resolving by atoms of rank 0, which substantially increases the efficiency of the procedure: contrary to the traditional version, there is no need for matching and the number of resolvents is reduced. The proposed procedure has been implemented using the level-saturation method and the erasure strategy [4].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
