46 search results - page 5 / 10 » Combinatorial Problems for Horn Clauses |
CP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
IGPL
2006
13 years 9 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
ICTAI
2008
IEEE
14 years 4 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
TABLEAUX
1995
Springer
14 years 1 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...