Boolean Satisfiability: From Theoretical Hardness to Practical Success.
The article presents a discussion of topics in computer science related to Boolean satisfiability. It focuses on solutions which can be readily used in applications software, and their effectiveness for solving certain types of problems. Topics addressed include the interaction between necessary val...
| Publicado en: | Communications of the ACM Vol. 52; no. 8; pp. 76 - 83 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Aug2009
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | The article presents a discussion of topics in computer science related to Boolean satisfiability. It focuses on solutions which can be readily used in applications software, and their effectiveness for solving certain types of problems. Topics addressed include the interaction between necessary values and constraints in generating computational complexity. Examples are provided using decision trees solved using various computer algorithms. The increasing commercial use of such programs in fields such as computer hardware and software testing and development is noted. |
|---|