: Compiling problem specifications into SAT.
Marco CadoliAndrea SchaerfPublished in: Artif. Intell. (2005)
Keyphrases
- sat solvers
- satisfiability problem
- formal specification
- search algorithm
- sat problem
- sat solving
- delay insensitive
- boolean satisfiability
- propositional satisfiability
- high level
- phase transition
- np complete
- functional requirements
- specification language
- control flow
- stochastic local search
- search strategies
- search space
- operational semantics
- computational complexity
- sat encodings
- neural network
- data sets