Pages that link to "Item:Q1408373"

The following pages link to Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373):

Displaying 12 items.

• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
• Resolution proof transformation for compression and interpolation (Q479815) (← links)
• An approach for extracting a small unsatisfiable core (Q1028724) (← links)
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
• Using local search to find MSSes and MUSes (Q1042194) (← links)
• On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
• Local-search extraction of mUSes (Q2385174) (← links)
• Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
• Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
• Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability (Q3523066) (← links)
• Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)