Incrementally Solving STNs by Enforcing Partial Path Consistency
暂无分享,去创建一个
[1] Leo Joskowicz,et al. Solving Systems of Difference Constraints Incrementally , 1999, Algorithmica.
[2] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[3] Manolis Koubarakis,et al. Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..
[4] Pinar Heggernes,et al. A vertex incremental approach for maintaining chordality , 2006, Discret. Math..
[5] C. Tinelli,et al. The SMT-LIB Format: An Initial Proposal , 2003 .
[6] H. Bui,et al. Efficient Message Passing and Propagation of Simple Temporal Constraints , 2007 .
[7] Mikkel Thorup,et al. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , 2004, SWAT.
[8] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[9] Ari K. Jónsson,et al. Activity Planning for the Mars Exploration Rovers , 2005, ICAPS.
[10] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[11] Louis Ibarra,et al. Fully dynamic algorithms for chordal graphs and split graphs , 2008, TALG.
[12] Giuseppe F. Italiano,et al. Incremental algorithms for minimal length paths , 1991, SODA '90.
[13] Amedeo Cesta,et al. Gaining efficiency and flexibility in the simple temporal problem , 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).
[14] Giuseppe F. Italiano,et al. Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths , 2002, ICALP.
[15] Dana S. Nau,et al. Semantics for hierarchical task-network planning , 1994 .
[16] D. West. Introduction to Graph Theory , 1995 .
[17] Djamila Sam-Haroud,et al. Path Consistency on Triangulated Constraint Graphs , 1999, IJCAI.
[18] Luke Hunsberger,et al. A Practical Temporal Constraint Management System for Real-Time Applications , 2008, ECAI.
[19] Paul Robertson,et al. A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans , 2007, ICAPS.
[20] Shimon Even,et al. Updating distances in dynamic graphs , 1985 .
[21] Giuseppe F. Italiano,et al. Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.
[22] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[23] Martha E. Pollack,et al. Efficient solution techniques for disjunctive temporal reasoning problems , 2003, Artif. Intell..
[24] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[25] Léon Planken,et al. Incrementally Solving the STP by Enforcing Partial Path Consistency , 2008 .
[26] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[27] Berthe Y. Choueiry,et al. A new effcient algorithm for solving the simple temporal problem , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..
[28] Mathijs de Weerdt,et al. P3C: A New Algorithm for the Simple Temporal Problem , 2008, ICAPS.
[29] Juan Fernández-Olivares,et al. Efficiently Handling Temporal Knowledge in an HTN Planner , 2006, ICAPS.
[30] Malik Ghallab,et al. Planning with Sharable Resource Constraints , 1995, IJCAI.
[31] Giuseppe F. Italiano,et al. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures , 2006, J. Discrete Algorithms.