1453 search results - page 156 / 291 » Partial Constraint Satisfaction |
155
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
126
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
136
click to vote
HM
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
132
click to vote
CSLP
2004
Springer
15 years 8 months ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
146
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...