Two approximate algorithms for model counting (Q507433): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6680871 / 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
 
resolution principle
Property / zbMATH Keywords: resolution principle / rank
 
Normal rank
Property / zbMATH Keywords
 
extension rule
Property / zbMATH Keywords: extension rule / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sharpSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / 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.1016/j.tcs.2016.04.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2413589572 / 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: Q5503674 / 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: 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: 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:55, 13 July 2024

scientific article
Language Label Description Also known as
English
Two approximate algorithms for model counting
scientific article

    Statements

    Two approximate algorithms for model counting (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2017
    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