z-logo
open-access-imgOpen Access
A satisfiability procedure for quantified Boolean formulae
Author(s) -
David A. Plaisted,
Armin Biere,
Yunshan Zhu
Publication year - 2003
Publication title -
carolina digital repository (university of north carolina at chapel hill)
Language(s) - English
DOI - 10.17615/5psg-8a20
Subject(s) - satisfiability , boolean satisfiability problem , mathematics , maximum satisfiability problem , boolean expression , computer science , boolean function , discrete mathematics

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom