Approximate Model Counting via Extension Rule (Q3452569): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sharpSAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2399637032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as satisfiability: heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveraging belief propagation, backtrack search, and statistics for model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving based on the extension rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving #SAT Using Extension Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inclusion-exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion-exclusion: exact and approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank

Latest revision as of 01:20, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximate Model Counting via Extension Rule
scientific article

    Statements

    Approximate Model Counting via Extension Rule (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2015
    0 references
    propositional satisfiability
    0 references
    model counting
    0 references
    resolution principle
    0 references
    extension rule
    0 references
    0 references
    0 references

    Identifiers

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