27 citations · 53 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 8 cited
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions
Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduc…
cs.DS2018★ 27 cited
Principled Network Reliability Approximation: A Counting-Based Approach
R. Paredes, L. Duenas-Osorio, K. S. Meel +1
As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, netw…