Meta-resolution: An algorithmic formalisation

DOI10.1016/0304-3975(95)00155-7MaRDI QIDQ671650zbMATH OpenOpenAlexFDO

Authors J.-D. Fouks, Jean-Claude Spehner

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(95)00155-7

Mathematics Subject Classification ID

Recommendations

• The efficiency of resolution and Davis-Putnam procedures
• scientific article; zbMATH DE number 6117305
• scientific article; zbMATH DE number 956865

Cites work

• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Machine-Oriented Logic Based on the Resolution Principle
• Completeness of resolution revisited
• Hard examples for resolution
• Many hard examples for resolution
• On the complexity of regular resolution and the Davis-Putnam procedure
• The intractability of resolution
• The relative efficiency of propositional proof systems
• Tseitin's formulas revisited

Cited in

(1)

• Tseitin's formulas revisited

This page was built for publication: Meta-resolution: An algorithmic formalisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671650)