Efficiency and stability of hypergraph SAT algorithms

Chapter
Publication Date:
1996
Short description:
Efficiency and stability of hypergraph SAT algorithms / Pretolani, D. - In: Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge / Michael A. Trick, David S. Johnson. - STAMPA. - Ann Arbor (MI) : American Mathematical Society, 1996. - ISBN 9780821866092. - pp. 479-498
abstract:
We discuss some topics related to the practical efficiency of exact methods for satisfiability. We use directed hypergraphs as an algorithmic and modeling tool; in particular, we propose a new relaxation technique, based on a hypergraph depth first search procedure. We discuss our computational experience, comparing the suitability of different approaches for various classes of instances.
Iris type:
Capitolo/Saggio
Keywords:
Satisfiability; directed hypergraphs; enumeration algorithms; relaxation; depth first search
List of contributors:
Authors of the University:
Handle:
https://iris.unimore.it/handle/11380/746223
Full Text:
Book title:
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge