Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Efficient Datalog Abduction th...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Efficient Datalog Abduction through Bounded Treewidth
Bibliographic Details
Main Authors:
Gottlob, G
,
Pichler, R
,
Wei, F
Format:
Conference item
Published:
AAAI Press
2007
Holdings
Description
Similar Items
Staff View
Similar Items
Monadic datalog over finite structures with bounded treewidth
by: Gottlob, G, et al.
Published: (2007)
Monadic datalog over finite structures of bounded treewidth.
by: Gottlob, G, et al.
Published: (2010)
Tractable database design through bounded treewidth
by: Gottlob, G, et al.
Published: (2006)
Bounded treewidth as a key to tractability of knowledge representation and reasoning
by: Gottlob, G, et al.
Published: (2010)
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
by: Gottlob, G, et al.
Published: (2006)