Formula preprocessing in MUS extraction

DOI10.1007/978-3-642-36742-7_8MaRDI QIDQ5326319zbMATH OpenOpenAlexFDO

Authors Anton Belov, Matti Järvisalo, Joao Marques-Silva

Publication date 5 August 2013

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36742-7_8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Speeding up MUS extraction with preprocessing and chunking
• On improving MUS extraction algorithms
• Towards efficient MUS extraction
• MUSer2: an efficient MUS extractor
• Theory and Applications of Satisfiability Testing

Cited in

(7)

• LMHS: a SAT-IP hybrid MaxSat solver
• Speeding up MUS extraction with preprocessing and chunking
• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Factoring Out Assumptions to Speed Up MUS Extraction
• Rotation based MSS/MCS enumeration
• On getting rid of the preprocessing minimization step in MUC-finding algorithms

This page was built for publication: Formula preprocessing in MUS extraction

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