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
AbstractA new enumeration algorithm is proposed for the propositional satisfiability problem. Such a...
Fra tional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its al...
We consider the problem of finding deterministically a large independent set of guaranteed size in a...
We discuss some topics related to the practical efficiency of exact methods for satisfiability. We u...
Although several tractable classes of SAT are known, none of these turns out to be easy for optimiza...
Abstract: This paper presents hypergraph parti-tioning based constraint decomposition procedures to ...
The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the ...
In this dissertation, we examine complete search algorithms for SAT, the satisfiability problem for ...
This report is intended to present the Fiduccia Mattheyses (FM) heuristic for hypergraph bipartition...
The satisfiability problem (SAT problem for short) is a computational problem, such as the traveling...
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem o...
A tree decomposition of a hypergraph is a construction that captures the graph's topological s...
A hypergraph is a generalization of a graph where each hyperedge can contain an arbitrary number of ...
We propose a series of randomized greedy construction schemes for the hypergraph partitioning proble...
A new enumeration algorithm is proposed for the propositional satisfiability problem. Such algorithm...
AbstractA new enumeration algorithm is proposed for the propositional satisfiability problem. Such a...
Fra tional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its al...
We consider the problem of finding deterministically a large independent set of guaranteed size in a...
We discuss some topics related to the practical efficiency of exact methods for satisfiability. We u...
Although several tractable classes of SAT are known, none of these turns out to be easy for optimiza...
Abstract: This paper presents hypergraph parti-tioning based constraint decomposition procedures to ...
The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the ...
In this dissertation, we examine complete search algorithms for SAT, the satisfiability problem for ...
This report is intended to present the Fiduccia Mattheyses (FM) heuristic for hypergraph bipartition...
The satisfiability problem (SAT problem for short) is a computational problem, such as the traveling...
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem o...
A tree decomposition of a hypergraph is a construction that captures the graph's topological s...
A hypergraph is a generalization of a graph where each hyperedge can contain an arbitrary number of ...
We propose a series of randomized greedy construction schemes for the hypergraph partitioning proble...
A new enumeration algorithm is proposed for the propositional satisfiability problem. Such algorithm...
AbstractA new enumeration algorithm is proposed for the propositional satisfiability problem. Such a...
Fra tional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its al...
We consider the problem of finding deterministically a large independent set of guaranteed size in a...
DOI
Add to ORKG