Tunable online MUS/MSS enumeration
From MaRDI portal
Publication:4636600
DOI10.4230/LIPICS.FSTTCS.2016.50zbMATH Open1391.68099arXiv1606.03289MaRDI QIDQ4636600FDOQ4636600
Authors: Jaroslav Bendík, Nikola Beneš, J. Barnat, I. Černá 
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1606.03289
Recommendations
- Recursive online enumeration of all minimal unsatisfiable subsets
- Fast, flexible MUS enumeration
- Enumerating infeasibility: finding multiple MUSes quickly
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
infeasibility analysisminimal unsatisfiable subsetsmaximal satisfiable subsetsunsatisfiability analysis
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (10)
- Counting minimal unsatisfiable subsets
- Recursive online enumeration of all minimal unsatisfiable subsets
- Fast, flexible MUS enumeration
- Timed automata relaxation for reachability
- Enumerating infeasibility: finding multiple MUSes quickly
- A new approach to partial MUS enumeration
- Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Computing MUS-based inconsistency measures
- Title not available (Why is that?)
This page was built for publication: Tunable online MUS/MSS enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636600)
