A novel method for counting models on grid Boolean formulas

Authors:
Carlos Guillén;Guillermo De Ita;Aurelio López-López
Affiliations:
Facultad de Ciencias de la Computación, BUAP;Facultad de Ciencias de la Computación, BUAP;Instituto Nacional de Astrofísica, Óptica y Electrónica
Venue:
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Year:
2010

Citing 7
Cited 0

On the hardness of approximate reasoning

Artificial Intelligence
The Number of Independent Sets in a Grid Graph

SIAM Journal on Discrete Mathematics
Randomized algorithms: approximation, generation, and counting

Randomized algorithms: approximation, generation, and counting
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
Constraint solving via fractional edge covers

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Unique Sink Orientations of Grids

Algorithmica
Efficient coding schemes for the hard-square model

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We research on the possible orientations patterns of a grid graph G, and propose a method for counting certain combinatorial structures over the class of orientations of G. For example, our method can be applied for counting sink-free orientations of G, as well as it can be applied for solving the #2SAT problem for grid Boolean formulas. Our proposal extends the classical transfer matrix method used for counting the number of independent sets in a grid.