Counting propositional models
type: Item
instance of: scholarly article
title: Counting propositional models
zbMATH Open document ID: 0780.68065
DOI: 10.1016/0020-0190(92)90160-W
author: Eliezer L. Lozinskii
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 92072
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: satisfiability
zbMATH Keywords: counting models
zbMATH Keywords: number of models of a propositional formula
MaRDI profile type: Publication
cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
cites work: Average time analyses of simplified Davis-Putnam procedures
cites work: Approximate inclusion-exclusion
cites work: Q3339245
cites work: Answering atomic queries in indefinite deductive databases
cites work: The Pure Literal Rule and Polynomial Average Time
cites work: The complexity of computing the permanent
Wikidata QID: Q127704372
full work available at URL: 0020-0190(92)90160-w
OpenAlex ID: W2081311719
description: scientific article; zbMATH DE number 92072