A New Exact Bit-Parallel Algorithm for SAT

This paper presents two new exact general purpose bit-parallel algorithms (BB-SAT and BBP-SAT) for the Boolean satisfiability problem (SAT). Based on the authors' recent successful bit-parallel algorithm for the maximum clique problem, the SAT formula is first reduced to a directed graph which...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2008 20th IEEE International Conference on Tools with Artificial Intelligence Jg. 2; S. 59 - 65
Hauptverfasser:	San Segundo, P., Tapia, C., Puente, J., Rodriguez-Losada, D.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.11.2008
Schlagworte:	Artificial intelligence bit vector bit-parallelism Boolean satisfiability Data mining Data structures directed graphs Encoding exact algorithms Input variables Intelligent control NP-complete problem Parallel processing Programming profession SAT
ISBN:	0769534406, 9780769534404
ISSN:	1082-3409
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!