Meta-resolution: An algorithmic formalisation
From MaRDI portal
Publication:671650
DOI10.1016/0304-3975(95)00155-7zbMath0872.68168OpenAlexW2010329048MaRDI QIDQ671650
Jean-Denis 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Completeness of resolution revisited
- The intractability of resolution
- Tseitin's formulas revisited
- On the complexity of regular resolution and the Davis-Putnam procedure
- Many hard examples for resolution
- Hard examples for resolution
- The relative efficiency of propositional proof systems
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
This page was built for publication: Meta-resolution: An algorithmic formalisation
