Extending the notion of preferred explanations for quantified constraint satisfaction problems

DOI10.1007/978-3-319-25150-9_19MaRDI QIDQ2787433zbMATH OpenOpenAlexFDO

Authors Deepak Mehta, Barry O'Sullivan, Luis O. Quesada

Publication date 25 February 2016

Published in Theoretical Aspects of Computing - ICTAC 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-25150-9_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving quantified constraint satisfaction problems
• Consistency for Quantified Constraint Satisfaction Problems
• Relatively quantified constraint satisfaction
• Meditations on quantified constraint satisfaction
• Existentially restricted quantified constraint satisfaction

Cited in

(3)

• Quantified Constraints in Twenty Seventeen
• scientific article; zbMATH DE number 7368415 (Why is no real title available?)
• Human-centred feasibility restoration in practice

This page was built for publication: Extending the notion of preferred explanations for quantified constraint satisfaction problems

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