Fast, flexible MUS enumeration
The problem of enumerating minimal unsatisfiable subsets (MUSes) of an infeasible
constraint system is challenging due first to the complexity of computing even a single MUS …
constraint system is challenging due first to the complexity of computing even a single MUS …
[PDF][PDF] On computing minimal correction subsets
A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal
relaxations and minimal explanations for over-constrained problems find many practical …
relaxations and minimal explanations for over-constrained problems find many practical …
Enumerating infeasibility: Finding multiple MUSes quickly
MH Liffiton, A Malik - Integration of AI and OR Techniques in Constraint …, 2013 - Springer
Methods for analyzing infeasible constraint sets have proliferated in the past decade,
commonly focused on finding maximal satisfiable subsets (MSSes) or minimal unsatisfiable …
commonly focused on finding maximal satisfiable subsets (MSSes) or minimal unsatisfiable …
Algorithms for maximum satisfiability using unsatisfiable cores
Many decision and optimization problems in Electronic Design Automation (EDA) can be
solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find …
solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find …
Towards efficient MUS extraction
Abstract Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical
applications, including product configuration, knowledge-based validation, and hardware …
applications, including product configuration, knowledge-based validation, and hardware …
Silas: A high-performance machine learning foundation for logical reasoning and verification
This paper introduces a new high-performance machine learning tool named Silas, which is
built to provide a more transparent, dependable and efficient data analytics service. We …
built to provide a more transparent, dependable and efficient data analytics service. We …
Core-guided minimal correction set and core enumeration
A set of constraints is unsatisfiable if there is no solution that satisfies these constraints. To
analyse unsatisfiable problems, the user needs to understand where inconsistencies come …
analyse unsatisfiable problems, the user needs to understand where inconsistencies come …
On improving MUS extraction algorithms
Abstract Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical
applications, including product configuration, knowledge-based validation, and hardware …
applications, including product configuration, knowledge-based validation, and hardware …
Managing SAT inconsistencies with HUMUS
In Product Line Engineering, as in any other modeling domain, designers and end users are
prone to making inconsistent assumptions (errors) because of complexity and lack of system …
prone to making inconsistent assumptions (errors) because of complexity and lack of system …
An experimentally efficient method for (MSS, CoMSS) partitioning
The concepts of MSS (Maximal Satisfiable Subset) andCoMSS (also called Minimal
Correction Subset) playa key role in many AI approaches and techniques. Inthis paper, a …
Correction Subset) playa key role in many AI approaches and techniques. Inthis paper, a …