86 search results - page 9 / 18 » Entailment of Finite Domain Constraints |
AI
2006
Springer
13 years 8 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
IPSN
2003
Springer
14 years 1 months ago
2003
Springer
This paper is concerned with coordinated delivery of messages in sensor networks. The notion of multicast is re-examined in light of a new set of requirements that are specific t...
AGP
1999
IEEE
14 years 4 days ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
AMAI
2002
Springer
13 years 7 months ago
2002
Springer
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving jus...
AICOM
2004
13 years 7 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...