Sciweavers

140 search results - page 17 / 28
» Rewriting Numeric Constraint Satisfaction Problems for Consi...
Sort
View
COMPULOG
1999
Springer
13 years 12 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
ICDT
2009
ACM
198views Database» more  ICDT 2009»
14 years 8 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
JAIR
2011
124views more  JAIR 2011»
13 years 2 months ago
Second-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
Christophe Lecoutre, Stéphane Cardon, Julie...
ECAI
2008
Springer
13 years 9 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang