Georg Gottlob

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