Equivalence Models for Quantified Boolean Formulas | Zendy

Hans Kleine Büning | Zendy; Xishun Zhao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Equivalence Models for Quantified Boolean Formulas

Author(s) -

Hans Kleine Büning,

Xishun Zhao

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/11527695_18

Subject(s) - equivalence (formal languages) , computer science , formal equivalence checking , boolean data type , theoretical computer science , boolean function , boolean expression , discrete mathematics , algorithm , algebra over a field , model checking , mathematics , pure mathematics

In this paper, the notion of equivalence models for quantified Boolean formulas with free variables is introduced. The computational complexity of the equivalence model checking problem is investigated in the general case and in some restricted cases. We also establish a connection between the structure of some quantified Boolean formulas and the structure of models.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research