Pages that link to "Item:Q5713708"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5713708):
Displayed 16 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Stream-based inconsistency measurement (Q895515) (← links)
- Reformulating table constraints using functional dependencies-an application to explanation generation (Q941813) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Symbolic Possibilistic Logic: Completeness and Inference Methods (Q3451208) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability (Q3523066) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)