Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

Схожие документы

• Bounded treewidth as a key to tractability of knowledge representation and reasoning
  по: Gottlob, G, и др.
  Опубликовано: (2010)
• Tractable database design through bounded treewidth
  по: Gottlob, G, и др.
  Опубликовано: (2006)
• Efficient Datalog Abduction through Bounded Treewidth
  по: Gottlob, G, и др.
  Опубликовано: (2007)
• Monadic datalog over finite structures with bounded treewidth
  по: Gottlob, G, и др.
  Опубликовано: (2007)
• Monadic datalog over finite structures of bounded treewidth.
  по: Gottlob, G, и др.
  Опубликовано: (2010)