Counting propositional models

DOI10.1016/0020-0190(92)90160-WMaRDI QIDQ1197995zbMATH OpenOpenAlexWikidataFDO

Authors 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 algorithmscounting modelsnumber of models of a propositional formulasatisfiability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1315584
• Algorithms for Propositional Model Counting
• Algorithms for propositional model counting
• Two approximate algorithms for model counting
• Counting models for 2SAT and 3SAT formulae

Cites work

• Answering atomic queries in indefinite deductive databases
• Approximate inclusion-exclusion
• Average time analyses of simplified Davis-Putnam procedures
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• The complexity of computing the permanent
• The Pure Literal Rule and Polynomial Average Time

Cited in

(13)

• Inclusion-exclusion for \(k\)-CNF formulas
• Resolving contradictions: A plausible semantics for inconsistent systems
• Enumerating models of DNF faster: breaking the dependency on the formula size
• Algorithms for propositional model counting
• Counting for satisfiability by inverting resolution
• Using binary patterns for counting falsifying assignments of conjunctive forms
• scientific article; zbMATH DE number 4210101 (Why is no real title available?)
• Algorithms for Propositional Model Counting
• scientific article; zbMATH DE number 1315584 (Why is no real title available?)
• Information and evidence in logic systems
• Approximate reasoning with credible subsets
• Explaining by evidence
• Is there an alternative to parsimonious semantics?

This page was built for publication: Counting propositional models

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