Pages that link to "Item:Q1777390"
From MaRDI portal
The following pages link to On exact selection of minimally unsatisfiable subformulae (Q1777390):
Displaying 10 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Extending Removed Sets Revision to partially preordered belief bases (Q622290) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae (Q2741521) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Dealing Automatically with Exceptions by Introducing Specificity in ASP (Q3638184) (← links)