Backtracking algorithms for disjunctions of temporal constraints
From MaRDI portal
Publication:1575430
DOI10.1016/S0004-3702(00)00019-9zbMath0945.68038OpenAlexW2103943372MaRDI QIDQ1575430
Publication date: 21 August 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00019-9
Searching and sorting (68P10) Database theory (68P15) General topics in artificial intelligence (68T01)
Related Items
Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way, Temporal Reasoning in Nested Temporal Networks with Alternatives, Temporal reasoning about fuzzy intervals, The SAT-based approach to separation logic, M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures, Optimal rectangle packing, An interdisciplinary experimental evaluation on the disjunctive temporal problem, Reducing the number of disjuncts in DTPs, Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU), Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games, On the modelling and optimization of preferences in constraint-based temporal reasoning, An initial study of time complexity in infinite-domain constraint satisfaction, Group planning with time constraints, From binary temporal relations to non-binary ones and back, Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty, Translation-based approaches for solving disjunctive temporal problems with preferences, Efficient solution techniques for disjunctive temporal reasoning problems
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
