Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
From MaRDI portal
Publication:5015593
DOI10.3233/SAT190100zbMath1484.68223OpenAlexW2187266564MaRDI QIDQ5015593
Alexander Nadel, Ofer Strichman, Vadim Ryvchin
Publication date: 9 December 2021
Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/sat190100
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (2)
Counting minimal unsatisfiable subsets ⋮ Anytime answer set optimization via unsatisfiable core shrinking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach for extracting a small unsatisfiable core
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Using local search to find MSSes and MUSes
- The complexity of facets resolved
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Algorithms for computing minimal unsatisfiable subsets of constraints
- On Improving MUS Extraction Algorithms
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Towards efficient MUS extraction
- Finding Guaranteed MUSes Fast
- Efficient Combination of Decision Procedures for MUS Computation
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Theory and Applications of Satisfiability Testing
- Factoring Out Assumptions to Speed Up MUS Extraction
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Computer Aided Verification
This page was built for publication: Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
