Looking Algebraically at Tractable Quantified Boolean Formulas | Zendy

Hubie Chen | Zendy; Víctor Dalmau | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Looking Algebraically at Tractable Quantified Boolean Formulas

Author(s) -

Hubie Chen,

Víctor Dalmau

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

ISBN - 3-540-27829-X

DOI - 10.1007/11527695_6

Subject(s) - constraint satisfaction problem , algebraic number , simple (philosophy) , computer science , boolean satisfiability problem , satisfiability , algebra over a field , constraint (computer aided design) , characterization (materials science) , discrete mathematics , mathematics , theoretical computer science , pure mathematics , artificial intelligence , mathematical analysis , philosophy , materials science , geometry , epistemology , probabilistic logic , nanotechnology

We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were given by Buning, Subramani, and Zhao, and described proof-theoretically.

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