 | 2010 |
|---|
| 250 |       | Bettina Fazzinga,
Giorgio Gianforme,
Georg Gottlob,
Thomas Lukasiewicz:
Semantic Web Search Based on Ontological Conjunctive Queries.
FoIKS 2010: 153-172 |
| 249 | | Georg Gottlob,
Pierre Senellart:
Schema mapping discovery from data instances.
J. ACM 57(2): (2010) |
| 2009 |
|---|
| 248 | | Alessandro Campi,
Georg Gottlob,
Ben Hoye:
Wormholes of Communication: Interfacing Virtual Worlds and the Real World.
AINA 2009: 2-9 |
| 247 | | Andrea Calì,
Georg Gottlob,
Thomas Lukasiewicz:
Tractable Query Answering over Ontologies with Datalog+/-.
Description Logics 2009 |
| 246 | | Andrea Calì,
Georg Gottlob,
Andreas Pieris:
Tractable Query Answering over Conceptual Schemata.
ER 2009: 175-190 |
| 245 | | Georg Gottlob,
Gianluigi Greco,
Zoltán Miklós,
Francesco Scarcello,
Thomas Schwentick:
Tree Projections: Game Characterization and Computational Aspects.
Graph Theory, Computational Intelligence and Thought 2009: 217-226 |
| 244 | | Georg Gottlob,
Gianluigi Greco,
Bruno Marnette:
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results.
Graph Theory, Computational Intelligence and Thought 2009: 87-99 |
| 243 | | Georg Gottlob,
Gianluigi Greco,
Francesco Scarcello:
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions.
ICALP (2) 2009: 16-30 |
| 242 | | Andrea Calì,
Georg Gottlob,
Thomas Lukasiewicz:
Datalog±: a unified approach to ontologies and integrity constraints.
ICDT 2009: 14-30 |
| 241 | | Serge Abiteboul,
Georg Gottlob,
Marco Manna:
Distributed XML design.
PODS 2009: 247-258 |
| 240 | | Georg Gottlob,
Stephanie Tien Lee,
Gregory Valiant:
Size and treewidth bounds for conjunctive queries.
PODS 2009: 45-54 |
| 239 | | Andrea Calì,
Georg Gottlob,
Thomas Lukasiewicz:
A general datalog-based framework for tractable query answering over ontologies.
PODS 2009: 77-86 |
| 238 | | Wolfgang Dvorák,
Georg Gottlob,
Reinhard Pichler,
Stefan Woltran:
Alternation as a programming paradigm.
PPDP 2009: 61-72 |
| 237 |  | Andrea Calì,
Georg Gottlob,
Thomas Lukasiewicz:
A General Datalog-Based Framework for Tractable Query Answering over Ontologies (extended abstract).
SEBD 2009: 29-36 |
| 236 | | Georg Gottlob:
Datalog+/-: A Unified Approach to Ontologies and Integrity Constraints.
SEBD 2009: 5-6 |
| 235 | | Claudia d'Amato,
Nicola Fanizzi,
Bettina Fazzinga,
Georg Gottlob,
Thomas Lukasiewicz:
Combining Semantic Web Search with the Power of Inductive Reasoning.
URSW 2009: 15-26 |
| 234 | | Robert Baumgartner,
Wolfgang Gatterbauer,
Georg Gottlob:
Web Data Extraction System.
Encyclopedia of Database Systems 2009: 3465-3471 |
| 233 | | Georg Gottlob:
Wrapper Stability.
Encyclopedia of Database Systems 2009: 3569-3570 |
| 232 | | Georg Gottlob,
Zoltán Miklós,
Thomas Schwentick:
Generalized hypertree decompositions: NP-hardness and tractable variants.
J. ACM 56(6): (2009) |
| 231 | | Georg Gottlob,
Reinhard Pichler,
Vadim Savenkov:
Normalization and Optimization of Schema Mappings.
PVLDB 2(1): 1102-1113 (2009) |
| 230 | | Robert Baumgartner,
Georg Gottlob,
Marcus Herzog:
Scalable Web Data Extraction for Online Market Intelligence.
PVLDB 2(2): 1512-1523 (2009) |
| 2008 |
|---|
| 229 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation.
AAAI 2008: 1541-1546 |
| 228 | | Francesco Scarcello,
Georg Gottlob,
Gianluigi Greco:
Uniform Constraint Satisfaction Problems and Database Theory.
Complexity of Constraints 2008: 156-195 |
| 227 | | Andrea Calì,
Georg Gottlob,
Michael Kifer:
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints.
Description Logics 2008 |
| 226 | | Thomas Eiter,
Georg Gottlob,
Magdalena Ortiz,
Mantas Simkus:
Query Answering in the Description Logic Horn-.
JELIA 2008: 166-179 |
| 225 | | Andrea Calì,
Georg Gottlob,
Michael Kifer:
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints.
KR 2008: 70-80 |
| 224 | | Artan Dermaku,
Tobias Ganzow,
Georg Gottlob,
Benjamin J. McMahan,
Nysret Musliu,
Marko Samer:
Heuristic Methods for Hypertree Decomposition.
MICAI 2008: 1-11 |
| 223 | | Pierre Senellart,
Georg Gottlob:
On the complexity of deriving schema mappings from database instances.
PODS 2008: 23-32 |
| 222 | | Georg Gottlob,
Marko Samer:
A backtracking-based algorithm for hypertree decomposition.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 221 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Monadic Datalog over Finite Structures with Bounded Treewidth
CoRR abs/0809.3140: (2008) |
| 220 | | Georg Gottlob,
Stefan Szeider:
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems.
Comput. J. 51(3): 303-325 (2008) |
| 219 | | Petr Hlinený,
Sang-il Oum,
Detlef Seese,
Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications.
Comput. J. 51(3): 326-362 (2008) |
| 218 | | Thomas Eiter,
Kazuhisa Makino,
Georg Gottlob:
Computational aspects of monotone dualization: A brief survey.
Discrete Applied Mathematics 156(11): 2035-2049 (2008) |
| 217 | | Georg Gottlob,
Alan Nash:
Efficient core computation in data exchange.
J. ACM 55(2): (2008) |
| 2007 |
|---|
| 216 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Efficient Datalog Abduction through Bounded Treewidth.
AAAI 2007: 1626-1631 |
| 215 | | Georg Gottlob,
Gianluigi Greco:
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition.
ACM Conference on Electronic Commerce 2007: 152-161 |
| 214 | | Robert Baumgartner,
Oliver Frölich,
Georg Gottlob:
The Lixto Systems Applications in Business Intelligence and Semantic Web.
ESWC 2007: 16-26 |
| 213 | | Georg Gottlob,
Gianluigi Greco,
Toni Mancini:
Complexity of Pure Equilibria in Bayesian Games.
IJCAI 2007: 1294-1299 |
| 212 | | Georg Gottlob,
Gianluigi Greco,
Toni Mancini:
Conditional Constraint Satisfaction: Logical Foundations and Complexity.
IJCAI 2007: 88-93 |
| 211 | | Georg Gottlob,
Zoltán Miklós,
Thomas Schwentick:
Generalized hypertree decompositions: np-hardness and tractable variants.
PODS 2007: 13-22 |
| 210 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Monadic datalog over finite structures with bounded treewidth.
PODS 2007: 165-174 |
| 209 | | François Bry,
Norbert Eisinger,
Thomas Eiter,
Tim Furche,
Georg Gottlob,
Clemens Ley,
Benedikt Linse,
Reinhard Pichler,
Fang Wei:
Foundations of Rule-Based Query Answering.
Reasoning Web 2007: 1-153 |
| 208 | | Georg Gottlob,
Marko Samer:
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions
CoRR abs/cs/0701083: (2007) |
| 207 | | Isolde Adler,
Georg Gottlob,
Martin Grohe:
Hypertree width and related hypergraph invariants.
Eur. J. Comb. 28(8): 2167-2181 (2007) |
| 206 | | Georg Gottlob,
Stephanie Tien Lee:
A logical approach to multicut problems.
Inf. Process. Lett. 103(4): 136-141 (2007) |
| 205 | | Georg Gottlob,
Gianluigi Greco:
Combinatorial auctions with tractable winner determination.
SIGecom Exchanges 7(1): 15-18 (2007) |
| 2006 |
|---|
| 204 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning.
AAAI 2006 |
| 203 | | Julien Carme,
Michal Ceresna,
Oliver Frölich,
Georg Gottlob,
Tamir Hassan,
Marcus Herzog,
Wolfgang Holzinger,
Bernhard Krüpl:
The Lixto Project: Exploring New Frontiers of Web Data Extraction.
BNCOD 2006: 1-15 |
| 202 | | Georg Gottlob,
Reinhard Pichler,
Fang Wei:
Tractable database design through bounded treewidth.
PODS 2006: 124-133 |
| 201 | | Georg Gottlob,
Alan Nash:
Data exchange: computing cores in polynomial time.
PODS 2006: 40-49 |
| 200 | | Tim Furche,
Benedikt Linse,
François Bry,
Dimitris Plexousakis,
Georg Gottlob:
RDF Querying: Language Constructs and Evaluation Methods Compared.
Reasoning Web 2006: 1-52 |
| 199 | | Georg Gottlob,
Christoph Koch:
A Formal Comparison of Visual Web Wrapper Generators.
SOFSEM 2006: 30-48 |
| 198 | | Nicola Leone,
Gerald Pfeifer,
Wolfgang Faber,
Thomas Eiter,
Georg Gottlob,
Simona Perri,
Francesco Scarcello:
The DLV system for knowledge representation and reasoning.
ACM Trans. Comput. Log. 7(3): 499-562 (2006) |
| 197 | | Georg Gottlob,
Christoph Koch,
Klaus U. Schulz:
Conjunctive Queries over Trees
CoRR abs/cs/0602004: (2006) |
| 196 | | Georg Gottlob:
Second-Order Logic over Finite Structures - Report on a Research Programme.
Electronic Notes in Discrete Mathematics 27: 41-42 (2006) |
| 195 | | Georg Gottlob,
Christoph Koch,
Klaus U. Schulz:
Conjunctive queries over trees.
J. ACM 53(2): 238-272 (2006) |
| 194 | | Thomas Eiter,
Georg Gottlob:
Reasoning under minimal upper bounds in propositional logic.
Theor. Comput. Sci. 369(1-3): 82-115 (2006) |
| 2005 |
|---|
| 193 | | Georg Gottlob:
Web Data Extraction for Business Intelligence: The Lixto Approach.
BTW 2005: 30-47 |
| 192 | | Riccardo Rosati,
Georg Gottlob:
Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic.
IJCAI 2005: 1378-1383 |
| 191 | | Georg Gottlob,
Gianluigi Greco,
Francesco Scarcello:
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions.
IJCAI 2005: 150-155 |
| 190 | | Fabian Abel,
Robert Baumgartner,
Adrian Brooks,
Christian Enzi,
Georg Gottlob,
Nicola Henze,
Marcus Herzog,
Matthias Kriesell,
Wolfgang Nejdl,
Kai Tomaschewski:
The Personal Publication Reader.
International Semantic Web Conference 2005: 1050-1053 |
| 189 | | Nicola Leone,
Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Georg Gottlob,
Luigi Granata,
Gianluigi Greco,
Edyta Kalka,
Giovambattista Ianni,
Domenico Lembo,
Maurizio Lenzerini,
Vincenzino Lio,
Bartosz Nowicki,
Riccardo Rosati,
Marco Ruzzi,
Witold Staniszkis,
Giorgio Terracina:
Data Integration: a Challenging ASP Application.
LPNMR 2005: 379-383 |
| 188 | | Georg Gottlob:
Computing cores for data exchange: new algorithms and practical solutions.
PODS 2005: 148-159 |
| 187 | | Robert Baumgartner,
Thomas Eiter,
Georg Gottlob,
Marcus Herzog,
Christoph Koch:
Information Extraction for the Semantic Web.
Reasoning Web 2005: 275-289 |
| 186 | | Nicola Leone,
Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Georg Gottlob,
Gianluigi Greco:
Boosting Information Integration: The INFOMIX System.
SEBD 2005: 55-66 |
| 185 | | Nicola Leone,
Gianluigi Greco,
Giovambattista Ianni,
Vincenzino Lio,
Giorgio Terracina,
Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Georg Gottlob,
Riccardo Rosati,
Domenico Lembo,
Maurizio Lenzerini,
Marco Ruzzi,
Edyta Kalka,
Bartosz Nowicki,
Witold Staniszkis:
The INFOMIX system for advanced integration of incomplete and inconsistent data.
SIGMOD Conference 2005: 915-917 |
| 184 | | Georg Gottlob,
Martin Grohe,
Nysret Musliu,
Marko Samer,
Francesco Scarcello:
Hypertree Decompositions: Structure, Algorithms, and Applications.
WG 2005: 1-15 |
| 183 | | Robert Baumgartner,
Oliver Frölich,
Georg Gottlob,
Marcus Herzog,
Peter Lehmann:
Integrating Semi-structured Data into Business Applications: A Web Intelligence Example.
Wissensmanagement (LNCS Volume) 2005: 469-482 |
| 182 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of propositional nested circumscription and nested abnormality theories.
ACM Trans. Comput. Log. 6(2): 232-272 (2005) |
| 181 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
Efficient algorithms for processing XPath queries.
ACM Trans. Database Syst. 30(2): 444-491 (2005) |
| 180 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler,
Luc Segoufin:
The complexity of XPath query evaluation and XML typing.
J. ACM 52(2): 284-335 (2005) |
| 179 | | Georg Gottlob,
Gianluigi Greco,
Francesco Scarcello:
Pure Nash Equilibria: Hard and Easy Games.
J. Artif. Intell. Res. (JAIR) 24: 357-406 (2005) |
| 2004 |
|---|
| 178 | | Georg Gottlob,
András A. Benczúr,
János Demetrovics:
Advances in Databases and Information Systems, 8th East European Conference, ADBIS 2004, Budapest, Hungary, September 22-25, 2004, Proceesing
Springer 2004 |
| 177 | | Georg Gottlob:
Hypergraph Transversals.
FoIKS 2004: 1-5 |
| 176 | | Georg Gottlob:
Second-Order Logic over Finite Structures - Report on a Research Programme.
IJCAR 2004: 229-243 |
| 175 | | Georg Gottlob,
Christoph Koch,
Robert Baumgartner,
Marcus Herzog,
Sergio Flesca:
The Lixto Data Extraction Project - Back and Forth between Theory and Practice.
PODS 2004: 1-12 |
| 174 | | Georg Gottlob,
Christoph Koch,
Klaus U. Schulz:
Conjunctive Queries over Trees.
PODS 2004: 189-200 |
| 173 | | Robert Baumgartner,
Georg Gottlob,
Marcus Herzog,
Wolfgang Slany:
Interactively Adding Web Service Interfaces to Existing Web Applications.
SAINT 2004: 74-80 |
| 172 | | Georg Gottlob,
Christoph Koch:
Monadic datalog and the expressive power of languages for Web information extraction.
J. ACM 51(1): 74-113 (2004) |
| 171 | | Georg Gottlob,
Phokion G. Kolaitis,
Thomas Schwentick:
Existential second-order logic over graphs: Charting the tractability frontier.
J. ACM 51(2): 312-362 (2004) |
| 170 | | Georg Gottlob,
Reinhard Pichler:
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
SIAM J. Comput. 33(2): 351-378 (2004) |
| 169 | | Georg Gottlob,
Christoph Koch:
Logic-based Web Information Extraction.
SIGMOD Record 33(2): 87-94 (2004) |
| 168 | | Georg Gottlob,
Miki Hermann,
Michaël Rusinowitch:
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst. 37(6): 639-640 (2004) |
| 2003 |
|---|
| 167 | | Georg Gottlob,
Toby Walsh:
IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003
Morgan Kaufmann 2003 |
| 166 | | Georg Gottlob,
Christoph Koch:
XPath Query Processing.
DBPL 2003: 20 |
| 165 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
XPath Query Evaluation: Improving Time and Space Efficiency.
ICDE 2003: 379-390 |
| 164 | | Robert Baumgartner,
Michal Ceresna,
Georg Gottlob,
Marcus Herzog,
Viktor Zigo:
Web Information Acquisition with Lixto Suite.
ICDE 2003: 747-749 |
| 163 | | Robert Baumgartner,
Georg Gottlob,
Marcus Herzog:
Visual Programming of Web Data Aggregation Applications.
IIWeb 2003: 137-142 |
| 162 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
The complexity of XPath query evaluation.
PODS 2003: 179-190 |
| 161 | | Georg Gottlob,
Gianluigi Greco,
Francesco Scarcello:
Pure Nash equilibria: hard and easy games.
TARK 2003: 215-230 |
| 160 | | Georg Gottlob,
Christoph Koch:
A Formal Comparison of Visual Web Wrapper Generators
CoRR cs.DB/0310012: (2003) |
| 159 | | Georg Gottlob,
Christos H. Papadimitriou:
On the complexity of single-rule datalog queries.
Inf. Comput. 183(1): 104-122 (2003) |
| 158 | | Georg Gottlob:
Guest Editor's Foreword.
J. Comput. Syst. Sci. 66(1): 1 (2003) |
| 157 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width.
J. Comput. Syst. Sci. 66(4): 775-808 (2003) |
| 156 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals.
SIAM J. Comput. 32(2): 514-537 (2003) |
| 155 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
XPath Processing in a Nutshell.
SIGMOD Record 32(1): 12-19 (2003) |
| 154 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
XPath processing in a nutshell.
SIGMOD Record 32(2): 21-27 (2003) |
| 2002 |
|---|
| 153 | | Francesco Buccafurri,
Georg Gottlob:
Multiagent Compromises, Joint Fixpoints, and Stable Models.
Computational Logic: Logic Programming and Beyond 2002: 561-585 |
| 152 | | Georg Gottlob,
Martin Hutle,
Franz Wotawa:
Combining hypertree, bicomp, and hinge decomposition.
ECAI 2002: 161-165 |
| 151 | | Nicola Leone,
Gerald Pfeifer,
Wolfgang Faber,
Francesco Calimeri,
Tina Dell'Armi,
Thomas Eiter,
Georg Gottlob,
Giovambattista Ianni,
Giuseppe Ielpa,
Christoph Koch,
Simona Perri,
Axel Polleres:
The DLV System.
JELIA 2002: 537-540 |
| 150 | | Thomas Eiter,
Georg Gottlob:
Hypergraph Transversal Computation and Related Problems in Logic and AI.
JELIA 2002: 549-564 |
| 149 | | Georg Gottlob,
Christoph Koch:
Monadic Queries over Tree-Structured Data.
LICS 2002: 189-202 |
| 148 | | Georg Gottlob:
Visual Data Extraction Through Visual Logic Programming.
NMR 2002: 4 |
| 147 | | Georg Gottlob,
Christoph Koch:
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction.
PODS 2002: 17-28 |
| 146 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New results on monotone dualization and generating hypergraph transversals.
STOC 2002: 14-22 |
| 145 | | Georg Gottlob,
Christoph Koch,
Reinhard Pichler:
Efficient Algorithms for Processing XPath Queries.
VLDB 2002: 95-106 |
| 144 | | Georg Gottlob,
Erich Grädel,
Helmut Veith:
Datalog LITE: a deductive query language with linear time model checking.
ACM Trans. Comput. Log. 3(1): 42-79 (2002) |
| 143 | | Georg Gottlob,
Francesco Scarcello,
Martha Sideri:
Fixed-parameter complexity in AI and nonmonotonic reasoning.
Artif. Intell. 138(1-2): 55-86 (2002) |
| 142 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of Nested Circumscription and Nested Abnormality Theories
CoRR cs.AI/0207072: (2002) |
| 141 | | Nicola Leone,
Gerald Pfeifer,
Wolfgang Faber,
Thomas Eiter,
Georg Gottlob,
Simona Perri,
Francesco Scarcello:
The DLV System for Knowledge Representation and Reasoning
CoRR cs.AI/0211004: (2002) |
| 140 | | Georg Gottlob,
Christoph Koch:
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
CoRR cs.DB/0211020: (2002) |
| 139 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals
CoRR cs.DS/0204009: (2002) |
| 138 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Hypertree Decompositions and Tractable Queries.
J. Comput. Syst. Sci. 64(3): 579-627 (2002) |
| 137 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Computing LOGCFL certificates.
Theor. Comput. Sci. 270(1-2): 761-777 (2002) |
| 136 | | Robert Baumgartner,
Georg Gottlob:
Propositional default logics made easier: computational complexity of model checking.
Theor. Comput. Sci. 289(1): 591-627 (2002) |
| 2001 |
|---|
| 135 | | Thomas Eiter,
Georg Gottlob,
Thomas Schwentick:
Second-Order Logic over Strings: Regular and Non-regular Fragments.
Developments in Language Theory 2001: 37-56 |
| 134 | | Georg Gottlob,
Reinhard Pichler:
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
ICALP 2001: 708-719 |
| 133 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of Nested Circumscription and Abnormality Theories.
IJCAI 2001: 169-174 |
| 132 | | Robert Baumgartner,
Sergio Flesca,
Georg Gottlob:
The Elog Web Extraction Language.
LPAR 2001: 548-560 |
| 131 | | Robert Baumgartner,
Sergio Flesca,
Georg Gottlob:
Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto.
LPNMR 2001: 21-41 |
| 130 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Hypertree Decompositions: A Survey.
MFCS 2001: 37-57 |
| 129 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width.
PODS 2001 |
| 128 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width.
SEBD 2001: 147-154 |
| 127 | | Georg Gottlob:
The Lixto Wrapper Generation Tool.
SEBD 2001: 3-10 |
| 126 | | Marcus Herzog,
Georg Gottlob:
InfoPipes: A Flexible Framework for M-Commerce Applications.
TES 2001: 175-186 |
| 125 | | Robert Baumgartner,
Sergio Flesca,
Georg Gottlob:
Visual Web Information Extraction with Lixto.
VLDB 2001: 119-128 |
| 124 | | Robert Baumgartner,
Sergio Flesca,
Georg Gottlob:
Supervised Wrapper Generation with Lixto.
VLDB 2001: 715-716 |
| 123 | | Evgeny Dantsin,
Thomas Eiter,
Georg Gottlob,
Andrei Voronkov:
Complexity and expressive power of logic programming.
ACM Comput. Surv. 33(3): 374-425 (2001) |
| 122 | | Georg Gottlob,
Reinhard Pichler:
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models.
Inf. Comput. 165(2): 183-207 (2001) |
| 121 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
The complexity of acyclic conjunctive queries.
J. ACM 48(3): 431-498 (2001) |
| 120 | | Francesco Buccafurri,
Thomas Eiter,
Georg Gottlob,
Nicola Leone:
On ACTL Formulas Having Linear Counterexamples.
J. Comput. Syst. Sci. 62(3): 463-515 (2001) |
| 2000 |
|---|
| 119 | | Georg Gottlob,
Phokion G. Kolaitis,
Thomas Schwentick:
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.
FOCS 2000: 664-674 |
| 118 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Theory Curbing.
LPAR 2000: 1-19 |
| 117 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
A comparison of structural CSP decomposition methods.
Artif. Intell. 124(2): 243-282 (2000) |
| 116 | | Thomas Eiter,
Yuri Gurevich,
Georg Gottlob:
Existential second-order logic over strings.
J. ACM 47(1): 77-131 (2000) |
| 115 | | Georg Gottlob:
Report on PODS 2000.
SIGACT News 31(3): 43-46 (2000) |
| 1999 |
|---|
| 114 | | Georg Gottlob,
Etienne Grandjean,
Katrin Seyr:
Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings
Springer 1999 |
| 113 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
On Tractable Queries and Constraints.
DEXA 1999: 1-15 |
| 112 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Computing LOGCFL Certificates.
ICALP 1999: 361-371 |
| 111 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
A Comparison of Structural CSP Decomposition Methods.
IJCAI 1999: 394-399 |
| 110 | | Robert Baumgartner,
Georg Gottlob:
On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases.
IJCAI 1999: 64-69 |
| 109 | | Georg Gottlob,
Reinhard Pichler:
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models.
LICS 1999: 306-315 |
| 108 | | Georg Gottlob,
Christos H. Papadimitriou:
On the Complexity of Single-Rule Datalog Queries.
LPAR 1999: 201-222 |
| 107 | | Georg Gottlob,
Francesco Scarcello,
Martha Sideri:
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning.
LPNMR 1999: 1-18 |
| 106 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Hypertree Decompositions and Tractable Queries.
PODS 1999: 21-32 |
| 105 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Hypertree Decompositions and Tractable Queries.
SEBD 1999: 275-289 |
| 104 | | Georg Gottlob,
Nicola Leone,
Helmut Veith:
Succinctness as a Source of Complexity in Logical Formalisms.
Ann. Pure Appl. Logic 97(1-3): 231-260 (1999) |
| 103 | | Francesco Buccafurri,
Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Enhancing Model Checking in Verification by AI Techniques.
Artif. Intell. 112(1-2): 57-104 (1999) |
| 102 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
On the Complexity of Some Inductive Logic Programming Problems.
New Generation Comput. 17(1): 53-75 (1999) |
| 1998 |
|---|
| 101 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
The Complexity of Acyclic Conjunctive Queries.
FOCS 1998: 706-715 |
| 100 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Existential Second-Order Logic over Strings.
LICS 1998: 16-27 |
| 99 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
Hypertree Decompositions and Tractable Queries
CoRR cs.DB/9812022: (1998) |
| 98 | | Thomas Eiter,
Georg Gottlob:
On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic.
J. Symb. Log. 63(1): 73-82 (1998) |
| 97 | | Anuj Dawar,
Georg Gottlob,
Lauri Hella:
Capturing Relativized Complexity Classes without Order.
Math. Log. Q. 44: 109-122 (1998) |
| 1997 |
|---|
| 96 | | Georg Gottlob,
Alexander Leitsch,
Daniele Mundici:
Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings
Springer 1997 |
| 95 | | Thomas Eiter,
Georg Gottlob,
Helmut Veith:
Generalized Quantifiers in Logic Programs.
ESSLLI 1997: 72-98 |
| 94 | | Thomas Eiter,
Georg Gottlob:
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic.
FCT 1997: 1-18 |
| 93 | | Evgeny Dantsin,
Thomas Eiter,
Georg Gottlob,
Andrei Voronkov:
Complexity and Expressive Power of Logic Programming.
IEEE Conference on Computational Complexity 1997: 82-101 |
| 92 | | Georg Gottlob,
Nicola Leone,
Francesco Scarcello:
On the Complexity of Some Inductive Logic Programming Problems.
ILP 1997: 17-32 |
| 91 | | Thomas Eiter,
Georg Gottlob,
Helmut Veith:
Modular Logic Programming and Generalized Quantifiers.
LPNMR 1997: 290-309 |
| 90 | | 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- |
| 89 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Disjunctive Datalog.
ACM Trans. Database Syst. 22(3): 364-418 (1997) |
| 88 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Semantics and Complexity of Abduction from Default Theories.
Artif. Intell. 90(1-2): 177-223 (1997) |
| 87 | | Gerhard Brewka,
Georg Gottlob:
Well-Founded Semantics for Default Logic.
Fundam. Inform. 31(3/4): 221-236 (1997) |
| 86 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Default Logic as a Query Language.
IEEE Trans. Knowl. Data Eng. 9(3): 448-463 (1997) |
| 85 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
On the Indiscernibility of Individuals in Logic Programming.
J. Log. Comput. 7(6): 805-824 (1997) |
| 84 | | Thomas Eiter,
Georg Gottlob:
Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions.
J. Log. Program. 33(2): 167-178 (1997) |
| 83 | | Georg Gottlob:
Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures.
J. Symb. Log. 62(2): 545-574 (1997) |
| 82 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Abduction from Logic Programs: Semantics and Complexity.
Theor. Comput. Sci. 189(1-2): 129-177 (1997) |
| 1996 |
|---|
| 81 | | Georg Gottlob,
Guido Moerkotte,
V. S. Subrahmanian:
The PARK Semantics for Active Rules.
EDBT 1996: 35-55 |
| 80 | | Georg Gottlob:
Collapsing Oracle-Tape Hierarchies.
IEEE Conference on Computational Complexity 1996: 33-42 |
| 79 | | Georg Gottlob:
Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract).
KR 1996: 647-649 |
| 78 | | Georg Gottlob,
Michael Schrefl,
Brigitte Röck:
Extending Object-Oriented Systems with Roles.
ACM Trans. Inf. Syst. 14(3): 268-296 (1996) |
| 77 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems.
Ann. Pure Appl. Logic 78(1-3): 111-125 (1996) |
| 76 | | Georg Gottlob,
Miroslaw Truszczynski:
Approximating the Stable Model Semantics is Hard.
Fundam. Inform. 28(1-2): 123-128 (1996) |
| 75 | | Jürgen Dix,
Georg Gottlob,
V. Wiktor Marek:
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations.
Fundam. Inform. 28(1-2): 87-100 (1996) |
| 74 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
J. Comput. Syst. Sci. 53(3): 497-512 (1996) |
| 73 | | Thomas Eiter,
Georg Gottlob:
Mächtigkeit von Logikprogrammierung über Datenbanken.
KI 10(3): 32-39 (1996) |
| 72 | | Georg Gottlob,
Sherry Marcus,
Anil Nerode,
Gernot Salzer,
V. S. Subrahmanian:
A Non-Ground Realization of the Stable and Well-Founded Semantics.
Theor. Comput. Sci. 166(1&2): 221-262 (1996) |
| 1995 |
|---|
| 71 | | Georg Gottlob,
Moshe Y. Vardi:
Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings
Springer 1995 |
| 70 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Semantics and Complexity of Abduction from Default Theories.
IJCAI (1) 1995: 870-877 |
| 69 | | Georg Gottlob:
Relativized Logspace and Generalized Quantifiers over Finite Structures
LICS 1995: 65-78 |
| 68 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Complexity Results for Abductive Logic Programming.
LPNMR 1995: 1-14 |
| 67 | | Georg Gottlob,
Nicola Leone,
Helmut Veith:
Second Order Logic and the Weak Exponential Hierarchies.
MFCS 1995: 66-81 |
| 66 | | Georg Gottlob,
Gerti Kappel,
Michael Schrefl:
The Evolving Algebra Semantics of Class and Role Hierarchies.
Semantics in Databases 1995: 92-113 |
| 65 | | Thomas Eiter,
Georg Gottlob:
On the Computational Cost of Disjunctive Logic Programming: Propositional Case.
Ann. Math. Artif. Intell. 15(3-4): 289-323 (1995) |
| 64 | | Georg Gottlob:
The Complexity of Default Reasoning under the Stationary Fixed Point Semantics
Inf. Comput. 121(1): 81-92 (1995) |
| 63 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Logic-Based Abduction.
J. ACM 42(1): 3-42 (1995) |
| 62 | | Georg Gottlob:
NP Trees and Carnap's Modal Logic.
J. ACM 42(2): 421-457 (1995) |
| 61 | | Georg Gottlob:
Translating Default Logic into Standard Autoepistemic Logic.
J. ACM 42(4): 711-740 (1995) |
| 60 | | Thomas Eiter,
Georg Gottlob:
Identifying the Minimal Transversals of a Hypergraph and Related Problems.
SIAM J. Comput. 24(6): 1278-1304 (1995) |
| 1994 |
|---|
| 59 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Disjunctive Logic Programming over Finite Structures.
GI Jahrestagung 1994: 69-73 |
| 58 | | Jürgen Dix,
Georg Gottlob,
V. Wiktor Marek:
Causal Models of Disjunctive Logic Programs.
ICLP 1994: 290-302 |
| 57 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics.
IS/KI 1994: 83-103 |
| 56 | | Georg Gottlob:
From Carnap's Modal Logic to Autoepistemic Logic.
JELIA 1994: 1-18 |
| 55 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Default Logic as a Query Language.
KR 1994: 99-108 |
| 54 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Adding Disjunction to Datalog.
PODS 1994: 267-278 |
| 53 | | Georg Gottlob:
Complexity and Expressive Power of Disjunctive Logic Programming.
SLP 1994: 23-42 |
| 52 | | Gerhard Friedrich,
Georg Gottlob,
Wolfgang Nejdl:
Formalizing the Repair Process - Extended Report.
Ann. Math. Artif. Intell. 11(1-4): 187-201 (1994) |
| 51 | | Georg Gottlob,
Zhang Mingyi:
Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity.
Artif. Intell. 69(1-2): 329-345 (1994) |
| 1993 |
|---|
| 50 | | Georg Gottlob,
Alexander Leitsch,
Daniele Mundici:
Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings
Springer 1993 |
| 49 | | Georg Gottlob:
NP Trees and Carnap's Modal Logic
FOCS 1993: 42-51 |
| 48 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
IJCAI 1993: 526-533 |
| 47 | | Georg Gottlob:
The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic.
IJCAI 1993: 570-577 |
| 46 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information.
IJCAI 1993: 634-639 |
| 45 | | Thomas Eiter,
Georg Gottlob:
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics.
ILPS 1993: 266-278 |
| 44 | | Georg Gottlob:
Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract).
LPNMR 1993: 265 |
| 43 | | Thomas Eiter,
Georg Gottlob:
Complexity Aspects of Various Semantics for Disjunctive Databases.
PODS 1993: 158-167 |
| 42 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Logic-Based Abduction.
STACS 1993: 70-79 |
| 41 | | Georg Gottlob,
Christian G. Fermüller:
Removing Redundancy from a Clause.
Artif. Intell. 61(2): 263-289 (1993) |
| 40 | | Thomas Eiter,
Georg Gottlob:
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete.
Theor. Comput. Sci. 114(2): 231-245 (1993) |
| 1992 |
|---|
| 39 | | Alain Pirotte,
Claude Delobel,
Georg Gottlob:
Advances in Database Technology - EDBT'92, 3rd International Conference on Extending Database Technology, Vienna, Austria, March 23-27, 1992, Proceedings
Springer 1992 |
| 38 | | Thomas Eiter,
Georg Gottlob:
Complexity of Propositional Knowledge Base Revision.
CNKBS 1992: 38-40 |
| 37 | | Gerhard Friedrich,
Georg Gottlob,
Wolfgang Nejdl:
Formaiizing the Repair Process.
ECAI 1992: 709-713 |
| 36 | | Georg Gottlob:
The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic.
ECAI Workshop on Knowledge Representation and Reasoning 1992: 133-144 |
| 35 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
PODS 1992: 261-273 |
| 34 | | Thomas Eiter,
Georg Gottlob:
Complexity Results for Logic-Based Abduction.
Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 29-44 |
| 33 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
An Efficient Method for Eliminating Varying Predicates from a Circumscription.
Artif. Intell. 54(2): 397-410 (1992) |
| 32 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
Artif. Intell. 57(2-3): 227-270 (1992) |
| 31 | | Georg Gottlob,
Michael Schrefl,
Markus Stumptner:
Selective Inheritance of Attribute Values in Relational Databases.
Discrete Applied Mathematics 40(2): 187-216 (1992) |
| 30 | | Thomas Eiter,
Georg Gottlob:
Reasoning with parsimonious and moderately grounded expansions.
Fundam. Inform. 17(1-2): 31-53 (1992) |
| 29 | | Georg Gottlob:
Complexity Results for Nonmonotonic Logics.
J. Log. Comput. 2(3): 397-425 (1992) |
| 1991 |
|---|
| 28 | | Georg Gottlob:
On the Complexity of Clause Condensing.
ÖGAI 1991: 16-29 |
| 27 | | Gerhard Friedrich,
Georg Gottlob,
Wolfgang Nejdl:
Towards a Theory of the Repair Process.
EPIA 1991: 222-236 |
| 1990 |
|---|
| 26 | | Georg Gottlob,
Wolfgang Nejdl:
Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings
Springer 1990 |
| 25 | | Stefano Ceri,
Georg Gottlob,
Letizia Tanca:
Logic Programming and Databases
Springer 1990 |
| 24 | | Gerhard Friedrich,
Georg Gottlob,
Wolfgang Nejdl:
Physical Impossibility Instead of Fault Models.
AAAI 1990: 331-336 |
| 23 | | Georg Gottlob,
Gerti Kappel,
Michael Schrefl:
Semantics of Object-Oriented Data Models - The Evolving Algebra Approach.
East/West Database Workshop 1990: 144-160 |
| 22 | | Gerhard Friedrich,
Georg Gottlob,
Wolfgang Nejdl:
Hypothesis Classification, Abductive Diagnosis and Therapy.
Expert Systems in Engineering 1990: 69-78 |
| 21 | | Georg Gottlob,
Leonid Libkin:
Investigation on Armstrong relations, dependency inference, and excluded functional dependencies.
Acta Cybern. 9(4): 385-402 (1990) |
| 1989 |
|---|
| 20 | | Georg Gottlob,
Michael Schrefl,
Markus Stumptner:
On the Interaction between Transitive Closure and Functional Dependencies.
MFDBS 1989: 187-206 |
| 19 | | Stefano Ceri,
Georg Gottlob,
Letizia Tanca:
What you Always Wanted to Know About Datalog (And Never Dared to Ask).
IEEE Trans. Knowl. Data Eng. 1(1): 146-166 (1989) |
| 18 | | Stefano Ceri,
Georg Gottlob,
Gio Wiederhold:
Efficient Database Access from Prolog.
IEEE Trans. Software Eng. 15(2): 153-164 (1989) |
| 17 | | Stefano Ceri,
Georg Gottlob,
Letizia Tanca,
Gio Wiederhold:
Magic Semi-Joins.
Inf. Process. Lett. 33(2): 97-107 (1989) |
| 1988 |
|---|
| 16 | | Stefano Ceri,
Stefano Crespi-Reghizzi,
Georg Gottlob,
F. Lamperti,
Luigi Lavazza,
Letizia Tanca,
Roberto Zicari:
The Algres Project.
EDBT 1988: 551-555 |
| 15 | | Georg Gottlob,
Roberto Zicari:
Closed World Databases Opened Through Null Values.
VLDB 1988: 50-61 |
| 14 | | Georg Gottlob,
Paolo Paolini,
Roberto Zicari:
Properties and Update Semantics of Consistent Views.
ACM Trans. Database Syst. 13(4): 486-524 (1988) |
| 1987 |
|---|
| 13 | | Georg Gottlob:
Computing Covers for Embedded Functional Dependencies.
PODS 1987: 58-69 |
| 12 | | Georg Gottlob:
Subsumption and Implication.
Inf. Process. Lett. 24(2): 109-111 (1987) |
| 11 | | Georg Gottlob:
On the Size of Nonredundant FD-Covers.
Inf. Process. Lett. 24(6): 355-360 (1987) |
| 1986 |
|---|
| 10 | | Stefano Ceri,
Georg Gottlob,
Gio Wiederhold:
Interfacing Relational Databases and Prolog Efficiently.
Expert Database Conf. 1986: 207-223 |
| 9 | | Stefano Ceri,
Georg Gottlob,
Luigi Lavazza:
Translation and Optimization of Logic Queries: The Algebraic Approach.
VLDB 1986: 395-402 |
| 8 | | Stefano Ceri,
Georg Gottlob:
Normalization of Relations and PROLOG.
Commun. ACM 29(6): 524-544 (1986) |
| 7 | | Stefano Ceri,
Georg Gottlob,
Giuseppe Pelagatti:
Taxonomy and formal properties of distributed joins.
Inf. Syst. 11(1): 25-40 (1986) |
| 6 | | Stefano Ceri,
Georg Gottlob:
Optimizing Joins between Two Partitioned Relations in Distributed Databases.
J. Parallel Distrib. Comput. 3(2): 183-205 (1986) |
| 1985 |
|---|
| 5 | | Georg Gottlob,
Alexander Leitsch:
Fast Subsumption Algorithms.
European Conference on Computer Algebra (2) 1985: 64-77 |
| 4 | | Stefano Ceri,
Georg Gottlob:
Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries.
IEEE Trans. Software Eng. 11(4): 324-345 (1985) |
| 3 | | Georg Gottlob,
Alexander Leitsch:
On the Efficiency of Subsumption Algorithms
J. ACM 32(2): 280-295 (1985) |
| 1984 |
|---|
| 2 | | S. Copelli,
Georg Gottlob:
Implementation of a Distributed File System on a Geographic Network of Personal Computers.
DDSS 1984: 203-219 |
| 1983 |
|---|
| 1 | | Stefano Ceri,
Georg Gottlob,
Giuseppe Pelagatti:
Joining Fragmented Relations in Distributed Databases.
XP4.5 Workshop on Database Theory 1983 |
