TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Georg Gottlob

Em.O.Univ.Prof. Dipl.-Ing. Dr.techn.

Research Focus

  • Information Systems Engineering: 20%
  • Logic and Computation: 80%

Research Areas

  • Database Theory, Complexity in Artificial Intelligence and logic programming, Semistructured Data, XML, Data Extraction and Integration, Complexity Theory, Finite Model Theory and Descriptive Complexity, Problem decomposition techniques based on graphs and hypergraphs, Computational Logic, Knowledge Representation and Reasoning, Constraint Satisfaction Problems
Georg Gottlob

About

Basic Research in Computer Science, in particular "Database Theory and Knowledge Representation"; applied Research on Web data extraction

Role

Contact

2024W

2025S

 

2024

2023

2022

  • Fast and parallel decomposition of constraint satisfaction problems / Gottlob, G., Okulmus, C., & Pichler, R. (2022). Fast and parallel decomposition of constraint satisfaction problems. Constraints, 27, 284–326. https://doi.org/10.1007/s10601-022-09332-1
    Project: HyperTrac (2018–2022)
  • MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory and Practice of Logic Programming, 22(5), 678–692. https://doi.org/10.1017/S1471068422000199
    Project: HyperTrac (2018–2022)
  • New Perspectives for Fuzzy Datalog (Extended Abstract) / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). New Perspectives for Fuzzy Datalog (Extended Abstract). In Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) co-located with the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR} 2022) (pp. 42–47). http://hdl.handle.net/20.500.12708/175762
    Download: PDF (1.17 MB)
    Project: HyperTrac (2018–2022)
  • Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth / Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2022). Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 325–336). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524153
    Project: HyperTrac (2018–2022)
  • Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports / Cheng, Z., Wu, L., Thomas Lukasiewicz, Emanuel Sallinger, & Georg Gottlob. (2022). Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports. In M. Ramanath & T. Palpanas (Eds.), Proceedings of the Workshops of the EDBT/ICDT 2022 Joint Conference. http://hdl.handle.net/20.500.12708/192765

2021

2020

  • An Evolutionary Algorithm for Rule Learning over Knowledge Graphs / Wu, L., Sallinger, E., Sherkhonov, E., Vahdati, S., & Gottlob, G. (2020). An Evolutionary Algorithm for Rule Learning over Knowledge Graphs. In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020 (pp. 52–59). http://hdl.handle.net/20.500.12708/58744
    Project: KnowledgeGraph (2020–2028)
  • Fractional Covers of Hypergraphs with BoundedMulti-Intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Fractional Covers of Hypergraphs with BoundedMulti-Intersection. In 45th International Symposium on Mathematical Foundations of Computer Science August 24-28, 2020, Prague (Czech Republic) (pp. 1–14). https://doi.org/10.4230/LIPIcs.MFCS.2020.41
  • Complexity Analysis of General and Fractional Hypertree Decompositions / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Complexity Analysis of General and Fractional Hypertree Decompositions (p. 54). arXiv. https://doi.org/10.48550/arXiv.2002.05239
  • The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions / Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., & Pichler, R. (2020). The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 3–21). Springer. https://doi.org/10.1007/978-3-030-58942-4_1
    Project: HyperTrac (2018–2022)

