Proof Complexity of Resolution-based QBF Calculi.

Olaf Beyersdorff Leroy Chew Mikolás Janota

Published in: STACS (2015)

Keyphrases

automatic theorem proving
high resolution
worst case
low resolution
theorem prover
sequent calculi
conjunctive query containment
computational cost