Satisfying constraint sets through convex envelopes
From MaRDI portal
Publication:3429327
DOI10.1080/09528130600926082zbMath1111.68117MaRDI QIDQ3429327
Eunice E. Santos, Eugene jun. Santos, Keumjoo Kim
Publication date: 30 March 2007
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528130600926082
algorithms; constraint satisfaction; convex envelopes; interval reasoning; cluster constraint systems
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Maintaining knowledge about temporal intervals
- Towards a general theory of action and time
- Temporal constraint networks
- A unifying approach to temporal constraint reasoning
- Computational complexity of relating time points with intervals
- Deliberation scheduling for problem solving in time-constrained environments
- Temporal causal abduction
- Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
- Building tractable disjunctive constraints
- Reasoning about temporal relations
- On binary constraint problems
- Reasoning about temporal relations
- Changing times: a causal theory of probabilistic temporal reasoning
- Simple Reasoning with Time-Dependent Propositions
- Determining computational complexity from characteristic ‘phase transitions’
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
