On the complexity of propositional calculus formulae

zbMATH Open1134.68373MaRDI QIDQ5457670FDOQ5457670

Authors: Ştefan Andrei, Manfred Kudlek, Gheorghe Grigoraş, Cristian Masalagiu 

Publication date: 14 April 2008

Recommendations

• scientific article; zbMATH DE number 4085614
• scientific article; zbMATH DE number 702472
• The intractability of resolution
• Optimizing propositional calculus formulas with regard to questions of deducibility
• On resolution with short clauses

zbMATH Keywords

resolution algorithmresolventsHorn clausesKrom clauses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Cited In (16)

• Title not available (Why is that?)
• Algorithm for PP-reduction a PC formula to the clause form
• Title not available (Why is that?)
• On the complexity of formulas in semantic programming
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Existence of simple propositional formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)