Improving MCS enumeration via caching

DOI10.1007/978-3-319-66263-3_12MaRDI QIDQ1680254zbMATH OpenOpenAlexFDO

Authors Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva

Publication date 15 November 2017

Full work available at URL http://hdl.handle.net/10138/309055

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A new approach to partial MUS enumeration
• MCS Extraction with Sublinear Oracle Queries
• Introducing Pareto minimal correction subsets
• Fast, flexible MUS enumeration
• Enumerating infeasibility: finding multiple MUSes quickly

Cited in

(7)

• Efficient implementation of the MFS: The three scenarios
• Introducing Pareto minimal correction subsets
• Fast, flexible MUS enumeration
• Exact and approximate determination of the Pareto front using minimal correction subsets
• Computing MUS-based inconsistency measures
• Explanations of unsatisfiability beyond minimal subsets
• Rotation based MSS/MCS enumeration

Describes a project that uses

Uses Software

• sharpSAT
• MiniSat
• Chaff

This page was built for publication: Improving MCS enumeration via caching

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