Counting propositional models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- Answering atomic queries in indefinite deductive databases
- Approximate inclusion-exclusion
- Average time analyses of simplified Davis-Putnam procedures
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- The Pure Literal Rule and Polynomial Average Time
- The complexity of computing the permanent
Cited in
(11)- Resolving contradictions: A plausible semantics for inconsistent systems
- Using binary patterns for counting falsifying assignments of conjunctive forms
- Is there an alternative to parsimonious semantics?
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Approximate reasoning with credible subsets
- Information and evidence in logic systems
- Algorithms for propositional model counting
- Inclusion-exclusion for \(k\)-CNF formulas
- Counting for satisfiability by inverting resolution
- Algorithms for Propositional Model Counting
- Explaining by evidence
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)