scientific article; zbMATH DE number 1113994

MaRDI QIDQ4375759zbMATH OpenFDO

Authors John V. Franco

Publication date 2 June 1998

zbMATH Keywords

satisfiability problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A perspective on certain polynomial-time solvable classes of satisfiability
• Polynomially solvable satisfiability problems
• scientific article; zbMATH DE number 2151254
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses

Cited in

(6)

• Generalising unit-refutation completeness and SLUR via nested input resolution
• Polynomially solvable satisfiability problems
• A short note on some tractable cases of the satisfiability problem.
• A perspective on certain polynomial-time solvable classes of satisfiability
• Investigations on autark assignments
• Generalising and unifying SLUR and unit-refutation completeness

Describes a project that uses

Uses Software

• Leibniz

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 Q4375759)