Login / Signup
Arithmetic Reasoning in DPLL-Based SAT Solving.
Markus Wedler
Dominik Stoffel
Wolfgang Kunz
Published in:
DATE (2004)
Keyphrases
</>
sat solving
sat solvers
boolean satisfiability
sat problem
clause learning
knowledge representation
propositional satisfiability
knowledge base
max sat
symmetry breaking
sat encodings
orders of magnitude
automated reasoning
genetic algorithm
lower bound
satisfiability problem
probabilistic reasoning
sat instances