Efficiency and stability of hypergraph SAT algorithms

Capitolo di libro
Data di Pubblicazione:
1996
Citazione:
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.
Tipologia CRIS:
Capitolo/Saggio
Keywords:
Satisfiability; directed hypergraphs; enumeration algorithms; relaxation; depth first search
Elenco autori:
Autori di Ateneo:
Link alla scheda completa:
https://iris.unimore.it/handle/11380/746223
Link al Full Text:
Titolo del libro:
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge