Satisfying constraint sets through convex envelopes

DOI10.1080/09528130600926082zbMATH Open1111.68117OpenAlexW2034336502MaRDI QIDQ3429327FDOQ3429327

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

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

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

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)