Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Dudek, Jeffrey M."'
While the Ising model remains essential to understand physical phenomena, its natural connection to combinatorial reasoning makes it also one of the best models to probe complex systems in science and engineering. We bring a computational lens to the
Externí odkaz:
http://arxiv.org/abs/2212.12812
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from researchers for over three decades, the design of scalable techniques for co
Externí odkaz:
http://arxiv.org/abs/2010.10724
We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are project-join trees, which specify efficient project-join orders to apply add
Externí odkaz:
http://arxiv.org/abs/2008.08748
Autor:
Dudek, Jeffrey M., Vardi, Moshe Y.
A promising new algebraic approach to weighted model counting makes use of tensor networks, following a reduction from weighted model counting to tensor-network contraction. Prior work has focused on analyzing the single-core performance of this appr
Externí odkaz:
http://arxiv.org/abs/2006.15512
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the problem of tensor-network contra
Externí odkaz:
http://arxiv.org/abs/1908.04381
We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in Conjunctive Normal Form. Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the primary data structure. We implement this tec
Externí odkaz:
http://arxiv.org/abs/1907.05000
Recent universal-hashing based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both CNF constraints and variable-width XOR constraints (known as CNF-XOR formul
Externí odkaz:
http://arxiv.org/abs/1710.06378
The runtime performance of modern SAT solvers on random $k$-CNF formulas is deeply connected with the 'phase-transition' phenomenon seen empirically in the satisfiability of random $k$-CNF formulas. Recent universal hashing-based approaches to sampli
Externí odkaz:
http://arxiv.org/abs/1702.08392
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dudek, Jeffrey M., Fried, Dror
Boolean functions are characterized by the unique structure of their solution space. Some properties of the solution space, such as the possible existence of a solution, are well sought after but difficult to obtain. To better reason about such prope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eed8d743acee04b51e500769cafa7d27