4117 search results - page 49 / 824 » On the Satisfiability of Complex Constraints |
128
click to vote
LCC
1994
15 years 3 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
120
click to vote
FOCS
2008
IEEE
15 years 28 days ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
107
click to vote
JACM
2010
14 years 10 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
SIAMCOMP
2008
14 years 11 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...