Computing Explanations for the Unary Resource Constraint

DOI10.1007/11493853_29MaRDI QIDQ5450947zbMATH OpenOpenAlexFDO

Authors Petr Vilím

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_29

Mathematics Subject Classification ID

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

Recommendations

• Filtering algorithms for the unary resource constraint
• scientific article; zbMATH DE number 2084736
• Efficiently explaining CSPs with unsatisfiable subset optimization
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• scientific article; zbMATH DE number 7368415
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Artificial Intelligence: Methodology, Systems, and Applications

Cited in

(4)

• A framework for step-wise explaining how to solve constraint satisfaction problems
• Explaining circuit propagation
• scientific article; zbMATH DE number 2084736 (Why is no real title available?)
• Explaining the \texttt{cumulative} propagator

This page was built for publication: Computing Explanations for the Unary Resource Constraint

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