Abstract
Many problems in artificial intelligence and in formal verification can be reduced to a validity test of a quantified boolean formula (QBF). To perform this test, existing QBF solvers need the formula to be in a restrictive prenex form, as conjunctive normal form or negation normal form. This prior prenexing process can lead to an exponential growth of the formula in presence of bi-implications and exclusive disjunctions. In this work, we describe a new method of prenexing with a particular pattern. Our experimental results show the interest of such a method with actual QBF solvers.
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
