Backtracking algorithms for disjunctions of temporal constraints
From MaRDI portal
Recommendations
Cites work
- A Sufficient Condition for Backtrack-Free Search
- A theoretical evaluation of selected backtracking algorithms.
- An empirical study of phase transitions in binary constraint satisfaction problems
- Backtrack Programming
- Combining qualitative and quantitative constraints in temporal reasoning
- Consistency in networks of relations
- Efficient algorithms for qualitative reasoning about time
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Experimental results on the crossover point in random 3-SAT
- From local to global consistency
- From local to global consistency in temporal constraint networks
- Generating hard satisfiability problems
- scientific article; zbMATH DE number 4166937 (Why is no real title available?)
- scientific article; zbMATH DE number 52880 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 1149417 (Why is no real title available?)
- scientific article; zbMATH DE number 1487978 (Why is no real title available?)
- scientific article; zbMATH DE number 802345 (Why is no real title available?)
- Locating the phase transition in binary constraint satisfaction problems
- Mechanizing Mathematical Reasoning
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- New methods to color the vertices of a graph
- On binary constraint problems
- Processing disjunctions in temporal constraint networks
- Reasoning about qualitative temporal information
- Reasoning about temporal relations
- Some pitfalls for experimenters with random SAT
- Synthesizing constraint expressions
- Temporal constraint networks
- Temporal constraint satisfaction techniques in job shop scheduling problem solving
- The complexity of query evaluation in indefinite temporal constraint databases
- The satisfiability constraint gap
- Towards a general theory of action and time
- Towards efficient universal planning: A randomized approach
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Twenty-one large tractable subclasses of Allen's algebra
Cited in
(24)- Processing disjunctions in temporal constraint networks
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Group planning with time constraints
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
- Translation-based approaches for solving disjunctive temporal problems with preferences
- Temporal reasoning about fuzzy intervals
- scientific article; zbMATH DE number 1213132 (Why is no real title available?)
- scientific article; zbMATH DE number 1149417 (Why is no real title available?)
- On restricted disjunctive temporal problems: faster algorithms and tractability frontier
- An initial study of time complexity in infinite-domain constraint satisfaction
- Temporal Reasoning in Nested Temporal Networks with Alternatives
- From binary temporal relations to non-binary ones and back
- An interdisciplinary experimental evaluation on the disjunctive temporal problem
- Optimal rectangle packing
- Reducing the number of disjuncts in DTPs
- Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
- On the modelling and optimization of preferences in constraint-based temporal reasoning
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- Exploring inconsistency measurement in disjunctive temporal problems
- Algorithms and complexity of difference logic
- Efficient solution techniques for disjunctive temporal reasoning problems
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- The SAT-based approach to separation logic
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication: Backtracking algorithms for disjunctions of temporal constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575430)
