New Directions in AI Planning, IOS Press, Amsterdam (1996), pp. 217-232 Google Scholar [19] ILOG, ILOG Scheduler 5.2 Reference Manual, 2001, http://www.ilog.com/ Google Scholar [20] S. Kambhampati, X. Yang On the role of disjunctive representations and constraint propagation in refineme...
Propagation of Constraints Applied to Circuit Synthesis. AI Memo 485, MIT Arti cial Intelligence Laboratory, Cambridge, Massachusetts, September 1978. Also in Circuit Theory and Applications, 8, pp. 127{144, 1980.de Kleer, 1978b de Kleer, Johan, and Gerald Jay Sussman. Propagation of ...
Explaining the outcome of programs has become one of the main concerns in AI research. In constraint programming, a user may want the system to explain why a given variable assignment is not feasible or how it came to the conclusion that the problem does not have any solution. One solution ...
For smaller applications, it is not necessary to implement a system that supports full structural satisfaction, and — as described in Chap. 5 — this has not been implemented for the test runs described in this book. However, in such cases, it must be..
In order to derive tranArc from the flat-CSN graph, we use the propagation information which is represented by the 3-tuple TPi=<Ni, VSpi, ETi>. In this notation, Ni are the nodes on the flat-CSN graph; VSpi are a set of hierarchy tree nodes {Vpj} in Path(root, IP(Ni)) in ...
Specifically,we propose i)a formal representation of probabilistic quantitative constraints,ii)an algorithm,based on the operations of intersection and composition,for the propagation of such temporal constraints,and iii)facilities to support query answering on a set of such constraints.As a result,we ...
However, a difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. In previous work, different methods for automatic generation of rule-based solvers for constraints defined over finite domains have been proposed1,2,3,4. In this paper,...
However, a difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. In previous work, different methods for automatic generation of rule-based solvers for constraints defined over finite domains have been proposed. In this paper, we ...
address problems of scientific and soci- etal relevance1: examples of processes that are affected by the structural details of the underlying network are provided by the spreading of infectious d iseases2–4, opinion dynamics5, the propagation of losses during financial crises6, ...
It is also likely that methods of constraint propagation =-=[31, 36]-=- can be used to help write the matrix representation automatically. This is possible only in problems that are completely described by equations, however. In principle, equation problems can be resequ......