On computing preferred MUSes and MCSes

DOI10.1007/978-3-319-09284-3_6MaRDI QIDQ3192055zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Towards efficient MUS extraction
• On improving MUS extraction algorithms
• MUSer2: an efficient MUS extractor
• Finding a collection of MUSes incrementally
• On computing the union of MUSes

Cited in

(11)

• Introducing Pareto minimal correction subsets
• Definability for model counting
• On the complexity of inconsistency measurement
• Fast, flexible MUS enumeration
• Finding a collection of MUSes incrementally
• MCS Extraction with Sublinear Oracle Queries
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• MUPS identification based on discrimination rules
• Human-centred feasibility restoration in practice
• On computing probabilistic abductive explanations
• Explanations of unsatisfiability beyond minimal subsets

Describes a project that uses

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)