Uma heurística de decisão baseada na subtração de cubos para solucionadores DPLL do problema de satisfabilidade
=== This work proposes a new decision heuristic for Davis Putnam, Loveland and Logemann algorithm (DPLL)-based satisfiability (SAT) solvers based on cube subtraction. Each negated clause is viewed as a cube in the n-dimensional Boolean search space denoting a subspace where no satisfying assignment...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | Portuguese |
| Published: |
Universidade Federal de Minas Gerais
2007
|
| Online Access: | http://hdl.handle.net/1843/RVMR-79SPCP |