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.
Efficiency and stability of hypergraph SAT algorithms / Pretolani, Daniele. - STAMPA. - 26:(1996), pp. 479-498.
Efficiency and stability of hypergraph SAT algorithms
PRETOLANI, Daniele
1996
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
DIMACS93.pdf
Open access
Tipologia:
Versione originale dell'autore proposta per la pubblicazione
Dimensione
7.02 MB
Formato
Adobe PDF
|
7.02 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
