loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)
Incremental Filtering Algorithms for Precedence and Dependency Constraints
Arlington, Virginia
November 13-November 15
ISBN: 0-7695-2728-0
Roman Bartak, Charles University in Prague, Czech Republic
Ondrej Cepek, Charles University in Prague, Czech Republic
Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities -- for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In the paper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on the logbased reconciliation problems and min-cutset problems.
Citation:
Roman Bartak, Ondrej Cepek, "Incremental Filtering Algorithms for Precedence and Dependency Constraints," ictai, pp.416-426, 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.