The Link between r-contiguous Detectors and k-CNF Satisfiability.
Thomas StiborJonathan TimmisClaudia EckertPublished in: IEEE Congress on Evolutionary Computation (2006)
Keyphrases
- cnf formula
- conjunctive normal form
- sat solving
- satisfiability problem
- boolean formula
- np complete
- sat problem
- stochastic local search
- sat solvers
- sat instances
- propositional satisfiability
- propositional logic
- object detection
- link structure
- boolean functions
- terminological reasoning
- computational complexity
- sat encodings
- negative selection algorithm
- decision procedures
- neural network
- symmetry breaking
- knowledge compilation
- max sat
- normal form
- database design
- relational databases