1142 search results - page 1 / 229 » Approximability of Clausal Constraints |
MST
2010
13 years 3 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
MST
2008
13 years 4 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
SBIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
AAAI
1997
13 years 6 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
JSAT
2006
13 years 4 months ago
2006
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...