2019

  • VADA: an architecture for end user informed data preparation / Konstantinou, N., Abel, E., Bellomarini, L., Bogatu, A. T., Civili, C., Irfanie, E., Köhler, M., Lacramioara, M., Sallinger, E., Fernandes, A. A. A., Gottlob, G., Keane, J. A., & Paton, N. W. (2019). VADA: an architecture for end user informed data preparation. Journal Of Big Data, 6(74). https://doi.org/10.1186/s40537-019-0237-9
  • Vadalog: Recent Advances and Applications / Gottlob, G., Sallinger, E., & Pieris, A. (2019). Vadalog: Recent Advances and Applications. In Logics in Artificial Intelligence 16th European Conference, JELIA 2019, Rende, Italy, May 7–11, 2019, Proceedings. JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence, Rende, Kalbrien, Italy. Springer. https://doi.org/10.1007/978-3-030-19570-0_2
  • Parallel Computation of Generalized Hypertree Decompositions / Gottlob, G., Pichler, R., & Okulmus, C. (2019). Parallel Computation of Generalized Hypertree Decompositions. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57860
    Project: HyperTrac (2018–2022)
  • HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings / Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2019). HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019.}, (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55517
    Project: HyperTrac (2018–2022)
  • Semantic Width Revisited (Extended Abstract) / Gottlob, G., Lanzinger, M., & Pichler, R. (2019). Semantic Width Revisited (Extended Abstract). In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55515
    Project: HyperTrac (2018–2022)
  • The Space-Efficient Core of Vadalog / Berger, G., Gottlob, G., Pieris, A., & Sallinger, E. (2019). The Space-Efficient Core of Vadalog. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). https://doi.org/10.1145/3294052.3319688
  • Datalog: Bag Semantics via Set Semantics / Bertossi, L., Gottlob, G., & Pichler, R. (2019). Datalog: Bag Semantics via Set Semantics. In P. Barcelo & M. Calutti (Eds.), 22nd International Conference on Database Theory, {ICDT} 2019 (pp. 16:1-16:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2019.16
  • HyperBench / Fischl, W., Longo, D. M., Gottlob, G., & Pichler, R. (2019). HyperBench. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). ACM. https://doi.org/10.1145/3294052.3319683
    Project: HyperTrac (2018–2022)
  • Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems / Lanzinger, M., Gottlob, G., & Pichler, R. (2019). Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems. In noch nicht bekannt (pp. 1–2). http://hdl.handle.net/20.500.12708/57793

2018

2017

  • Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability / Gottlob, G., Pichler, R., & Sallinger, E. (2017). Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. In E. Sallinger (Ed.), 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, AMW 2017 (pp. 1–5). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/57055
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Swift Logic for Big Data and Knowledge Graphs / Bellomarini, L., Gottlob, G., Pieris, A., & Sallinger, E. (2017). Swift Logic for Big Data and Knowledge Graphs. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia. https://doi.org/10.24963/ijcai.2017/1
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Answer Set Programming with External Source Access / Eiter, T., Kaminski, T. D., Redl, C., Schüller, P., & Weinzierl, A. (2017). Answer Set Programming with External Source Access. In G. Ianni, D. Lembo, L. Bertossi, W. Faber, B. Glimm, G. Gottlob, & S. Staab (Eds.), Reasoning Web. Semantic Interoperability on the Web : 13th International Summer School 2017, London, UK, July 7-11, 2017, Tutorial Lectures. Springer. https://doi.org/10.1007/978-3-319-61033-7_7
    Download: PDF (662 KB)
  • Preface of the Special Issue in Memoriam Helmut Veith / Gottlob, G., Henzinger, T. A., & Weissenbacher, G. (2017). Preface of the Special Issue in Memoriam Helmut Veith. Formal Methods in System Design, 51(2), 267–269. https://doi.org/10.1007/s10703-017-0307-6

2016

  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2016). The Impact of Active Domain Predicates on Guarded Existential Rules. In M. M. Ortiz de la Fuente & S. Schlobach (Eds.), Web Reasoning and Rule Systems (pp. 94–110). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-45276-0_8
    Projects: HINT (2012–2017) / START (2014–2022)
  • A Datalog-Based Language for Querying RDF Graphs / Arenas, M., Gottlob, G., & Pieris, A. (2016). A Datalog-Based Language for Querying RDF Graphs. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56548
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Semantic Acyclicity Under Constraints / Barcelo, P., Gottlob, G., & Pieris, A. (2016). Semantic Acyclicity Under Constraints. In T. Milo & W.-C. Tang (Eds.), Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2902251.2902302
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Semantic Acyclicity Under Constraints / Barceló, P., Gottlob, G., & Pieris, A. (2016). Semantic Acyclicity Under Constraints. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56547
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)

