On Computing Preferred MUSes and MCSes

DOI10.1007/978-3-319-09284-3_6zbMath1423.68460OpenAlexW764940MaRDI QIDQ3192055

Alessandro Previti, João P. Marques-Silva

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_6

Mathematics Subject Classification ID

Related Items (7)

Fast, flexible MUS enumeration ⋮ Human-centred feasibility restoration in practice ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ On computing probabilistic abductive explanations ⋮ Definability for model counting ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ On the complexity of inconsistency measurement

Uses Software

• CP-nets

This page was built for publication: On Computing Preferred MUSes and MCSes