Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets

DOI10.29007/SXZBzbMATH Open1415.68184OpenAlexW2907199459MaRDI QIDQ5222949FDOQ5222949

Authors: Jaroslav Bendík, I. Černá 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/sxzb

Recommendations

• Fast, flexible MUS enumeration
• Recursive online enumeration of all minimal unsatisfiable subsets
• Enumerating infeasibility: finding multiple MUSes quickly
• Tunable online MUS/MSS enumeration
• A new approach to partial MUS enumeration

zbMATH Keywords

infeasibility analysisminimal unsatisfiable subsetsMUS enumerationunsatisfiability analysisdomain-agnostic

Mathematics Subject Classification ID

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

Cited In (5)

• Recursive online enumeration of all minimal unsatisfiable subsets
• A new approach to partial MUS enumeration
• Tunable online MUS/MSS enumeration
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Title not available (Why is that?)

Uses Software

• MiniSat
• MARCO
• z3
• MUSer2
• nuXmv

This page was built for publication: Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets

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