2015

  • Function Symbols in Tuple-Generating Dependencies / Gottlob, G., Pichler, R., & Sallinger, E. (2015). Function Symbols in Tuple-Generating Dependencies. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745756
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Chase Termination for Guarded Existential Rules / Calautti, M., Gottlob, G., & Pieris, A. (2015). Chase Termination for Guarded Existential Rules. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745773
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations / Gottlob, G., Manna, M., & Pieris, A. (2015). Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations. In Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56410
    Project: START (2014–2022)
  • Chase Termination for Guarded Existential Rules / Calautti, M., Gottlob, G., & Pieris, A. (2015). Chase Termination for Guarded Existential Rules. In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56099
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Binary Frontier-Guarded ASP with Function Symbols / Šimkus, M. (2015). Binary Frontier-Guarded ASP with Function Symbols. In N. Bassiliades, G. Gottlob, F. Sadri, A. Paschke, & D. Roman (Eds.), Rule Technologies: Foundations, Tools, and Applications (pp. 311–327). Springer LNCS. https://doi.org/10.1007/978-3-319-21542-6_20
    Projects: HINT (2012–2017) / Hybride Wissensbasen (2008–2012) / SEE (2012–2016)
  • Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/- / Gottlob, G., Orsi, G., & Pieris, A. (2015). Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/-. In Rule Technologies: Foundations, Tools, and Applications (pp. 35–53). Springer LNCS. https://doi.org/10.1007/978-3-319-21542-6_3
  • Polynomial Rewritings for Linear Existential Rules / Gottlob, G., Manna, M., & Pieris, A. (2015). Polynomial Rewritings for Linear Existential Rules. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 (pp. 2992–2998). AAAI Press. http://hdl.handle.net/20.500.12708/56412
    Project: START (2014–2022)
  • Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue / Gottlob, G., & Pieris, A. (2015). Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue. In roceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 (pp. 2999–3007). AAAI Press. http://hdl.handle.net/20.500.12708/56411
    Project: START (2014–2022)
  • Recent Advances in Datalog+/- / Gottlob, G., Morak, M., & Pieris, A. (2015). Recent Advances in Datalog+/-. In Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31 - August 4, 2015, Tutorial Lectures. (pp. 193–217). Springer. http://hdl.handle.net/20.500.12708/56288
    Project: START (2014–2022)

2014

  • Nested Regular Path Queries in Description Logics (Extended Abstract) / Bienvenu, M., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Nested Regular Path Queries in Description Logics (Extended Abstract). In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55386
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Expressiveness of guarded existential rule languages / Gottlob, G., Rudolph, S., & Simkus, M. (2014). Expressiveness of guarded existential rule languages. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM Press. https://doi.org/10.1145/2594538.2594556
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Planning and Change in Graph Structured Data under Description Logics Constraints / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Planning and Change in Graph Structured Data under Description Logics Constraints. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR-Proceedings. http://hdl.handle.net/20.500.12708/55930
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Combined Complexity of Repair Checking and Consistent Query Answering / Arming, S., Pichler, R., & Sallinger, E. (2014). Combined Complexity of Repair Checking and Consistent Query Answering. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, Cartagena de Indias, Colombia, June 4-6, 2014 (p. 6). CEUR. http://hdl.handle.net/20.500.12708/55791
    Project: HINT (2012–2017)
  • On the Hardness of Counting the Solutions of SPARQL Queries / Pichler, R., & Skritek, S. (2014). On the Hardness of Counting the Solutions of SPARQL Queries. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management (p. 6). CEUR-WS. http://hdl.handle.net/20.500.12708/55783
    Project: SEE (2012–2016)

