Meta-resolution: An algorithmic formalisation

DOI10.1016/0304-3975(95)00155-7zbMATH Open0872.68168OpenAlexW2010329048MaRDI QIDQ671650FDOQ671650

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

Recommendations

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

Mathematics Subject Classification ID

Cites Work

• Hard examples for resolution
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• Title not available (Why is that?)
• The relative efficiency of propositional proof systems
• Many hard examples for resolution
• Title not available (Why is that?)
• The intractability of resolution
• Tseitin's formulas revisited
• On the complexity of regular resolution and the Davis-Putnam procedure
• Completeness of resolution 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)