Efficient solution techniques for disjunctive temporal reasoning problems

DOI10.1016/S0004-3702(03)00113-9zbMath1082.68825MaRDI QIDQ814524

Martha E. Pollack, Ioannis Tsamardinos

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

SchedulingPlanningConstraint satisfactionConstraint-based temporal reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Temporal logic (03B44)

Related Items

Dynamic controllability via timed game automata ⋮ Temporal reasoning about fuzzy intervals ⋮ Modelling and solving temporal reasoning as propositional satisfiability ⋮ The SAT-based approach to separation logic ⋮ Optimal rectangle packing ⋮ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Reducing the number of disjuncts in DTPs ⋮ Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm ⋮ On the modelling and optimization of preferences in constraint-based temporal reasoning ⋮ Strong temporal planning with uncontrollable durations ⋮ Translation-based approaches for solving disjunctive temporal problems with preferences ⋮ Solving strong controllability of temporal problems with uncertainty using SMT

Cites Work

• Temporal constraint networks
• Applying constraint satisfaction techniques to job shop scheduling
• Backtracking algorithms for disjunctions of temporal constraints
• Backjump-based backtracking for constraint satisfaction problems
• CTP: A new constraint-based formalism for conditional, temporal planning
• From binary temporal relations to non-binary ones and back
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item