scientific article; zbMATH DE number 1737608

MaRDI QIDQ4529644zbMATH OpenFDO

Authors Marin Vlada

Publication date 5 May 2002

zbMATH Keywords

satisfiability of propositional formulas

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of computation (including implicit computational complexity) (03D15) Boolean functions (06E30) Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms for testing satisfiability formulas
• A satisfiability tester for non-clausal propositional calculus
• Algorithms for testing the satisfiability of propositional formulae
• scientific article; zbMATH DE number 3870637
• Solving propositional satisfiability problems

Cited in

(8)

• The propositional formula checker HeerHugo
• Counting for satisfiability by inverting resolution
• The satisfiability of logical formula in proof of program
• scientific article; zbMATH DE number 4063058 (Why is no real title available?)
• scientific article; zbMATH DE number 1113999 (Why is no real title available?)
• Abstract Combinatorial Programs and Efficient Property Testers
• Algorithms for testing satisfiability formulas
• Determination of the class of validity of logical formulas by directed exhaustive search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529644)