CTP: A new constraint-based formalism for conditional, temporal planning
From MaRDI portal
Publication:1768744
DOI10.1023/A:1025894003623zbMath1074.68616OpenAlexW1596577245MaRDI QIDQ1768744
Thierry Vidal, Ioannis Tsamardinos, Martha E. Pollack
Publication date: 15 March 2005
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025894003623
Related Items
Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way, A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, Temporal Reasoning in Nested Temporal Networks with Alternatives, Dynamic controllability via timed game automata, Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks, Discovering implied constraints in precedence graphs with alternatives, Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU), Dynamic controllability of temporal networks with instantaneous reaction, Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm, Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games, Scheduling Conditional Task Graphs, A new method for constructing a minimal PERT network, Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models, Mining Significant Temporal Networks Is Polynomial, Allocation and scheduling of conditional task graphs, A theoretic and practical framework for scheduling in a stochastic environment, Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking, Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty., Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty., Mining CSTNUDs significant for a set of traces is polynomial, SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT, Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty, Conditional simple temporal networks with uncertainty and decisions, Efficient solution techniques for disjunctive temporal reasoning problems, Efficient execution of dynamically controllable simple temporal networks with uncertainty