1378 search results - page 70 / 276 » The Tractability of Global Constraints |
273
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
168
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
139
click to vote
AAAI
2010
15 years 7 months ago
2010
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
142
click to vote
ACL
2006
15 years 7 months ago
2006
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
182
click to vote
IJCAI
2001
15 years 7 months ago
2001
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...