711 search results - page 54 / 143 » Amalgams of Constraint Satisfaction Problems |
161
click to vote
PRICAI
1998
Springer
15 years 8 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
128
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
128
click to vote
KCAP
2005
ACM
15 years 10 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
133
click to vote
ACL
1990
15 years 5 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...