| 
| |  | |  |
Hypertree Decompositions and Tractable Queries
Note: Links lead to the DBLP on the Web.
Georg Gottlob
86
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: On Tractable Queries and Constraints.
DEXA 1999
: 1-15
85
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: Computing LOGCFL Certificates.
ICALP 1999
: 361-371
84
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: A Comparison of Structural CSP Decomposition Methods.
IJCAI 1999
: 394-399
83
Robert Baumgartner
, Georg Gottlob: On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases.
IJCAI 1999
: 64-69
82
Georg Gottlob,
Reinhard Pichler
: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models.
LICS 1999
: 306-315
81
Georg Gottlob,
Christos H. Papadimitriou
: On the Complexity of Single-Rule Datalog Queries.
LPAR 1999
: 201-222
80
Georg Gottlob,
Francesco Scarcello
,
Martha Sideri
: Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning.
LPNMR 1999
: 1-18
79
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: Hypertree Decompositions and Tractable Queries.
PODS 1999
: 21-32
78
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: Hypertree Decompositions and Tractable Queries.
SEBD 1999
: 275-289
77
Francesco Buccafurri
,
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: Enhancing Model Checking in Verification by AI Techniques.
Artificial Intelligence 112
(1-2): 57-104 (1999)
76
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: On the Complexity of Some Inductive Logic Programming Problems.
New Generation Computing 17
(1): 53-75 (1999)
75
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: The Complexity of Acyclic Conjunctive Queries.
FOCS 1998
: 706-715
74
Thomas Eiter
, Georg Gottlob,
Yuri Gurevich
: Existential Second-Order Logic over Strings.
LICS 1998
: 16-27
73
Thomas Eiter
, Georg Gottlob: The Complexity Class Theta
2
p
: Recent Results and Applications in AI and Modal Logic.
FCT 1997
: 1-18
72
Evgeny Dantsin
,
Thomas Eiter
, Georg Gottlob,
Andrei Voronkov
: Complexity and Expressive Power of Logic Programming.
IEEE Conference on Computational Complexity 1997
: 82-101
71
Georg Gottlob,
Nicola Leone
,
Francesco Scarcello
: On the Complexity of Some Inductive Logic Programming Problems.
ILP 1997
: 17-32
70
Thomas Eiter
, Georg Gottlob,
Helmut Veith
: Modular Logic Programming and Generalized Quantifiers.
LPNMR 1997
: 290-309
69
Simona Citrigno
,
Thomas Eiter
,
Wolfgang Faber
, Georg Gottlob,
Christoph Koch
,
Nicola Leone
,
Cristinel Mateis
,
Gerald Pfeifer
,
Francesco Scarcello
: The dlv System: Model Generator and Advanced Frontends (system description).
WLP 1997
: 0-
68
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: Semantics and Complexity of Abduction from Default Theories.
Artificial Intelligence 90
(1-2): 177-223 (1997)
67
Gerhard Brewka
, Georg Gottlob: Well-Founded Semantics for Default Logic.
Fundamenta Informaticae 31
(3/4): 221-236 (1997)
66
Thomas Eiter
, Georg Gottlob: Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions.
JLP 33
(2): 167-178 (1997)
65
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: On the Indiscernibility of Individuals in Logic Programming.
Journal of Logic and Computation 7
(6): 805-824 (1997)
64
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: Abduction from Logic Programs: Semantics and Complexity.
TCS 189
(1-2): 129-177 (1997)
63
Marco Cadoli
,
Thomas Eiter
, Georg Gottlob: Default Logic as a Query Language.
TKDE 9
(3): 448-463 (1997)
62
Thomas Eiter
, Georg Gottlob,
Heikki Mannila
: Disjunctive Datalog.
TODS 22
(3): 364-418 (1997)
61
Georg Gottlob,
Guido Moerkotte
,
V. S. Subrahmanian
: The PARK Semantics for Active Rules.
EDBT 1996
: 35-55
60
Georg Gottlob: Collapsing Oracle-Tape Hierarchies.
IEEE Conference on Computational Complexity 1996
: 33-42
59
Georg Gottlob: Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract).
KR 1996
: 647-649
58
Georg Gottlob,
Miroslaw Truszczynski
: Approximating the Stable Model Semantics is Hard.
Fundamenta Informaticae 28
(1-2): 123-128 (1996)
57
Jürgen Dix
, Georg Gottlob,
V. Wiktor Marek
: Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations.
Fundamenta Informaticae 28
(1-2): 87-100 (1996)
56
Thomas Eiter
, Georg Gottlob: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
JCSS 53
(3): 497-512 (1996)
55
Thomas Eiter
, Georg Gottlob: Mächtigkeit von Logikprogrammierung über Datenbanken.
KI 10
(3): 32-39 (1996)
54
Georg Gottlob,
Sherry Marcus
,
Anil Nerode
,
Gernot Salzer
,
V. S. Subrahmanian
: A Non-Ground Realization of the Stable and Well-Founded Semantics.
TCS 166
(1&2): 221-262 (1996)
53
Georg Gottlob,
Michael Schrefl
,
Brigitte Röck
: Extending Object-Oriented Systems with Roles.
TOIS 14
(3): 268-296 (1996)
52
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: Semantics and Complexity of Abduction from Default Theories.
IJCAI (1) 1995
: 870-877
51
Georg Gottlob: Relativized Logspace and Generalized Quantifiers over Finite Structures.
LICS 1995
: 65-78
50
Thomas Eiter
, Georg Gottlob,
Nicola Leone
: Complexity Results for Abductive Logic Programming.
LPNMR 1995
: 1-14
49
Georg Gottlob,
Nicola Leone
,
Helmut Veith
: Second Order Logic and the Weak Exponential Hierarchies.
MFCS 1995
: 66-81
48
Georg Gottlob,
Gerti Kappel
,
Michael Schrefl
: The Evolving Algebra Semantics of Class and Role Hierarchies.
Semantics in Databases 1995
: 92-113
47
Thomas Eiter
, Georg Gottlob: On the Computational Cost of Disjunctive Logic Programming: Propositional Case.
Annals of Mathematics and Artificial Intelligence 15
(3-4): 289-323 (1995)
46
Georg Gottlob: The Complexity of Default Reasoning under the Stationary Fixed Point Semantics.
Information and Computation 121
(1): 81-92 (1995)
45
Thomas Eiter
, Georg Gottlob: The Complexity of Logic-Based Abduction.
JACM 42
(1): 3-42 (1995)
44
Georg Gottlob: NP Trees and Carnap's Modal Logic.
JACM 42
(2): 421-457 (1995)
43
Georg Gottlob: Translating Default Logic into Standard Autoepistemic Logic.
JACM 42
(4): 711-740 (1995)
42
Thomas Eiter
, Georg Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems.
SIAM J. Comput. 24
(6): 1278-1304 (1995)
41
Jürgen Dix
, Georg Gottlob,
V. Wiktor Marek
: Causal Models of Disjunctive Logic Programs.
ICLP 1994
: 290-302
40
Thomas Eiter
, Georg Gottlob,
Heikki Mannila
: Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics.
IS/KI 1994
: 83-103
39
Georg Gottlob: From Carnap's Modal Logic to Autoepistemic Logic.
JELIA 1994
: 1-18
38
Marco Cadoli
,
Thomas Eiter
, Georg Gottlob: Default Logic as a Query Language.
KR 1994
: 99-108
37
Thomas Eiter
, Georg Gottlob,
Heikki Mannila
: Adding Disjunction to Datalog.
PODS 1994
: 267-278
36
Georg Gottlob: Complexity and Expressive Power of Disjunctive Logic Programming.
SLP 1994
: 23-42
35
Georg Gottlob,
Zhang Mingyi
: Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity.
Artificial Intelligence 69
(1-2): 329-345 (1994)
34
Georg Gottlob: NP Trees and Carnap's Modal Logic.
FOCS 1993
: 42-51
33
Thomas Eiter
, Georg Gottlob: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
IJCAI 1993
: 526-533
32
Georg Gottlob: The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic.
IJCAI 1993
: 570-577
31
Thomas Eiter
, Georg Gottlob,
Yuri Gurevich
: Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information.
IJCAI 1993
: 634-639
30
Thomas Eiter
, Georg Gottlob: Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics.
ILPS 1993
: 266-278
29
Georg Gottlob: Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract).
LPNMR 1993
: 265
28
Thomas Eiter
, Georg Gottlob: Complexity Aspects of Various Semantics for Disjunctive Databases.
PODS 1993
: 158-167
27
Thomas Eiter
, Georg Gottlob: The Complexity of Logic-Based Abduction.
STACS 1993
: 70-79
26
Georg Gottlob,
Christian G. Fermüller
: Removing Redundancy from a Clause.
Artificial Intelligence 61
(2): 263-289 (1993)
25
Thomas Eiter
, Georg Gottlob: Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete.
TCS 114
(2): 231-245 (1993)
24
Gerhard Friedrich
, Georg Gottlob,
Wolfgang Nejdl
: Formaiizing the Repair Process.
ECAI 1992
: 709-713
23
Thomas Eiter
, Georg Gottlob: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
PODS 1992
: 261-273
22
Marco Cadoli
,
Thomas Eiter
, Georg Gottlob: An Efficient Method for Eliminating Varying Predicates from a Circumscription.
Artificial Intelligence 54
(2): 397-410 (1992)
21
Thomas Eiter
, Georg Gottlob: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
Artificial Intelligence 57
(2-3): 227-270 (1992)
20
Georg Gottlob: Complexity Results for Nonmonotonic Logics.
Journal of Logic and Computation 2
(3): 397-425 (1992)
19
Gerhard Friedrich
, Georg Gottlob,
Wolfgang Nejdl
: Physical Impossibility Instead of Fault Models.
AAAI 1990
: 331-336
18
Georg Gottlob,
Gerti Kappel
,
Michael Schrefl
: Semantics of Object-Oriented Data Models - The Evolving Algebra Approach.
East/West Database Workshop 1990
: 144-160
17
Georg Gottlob,
Michael Schrefl
,
Markus Stumptner
: On the Interaction between Transitive Closure and Functional Dependencies.
MFDBS 1989
: 187-206
16
Stefano Ceri
, Georg Gottlob,
Letizia Tanca
,
Gio Wiederhold
: Magic Semi-Joins.
IPL 33
(2): 97-107 (1989)
15
Stefano Ceri
, Georg Gottlob,
Letizia Tanca
: What you Always Wanted to Know About Datalog (And Never Dared to Ask).
TKDE 1
(1): 146-166 (1989)
14
Stefano Ceri
, Georg Gottlob,
Gio Wiederhold
: Efficient Database Access from Prolog.
TSE 15
(2): 153-164 (1989)
13
Stefano Ceri
,
Stefano Crespi-Reghizzi
, Georg Gottlob,
F. Lamperti
,
Luigi Lavazza
,
Letizia Tanca
,
Roberto Zicari
: The Algres Project.
EDBT 1988
: 551-555
12
Georg Gottlob,
Roberto Zicari
: Closed World Databases Opened Through Null Values.
VLDB 1988
: 50-61
11
Georg Gottlob,
Paolo Paolini
,
Roberto Zicari
: Properties and Update Semantics of Consistent Views.
TODS 13
(4): 486-524 (1988)
10
Georg Gottlob: Computing Covers for Embedded Functional Dependencies.
PODS 1987
: 58-69
9
Georg Gottlob: Subsumption and Implication.
IPL 24
(2): 109-111 (1987)
8
Georg Gottlob: On the Size of Nonredundant FD-Covers.
IPL 24
(6): 355-360 (1987)
7
Stefano Ceri
, Georg Gottlob,
Gio Wiederhold
: Interfacing Relational Databases and Prolog Efficiently.
Expert Database Conf. 1986
: 207-223
6
Stefano Ceri
, Georg Gottlob,
Luigi Lavazza
: Translation and Optimization of Logic Queries: The Algebraic Approach.
VLDB 1986
: 395-402
5
Stefano Ceri
, Georg Gottlob: Normalization of Relations and PROLOG.
CACM 29
(6): 524-544 (1986)
4
Stefano Ceri
, Georg Gottlob,
Giuseppe Pelagatti
: Taxonomy and formal properties of distributed joins.
IS 11
(1): 25-40 (1986)
3
Georg Gottlob,
Alexander Leitsch
: On the Efficiency of Subsumption Algorithms.
JACM 32
(2): 280-295 (1985)
2
Stefano Ceri
, Georg Gottlob: Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries.
TSE 11
(4): 324-345 (1985)
1
S. Copelli
, Georg Gottlob: Implementation of a Distributed File System on a Geographic Network of Personal Computers.
DDSS 1984
: 203-219
Copyright(C) 2000 ACM | | | | | | |
