Arc and path consistence revisited
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Introduction to algorithms
Artificial Intelligence - Special issue on knowledge representation
Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Backtracking algorithms for disjunctions of temporal constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
SAT-Based Procedures for Temporal Reasoning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Constraint-based temporal reasoning algorithms with applications to planning
Constraint-based temporal reasoning algorithms with applications to planning
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
Conflict-directed backjumping revisited
Journal of Artificial Intelligence Research
Execution-Time Plan Management for a Cognitive Orthotic System
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
ICML '04 Proceedings of the twenty-first international conference on Machine learning
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Temporal reasoning about fuzzy intervals
Artificial Intelligence
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence
Commitment-based service coordination
International Journal of Agent-Oriented Software Engineering
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Low-cost addition of preferences to DTPs and TCSPs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Temporal preference optimization as weighted constraint satisfaction
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Exploration of the robustness of plans
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Tractable classes of metric temporal problems with domain rules
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Augmenting disjunctive temporal problems with finite-domain constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
An approach to temporal planning and scheduling in domains with predictable exogenous events
Journal of Artificial Intelligence Research
Qualitative temporal reasoning about vague events
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Identifying conflicts in overconstrained temporal problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Applying local search to disjunctive temporal problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Integrating planning and temporal reasoning for domains with durations and time windows
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Disjunctive temporal planning with uncertainty
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Efficient algorithms for fuzzy qualitative temporal reasoning
IEEE Transactions on Fuzzy Systems
TSAT++: an Open Platform for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Strong controllability of disjunctive temporal problems with uncertainty
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Project Scheduling as a Disjunctive Temporal Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Improved human-robot team performance using chaski, a human-inspired plan execution system
Proceedings of the 6th international conference on Human-robot interaction
On the modelling and optimization of preferences in constraint-based temporal reasoning
Artificial Intelligence
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Solving temporal problems using SMT: strong controllability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
Over the past few years, a new constraint-based formalism for temporal reasoning has been developed to represent and reason about Disjunctive Temporal Problems (DTPs). The class of DTPs is significantly more expressive than other problems previously studied in constraint-based temporal reasoning. In this paper we present a new algorithm for DTP solving, called Epilitis, which integrates strategies for efficient DTP solving from the previous literature, including conflictdirected backjumping, removal of subsumed variables, and semantic branching, and further adds no-good recording as a central technique. We discuss the theoretical and technical issues that arise in successfully integrating this range of strategies with one another and with no-good recording in the context of DTP solving. Using an implementation of Epilitis, we explore the effectiveness of various combinations of strategies for solving DTPs, and based on this analysis we demonstrate that Epilitis can achieve a nearly two order-of-magnitude speed-up over the previously published algorithms on benchmark problems in the DTP literature.