Backtracking algorithms for disjunctions of temporal constraints
From MaRDI portal
Publication:1575430
DOI10.1016/S0004-3702(00)00019-9zbMath0945.68038MaRDI QIDQ1575430
Publication date: 21 August 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
68P10: Searching and sorting
68P15: Database theory
68T01: General topics in artificial intelligence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a general theory of action and time
- Network-based heuristics for constraint-satisfaction problems
- Temporal constraint networks
- From local to global consistency
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- Temporal constraint satisfaction techniques in job shop scheduling problem solving
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- The complexity of query evaluation in indefinite temporal constraint databases
- From local to global consistency in temporal constraint networks
- A theoretical evaluation of selected backtracking algorithms.
- Processing disjunctions in temporal constraint networks
- Twenty-one large tractable subclasses of Allen's algebra
- Networks of constraints: Fundamental properties and applications to picture processing
- Efficient algorithms for qualitative reasoning about time
- Towards efficient universal planning: A randomized approach
- Generating hard satisfiability problems
- Experimental results on the crossover point in random 3-SAT
- The satisfiability constraint gap
- An empirical study of phase transitions in binary constraint satisfaction problems
- Some pitfalls for experimenters with random SAT
- Locating the phase transition in binary constraint satisfaction problems
- Combining qualitative and quantitative constraints in temporal reasoning
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
- New methods to color the vertices of a graph
- On binary constraint problems
- Reasoning about temporal relations
- Backtrack Programming
- Mechanizing Mathematical Reasoning
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning