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
On the Complexity of Single−Ru...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
On the Complexity of Single−Rule Datalog Queries
Show other versions (1)
Bibliographic Details
Main Authors:
Gottlob, G
,
Papadimitriou, C
Format:
Conference item
Published:
Springer
1999
Holdings
Description
Other Versions (1)
Similar Items
Staff View
Similar Items
On the complexity of single−rule datalog queries
by: Gottlob, G, et al.
Published: (2003)
Query Answering under Non−guarded Rules in Datalog+/−
by: Calì, A, et al.
Published: (2010)
Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies
by: Gottlob, G, et al.
Published: (2011)
Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies.
by: Gottlob, G, et al.
Published: (2011)
Answering Threshold Queries in Probabilistic Datalog+/- Ontologies.
by: Gottlob, G, et al.
Published: (2011)