Advertisement

Behaviormetrika

, Volume 45, Issue 2, pp 423–450 | Cite as

Fast compilation of graph substructures for counting and enumeration

  • Teruji Sugaya
  • Masaaki Nishino
  • Norihito Yasuda
  • Shin-ichi Minato
Original Paper

Abstract

In this paper, we propose a new compilation method called merging frontier-based search for st simple paths on a graph. Recently, Nishino et al. proposed a top-down construction algorithm, which compiles st simple paths into a zero-suppressed SDD (ZSDD), and they showed that this method is more efficient than simpath by Knuth. However, since the method of Nishino et al. uses ZSDD as a tractable representation, it requires complicated steps for compilation. In this paper, we propose structured Z-d-DNNF, which is a super set of ZSDD. Though this representation relaxed the restriction of ZSDD, it supports important queries like model counting and model enumeration. Using this representation instead of ZSDD, we show that more efficient compilation can be realized for st simple paths.

Keywords

Knowledge compilation ZSDD Frontier-based search Structured Z-d-DNNF 

References

  1. Bordeaux L, Hamadi Y, Kohli P (eds) (2014) Tractability practical approaches to hard problems. Cambridge University Press, CambridgezbMATHGoogle Scholar
  2. Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput 35(8):677–691CrossRefGoogle Scholar
  3. Chavira M, Darwiche A (2008) On probabilistic inference by weighted model counting. Artif Intell 172(6–7):772–799MathSciNetCrossRefGoogle Scholar
  4. Cook W, Seymour PD (2003) Tour merging via branch-decomposition. Informs J Comput 15(3):233–248MathSciNetCrossRefGoogle Scholar
  5. Darwiche A (1999) Compiling knowledge into decomposable negation normal form. In: IJCAI, pp 284–289Google Scholar
  6. Darwiche A (2004) New advances in compiling CNF into decomposable negation normal form. In: ECAI, pp 328–332Google Scholar
  7. Darwiche A (2011) SDD: A new canonical representation of propositional knowledge bases. In: IJCAI, pp 819–826Google Scholar
  8. Darwiche A (2001a) Decomposable negation normal form. J ACM 48(4):608–647MathSciNetCrossRefGoogle Scholar
  9. Darwiche A (2001b) On the tractable counting of theory models and its application to truth maintenance and belief revision. JANCL 11(1–2):11–34MathSciNetzbMATHGoogle Scholar
  10. Darwiche A, Marquis P (2002) A knowledge compilation map. J Artif Intell Res 17:229–264MathSciNetCrossRefGoogle Scholar
  11. Hardy G, Lucet C, Limnios N (2005) Computing all-terminal reliability of stochastic networks with binary decision diagrams. In: ASMDA, pp 1469–74Google Scholar
  12. Kawahara J, Inoue T, Iwashita H, Minato S (2017) Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans 100–A(9):1773–1784CrossRefGoogle Scholar
  13. Knuth DE (2011) The art of computer programming, volume 4A: combinatorial algorithms, part 1. Addison-Wesley Professional, BostonzbMATHGoogle Scholar
  14. Maehara T, Suzuki H, Ishihata M (2017) Exact computation of influence spread by binary decision diagrams. In: WWW, pp 947–956Google Scholar
  15. Minato S (1993) Zero-suppressed bdds for set manipulation in combinatorial problems. In: DAC, pp 272–277Google Scholar
  16. Nishino M, Yasuda N, Minato S, Nagata M (2016) Zero-suppressed sentential decision diagrams. In: AAAI, pp 1058–1066Google Scholar
  17. Nishino M, Yasuda N, Minato S, Nagata M (2017) Compiling graph substructures into sentential decision diagrams. In: AAAI, pp 1213–1221Google Scholar
  18. Oztok U, Darwiche A (2015) A top-down compiler for sentential decision diagrams. In: IJCAI, pp 3141–3148Google Scholar
  19. Pipatsrisawat K, Darwiche A (2008) New compilation languages based on structured decomposability. In: AAAI, pp 517–522Google Scholar
  20. Pipatsrisawat K, Darwiche A (2010) Top-down algorithms for constructing structured DNNF: theoretical and practical implications. In: ECAI, pp 3–8Google Scholar
  21. Robertson N, Seymour PD (1991) Graph minors. X. Obstructions to tree-decomposition. J Comb Theory Ser B 52(2):153–190MathSciNetCrossRefGoogle Scholar

Copyright information

© The Behaviormetric Society 2018

Authors and Affiliations

  1. 1.Graduate School of Information Science and TechnologyHokkaido UniversitySapporoJapan
  2. 2.NTT Communication Science LaboratoriesNTT CorporationKyotoJapan
  3. 3.Graduate School of InformaticsKyoto UniversityKyotoJapan

Personalised recommendations