An enumerative algorithm for \#2SAT (Q283678): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2014.08.012 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2014.08.012 / rank
 
Normal rank

Latest revision as of 13:22, 9 December 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
    0 references
    0 references
    13 May 2016
    0 references
    \#SAT problem
    0 references
    counting models
    0 references
    enumerative algorithm
    0 references
    efficient counting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references