Counting Models in Integer Domains

DOI10.1007/11814948_37MaRDI QIDQ5756568zbMATH OpenOpenAlexFDO

Authors Antonio Morgado, Paulo Rogério Faustino Matos, Vasco Manquinho, Joao Marques-Silva

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/262431/1/jpms-sat06c.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10)

Recommendations

• Model counting: a new stategy for obtaining good bounds
• Leveraging belief propagation, backtrack search, and statistics for model counting
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Two approximate algorithms for model counting
• Counting solutions to CSP using generating polynomials

Cited in

(4)

• Counting models of set theory
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 7015237 (Why is no real title available?)
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

This page was built for publication: Counting Models in Integer Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756568)