Satisfying constraint sets through convex envelopes

DOI10.1080/09528130600926082MaRDI QIDQ3429327zbMATH OpenOpenAlexFDO

Authors Eugene jun. Santos, Eunice E. 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)

Recommendations

• Solving set-valued constraint satisfaction problems
• The logic of constraint satisfaction
• Numerical constraint satisfaction problems with non-isolated solutions
• Convex envelopes generated from finitely many compact convex sets
• scientific article; zbMATH DE number 1234562

Cites work

• A unifying approach to temporal constraint reasoning
• Building tractable disjunctive constraints
• Changing times: a causal theory of probabilistic temporal reasoning
• Computational complexity of relating time points with intervals
• Deliberation scheduling for problem solving in time-constrained environments
• Determining computational complexity from characteristic ``phase transitions
• Maintaining knowledge about temporal intervals
• On binary constraint problems
• Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
• Reasoning about temporal relations
• Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
• Simple Reasoning with Time-Dependent Propositions
• Temporal causal abduction
• Temporal constraint networks
• Towards a general theory of action and time
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning

Cited in

(2)

• Solving set-valued constraint satisfaction problems
• Using convex envelopes to solve the interactive fixed-charge linear programming problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429327)