scientific article; zbMATH DE number 1315584

zbMath0918.68098MaRDI QIDQ4256519

Eliezer L. Lozinskii, Elazar Birnbaum

Publication date: 18 July 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Davis-Putnam procedure

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) General topics in artificial intelligence (68T01)

Related Items (10)

Approximate Model Counting via Extension Rule ⋮ Counting for satisfiability by inverting resolution ⋮ Phase transitions of PP-complete satisfiability problems ⋮ Unnamed Item ⋮ Algorithms for four variants of the exact satisfiability problem ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ Feasibility analysis for robustness quantification by symbolic model checking ⋮ Two approximate algorithms for model counting ⋮ Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

This page was built for publication: