Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. JSAT, 1(1):61-88, 2006. [doi]
@article{Coste-MarquisBLM06,
title = {Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages},
author = {Sylvie Coste-Marquis and Daniel Le Berre and Florian Letombe and Pierre Marquis},
year = {2006},
url = {http://jsat.ewi.tudelft.nl/content/volume1/JSAT1_3_Coste.pdf},
tags = {rule-based, completeness},
researchr = {https://researchr.org/publication/Coste-MarquisBLM06},
cites = {0},
citedby = {0},
journal = {JSAT},
volume = {1},
number = {1},
pages = {61-88},
}