Proceedings of the first international conference on Principles of knowledge representation and reasoning
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Efficient algorithms for qualitative reasoning about time
Artificial Intelligence
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
Processing disjunctions in temporal constraint networks
Artificial Intelligence
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Execution-Time Plan Management for a Cognitive Orthotic System
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Entropy-Driven online active learning for interactive calendar management
Proceedings of the 12th international conference on Intelligent user interfaces
Temporal Reasoning in Nested Temporal Networks with Alternatives
Recent Advances in Constraints
Evaluating hybrid constraint tightening for scheduling agents
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
Augmenting disjunctive temporal problems with finite-domain constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Fast (incremental) algorithms for useful classes of simple temporal problems with preferences
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Generalizing temporal controllability
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
A constraint model for state transitions in disjunctive resources
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
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”
| Hi-index | 0.00 |
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 - y1 驴 r1 V... V xn - yn 驴 rn where x1... xn, y1... yn are variables ranging over the real numbers, r1... rn are real constants, and n 驴 1. We have implemented four progressively more efficient algorithms for the consistency checking problem for this class of temporal constraints. We have partially ordered those algorithms according to the number of visited search nodes and the number of performed consistency checks. Finally, we have carried out a series of experimental results on the location of the hard region. The results show that hard problems occur at a critical value of the ratio of disjunctions to variables. This value is between 6 and 7.