Certainty closure: reliable constraint reasoning with incomplete or erroneous data

DOI10.1145/1459010.1459013MaRDI QIDQ5277821zbMATH OpenOpenAlexFDO

Authors Neil Yorke-Smith, Carmen Gervet

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1459010.1459013

zbMATH Keywords

closureincomplete and erroneous datareliable solutionsuncertain constraint satisfaction problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Finding reliable solutions: event-driven probabilistic constraint programming
• A survey on CP-AI-OR hybrids for decision making under uncertainty
• Dempster-Shafer Theory: Ηow Constraint Programming Can Help
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Constraint reasoning with uncertain data using CDF-intervals

Cited in

(3)

• Tractability in constraint satisfaction problems: a survey
• Maximum feasibility estimation
• Stochastic constraint programming: A scenario-based approach

This page was built for publication: Certainty closure: reliable constraint reasoning with incomplete or erroneous data

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