Propositional proof systems based on maximum satisfiability
From MaRDI portal
Recommendations
Cites work
- A theory of diagnosis from first principles
- An exponential separation between the parity principle and the pigeonhole principle
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Correct Hardware Design and Verification Methods
- Counterexample-guided abstraction refinement for symbolic model checking
- Cutting planes, connectivity, and threshold logic
- DRMaxSAT with MaxHS: first contact
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Exploiting the power of MIP solvers in MAXSAT
- Extended clause learning
- GRASP: a search algorithm for propositional satisfiability
- Hard examples for resolution
- scientific article; zbMATH DE number 176196 (Why is no real title available?)
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- Iterative and core-guided maxsat solving: a survey and assessment
- LMHS: a SAT-IP hybrid MaxSat solver
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
- Mutilated chessboard problem is exponentially hard for resolution
- On Solving the Partial MAX-SAT Problem
- On tackling the limits of resolution in SAT solving
- On the complexity of the maximum satisfiability problem for Horn formulas
- On the power of clause-learning SAT solvers as resolution engines
- Open-WBO: a modular MaxSAT solver
- Propositional proofs and reductions between NP search problems
- Propositional SAT solving
- Resolution for Max-SAT
- SAT-based MaxSAT algorithms
- Short proofs for tricky formulas
- Symbolic techniques in satisfiability solving
- The complexity of theorem-proving procedures
- The relative efficiency of propositional proof systems
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Tools and algorithms for the construction and analysis of systems. 25th international conference, TACAS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceed
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(7)- DRMaxSAT with MaxHS: first contact
- Proof Systems for Effectively Propositional Logic
- Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
- MaxSAT resolution for regular propositional logic
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
- Polynomial calculus for optimization
- Strength and limitations of Sherali-Adams and nullstellensatz proof systems
Describes a project that uses
Uses Software
This page was built for publication: Propositional proof systems based on maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238728)
