AMUSE

swMATH11915MaRDI QIDQ23851FDOQ23851

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=996710

Cited In (37)

• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
• Counting minimal unsatisfiable subsets
• Resolution proof transformation for compression and interpolation
• Theory and Applications of Satisfiability Testing
• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Computing small unsatisfiable cores in satisfiability modulo theories
• Efficient combination of decision procedures for MUS computation
• Reconfigurable computing. The theory and practice of FPGA-based computation.
• Factoring Out Assumptions to Speed Up MUS Extraction
• Algorithms for computing minimal unsatisfiable subsets of constraints
• HaifaSat
• CEGAR
• CMU Benchmarks
• MUP
• SATLIB Benchmark Suite
• RSat
• MUSer2
• Velev SAT Benchmarks
• BEACON
• An approach for extracting a small unsatisfiable core
• C32SAT
• QAGen
• Z34Bio
• QUICKXPLAIN
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Using local search to find MSSes and MUSes
• Hints revealed
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• On improving MUS extraction algorithms
• Improved single pass algorithms for resolution proof reduction
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• Local-search extraction of mUSes
• Decision procedures. An algorithmic point of view
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability
• A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories

This page was built for software: AMUSE