On the complexity of propositional calculus formulae
From MaRDI portal
Publication:5457670
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 6698765 (Why is no real title available?)
- Algorithm for PP-reduction a PC formula to the clause form
- On the complexity of formulas in semantic programming
- scientific article; zbMATH DE number 3849198 (Why is no real title available?)
- scientific article; zbMATH DE number 2044514 (Why is no real title available?)
- The expected complexity of analytic tableaux analyses in propositional calculus. II
- A formal grammatical model of the resolution method for the propositional calculus
- Optimizing propositional calculus formulas with regard to questions of deducibility
- Regular Resolution Versus Unrestricted Resolution
- scientific article; zbMATH DE number 4075035 (Why is no real title available?)
- Existence of simple propositional formulas
- scientific article; zbMATH DE number 6963530 (Why is no real title available?)
- scientific article; zbMATH DE number 5263419 (Why is no real title available?)
- scientific article; zbMATH DE number 3240380 (Why is no real title available?)
- scientific article; zbMATH DE number 5139037 (Why is no real title available?)
- On meta complexity of propositional formulas and propositional proofs
This page was built for publication: On the complexity of propositional calculus formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457670)