An enumerative algorithm for \#2SAT (Q283678): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting models for 2SAT and 3SAT formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the hardness of approximate reasoning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2701738 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory and Applications of Satisfiability Testing / rank | |||
Normal rank |
Revision as of 23:26, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An enumerative algorithm for \#2SAT |
scientific article |
Statements
An enumerative algorithm for \#2SAT (English)
0 references
13 May 2016
0 references
\#SAT problem
0 references
counting models
0 references
enumerative algorithm
0 references
efficient counting
0 references
0 references