On the structure of Boolean satisfiability

MaRDI QIDQ3567616zbMATH OpenFDO

Authors Silvano Di Zenzo

Publication date 17 June 2010

zbMATH Keywords

certificates of membershiplogogramNP problemsprogram kernelsatisfiability problemsstructural independence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 3954272
• Some structural properties of SAT
• scientific article; zbMATH DE number 169728
• The complexity of satisfiability problems

Cited in

(11)

• Some structural properties of SAT
• The Boolean solution problem from the perspective of predicate logic
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
• scientific article; zbMATH DE number 5547835 (Why is no real title available?)
• Complete Problems Involving Boolean Labelled Structures and Projection Transactions
• scientific article; zbMATH DE number 2084702 (Why is no real title available?)
• The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
• ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY
• Boolean satisfiability with transitivity constraints
• Characterizing Propagation Methods for Boolean Satisfiability
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

This page was built for publication: On the structure of Boolean satisfiability

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