Circular (Yet Sound) Proofs in Propositional Logic

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Games for the \(\mu\)-calculus
Exponential lower bounds for the pigeonhole principle
On the proof theory of the modal mu-calculus
Tight rank lower bounds for the Sherali-Adams proof system
The intractability of resolution
On tackling the limits of resolution in SAT solving
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Circular (yet sound) proofs
Equivalence between systems stronger than resolution
Towards a better understanding of (partial weighted) MaxSAT proof systems
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
Sequent calculi for induction and infinite descent
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
NON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGIC
Polynomial size proofs of the propositional pigeonhole principle
The relative efficiency of propositional proof systems
Short proofs are narrow—resolution made simple
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
Narrow Proofs May Be Maximally Long
A Proof System for the Linear Time μ-Calculus
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity

This page was built for publication: Circular (Yet Sound) Proofs in Propositional Logic