The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Georg Gottlob: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefano Ceri, Georg Gottlob
    Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries. [Citation Graph (22, 0)][DBLP]
    IEEE Trans. Software Eng., 1985, v:11, n:4, pp:324-345 [Journal]
  2. Georg Gottlob, Paolo Paolini, Roberto Zicari
    Properties and Update Semantics of Consistent Views. [Citation Graph (15, 36)][DBLP]
    ACM Trans. Database Syst., 1988, v:13, n:4, pp:486-524 [Journal]
  3. Stefano Ceri, Georg Gottlob, Gio Wiederhold
    Interfacing Relational Databases and Prolog Efficiently. [Citation Graph (14, 0)][DBLP]
    Expert Database Conf., 1986, pp:207-223 [Conf]
  4. Stefano Ceri, Georg Gottlob, Luigi Lavazza
    Translation and Optimization of Logic Queries: The Algebraic Approach. [Citation Graph (13, 10)][DBLP]
    VLDB, 1986, pp:395-402 [Conf]
  5. Stefano Ceri, Georg Gottlob, Letizia Tanca
    What you Always Wanted to Know About Datalog (And Never Dared to Ask). [Citation Graph (10, 91)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1989, v:1, n:1, pp:146-166 [Journal]
  6. Georg Gottlob, Michael Schrefl, Brigitte Röck
    Extending Object-Oriented Systems with Roles. [Citation Graph (7, 0)][DBLP]
    ACM Trans. Inf. Syst., 1996, v:14, n:3, pp:268-296 [Journal]
  7. Georg Gottlob, Roberto Zicari
    Closed World Databases Opened Through Null Values. [Citation Graph (6, 24)][DBLP]
    VLDB, 1988, pp:50-61 [Conf]
  8. Georg Gottlob, Nicola Leone, Francesco Scarcello
    The Complexity of Acyclic Conjunctive Queries. [Citation Graph (5, 0)][DBLP]
    FOCS, 1998, pp:706-715 [Conf]
  9. Thomas Eiter, Georg Gottlob
    On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. [Citation Graph (5, 30)][DBLP]
    PODS, 1992, pp:261-273 [Conf]
  10. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Default Logic as a Query Language. [Citation Graph (4, 0)][DBLP]
    KR, 1994, pp:99-108 [Conf]
  11. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Adding Disjunction to Datalog. [Citation Graph (4, 25)][DBLP]
    PODS, 1994, pp:267-278 [Conf]
  12. Georg Gottlob
    Computing Covers for Embedded Functional Dependencies. [Citation Graph (4, 17)][DBLP]
    PODS, 1987, pp:58-69 [Conf]
  13. Thomas Eiter, Georg Gottlob
    On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. [Citation Graph (4, 0)][DBLP]
    Artif. Intell., 1992, v:57, n:2-3, pp:227-270 [Journal]
  14. Stefano Ceri, Georg Gottlob
    Normalization of Relations and PROLOG. [Citation Graph (4, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:6, pp:524-544 [Journal]
  15. Georg Gottlob
    On the Size of Nonredundant FD-Covers. [Citation Graph (4, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:355-360 [Journal]
  16. Thomas Eiter, Georg Gottlob
    Identifying the Minimal Transversals of a Hypergraph and Related Problems. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1278-1304 [Journal]
  17. Stefano Ceri, Stefano Crespi-Reghizzi, Georg Gottlob, F. Lamperti, Luigi Lavazza, Letizia Tanca, Roberto Zicari
    The Algres Project. [Citation Graph (3, 13)][DBLP]
    EDBT, 1988, pp:551-555 [Conf]
  18. Thomas Eiter, Georg Gottlob
    Complexity Aspects of Various Semantics for Disjunctive Databases. [Citation Graph (3, 19)][DBLP]
    PODS, 1993, pp:158-167 [Conf]
  19. Georg Gottlob
    Complexity Results for Nonmonotonic Logics. [Citation Graph (3, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:3, pp:397-425 [Journal]
  20. Thomas Eiter, Georg Gottlob
    Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:114, n:2, pp:231-245 [Journal]
  21. Georg Gottlob, Sherry Marcus, Anil Nerode, Gernot Salzer, V. S. Subrahmanian
    A Non-Ground Realization of the Stable and Well-Founded Semantics. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:166, n:1&2, pp:221-262 [Journal]
  22. Stefano Ceri, Georg Gottlob, Gio Wiederhold
    Efficient Database Access from Prolog. [Citation Graph (3, 0)][DBLP]
    IEEE Trans. Software Eng., 1989, v:15, n:2, pp:153-164 [Journal]
  23. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
    Complexity and Expressive Power of Logic Programming. [Citation Graph (2, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:82-101 [Conf]
  24. Georg Gottlob, Gerti Kappel, Michael Schrefl
    Semantics of Object-Oriented Data Models - The Evolving Algebra Approach. [Citation Graph (2, 0)][DBLP]
    East/West Database Workshop, 1990, pp:144-160 [Conf]
  25. Georg Gottlob, Nicola Leone, Francesco Scarcello
    A Comparison of Structural CSP Decomposition Methods. [Citation Graph (2, 0)][DBLP]
    IJCAI, 1999, pp:394-399 [Conf]
  26. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Hypertree Decompositions and Tractable Queries. [Citation Graph (2, 30)][DBLP]
    PODS, 1999, pp:21-32 [Conf]
  27. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Disjunctive Datalog. [Citation Graph (2, 61)][DBLP]
    ACM Trans. Database Syst., 1997, v:22, n:3, pp:364-418 [Journal]
  28. Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
    Formaiizing the Repair Process. [Citation Graph (1, 0)][DBLP]
    ECAI, 1992, pp:709-713 [Conf]
  29. Georg Gottlob, Guido Moerkotte, V. S. Subrahmanian
    The PARK Semantics for Active Rules. [Citation Graph (1, 11)][DBLP]
    EDBT, 1996, pp:35-55 [Conf]
  30. Thomas Eiter, Georg Gottlob
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1993, pp:526-533 [Conf]
  31. Georg Gottlob, Nicola Leone, Helmut Veith
    Second Order Logic and the Weak Exponential Hierarchies. [Citation Graph (1, 0)][DBLP]
    MFCS, 1995, pp:66-81 [Conf]
  32. Georg Gottlob, Gerti Kappel, Michael Schrefl
    The Evolving Algebra Semantics of Class and Role Hierarchies. [Citation Graph (1, 0)][DBLP]
    Semantics in Databases, 1995, pp:92-113 [Conf]
  33. Thomas Eiter, Georg Gottlob
    Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. [Citation Graph (1, 0)][DBLP]
    ILPS, 1993, pp:266-278 [Conf]
  34. Stefano Ceri, Georg Gottlob, Letizia Tanca, Gio Wiederhold
    Magic Semi-Joins. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:2, pp:97-107 [Journal]
  35. Stefano Ceri, Georg Gottlob, Giuseppe Pelagatti
    Taxonomy and formal properties of distributed joins. [Citation Graph (1, 0)][DBLP]
    Inf. Syst., 1986, v:11, n:1, pp:25-40 [Journal]
  36. Thomas Eiter, Georg Gottlob
    The Complexity of Logic-Based Abduction. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:3-42 [Journal]
  37. Georg Gottlob
    Translating Default Logic into Standard Autoepistemic Logic. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:711-740 [Journal]
  38. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Default Logic as a Query Language. [Citation Graph (1, 37)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1997, v:9, n:3, pp:448-463 [Journal]
  39. Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
    Physical Impossibility Instead of Fault Models. [Citation Graph (0, 0)][DBLP]
    AAAI, 1990, pp:331-336 [Conf]
  40. Georg Gottlob, Reinhard Pichler, Fang Wei
    Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  41. Francesco Buccafurri, Georg Gottlob
    Multiagent Compromises, Joint Fixpoints, and Stable Models. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:561-585 [Conf]
  42. 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. [Citation Graph (0, 0)][DBLP]
    BNCOD, 2006, pp:1-15 [Conf]
  43. Georg Gottlob
    Web Data Extraction for Business Intelligence: The Lixto Approach. [Citation Graph (0, 0)][DBLP]
    BTW, 2005, pp:30-47 [Conf]
  44. Georg Gottlob
    Second-Order Logic over Finite Structures - Report on a Research Programme. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:229-243 [Conf]
  45. Thomas Eiter, Georg Gottlob
    Complexity of Propositional Knowledge Base Revision. [Citation Graph (0, 0)][DBLP]
    CNKBS, 1992, pp:38-40 [Conf]
  46. Georg Gottlob
    Collapsing Oracle-Tape Hierarchies. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:33-42 [Conf]
  47. Georg Gottlob, Christoph Koch
    XPath Query Processing. [Citation Graph (0, 0)][DBLP]
    DBPL, 2003, pp:20- [Conf]
  48. S. Copelli, Georg Gottlob
    Implementation of a Distributed File System on a Geographic Network of Personal Computers. [Citation Graph (0, 0)][DBLP]
    DDSS, 1984, pp:203-219 [Conf]
  49. Georg Gottlob, Nicola Leone, Francesco Scarcello
    On Tractable Queries and Constraints. [Citation Graph (0, 0)][DBLP]
    DEXA, 1999, pp:1-15 [Conf]
  50. Thomas Eiter, Georg Gottlob, Thomas Schwentick
    Second-Order Logic over Strings: Regular and Non-regular Fragments. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:37-56 [Conf]
  51. Georg Gottlob
    The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    ECAI Workshop on Knowledge Representation and Reasoning, 1992, pp:133-144 [Conf]
  52. Georg Gottlob, Martin Hutle, Franz Wotawa
    Combining hypertree, bicomp, and hinge decomposition. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:161-165 [Conf]
  53. Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
    Towards a Theory of the Repair Process. [Citation Graph (0, 0)][DBLP]
    EPIA, 1991, pp:222-236 [Conf]
  54. Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
    Hypothesis Classification, Abductive Diagnosis and Therapy. [Citation Graph (0, 0)][DBLP]
    Expert Systems in Engineering, 1990, pp:69-78 [Conf]
  55. Thomas Eiter, Georg Gottlob, Helmut Veith
    Generalized Quantifiers in Logic Programs. [Citation Graph (0, 0)][DBLP]
    ESSLLI, 1997, pp:72-98 [Conf]
  56. Georg Gottlob, Alexander Leitsch
    Fast Subsumption Algorithms. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:64-77 [Conf]
  57. Thomas Eiter, Georg Gottlob
    The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:1-18 [Conf]
  58. Georg Gottlob
    NP Trees and Carnap's Modal Logic [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:42-51 [Conf]
  59. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:664-674 [Conf]
  60. Georg Gottlob
    Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2004, pp:1-5 [Conf]
  61. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Disjunctive Logic Programming over Finite Structures. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1994, pp:69-73 [Conf]
  62. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Computing LOGCFL Certificates. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:361-371 [Conf]
  63. Georg Gottlob, Reinhard Pichler
    Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:708-719 [Conf]
  64. Robert Baumgartner, Michal Ceresna, Georg Gottlob, Marcus Herzog, Viktor Zigo
    Web Information Acquisition with Lixto Suite. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:747-749 [Conf]
  65. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath Query Evaluation: Improving Time and Space Efficiency. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:379-390 [Conf]
  66. Jürgen Dix, Georg Gottlob, V. Wiktor Marek
    Causal Models of Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:290-302 [Conf]
  67. Thomas Eiter, Georg Gottlob
    Complexity Results for Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:29-44 [Conf]
  68. Robert Baumgartner, Georg Gottlob
    On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:64-69 [Conf]
  69. Robert Baumgartner, Georg Gottlob, Marcus Herzog
    Visual Programming of Web Data Aggregation Applications. [Citation Graph (0, 0)][DBLP]
    IIWeb, 2003, pp:137-142 [Conf]
  70. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of Nested Circumscription and Abnormality Theories. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:169-174 [Conf]
  71. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:634-639 [Conf]
  72. Thomas Eiter, Georg Gottlob, Nicola Leone
    Semantics and Complexity of Abduction from Default Theories. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:870-877 [Conf]
  73. Georg Gottlob
    The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:570-577 [Conf]
  74. Georg Gottlob, Gianluigi Greco, Francesco Scarcello
    The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:150-155 [Conf]
  75. Riccardo Rosati, Georg Gottlob
    Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1378-1383 [Conf]
  76. Georg Gottlob, Gianluigi Greco, Toni Mancini
    Complexity of Pure Equilibria in Bayesian Games. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1294-1299 [Conf]
  77. Georg Gottlob, Gianluigi Greco, Toni Mancini
    Conditional Constraint Satisfaction: Logical Foundations and Complexity. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:88-93 [Conf]
  78. Georg Gottlob, Nicola Leone, Francesco Scarcello
    On the Complexity of Some Inductive Logic Programming Problems. [Citation Graph (0, 0)][DBLP]
    ILP, 1997, pp:17-32 [Conf]
  79. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    IS/KI, 1994, pp:83-103 [Conf]
  80. Thomas Eiter, Georg Gottlob
    Hypergraph Transversal Computation and Related Problems in Logic and AI. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:549-564 [Conf]
  81. Georg Gottlob
    From Carnap's Modal Logic to Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    JELIA, 1994, pp:1-18 [Conf]
  82. 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. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:537-540 [Conf]
  83. Georg Gottlob
    Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract). [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:647-649 [Conf]
  84. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Existential Second-Order Logic over Strings. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:16-27 [Conf]
  85. Georg Gottlob
    Relativized Logspace and Generalized Quantifiers over Finite Structures [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:65-78 [Conf]
  86. Georg Gottlob, Christoph Koch
    Monadic Queries over Tree-Structured Data. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:189-202 [Conf]
  87. Georg Gottlob, Reinhard Pichler
    Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:306-315 [Conf]
  88. Robert Baumgartner, Sergio Flesca, Georg Gottlob
    The Elog Web Extraction Language. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:548-560 [Conf]
  89. Thomas Eiter, Georg Gottlob
    On the Complexity of Theory Curbing. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:1-19 [Conf]
  90. Georg Gottlob, Christos H. Papadimitriou
    On the Complexity of Single-Rule Datalog Queries. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:201-222 [Conf]
  91. Thomas Eiter, Georg Gottlob, Nicola Leone
    Complexity Results for Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:1-14 [Conf]
  92. Thomas Eiter, Georg Gottlob, Helmut Veith
    Modular Logic Programming and Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:290-309 [Conf]
  93. Robert Baumgartner, Sergio Flesca, Georg Gottlob
    Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:21-41 [Conf]
  94. Georg Gottlob
    Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract). [Citation Graph (0, 0)][DBLP]
    LPNMR, 1993, pp:265- [Conf]
  95. Georg Gottlob, Francesco Scarcello, Martha Sideri
    Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:1-18 [Conf]
  96. 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. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:379-383 [Conf]
  97. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Hypertree Decompositions: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:37-57 [Conf]
  98. Georg Gottlob, Michael Schrefl, Markus Stumptner
    On the Interaction between Transitive Closure and Functional Dependencies. [Citation Graph (0, 19)][DBLP]
    MFDBS, 1989, pp:187-206 [Conf]
  99. Georg Gottlob
    Visual Data Extraction Through Visual Logic Programming. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:4- [Conf]
  100. Georg Gottlob
    On the Complexity of Clause Condensing. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1991, pp:16-29 [Conf]
  101. Georg Gottlob
    Computing cores for data exchange: new algorithms and practical solutions. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:148-159 [Conf]
  102. Georg Gottlob, Christoph Koch
    Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. [Citation Graph (0, 0)][DBLP]
    PODS, 2002, pp:17-28 [Conf]
  103. Georg Gottlob, Christoph Koch, Robert Baumgartner, Marcus Herzog, Sergio Flesca
    The Lixto Data Extraction Project - Back and Forth between Theory and Practice. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:1-12 [Conf]
  104. Georg Gottlob, Christoph Koch, Reinhard Pichler
    The complexity of XPath query evaluation. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:179-190 [Conf]
  105. Georg Gottlob, Christoph Koch, Klaus U. Schulz
    Conjunctive Queries over Trees. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:189-200 [Conf]
  106. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  107. Georg Gottlob, Alan Nash
    Data exchange: computing cores in polynomial time. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:40-49 [Conf]
  108. Georg Gottlob, Reinhard Pichler, Fang Wei
    Tractable database design through bounded treewidth. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:124-133 [Conf]
  109. Robert Baumgartner, Thomas Eiter, Georg Gottlob, Marcus Herzog, Christoph Koch
    Information Extraction for the Semantic Web. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2005, pp:275-289 [Conf]
  110. Tim Furche, Benedikt Linse, François Bry, Dimitris Plexousakis, Georg Gottlob
    RDF Querying: Language Constructs and Evaluation Methods Compared. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2006, pp:1-52 [Conf]
  111. Robert Baumgartner, Georg Gottlob, Marcus Herzog, Wolfgang Slany
    Interactively Adding Web Service Interfaces to Existing Web Applications. [Citation Graph (0, 0)][DBLP]
    SAINT, 2004, pp:74-80 [Conf]
  112. Georg Gottlob
    The Lixto Wrapper Generation Tool. [Citation Graph (0, 0)][DBLP]
    SEBD, 2001, pp:3-10 [Conf]
  113. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. [Citation Graph (0, 0)][DBLP]
    SEBD, 2001, pp:147-154 [Conf]
  114. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Hypertree Decompositions and Tractable Queries. [Citation Graph (0, 0)][DBLP]
    SEBD, 1999, pp:275-289 [Conf]
  115. Nicola Leone, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Gianluigi Greco
    Boosting Information Integration: The INFOMIX System. [Citation Graph (0, 0)][DBLP]
    SEBD, 2005, pp:55-66 [Conf]
  116. Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski
    The Personal Publication Reader. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2005, pp:1050-1053 [Conf]
  117. 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. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2005, pp:915-917 [Conf]
  118. Georg Gottlob
    Complexity and Expressive Power of Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    SLP, 1994, pp:23-42 [Conf]
  119. Georg Gottlob, Christoph Koch
    A Formal Comparison of Visual Web Wrapper Generators. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:30-48 [Conf]
  120. Thomas Eiter, Georg Gottlob
    The Complexity of Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:70-79 [Conf]
  121. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New results on monotone dualization and generating hypergraph transversals. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:14-22 [Conf]
  122. Georg Gottlob, Gianluigi Greco, Francesco Scarcello
    Pure Nash equilibria: hard and easy games. [Citation Graph (0, 0)][DBLP]
    TARK, 2003, pp:215-230 [Conf]
  123. Marcus Herzog, Georg Gottlob
    InfoPipes: A Flexible Framework for M-Commerce Applications. [Citation Graph (0, 0)][DBLP]
    TES, 2001, pp:175-186 [Conf]
  124. Robert Baumgartner, Sergio Flesca, Georg Gottlob
    Visual Web Information Extraction with Lixto. [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:119-128 [Conf]
  125. Robert Baumgartner, Sergio Flesca, Georg Gottlob
    Supervised Wrapper Generation with Lixto. [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:715-716 [Conf]
  126. Georg Gottlob, Christoph Koch, Reinhard Pichler
    Efficient Algorithms for Processing XPath Queries. [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:95-106 [Conf]
  127. Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
    Hypertree Decompositions: Structure, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:1-15 [Conf]
  128. 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). [Citation Graph (0, 0)][DBLP]
    WLP, 1997, pp:0-0 [Conf]
  129. Robert Baumgartner, Oliver Frölich, Georg Gottlob, Marcus Herzog, Peter Lehmann
    Integrating Semi-structured Data into Business Applications: A Web Intelligence Example. [Citation Graph (0, 0)][DBLP]
    Wissensmanagement (LNCS Volume), 2005, pp:469-482 [Conf]
  130. Stefano Ceri, Georg Gottlob, Giuseppe Pelagatti
    Joining Fragmented Relations in Distributed Databases. [Citation Graph (0, 0)][DBLP]
    XP4.5 Workshop on Database Theory, 1983, pp:- [Conf]
  131. Georg Gottlob, Leonid Libkin
    Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1990, v:9, n:4, pp:385-402 [Journal]
  132. Francesco Buccafurri, Thomas Eiter, Georg Gottlob, Nicola Leone
    Enhancing Model Checking in Verification by AI Techniques. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:112, n:1-2, pp:57-104 [Journal]
  133. Marco Cadoli, Thomas Eiter, Georg Gottlob
    An Efficient Method for Eliminating Varying Predicates from a Circumscription. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:54, n:2, pp:397-410 [Journal]
  134. Thomas Eiter, Georg Gottlob, Nicola Leone
    Semantics and Complexity of Abduction from Default Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:90, n:1-2, pp:177-223 [Journal]
  135. Georg Gottlob, Christian G. Fermüller
    Removing Redundancy from a Clause. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1993, v:61, n:2, pp:263-289 [Journal]
  136. Georg Gottlob, Nicola Leone, Francesco Scarcello
    A comparison of structural CSP decomposition methods. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:124, n:2, pp:243-282 [Journal]
  137. Georg Gottlob, Zhang Mingyi
    Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:69, n:1-2, pp:329-345 [Journal]
  138. Georg Gottlob, Francesco Scarcello, Martha Sideri
    Fixed-parameter complexity in AI and nonmonotonic reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:138, n:1-2, pp:55-86 [Journal]
  139. Thomas Eiter, Georg Gottlob
    On the Computational Cost of Disjunctive Logic Programming: Propositional Case. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:289-323 [Journal]
  140. Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
    Formalizing the Repair Process - Extended Report. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1994, v:11, n:1-4, pp:187-201 [Journal]
  141. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:111-125 [Journal]
  142. Georg Gottlob, Nicola Leone, Helmut Veith
    Succinctness as a Source of Complexity in Logical Formalisms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:231-260 [Journal]
  143. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of Nested Circumscription and Nested Abnormality Theories [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  144. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
    The DLV System for Knowledge Representation and Reasoning [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  145. Georg Gottlob, Christoph Koch
    Monadic Datalog and the Expressive Power of Languages for Web Information Extraction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  146. Georg Gottlob, Christoph Koch
    A Formal Comparison of Visual Web Wrapper Generators [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  147. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Hypertree Decompositions and Tractable Queries [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  148. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  149. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
    Complexity and expressive power of logic programming. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2001, v:33, n:3, pp:374-425 [Journal]
  150. Georg Gottlob, Michael Schrefl, Markus Stumptner
    Selective Inheritance of Attribute Values in Relational Databases. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:2, pp:187-216 [Journal]
  151. Gerhard Brewka, Georg Gottlob
    Well-Founded Semantics for Default Logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:3/4, pp:221-236 [Journal]
  152. Jürgen Dix, Georg Gottlob, V. Wiktor Marek
    Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:87-100 [Journal]
  153. Thomas Eiter, Georg Gottlob
    Reasoning with parsimonious and moderately grounded expansions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:1-2, pp:31-53 [Journal]
  154. Georg Gottlob, Miroslaw Truszczynski
    Approximating the Stable Model Semantics is Hard. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:123-128 [Journal]
  155. Georg Gottlob
    The Complexity of Default Reasoning under the Stationary Fixed Point Semantics [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:81-92 [Journal]
  156. Georg Gottlob, Reinhard Pichler
    Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:165, n:2, pp:183-207 [Journal]
  157. Georg Gottlob, Christos H. Papadimitriou
    On the complexity of single-rule datalog queries. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:104-122 [Journal]
  158. Georg Gottlob
    Subsumption and Implication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:109-111 [Journal]
  159. Thomas Eiter, Yuri Gurevich, Georg Gottlob
    Existential second-order logic over strings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:1, pp:77-131 [Journal]
  160. Georg Gottlob
    NP Trees and Carnap's Modal Logic. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:2, pp:421-457 [Journal]
  161. Georg Gottlob, Christoph Koch
    Monadic datalog and the expressive power of languages for Web information extraction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:1, pp:74-113 [Journal]
  162. Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
    The complexity of XPath query evaluation and XML typing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:284-335 [Journal]
  163. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential second-order logic over graphs: Charting the tractability frontier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:312-362 [Journal]
  164. Georg Gottlob, Alexander Leitsch
    On the Efficiency of Subsumption Algorithms [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:280-295 [Journal]
  165. Georg Gottlob, Nicola Leone, Francesco Scarcello
    The complexity of acyclic conjunctive queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:3, pp:431-498 [Journal]
  166. Georg Gottlob, Christoph Koch, Klaus U. Schulz
    Conjunctive queries over trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:2, pp:238-272 [Journal]
  167. Francesco Buccafurri, Thomas Eiter, Georg Gottlob, Nicola Leone
    On ACTL Formulas Having Linear Counterexamples. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:463-515 [Journal]
  168. Thomas Eiter, Georg Gottlob
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:497-512 [Journal]
  169. Georg Gottlob
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:1- [Journal]
  170. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Hypertree Decompositions and Tractable Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:3, pp:579-627 [Journal]
  171. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:4, pp:775-808 [Journal]
  172. Thomas Eiter, Georg Gottlob
    Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:33, n:2, pp:167-178 [Journal]
  173. Stefano Ceri, Georg Gottlob
    Optimizing Joins between Two Partitioned Relations in Distributed Databases. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1986, v:3, n:2, pp:183-205 [Journal]
  174. Thomas Eiter, Georg Gottlob
    On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:73-82 [Journal]
  175. Georg Gottlob
    Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:2, pp:545-574 [Journal]
  176. Thomas Eiter, Georg Gottlob
    Mächtigkeit von Logikprogrammierung über Datenbanken. [Citation Graph (0, 0)][DBLP]
    KI, 1996, v:10, n:3, pp:32-39 [Journal]
  177. Thomas Eiter, Georg Gottlob, Nicola Leone
    On the Indiscernibility of Individuals in Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:6, pp:805-824 [Journal]
  178. Anuj Dawar, Georg Gottlob, Lauri Hella
    Capturing Relativized Complexity Classes without Order. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:109-122 [Journal]
  179. Georg Gottlob, Miki Hermann, Michaël Rusinowitch
    2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:639-640 [Journal]
  180. Georg Gottlob, Nicola Leone, Francesco Scarcello
    On the Complexity of Some Inductive Logic Programming Problems. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1999, v:17, n:1, pp:53-75 [Journal]
  181. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:514-537 [Journal]
  182. Georg Gottlob, Reinhard Pichler
    Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:351-378 [Journal]
  183. Georg Gottlob, Christoph Koch
    Logic-based Web Information Extraction. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2004, v:33, n:2, pp:87-94 [Journal]
  184. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath Processing in a Nutshell. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2003, v:32, n:1, pp:12-19 [Journal]
  185. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath processing in a nutshell. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2003, v:32, n:2, pp:21-27 [Journal]
  186. Robert Baumgartner, Georg Gottlob
    Propositional default logics made easier: computational complexity of model checking. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:591-627 [Journal]
  187. Thomas Eiter, Georg Gottlob, Nicola Leone
    Abduction from Logic Programs: Semantics and Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:189, n:1-2, pp:129-177 [Journal]
  188. Georg Gottlob, Nicola Leone, Francesco Scarcello
    Computing LOGCFL certificates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:761-777 [Journal]
  189. Thomas Eiter, Georg Gottlob
    Reasoning under minimal upper bounds in propositional logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:82-115 [Journal]
  190. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of propositional nested circumscription and nested abnormality theories. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:232-272 [Journal]
  191. Georg Gottlob, Erich Grädel, Helmut Veith
    Datalog LITE: a deductive query language with linear time model checking. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2002, v:3, n:1, pp:42-79 [Journal]
  192. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
    The DLV system for knowledge representation and reasoning. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:3, pp:499-562 [Journal]
  193. Georg Gottlob, Christoph Koch, Reinhard Pichler
    Efficient algorithms for processing XPath queries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:2, pp:444-491 [Journal]
  194. Georg Gottlob, Reinhard Pichler, Fang Wei
    Efficient Datalog Abduction through Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1626-1631 [Conf]
  195. Robert Baumgartner, Oliver Frölich, Georg Gottlob
    The Lixto Systems Applications in Business Intelligence and Semantic Web. [Citation Graph (0, 0)][DBLP]
    ESWC, 2007, pp:16-26 [Conf]
  196. Georg Gottlob, Zoltán Miklós, Thomas Schwentick
    Generalized hypertree decompositions: np-hardness and tractable variants. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:13-22 [Conf]
  197. Georg Gottlob, Reinhard Pichler, Fang Wei
    Monadic datalog over finite structures with bounded treewidth. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:165-174 [Conf]
  198. 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. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2007, pp:1-153 [Conf]
  199. Georg Gottlob, Gianluigi Greco
    On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:152-161 [Conf]
  200. Georg Gottlob, Marko Samer
    A Backtracking-Based Algorithm for Computing Hypertree-Decompositions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  201. Georg Gottlob, Christoph Koch, Klaus U. Schulz
    Conjunctive Queries over Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  202. Georg Gottlob, Stephanie Tien Lee
    A logical approach to multicut problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:4, pp:136-141 [Journal]
  203. Georg Gottlob, Gianluigi Greco, Francesco Scarcello
    Pure Nash Equilibria: Hard and Easy Games. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:357-406 [Journal]

  204. Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. [Citation Graph (, )][DBLP]


  205. Ontological Reasoning with F-logic Lite and its Extensions. [Citation Graph (, )][DBLP]


  206. Wormholes of Communication: Interfacing Virtual Worlds and the Real World. [Citation Graph (, )][DBLP]


  207. HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. [Citation Graph (, )][DBLP]


  208. Tree Projections: Game Characterization and Computational Aspects. [Citation Graph (, )][DBLP]


  209. The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. [Citation Graph (, )][DBLP]


  210. Uniform Constraint Satisfaction Problems and Database Theory. [Citation Graph (, )][DBLP]


  211. Tractable Query Answering over Ontologies with Datalog+/-. [Citation Graph (, )][DBLP]


  212. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. [Citation Graph (, )][DBLP]


  213. Tractable Query Answering over Conceptual Schemata. [Citation Graph (, )][DBLP]


  214. Semantic Web Search Based on Ontological Conjunctive Queries. [Citation Graph (, )][DBLP]


  215. Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. [Citation Graph (, )][DBLP]


  216. Datalog±: a unified approach to ontologies and integrity constraints. [Citation Graph (, )][DBLP]


  217. Query Answering in the Description Logic Horn-. [Citation Graph (, )][DBLP]


  218. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. [Citation Graph (, )][DBLP]


  219. Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. [Citation Graph (, )][DBLP]


  220. Querying the Guarded Fragment. [Citation Graph (, )][DBLP]


  221. Balanced Queries: Divide and Conquer. [Citation Graph (, )][DBLP]


  222. Heuristic Methods for Hypertree Decomposition. [Citation Graph (, )][DBLP]


  223. Distributed XML design. [Citation Graph (, )][DBLP]


  224. Size and treewidth bounds for conjunctive queries. [Citation Graph (, )][DBLP]


  225. A general datalog-based framework for tractable query answering over ontologies. [Citation Graph (, )][DBLP]


  226. On the complexity of deriving schema mappings from database instances. [Citation Graph (, )][DBLP]


  227. Alternation as a programming paradigm. [Citation Graph (, )][DBLP]


  228. Inductive reasoning and semantic web search. [Citation Graph (, )][DBLP]


  229. Datalog+/-: A Unified Approach to Ontologies and Integrity Constraints. [Citation Graph (, )][DBLP]


  230. A General Datalog-Based Framework for Tractable Query Answering over Ontologies (extended abstract). [Citation Graph (, )][DBLP]


  231. Combining Semantic Web Search with the Power of Inductive Reasoning. [Citation Graph (, )][DBLP]


  232. Query Answering under Non-guarded Rules in Datalog+/-. [Citation Graph (, )][DBLP]


  233. Combining Semantic Web Search with the Power of Inductive Reasoning. [Citation Graph (, )][DBLP]


  234. Query Rewriting under Non-Guarded Rules. [Citation Graph (, )][DBLP]


  235. Service Marts. [Citation Graph (, )][DBLP]


  236. Web Data Extraction for Service Creation. [Citation Graph (, )][DBLP]


  237. Bounded treewidth as a key to tractability of knowledge representation and reasoning. [Citation Graph (, )][DBLP]


  238. Width Parameters Beyond Tree-width and their Applications. [Citation Graph (, )][DBLP]


  239. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. [Citation Graph (, )][DBLP]


  240. Monadic Datalog over Finite Structures with Bounded Treewidth [Citation Graph (, )][DBLP]


  241. Computational aspects of monotone dualization: A brief survey. [Citation Graph (, )][DBLP]


  242. Hypertree width and related hypergraph invariants. [Citation Graph (, )][DBLP]


Search in 0.213secs, Finished in 0.220secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002