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

Podobne zapisy

• Bounded treewidth as a key to tractability of knowledge representation and reasoning
  od: Gottlob, G, i wsp.
  Wydane: (2010)
• Tractable database design through bounded treewidth
  od: Gottlob, G, i wsp.
  Wydane: (2006)
• Efficient Datalog Abduction through Bounded Treewidth
  od: Gottlob, G, i wsp.
  Wydane: (2007)
• Monadic datalog over finite structures with bounded treewidth
  od: Gottlob, G, i wsp.
  Wydane: (2007)
• Monadic datalog over finite structures of bounded treewidth.
  od: Gottlob, G, i wsp.
  Wydane: (2010)