Improving Backtrack Search for SAT by Means of Redundancy.
Laure BrisouxÉric GrégoireLakhdar SaisPublished in: ISMIS (1999)
Keyphrases
- backtrack search
- propositional satisfiability
- sat solvers
- constraint programming
- constraint satisfaction problems
- constraint satisfaction
- highly efficient
- search algorithm
- search strategies
- branch and bound algorithm
- satisfiability problem
- solving hard
- propositional logic
- sat problem
- information retrieval
- industrial applications
- sat instances
- orders of magnitude
- linear programming
- data structure