Efficient solution techniques for disjunctive temporal reasoning problems
From MaRDI portal
Publication:814524
DOI10.1016/S0004-3702(03)00113-9zbMATH Open1082.68825MaRDI QIDQ814524FDOQ814524
Authors: Ioannis Tsamardinos, M. E. Pollack 
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Applying constraint satisfaction techniques to job shop scheduling
- Title not available (Why is that?)
- Backjump-based backtracking for constraint satisfaction problems
- Backtracking algorithms for disjunctions of temporal constraints
- Conflict-directed backjumping revisited
- Non-systematic search and no-good learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- From binary temporal relations to non-binary ones and back
Cited In (17)
- Solving disjunctive temporal problems with preferences using maximum satisfiability
- Dynamic controllability via timed game automata
- Translation-based approaches for solving disjunctive temporal problems with preferences
- Modelling and solving temporal reasoning as propositional satisfiability
- Temporal reasoning about fuzzy intervals
- On Solving Soft Temporal Constraints Using SAT Techniques
- Strong temporal planning with uncontrollable durations
- Efficient Temporal Satisfiability
- The SAT-based approach to separation logic
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
- On restricted disjunctive temporal problems: faster algorithms and tractability frontier
- Optimal rectangle packing
- On the modelling and optimization of preferences in constraint-based temporal reasoning
- An interdisciplinary experimental evaluation on the disjunctive temporal problem
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
- Reducing the number of disjuncts in DTPs
- Solving strong controllability of temporal problems with uncertainty using SMT
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)
