The complexity of analytic tableaux

DOI10.2178/jsl/1154698576zbMath1109.03066OpenAlexW2114226999MaRDI QIDQ3410672

Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart

Publication date: 29 November 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1154698576

zbMATH Keywords

proof complexitytree resolutionanalytic tableaux

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cites Work

• Unnamed Item
• The proof complexity of analytic and clausal tableaux
• The relative efficiency of propositional proof systems
• On the Computational Intractability of Analytic Tableau Methods
• The Complexity of Propositional Proofs

This page was built for publication: The complexity of analytic tableaux