Publication:4251071
From MaRDI portal
zbMath0924.03020MaRDI QIDQ4251071
Juan Luis Esteban, Jacobo Toran
Publication date: 17 June 1999
propositional logic; resolution; complexity measures; pebble game; CNF formula; space bounds; unsatisfiable formula
68Q25: Analysis of algorithms and problem complexity
03B35: Mechanization of proofs and logical operations
03D15: Complexity of computation (including implicit computational complexity)
03B05: Classical propositional logic
Related Items
An Upper Bound on the Space Complexity of Random Formulae in Resolution, An Introduction to Lower Bounds on Resolution Proof Systems, Verifying time, memory and communication bounds in systems of reasoning agents, Space bounds for resolution