Counting propositional models

Eliezer L. Lozinskii

doi:10.1016/0020-0190(92)90160-W

Counting propositional models

Eliezer L. Lozinskii^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

Given a propositional DNF or CNF formula F with m clauses on n variables, counting the number of models of F is, at the present state of the art, computationally intractable in a worst case. It is shown that an algorithm based on the Inclusion-Exclusion formula computes the exact number of models of F in average time that under reasonable assumptions in O(m^cn), where c = O(log m).

Original language	English
Pages (from-to)	327-332
Number of pages	6
Journal	Information Processing Letters
Volume	41
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(92)90160-W
State	Published - 17 Apr 1992

Keywords

Analysis of algorithms
counting models
satisfiability

Access to Document

10.1016/0020-0190(92)90160-W

Cite this

@article{47444916189a405aa206fb0fdb9faf70,

title = "Counting propositional models",

abstract = "Given a propositional DNF or CNF formula F with m clauses on n variables, counting the number of models of F is, at the present state of the art, computationally intractable in a worst case. It is shown that an algorithm based on the Inclusion-Exclusion formula computes the exact number of models of F in average time that under reasonable assumptions in O(mcn), where c = O(log m).",

keywords = "Analysis of algorithms, counting models, satisfiability",

author = "Lozinskii, \{Eliezer L.\}",

year = "1992",

month = apr,

day = "17",

doi = "10.1016/0020-0190(92)90160-W",

language = "אנגלית",

volume = "41",

pages = "327--332",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Counting propositional models

AU - Lozinskii, Eliezer L.

PY - 1992/4/17

Y1 - 1992/4/17

N2 - Given a propositional DNF or CNF formula F with m clauses on n variables, counting the number of models of F is, at the present state of the art, computationally intractable in a worst case. It is shown that an algorithm based on the Inclusion-Exclusion formula computes the exact number of models of F in average time that under reasonable assumptions in O(mcn), where c = O(log m).

AB - Given a propositional DNF or CNF formula F with m clauses on n variables, counting the number of models of F is, at the present state of the art, computationally intractable in a worst case. It is shown that an algorithm based on the Inclusion-Exclusion formula computes the exact number of models of F in average time that under reasonable assumptions in O(mcn), where c = O(log m).

KW - Analysis of algorithms

KW - counting models

KW - satisfiability

UR - https://www.scopus.com/pages/publications/0026851502

U2 - 10.1016/0020-0190(92)90160-W

DO - 10.1016/0020-0190(92)90160-W

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026851502

SN - 0020-0190

VL - 41

SP - 327

EP - 332

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Counting propositional models

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this