Short XORs for Model Counting: From Theory to Practice
From MaRDI portal
Publication:3612459
DOI10.1007/978-3-540-72788-0_13zbMath1214.68354OpenAlexW1549031924MaRDI QIDQ3612459
Jörg Hoffmann, Ashish Sabharwal, Carla P. Gomes, Bart Selman
Publication date: 10 March 2009
Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_13
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
On computing minimal independent support and its applications to sampling and counting ⋮ A Study of Symmetry Breaking Predicates and Model Counting ⋮ Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ Projected model counting: beyond independent support ⋮ Model counting with error-correcting codes ⋮ In search of balance: the challenge of generating balanced Latin rectangles ⋮ Testing in ASP: revisited language and programming environment ⋮ Unnamed Item
This page was built for publication: Short XORs for Model Counting: From Theory to Practice
