A non-clausal tableau calculus for \textsc{MinSat}
From MaRDI portal
Publication:2234795
Recommendations
Cites work
- scientific article; zbMATH DE number 1189106 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3300581 (Why is no real title available?)
- A resolution calculus for MinSAT
- A tableau calculus for non-clausal maximum satisfiability
- Clause tableaux for maximum and minimum satisfiability
- On approximation algorithms for the minimum satisfiability problem
- On reducing maximum independent set to minimum satisfiability
- Optimizing with minimum satisfiability
- SAT and SMT technology for many-valued logics
- Simplification Rules for Intuitionistic Propositional Tableaux
- The Minimum Satisfiability Problem
- fCube: an efficient prover for intuitionistic propositional logic
Cited in
(3)
This page was built for publication: A non-clausal tableau calculus for \textsc{MinSat}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234795)