Satisfying constraint sets through convex envelopes

DOI10.1080/09528130600926082zbMath1111.68117OpenAlexW2034336502MaRDI 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

zbMATH Keywords

algorithmsconstraint satisfactionconvex envelopesinterval reasoningcluster constraint systems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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

This page was built for publication: Satisfying constraint sets through convex envelopes