Temporal Reasoning in Nested Temporal Networks with Alternatives
暂无分享,去创建一个
[1] Mark Abramson,et al. Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.
[2] Jim Blythe,et al. An Overview of Planning Under Certainty , 1999, Artificial Intelligence Today.
[3] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[4] Manolis Koubarakis,et al. Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..
[5] Jim Blythe,et al. Decision-Theoretic Planning , 1999, AI Mag..
[6] Gerhard Friedrich,et al. Handling Alternative Activities in Resource-Constrained Project Scheduling Problems , 2007, IJCAI.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[9] Martha E. Pollack,et al. Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints , 2005, AAAI.
[10] R. Barták. Nested Temporal Networks with Alternatives , 2007 .
[11] Thierry Vidal,et al. CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning , 2003, Constraints.
[12] Roman Barták,et al. Temporal Networks with Alternatives: Complexity and Model , 2007, FLAIRS.
[13] J. Christopher Beck,et al. Scheduling Alternative Activities , 1999, AAAI/IAAI.
[14] Youssef Hamadi. Cycle-cut decomposition and Log-based reconciliation , 2004 .