4451 search results - page 15 / 891 » On Random Ordering Constraints |
APAL
2008
14 years 12 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
107
click to vote
CSCLP
2005
Springer
15 years 5 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
CP
2003
Springer
15 years 5 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
117
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
FUIN
2002
14 years 11 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability