Clause redundancy and preprocessing in maximum satisfiability
From MaRDI portal
Publication:2104499
DOI10.1007/978-3-031-10769-6_6OpenAlexW4289104008MaRDI QIDQ2104499FDOQ2104499
Hannes Ihalainen, Matti Järvisalo, Jeremias Berg
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_6
Cites Work
- RC2: an Efficient MaxSAT Solver
- A theory of measurement in diagnosis from first principles
- Iterative and core-guided maxsat solving: a survey and assessment
- SAT-Based Preprocessing for MaxSAT
- SAT-based MaxSAT algorithms
- Inprocessing Rules
- Simulating circuit-level simplifications on CNF
- Exploiting the Power of mip Solvers in maxsat
- Efficient certified RAT verification
- Title not available (Why is that?)
- Progress in Artificial Intelligence
- Simulating strong practical proof systems with extended resolution
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- On preprocessing for weighted MaxSAT
- Efficient, verified checking of propositional proofs
- A flexible proof format for SAT solver-elaborator communication
- Strong extension-free proof systems
- Short proofs without new variables
- Super-Blocked Clauses
- Clause Elimination for SAT and QSAT
- Unifying reasoning and core-guided search for maximum satisfiability
- Core-boosted linear search for incomplete MaxSAT
- Mycielski graphs and PR proofs
- Title not available (Why is that?)
- Subsumed Label Elimination for Maximum Satisfiability
Cited In (2)
Uses Software
This page was built for publication: Clause redundancy and preprocessing in maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104499)
