On getting rid of the preprocessing minimization step in MUC-finding algorithms

DOI10.1007/s10601-015-9187-9zbMath1329.90151OpenAlexW1987749949MaRDI QIDQ903912

Jean-Marie Lagniez, Bertrand Mazure, Éric Grégoire

Publication date: 15 January 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9187-9

zbMATH Keywords

CSPconstraint networksMUCunsatisfiability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• Choco
• MUSer2
• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of facets resolved
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Consistency in networks of relations
• Integration of AI and OR techniques in constraint programming. 11th international conference, CPAIOR 2014, Cork, Ireland, May 19--23, 2014. Proceedings
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Towards efficient MUS extraction
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability
• Formula Preprocessing in MUS Extraction
• Factoring Out Assumptions to Speed Up MUS Extraction

This page was built for publication: On getting rid of the preprocessing minimization step in MUC-finding algorithms