2013

  • Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization / Gottlob, G., Lanzinger, M. P., Longo, D. M., Okulmus, C., Pichler, R., & Selzer, A. (2013). Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization. In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). CEUR-WS.org. https://doi.org/10.34726/5396
    Download: PDF (932 KB)
    Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes / Feinerer, I., Guagliardo, P., & Franconi, E. (2013). Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes. In G. Gottlob, G. Grasso, D. Olteanu, & C. Schallhart (Eds.), Big Data (pp. 77–91). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39467-6_10
  • Loop Elimination for Database Updates / Savenkov, V., Pichler, R., & Koch, C. (2013). Loop Elimination for Database Updates. In G. Gottlob, G. Grasso, D. Olteanu, & C. Schallhart (Eds.), Big Data (pp. 48–61). Springer. https://doi.org/10.1007/978-3-642-39467-6_8
    Project: HINT (2012–2017)
  • Marco Cadoli's Work on Nonmonotonic Reasoning / Eiter, T., & Gottlob, G. (2013). Marco Cadoli’s Work on Nonmonotonic Reasoning. Intelligenza Artificiale, 7(1), 7–17. http://hdl.handle.net/20.500.12708/155845

2012

  • Datalog and Its Extensions for Semantic Web Databases / Gottlob, G., Orsi, G., Pieris, A., & Šimkus, M. (2012). Datalog and Its Extensions for Semantic Web Databases. In T. Eiter & T. Krennwallner (Eds.), Reasoning Web - Semantic Technologies for Advanced Query Answering 8th International Summer School 2012, Vienna, Austria, September 3-8, 2012. Proceedings (pp. 54–77). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_2

2011

2010

  • Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications / Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., & Pieris, A. (2010). Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. In J.-P. Jouannaud (Ed.), 2010 25th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society. https://doi.org/10.1109/lics.2010.27
  • Ontological reasoning with F-Logic Lite and its extensions / Cali, A., Gottlob, G., Kifer, M., Lukasiewicz, T., & Pieris, A. (2010). Ontological reasoning with F-Logic Lite and its extensions. In M. Fox & D. Poole (Eds.), Proceedings of the 24th National Conference on Artificial Intelligence (AAAI 2010) (pp. 1660–1665). AAAI Press. http://hdl.handle.net/20.500.12708/53559
  • Bounded treewidth as a key to tractability of knowledge representation and reasoning / Gottlob, G., Pichler, R., & Wei, F. (2010). Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artificial Intelligence, 174(1), 105–132. https://doi.org/10.1016/j.artint.2009.10.003
  • Tractable database design and datalog abduction through bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Tractable database design and datalog abduction through bounded treewidth. Information Systems, 35(3), 278–298. https://doi.org/10.1016/j.is.2009.09.003
  • Monadic datalog over finite structures of bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Monadic datalog over finite structures of bounded treewidth. ACM Transactions on Computational Logic, 12(1), 1–48. https://doi.org/10.1145/1838552.1838555
  • Datalog extensions for tractable query answering over ontologies / Cali, A., Gottlob, G., & Lukasiewicz, T. (2010). Datalog extensions for tractable query answering over ontologies. In R. De Virgilio, F. Giunchiglia, & L. Tanca (Eds.), Semantic Web Information Management: A Model-Based Perspective (pp. 249–279). Springer. http://hdl.handle.net/20.500.12708/27045
  • The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey / Eiter, T., Gottlob, G., & Schwentick, T. (2010). The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. In A. Blass, N. Dershowitz, & W. Reisig (Eds.), Fields of Logic and Computation (pp. 227–250). Springer LNCS. https://doi.org/10.1007/978-3-642-15025-8_13
  • Semantic Web search based on ontological conjunctive queries / Fazzinga, B., Gianforme, G., Gottlob, G., & Lukasiewicz, T. (2010). Semantic Web search based on ontological conjunctive queries. In S. Link & H. Prade (Eds.), Foundations of Information and Knowledge Systems (pp. 153–172). Springer LNCS. https://doi.org/10.1007/978-3-642-11829-6_12
  • Combining Semantic Web search with the power of inductive reasoning / d´Amato, C., Fanizzi, N., Fazzinga, B., Gottlob, G., & Lukasiewicz, T. (2010). Combining Semantic Web search with the power of inductive reasoning. In A. Deshpande & A. Hunter (Eds.), Scalable Uncertainty Management (pp. 137–150). Springer LNCS. https://doi.org/10.1007/978-3-642-15951-0_17
  • Inductive reasoning and semantic web search / d’Amato, C., Esposito, F., Fanizzi, N., Fazzinga, B., Gottlob, G., & Lukasiewicz, T. (2010). Inductive reasoning and semantic web search. In S. Shin, S. Ossowski, M. Schumacher, M. J. Palakal, & C.-C. Hung (Eds.), Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10. ACM. https://doi.org/10.1145/1774088.1774397

