Tree Decomposition-based Approach for Compiling Independent Sets

[1]  Luc De Raedt,et al.  Inference in Probabilistic Logic Programs using Weighted CNF's , 2011, UAI.

[2]  Adnan Darwiche,et al.  On Compiling System Models for Faster and More Scalable Diagnosis , 2005, AAAI.

[3]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[4]  Masaaki Nishino,et al.  Fast compilation of graph substructures for counting and enumeration , 2018 .

[5]  Kunihiko Sadakane,et al.  Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem , 1995, COCOON.

[6]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[7]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[8]  Markus Chimani,et al.  Improved Steiner tree algorithms for bounded treewidth , 2012, J. Discrete Algorithms.

[9]  Takanori Maehara,et al.  Algorithmic Meta-Theorems for Monotone Submodular Maximization , 2018, ArXiv.

[10]  Stephen T. Hedetniemi,et al.  Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs , 1979, Inf. Process. Lett..

[11]  Brian C. Williams,et al.  DNNF-based Belief State Estimation , 2006, AAAI.

[12]  Manfred Jaeger,et al.  Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..

[13]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[14]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[15]  Peter Willett,et al.  CLIP: Similarity Searching of 3D Databases Using Clique Detection , 2003, J. Chem. Inf. Comput. Sci..

[16]  Guy Van den Broeck,et al.  Probabilistic Sentential Decision Diagrams , 2014, KR.

[17]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[18]  Takeru Inoue,et al.  Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation , 2017, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[19]  Guy Van den Broeck.  Lifted Inference and Learning in Statistical Relational Models , 2013 .

[20]  Paul S. Bonsma,et al.  The Fine Details of Fast Dynamic Programming over Tree Decompositions , 2013, IPEC.

[21]  R. Halin.  S-functions for graphs , 1976 .

[22]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[23]  Theodoros Rekatsinas,et al.  Local structure and determinism in probabilistic databases , 2012, SIGMOD Conference.

[24]  Masaaki Nagata,et al.  Zero-Suppressed Sentential Decision Diagrams , 2016, AAAI.

[25]  Hiroshi Imai,et al.  Computing the Tutte Polynomial of a Graph of Moderate Size , 1995, ISAAC.

[26]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[27]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[28]  Adnan Darwiche,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence SDD: A New Canonical Representation of Propositional Knowledge Bases , 2022 .

[29]  Donald E. Knuth,et al.  The Art of Computer Programming: Combinatorial Algorithms, Part 1 , 2011 .

[30]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[31]  Masaaki Nagata,et al.  Compiling Graph Substructures into Sentential Decision Diagrams , 2017, AAAI.

[32]  Luc De Raedt,et al.  Lifted Probabilistic Inference by First-Order Knowledge Compilation , 2011, IJCAI.

[33]  Guy Van den Broeck.  On the Completeness of First-Order Knowledge Compilation for Lifted Probabilistic Inference , 2011, NIPS.

[34]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[35]  Guy Van den Broeck,et al.  On the Role of Canonicity in Knowledge Compilation , 2015, AAAI.

[36]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[37]  Guillaume Bagan,et al.  MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay , 2006, CSL.

[38]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[39]  Antoine Amarilli,et al.  A Circuit-Based Approach to Efficient Enumeration , 2017, ICALP.

[40]  Jerry Li,et al.  Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases , 2013, UAI.

[41]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[42]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[43]  Luc Segoufin,et al.  Enumeration of monadic second-order queries on trees , 2013, TOCL.

[44]  R Samudrala,et al.  A graph-theoretic algorithm for comparative modeling of protein structure. , 1998, Journal of molecular biology.

[45]  Luc Segoufin,et al.  First-order query evaluation on structures of bounded degree , 2011, Log. Methods Comput. Sci..

[46]  J.H. Patel,et al.  Test set compaction algorithms for combinational circuits , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[47]  Jinbo Huang,et al.  Combining Knowledge Compilation and Search for Conformant Probabilistic Planning , 2006, ICAPS.

[48]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[49]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..