Tseitin's formulas revisited

DOI10.1016/0304-3975(92)90356-KzbMath0754.05065OpenAlexW2091111068MaRDI QIDQ1193906

Jean-Denis Fouks

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90356-k

zbMATH Keywords

resolutioncyclomatic cohesionTseitin's formulasTseitin's method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mechanization of proofs and logical operations (03B35) Graph theory (05C99)

Related Items (1)

Meta-resolution: An algorithmic formalisation

Cites Work

• Unnamed Item
• Meta-resolution: An algorithmic formalisation
• The intractability of resolution
• On the complexity of regular resolution and the Davis-Putnam procedure
• Many hard examples for resolution
• Hard examples for resolution
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory

This page was built for publication: Tseitin's formulas revisited