2009

  • Datalog±: A Unified Approach to Ontologies and Integrity Constraints / Cali, A., Gottlob, G., & Lukasiewicz, T. (2009). Datalog±: A Unified Approach to Ontologies and Integrity Constraints. In V. De Antonellis, S. Castano, B. Catania, & G. Guerrini (Eds.), Proceedings of the 17th Italian Symposium on Advanced Database Systems (SEBD 2009) (pp. 5–6). Seneca Edizioni. http://hdl.handle.net/20.500.12708/53031
  • Alternation as a programming paradigm / Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419
    Project: TTPC (2008–2012)
  • Combining Semantic Web Search with the Power of Inductive Reasoning / d´Amato, C., Fanizzi, N., Fazzinga, B., Gottlob, G., & Lukasiewicz, T. (2009). Combining Semantic Web Search with the Power of Inductive Reasoning. In F. Bobillo, P. C. G. da Costa, C. d´Amato, N. Fanizzi, K. B. Laskey, K. J. Laskey, T. Lukasiewicz, T. Martin, M. Nickles, M. Pool, & P. Smrz (Eds.), Proceedings of the Fifth International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2009) (pp. 15–26). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/53024
  • Tractable Query Answering over Ontologies with Datalog+- / Cali, A., Gottlob, G., & Lukasiewicz, T. (2009). Tractable Query Answering over Ontologies with Datalog+-. In B. Cuenca Grau, I. Horrocks, B. Motik, & U. Sattler (Eds.), Proceedings of the 22nd International Workshop on Description Logics (DL 2009) (pp. 46:1-46:12). CEUR workshop proceedings. http://hdl.handle.net/20.500.12708/53039
  • A general datalog-based framework for tractable query answering over ontologies / Calì, A., Gottlob, G., & Lukasiewicz, T. (2009). A general datalog-based framework for tractable query answering over ontologies. In J. Paredaens & S. Jianwen (Eds.), Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS ’09. ACM Press. https://doi.org/10.1145/1559795.1559809
  • A General Datalog-Based Framework for Tractable Query Answering over Ontologies / Cali, A., Gottlob, G., & Lukasiewicz, T. (2009). A General Datalog-Based Framework for Tractable Query Answering over Ontologies. In V. De Antonellis, S. Castano, B. Catania, & G. Guerrini (Eds.), Proceedings of the 17th Italian Symposium on Advanced Database Systems (SEBD 2009) (pp. 29–36). Seneca Edizioni. http://hdl.handle.net/20.500.12708/53032
  • Datalog±: A Unified Approach to Ontologies and Integrity Constraints / Cali, A., Gottlob, G., & Lukasiewicz, T. (2009). Datalog±: A Unified Approach to Ontologies and Integrity Constraints. In R. Fagin (Ed.), Proceedings of the 12th International Conference on Database Theory (ICDT 2009) (pp. 14–30). ACM International Conference Proceeding Series. http://hdl.handle.net/20.500.12708/53030
  • Normalization and Optimization of Schema Mappings / Gottlob, G., Pichler, R., & Savenkov, V. (2009). Normalization and Optimization of Schema Mappings. In H. V. Jagadish (Ed.), Proceedings of the 35#^{th}Int. Conf. on Very Large Data Bases (p. 12). VLDB Endowment. http://hdl.handle.net/20.500.12708/52806
    Project: SODI (2009–2013)
  • Alternation as a Programming Paradigm / Dvorak, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a Programming Paradigm (DBAI-TR-2009-64). http://hdl.handle.net/20.500.12708/35631

