scientific article; zbMATH DE number 2084758

MaRDI QIDQ4475696zbMATH OpenFDO

Authors Mitchell Alan Harris

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390765.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Inclusion-exclusion for \(k\)-CNF formulas
• Counting the number of solutions for instances of satisfiability
• An approximation algorithm for \(\#k\)-SAT
• Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
• An algorithm for the satisfiability problem of formulas in conjunctive normal form

Cited in

(9)

• Inclusion-exclusion for \(k\)-CNF formulas
• The number of 3-SAT functions
• Counting the number of solutions for instances of satisfiability
• Probability distribution for simple tautologies
• Counting for satisfiability by inverting resolution
• On extremal \(k\)-CNF formulas
• Counting a type's (principal) inhabitants
• Satisfiability of acyclic and almost acyclic CNF formulas
• Satisfiability of acyclic and almost acyclic CNF formulas

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