C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Equivalence checking of partial designs using dependency quantified Boolean formulae.
Karina Gitina
Sven Reimer
Matthias Sauer
Ralf Wimmer
Christoph Scholl
Bernd Becker
Published in:
ICCD (2013)
Keyphrases
</>
quantified boolean formulae
propositional logic
symmetry breaking
knowledge compilation
quantified boolean formulas
prime implicates
first order logic
np complete
database design
constraint programming
temporal logic
combinatorial problems