2008

  • Heuristic Methods for Hypertree Decomposition / Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B. J., Musliu, N., & Samer, M. (2008). Heuristic Methods for Hypertree Decomposition. In MICAI 2008: Advances in Artificial Intelligence (pp. 1–11). Springer. https://doi.org/10.1007/978-3-540-88636-5_1
  • Computational Aspects of Monotone Dualization: A Brief Survey / Eiter, T., Makino, K., & Gottlob, G. (2008). Computational Aspects of Monotone Dualization: A Brief Survey. Discrete Applied Mathematics, 156(11), 2035–2049. https://doi.org/10.1016/j.dam.2007.04.017
  • Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation / Gottlob, G., Pichler, R., & Wei, F. (2008). Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. In A. Cohn & D. M. Hamilton (Eds.), AAAI-08/IAAI-08 Proceedings (pp. 1541–1547). AAAI Press. http://hdl.handle.net/20.500.12708/52641
  • Query Answering in the Description Logic Horn-SHIQ / Eiter, T., Gottlob, G., Ortiz, M., & Šimkus, M. (2008). Query Answering in the Description Logic Horn-SHIQ. In S. Hölldobler, C. Lutz, & H. Wansing (Eds.), Logics in Artificial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings (pp. 166–179). Lecture Notes in Artificial Intelligence. https://doi.org/10.1007/978-3-540-87803-2_15
  • From Web Search to Semantic Web Search / Fazzinga, B., Gianforme, G., Gottlob, G., & Lukasiewicz, T. (2008). From Web Search to Semantic Web Search (INFSYS RR-1843-08-11). http://hdl.handle.net/20.500.12708/35362

2007

  • The Lixto Systems Applications in Business Intelligence and Semantic Web / Baumgartner, R., Frölich, O., & Gottlob, G. (2007). The Lixto Systems Applications in Business Intelligence and Semantic Web. In The Semantic Web: Research and Applications (pp. 16–26). Springer-Verlag. https://doi.org/10.1007/978-3-540-72667-8_3
  • Efficient Datalog Abduction through Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2007). Efficient Datalog Abduction through Bounded Treewidth. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/51837
  • Foundations of Rule-Based Query / Bry, F., Eisinger, N., Eiter, T., Furche, T., Gottlob, G., Ley, C., Linse, B., Pichler, R., & Wei, F. (2007). Foundations of Rule-Based Query. In Reasoning Web (pp. 1–153). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/51850
  • Monadic Datalog over Finite Structures with Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2007). Monadic Datalog over Finite Structures with Bounded Treewidth. In P. G. Kolaitis (Ed.), Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART -Symposium on Principles of Database Systems (PODS 2007) (pp. 165–174). ACM. http://hdl.handle.net/20.500.12708/51822

