The relative complexity of analytic tableaux and SL-resolution

DOI10.1007/BF01058395zbMath0801.03010MaRDI QIDQ687165

André Vellino

Publication date: 5 December 1994

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

complexity of proofsproof systemanalytic tableaupolynomial simulationSL-resolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (2)

On Linear Resolution ⋮ Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals

Cites Work

• Linear resolution with selection function
• The relative efficiency of propositional proof systems
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The relative complexity of analytic tableaux and SL-resolution