Model counting for CNF formulas of bounded modular treewidth (Q334935): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6646537 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
propositional satisfiability | |||
| Property / zbMATH Keywords: propositional satisfiability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
model counting | |||
| Property / zbMATH Keywords: model counting / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithms | |||
| Property / zbMATH Keywords: algorithms / rank | |||
Normal rank | |||
Revision as of 04:55, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Model counting for CNF formulas of bounded modular treewidth |
scientific article |
Statements
Model counting for CNF formulas of bounded modular treewidth (English)
0 references
1 November 2016
0 references
propositional satisfiability
0 references
model counting
0 references
algorithms
0 references