2006

  • Reasoning Under Minimal Upper Bounds in Propositional Logic / Eiter, T., & Gottlob, G. (2006). Reasoning Under Minimal Upper Bounds in Propositional Logic. Theoretical Computer Science, 369, 82–115. http://hdl.handle.net/20.500.12708/173436
  • Conjunctive Queries over Trees / Gottlob, G., Koch, C., & Schulz, K. U. (2006). Conjunctive Queries over Trees. Journal of the ACM, VOL. 53(2), 238–272. http://hdl.handle.net/20.500.12708/173400
  • The DLV System for knowledge representation and reasoning / Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006). The DLV System for knowledge representation and reasoning. ACM Transactions on Computational Logic, VOL. 7(3), 499–562. http://hdl.handle.net/20.500.12708/173399
  • The Lixto Project: Exploring New Frontiers of Web Data Extraction / Carme, J., Ceresna, M., Froelich, O., Gottlob, G., Hassan, T., Herzog, M., Holzinger, W., & Krüpl, B. (2006). The Lixto Project: Exploring New Frontiers of Web Data Extraction. In D. Bell & J. Hong (Eds.), Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23 (pp. 1–15). Springer. http://hdl.handle.net/20.500.12708/51533
  • Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning / Gottlob, G., Pichler, R., & Wei, F. (2006). Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In Proceeding of the Twenty-First National Conference on Artificial Intelligence (pp. 250–256). The AAAI Press. http://hdl.handle.net/20.500.12708/51474
  • Data Exchange: Computing Cores in Polynomial Time / Gottlob, G., & Nash, A. (2006). Data Exchange: Computing Cores in Polynomial Time. In Proceedings of the Twenty-Fifth ACM SIGMOND-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 40–49). ACM Press. http://hdl.handle.net/20.500.12708/51364
  • Tractable Database Design through Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2006). Tractable Database Design through Bounded Treewidth. In Proceedings of the Twenty-Fifth ACM SIGMOND-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 124–133). ACM Press. http://hdl.handle.net/20.500.12708/51363
  • A Formal Comparison of Visual Web Wrapper Generators / Gottlob, G., & Koch, C. (2006). A Formal Comparison of Visual Web Wrapper Generators. In Theory and Practice of Computer Science (pp. 30–48). Springer. http://hdl.handle.net/20.500.12708/51357
    Project: Weblearn (2005–2008)
  • Computational Aspects of Monotone Dualization: A Brief Survey / Eiter, T., Makino, K., & Gottlob, G. (2006). Computational Aspects of Monotone Dualization: A Brief Survey (INFSYS RR-1843-06-01). http://hdl.handle.net/20.500.12708/33067

2005

2004

  • Annotating the Legacy Web with Lixto / Baumgartner, R., Gottlob, G., Herzog, M., & Slany, W. (2004). Annotating the Legacy Web with Lixto. ISWC 2004, Hiroshima, Japan, Austria. http://hdl.handle.net/20.500.12708/84273
  • Generating Wrappers for Web Information Sources / Baumgartner, R., Flesca, S., Gottlob, G., & Herzog, M. (2004). Generating Wrappers for Web Information Sources. Logic Based Information Agents, Dagstuhl, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84272

2003

2002

 

2024

2023

2022

2021

2019

2018

2010

2009

  • Wrapper adaptation and generic wrappers / Chandradoss, R. J. (2009). Wrapper adaptation and generic wrappers [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/177810

2008

2007

2006

2005

2004

2003

2002

2001

 

  • ExtraLytics
    2014 / ERC Europäischer Forschungsrat
  • DIADEM: Domain-centric Intelligent Automated Data Extraction Methodology
    2010 / ERC Europäischer Forschungsrat
  • Full Member of the Austrian Academy of Sciences
    2004 / Mitgliedschaft / Austria
  • Fellow of ECCAI, the European Artificial Intelligence Society
    2002 / Austria
  • Best Paper Award at the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin
    2002 / USA
  • Honorary Scientist of the Guizhou Academy of Sciences, Guyang
    2000 / Mitgliedschaft
  • Elected corresponding member of the Austrian National Academy of Sciences
    1999 / Mitgliedschaft / Austria
  • Best Paper Award at the 5th Int. Conference on Logic Programming and Nonmonotonic Reasoning, El Paso, Texas
    1999 / USA
  • Logik und Algorithmen
    1998 / Wittgenstein-Preis / Austria
  • Senior Fellow of the Christian Doppler Society
    1996 / Austria
  • Silbermedaille der Universität Helsinki f. wiss. Leistungen auf dem Gebiet der Informatik
    1995 / Finland
  • Preis der ital. Vereinigung der Elektronik-Ingenieure f. wiss. Leistungen auf dem Gebiet der Datenbanken
    1988 / Italy (South Tyrol)

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Georg Gottlob’s research profile in TISS .