Efficient solution techniques for disjunctive temporal reasoning problems

DOI10.1016/S0004-3702(03)00113-9MaRDI QIDQ814524zbMATH OpenFDO

Authors Ioannis Tsamardinos, M. E. Pollack

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(03)00113-9

zbMATH Keywords

Constraint satisfactionConstraint-based temporal reasoningPlanningScheduling

Mathematics Subject Classification ID

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

Recommendations

• On Solving Soft Temporal Constraints Using SAT Techniques
• Processing disjunctions in temporal constraint networks
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Solving disjunctive temporal problems with preferences using maximum satisfiability
• Backtracking algorithms for disjunctions of temporal constraints

Cites work

• Applying constraint satisfaction techniques to job shop scheduling
• Backjump-based backtracking for constraint satisfaction problems
• Backtracking algorithms for disjunctions of temporal constraints
• Conflict-directed backjumping revisited
• CTP: A new constraint-based formalism for conditional, temporal planning
• From binary temporal relations to non-binary ones and back
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• scientific article; zbMATH DE number 1487978 (Why is no real title available?)
• scientific article; zbMATH DE number 1448980 (Why is no real title available?)
• Non-systematic search and no-good learning
• Temporal constraint networks

Cited in

(19)

• Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
• 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
• Temporal reasoning about fuzzy intervals
• Modelling and solving temporal reasoning as propositional satisfiability
• Solving disjunctive temporal problems with preferences using maximum satisfiability
• Dynamic controllability via timed game automata
• On Solving Soft Temporal Constraints Using SAT Techniques
• Efficient Temporal Satisfiability
• On restricted disjunctive temporal problems: faster algorithms and tractability frontier
• An interdisciplinary experimental evaluation on the disjunctive temporal problem
• Optimal rectangle packing
• Reducing the number of disjuncts in DTPs
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Algorithms and complexity of difference logic
• Multiple interdependent simple temporal networks with uncertainty: a semi-decentralized multi-agent model with shared control of activity durations
• The SAT-based approach to separation logic
• An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty

This page was built for publication: Efficient solution techniques for disjunctive temporal reasoning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814524)