{"type":"link","version":"1.0","title":"Query decomposition with fixed-hop graph expansion for tractable bounded search","author_name":"AI Archs","author_url":"https://ai-arch.pages.dev","provider_name":"AI Archs","provider_url":"https://ai-arch.pages.dev","url":"https://ai-arch.pages.dev/n/pattern-query-decomposition-plus-bounded-graph-expansion","thumbnail_url":"https://ai-arch.pages.dev/og/pattern-query-decomposition-plus-bounded-graph-expansion.png","thumbnail_width":1200,"thumbnail_height":630}