Pages that link to "Item:Q2471741"
From MaRDI portal
The following pages link to Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- Fast, flexible MUS enumeration (Q272009) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Analysing sanity of requirements for avionics systems (Q282095) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Responsibility for inconsistency (Q891774) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Measuring inconsistency with constraints for propositional knowledge bases (Q1647509) (← links)
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems (Q1664711) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Shield synthesis (Q1696587) (← links)
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction (Q1980482) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Strong inconsistency (Q2321259) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- Speeding up MUS Extraction with Preprocessing and Chunking (Q3453206) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)
- Dealing Automatically with Exceptions by Introducing Specificity in ASP (Q3638184) (← links)
- Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (Q4571130) (← links)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- On the measure of conflicts: an argumentation-based framework (Q4685531) (← links)
- Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design (Q5039527) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Does This Set of Clauses Overlap with at Least One MUS? (Q5191099) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
