Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers.
Toru OgawaYangyang LiuRyuzo HasegawaMiyuki KoshimuraHiroshi FujitaPublished in: ICTAI (2013)
Keyphrases
- sat solvers
- cardinality constraints
- sat encodings
- pseudo boolean
- propositional satisfiability
- sat solving
- sat instances
- orders of magnitude
- clause learning
- sat problem
- boolean satisfiability
- search space
- boolean algebra
- functional dependencies
- constraint satisfaction
- constraint query languages
- entity relationship
- search strategies
- max sat
- symmetry breaking
- database schema
- deductive databases
- constraint programming
- maximum satisfiability
- boolean formula
- database
- feasible solution
- integrity constraints
- upper bound
- relational databases
- search algorithm