On Computing Preferred MUSes and MCSes

DOI10.1007/978-3-319-09284-3_6zbMATH Open1423.68460OpenAlexW764940MaRDI QIDQ3192055FDOQ3192055

Alessandro Previti, Joao 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

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

Cited In (7)

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

Uses Software

• CP-nets

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

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