Counting propositional models

DOI10.1016/0020-0190(92)90160-WzbMath0780.68065OpenAlexW2081311719WikidataQ127704372 ScholiaQ127704372MaRDI QIDQ1197995

Eliezer L. Lozinskii

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90160-w

zbMATH Keywords

analysis of algorithmssatisfiabilitycounting modelsnumber of models of a propositional formula

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)

Related Items (8)

Resolving contradictions: A plausible semantics for inconsistent systems ⋮ Counting for satisfiability by inverting resolution ⋮ Information and evidence in logic systems ⋮ Is there an alternative to parsimonious semantics? ⋮ Approximate reasoning with credible subsets ⋮ Using binary patterns for counting falsifying assignments of conjunctive forms ⋮ Inclusion-exclusion for \(k\)-CNF formulas ⋮ Explaining by evidence

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Average time analyses of simplified Davis-Putnam procedures
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Approximate inclusion-exclusion
• Answering atomic queries in indefinite deductive databases
• The Pure Literal Rule and Polynomial Average Time

This page was built for publication: Counting propositional models