Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths.

Olaf Beyersdorff Joshua Blinkhorn Tomás Peitl

Published in: SAT (2020)

Keyphrases

high resolution
quantified boolean formulas
consequence finding
data sets
shortest path
propositional logic
database
real time
high level
knowledge representation
low resolution
path length
sampling rate
quantified boolean formulae