Georg Gottlob : Publications

Books

• [1]

  Logic Programming and Databases

  Stefano Ceri‚ Georg Gottlob and Letizia Tanca

  Springer. 1990.

  Details about Logic Programming and Databases | BibTeX data for Logic Programming and Databases

Book chapters

• [1]

  Semantic Web Search and Inductive Reasoning

  Claudia d'Amato‚ Nicola Fanizzi‚ Bettina Fazzinga‚ Georg Gottlob and Thomas Lukasiewicz

  In Fernando Bobillo‚ Paulo Cesar G. da Costa‚ Claudia d'Amato‚ Nicola Fanizzi‚ Kathryn B. Laskey‚ Kenneth J. Laskey‚ Thomas Lukasiewicz‚ Matthias Nickles and Michael Pool, editors, Uncertainty Reasoning for the Semantic Web II‚ International Workshops URSW 2008−2010‚ Held at ISWC‚ and UniDL 2010‚ Held at FLoC‚ Revised Selected Papers. Vol. 7123 of Lecture Notes in Computer Science. Pages 237−261. Springer. 2013.

  Details about Semantic Web Search and Inductive Reasoning | BibTeX data for Semantic Web Search and Inductive Reasoning | Link to Semantic Web Search and Inductive Reasoning

• [2]

  Semantic Web Information Management − A Model−Based Perspective

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Roberto De Virgilio‚ Fausto Giunchiglia and Letizia Tanca, editors, Semantic Web Information Management. Pages 249−279. Springer. 2009.

  Details about Semantic Web Information Management − A Model−Based Perspective | BibTeX data for Semantic Web Information Management − A Model−Based Perspective | Link to Semantic Web Information Management − A Model−Based Perspective

Journal papers

• [1]

  Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity

  Georg Gottlob‚ André Hernich‚ Clemens Kupke and Thomas Lukasiewicz

  In Journal of the ACM. Vol. 68. No. 5. Pages 35:1–87. October, 2021.

  Details about Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity | BibTeX data for Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity | Link to Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity

• [2]

  Query Answering under Probabilistic Uncertainty in Datalog+⁄− Ontologies

  Georg Gottlob‚ Thomas Lukasiewicz‚ Maria Vanina Martinez and Gerardo I. Simari

  In Annals of Mathematics and Artificial Intelligence. Vol. 69. No. 1. Pages 37−72. September, 2013.

  Details about Query Answering under Probabilistic Uncertainty in Datalog+⁄− Ontologies | BibTeX data for Query Answering under Probabilistic Uncertainty in Datalog+⁄− Ontologies | Link to Query Answering under Probabilistic Uncertainty in Datalog+⁄− Ontologies

• [3]

  Ontology−Based Semantic Search on the Web and its Combination with the Power of Inductive Reasoning

  Claudia d'Amato‚ Nicola Fanizzi‚ Bettina Fazzinga‚ Georg Gottlob and Thomas Lukasiewicz

  In Annals of Mathematics and Artificial Intelligence. Vol. 65. No. 2/3. Pages 83−121. July, 2012.

  Details about Ontology−Based Semantic Search on the Web and its Combination with the Power of Inductive Reasoning | BibTeX data for Ontology−Based Semantic Search on the Web and its Combination with the Power of Inductive Reasoning | Link to Ontology−Based Semantic Search on the Web and its Combination with the Power of Inductive Reasoning

• [4]

  A General Datalog−Based Framework for Tractable Query Answering over Ontologies

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Journal of Web Semantics. Vol. 14. Pages 57–83. July, 2012.

  Details about A General Datalog−Based Framework for Tractable Query Answering over Ontologies | BibTeX data for A General Datalog−Based Framework for Tractable Query Answering over Ontologies | Link to A General Datalog−Based Framework for Tractable Query Answering over Ontologies

• [5]

  A Logical Toolbox for Ontological Reasoning

  Andrea Calì‚ Georg Gottlob‚ Thomas Lukasiewicz and Andreas Pieris

  In SIGMOD Record. Vol. 40. No. 3. Pages 5–14. 2011.

  Details about A Logical Toolbox for Ontological Reasoning | BibTeX data for A Logical Toolbox for Ontological Reasoning | Link to A Logical Toolbox for Ontological Reasoning

• [6]

  Semantic Web Search Based on Ontological Conjunctive Queries

  Bettina Fazzinga‚ Giorgio Gianforme‚ Georg Gottlob and Thomas Lukasiewicz

  In Journal of Web Semantics. Vol. 9. Pages 453−473. December, 2011.

  Details about Semantic Web Search Based on Ontological Conjunctive Queries | BibTeX data for Semantic Web Search Based on Ontological Conjunctive Queries | Link to Semantic Web Search Based on Ontological Conjunctive Queries

• [7]

  A Backtracking−Based Algorithm for Computing Hypertree−Decompositions

  Georg Gottlob and Marko Samer

  In CoRR. Vol. abs/cs/0701083. 2007.

  Details about A Backtracking−Based Algorithm for Computing Hypertree−Decompositions | BibTeX data for A Backtracking−Based Algorithm for Computing Hypertree−Decompositions | DOI (http://arxiv.org/abs/cs/0701083)

• [8]

  Hypertree width and related hypergraph invariants

  Isolde Adler‚ Georg Gottlob and Martin Grohe

  In Eur. J. Comb.. Vol. 28. No. 8. Pages 2167−2181. 2007.

  Details about Hypertree width and related hypergraph invariants | BibTeX data for Hypertree width and related hypergraph invariants | DOI (10.1016/j.ejc.2007.04.013)

• [9]

  A logical approach to multicut problems

  Georg Gottlob and Stephanie Tien Lee

  In Inf. Process. Lett.. Vol. 103. No. 4. Pages 136−141. 2007.

  Details about A logical approach to multicut problems | BibTeX data for A logical approach to multicut problems | DOI (10.1016/j.ipl.2007.03.005)

• [10]

  The DLV system for knowledge representation and reasoning

  Nicola Leone‚ Gerald Pfeifer‚ Wolfgang Faber‚ Thomas Eiter‚ Georg Gottlob‚ Simona Perri and Francesco Scarcello

  In ACM Trans. Comput. Log.. Vol. 7. No. 3. Pages 499−562. 2006.

  Details about The DLV system for knowledge representation and reasoning | BibTeX data for The DLV system for knowledge representation and reasoning | DOI (10.1145/1149114.1149117)

• [11]

  Conjunctive Queries over Trees

  Georg Gottlob‚ Christoph Koch and Klaus U. Schulz

  In CoRR. Vol. abs/cs/0602004. 2006.

  Details about Conjunctive Queries over Trees | BibTeX data for Conjunctive Queries over Trees | Link to Conjunctive Queries over Trees

• [12]

  Conjunctive queries over trees

  Georg Gottlob‚ Christoph Koch and Klaus U. Schulz

  In J. ACM. Vol. 53. No. 2. Pages 238−272. 2006.

  Details about Conjunctive queries over trees | BibTeX data for Conjunctive queries over trees | DOI (10.1145/1131342.1131345)

• [13]

  Reasoning under minimal upper bounds in propositional logic

  Thomas Eiter and Georg Gottlob

  In Theor. Comput. Sci.. Vol. 369. No. 1−3. Pages 82−115. 2006.

  Details about Reasoning under minimal upper bounds in propositional logic | BibTeX data for Reasoning under minimal upper bounds in propositional logic | DOI (10.1016/j.tcs.2006.07.054)

• [14]

  Complexity of propositional nested circumscription and nested abnormality theories

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In ACM Trans. Comput. Log.. Vol. 6. No. 2. Pages 232−272. 2005.

  Details about Complexity of propositional nested circumscription and nested abnormality theories | BibTeX data for Complexity of propositional nested circumscription and nested abnormality theories | DOI (10.1145/1055686.1055688)

• [15]

  Efficient algorithms for processing XPath queries

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In ACM Trans. Database Syst.. Vol. 30. No. 2. Pages 444−491. 2005.

  Details about Efficient algorithms for processing XPath queries | BibTeX data for Efficient algorithms for processing XPath queries | DOI (10.1145/1071610.1071614)

• [16]

  The complexity of XPath query evaluation and XML typing

  Georg Gottlob‚ Christoph Koch‚ Reinhard Pichler and Luc Segoufin

  In J. ACM. Vol. 52. No. 2. Pages 284−335. 2005.

  Details about The complexity of XPath query evaluation and XML typing | BibTeX data for The complexity of XPath query evaluation and XML typing | DOI (10.1145/1059513.1059520)

• [17]

  Pure Nash Equilibria: Hard and Easy Games

  Georg Gottlob‚ Gianluigi Greco and Francesco Scarcello

  In J. Artif. Intell. Res. (JAIR). Vol. 24. Pages 357−406. 2005.

  Details about Pure Nash Equilibria: Hard and Easy Games | BibTeX data for Pure Nash Equilibria: Hard and Easy Games | Link to Pure Nash Equilibria: Hard and Easy Games

• [18]

  Monadic datalog and the expressive power of languages for Web information extraction

  Georg Gottlob and Christoph Koch

  In J. ACM. Vol. 51. No. 1. Pages 74−113. 2004.

  Details about Monadic datalog and the expressive power of languages for Web information extraction | BibTeX data for Monadic datalog and the expressive power of languages for Web information extraction | DOI (10.1145/962446.962450)

• [19]

  Existential second−order logic over graphs: Charting the tractability frontier

  Georg Gottlob‚ Phokion G. Kolaitis and Thomas Schwentick

  In J. ACM. Vol. 51. No. 2. Pages 312−362. 2004.

  Details about Existential second−order logic over graphs: Charting the tractability frontier | BibTeX data for Existential second−order logic over graphs: Charting the tractability frontier | DOI (10.1145/972639.972646)

• [20]

  Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width

  Georg Gottlob and Reinhard Pichler

  In SIAM J. Comput.. Vol. 33. No. 2. Pages 351−378. 2004.

  Details about Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width | BibTeX data for Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width | DOI (10.1137/S0097539701396807)

• [21]

  Logic−based Web Information Extraction

  Georg Gottlob and Christoph Koch

  In SIGMOD Record. Vol. 33. No. 2. Pages 87−94. 2004.

  Details about Logic−based Web Information Extraction | BibTeX data for Logic−based Web Information Extraction | DOI (10.1145/1024694.1024711) | Download (pdf) of Logic−based Web Information Extraction

• [22]

  2nd International Workshop on Complexity in Automated Deduction (CiAD) − Foreword

  Georg Gottlob‚ Miki Hermann and Michaël Rusinowitch

  In Theory Comput. Syst.. Vol. 37. No. 6. Pages 639−640. 2004.

  Details about 2nd International Workshop on Complexity in Automated Deduction (CiAD) − Foreword | BibTeX data for 2nd International Workshop on Complexity in Automated Deduction (CiAD) − Foreword | DOI (http://dx.doi.org/10.1007/s00224-004-3706-1)

• [23]

  A Formal Comparison of Visual Web Wrapper Generators

  Georg Gottlob and Christoph Koch

  In CoRR. Vol. cs.DB/0310012. 2003.

  Details about A Formal Comparison of Visual Web Wrapper Generators | BibTeX data for A Formal Comparison of Visual Web Wrapper Generators | Link to A Formal Comparison of Visual Web Wrapper Generators

• [24]

  On the complexity of single−rule datalog queries

  Georg Gottlob and Christos H. Papadimitriou

  In Inf. Comput.. Vol. 183. No. 1. Pages 104−122. 2003.

  Details about On the complexity of single−rule datalog queries | BibTeX data for On the complexity of single−rule datalog queries | DOI (10.1016/S0890-5401(03)00012-9)

• [25]

  Guest Editor's Foreword

  Georg Gottlob

  In J. Comput. Syst. Sci.. Vol. 66. No. 1. Pages 1. 2003.

  Details about Guest Editor's Foreword | BibTeX data for Guest Editor's Foreword | DOI (10.1016/S0022-0000(02)00026-0)

• [26]

  Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In J. Comput. Syst. Sci.. Vol. 66. No. 4. Pages 775−808. 2003.

  Details about Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width | BibTeX data for Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width | DOI (10.1016/S0022-0000(03)00030-8)

• [27]

  New Results on Monotone Dualization and Generating Hypergraph Transversals

  Thomas Eiter‚ Georg Gottlob and Kazuhisa Makino

  In SIAM J. Comput.. Vol. 32. No. 2. Pages 514−537. 2003.

  Details about New Results on Monotone Dualization and Generating Hypergraph Transversals | BibTeX data for New Results on Monotone Dualization and Generating Hypergraph Transversals | Link to New Results on Monotone Dualization and Generating Hypergraph Transversals

• [28]

  XPath Processing in a Nutshell

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In SIGMOD Record. Vol. 32. No. 1. Pages 12−19. 2003.

  Details about XPath Processing in a Nutshell | BibTeX data for XPath Processing in a Nutshell | DOI (10.1145/640990.640992) | Download (pdf) of XPath Processing in a Nutshell

• [29]

  XPath processing in a nutshell

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In SIGMOD Record. Vol. 32. No. 2. Pages 21−27. 2003.

  Details about XPath processing in a nutshell | BibTeX data for XPath processing in a nutshell | DOI (10.1145/776985.776988)

• [30]

  Datalog LITE: a deductive query language with linear time model checking

  Georg Gottlob‚ Erich Grädel and Helmut Veith

  In ACM Trans. Comput. Log.. Vol. 3. No. 1. Pages 42−79. 2002.

  Details about Datalog LITE: a deductive query language with linear time model checking | BibTeX data for Datalog LITE: a deductive query language with linear time model checking | DOI (10.1145/504077.504079)

• [31]

  Fixed−parameter complexity in AI and nonmonotonic reasoning

  Georg Gottlob‚ Francesco Scarcello and Martha Sideri

  In Artif. Intell.. Vol. 138. No. 1−2. Pages 55−86. 2002.

  Details about Fixed−parameter complexity in AI and nonmonotonic reasoning | BibTeX data for Fixed−parameter complexity in AI and nonmonotonic reasoning | DOI (10.1016/S0004-3702(02)00182-0)

• [32]

  Complexity of Nested Circumscription and Nested Abnormality Theories

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In CoRR. Vol. cs.AI/0207072. 2002.

  Details about Complexity of Nested Circumscription and Nested Abnormality Theories | BibTeX data for Complexity of Nested Circumscription and Nested Abnormality Theories | Link to Complexity of Nested Circumscription and Nested Abnormality Theories

• [33]

  The DLV System for Knowledge Representation and Reasoning

  Nicola Leone‚ Gerald Pfeifer‚ Wolfgang Faber‚ Thomas Eiter‚ Georg Gottlob‚ Simona Perri and Francesco Scarcello

  In CoRR. Vol. cs.AI/0211004. 2002.

  Details about The DLV System for Knowledge Representation and Reasoning | BibTeX data for The DLV System for Knowledge Representation and Reasoning | Link to The DLV System for Knowledge Representation and Reasoning

• [34]

  Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

  Georg Gottlob and Christoph Koch

  In CoRR. Vol. cs.DB/0211020. 2002.

  Details about Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | BibTeX data for Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | Link to Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

• [35]

  New Results on Monotone Dualization and Generating Hypergraph Transversals

  Thomas Eiter‚ Georg Gottlob and Kazuhisa Makino

  In CoRR. Vol. cs.DS/0204009. 2002.

  Details about New Results on Monotone Dualization and Generating Hypergraph Transversals | BibTeX data for New Results on Monotone Dualization and Generating Hypergraph Transversals | Link to New Results on Monotone Dualization and Generating Hypergraph Transversals

• [36]

  Hypertree Decompositions and Tractable Queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In J. Comput. Syst. Sci.. Vol. 64. No. 3. Pages 579−627. 2002.

  Details about Hypertree Decompositions and Tractable Queries | BibTeX data for Hypertree Decompositions and Tractable Queries | DOI (10.1006/jcss.2001.1809)

• [37]

  Computing LOGCFL certificates

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Theor. Comput. Sci.. Vol. 270. No. 1−2. Pages 761−777. 2002.

  Details about Computing LOGCFL certificates | BibTeX data for Computing LOGCFL certificates | DOI (10.1016/S0304-3975(01)00108-6)

• [38]

  Propositional default logics made easier: computational complexity of model checking

  Robert Baumgartner and Georg Gottlob

  In Theor. Comput. Sci.. Vol. 289. No. 1. Pages 591−627. 2002.

  Details about Propositional default logics made easier: computational complexity of model checking | BibTeX data for Propositional default logics made easier: computational complexity of model checking

• [39]

  Complexity and expressive power of logic programming

  Evgeny Dantsin‚ Thomas Eiter‚ Georg Gottlob and Andrei Voronkov

  In ACM Comput. Surv.. Vol. 33. No. 3. Pages 374−425. 2001.

  Details about Complexity and expressive power of logic programming | BibTeX data for Complexity and expressive power of logic programming | DOI (10.1145/502807.502810)

• [40]

  Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

  Georg Gottlob and Reinhard Pichler

  In Inf. Comput.. Vol. 165. No. 2. Pages 183−207. 2001.

  Details about Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models | BibTeX data for Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models | DOI (10.1006/inco.2000.2915)

• [41]

  The complexity of acyclic conjunctive queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In J. ACM. Vol. 48. No. 3. Pages 431−498. 2001.

  Details about The complexity of acyclic conjunctive queries | BibTeX data for The complexity of acyclic conjunctive queries | DOI (10.1145/382780.382783)

• [42]

  On ACTL Formulas Having Linear Counterexamples

  Francesco Buccafurri‚ Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In J. Comput. Syst. Sci.. Vol. 62. No. 3. Pages 463−515. 2001.

  Details about On ACTL Formulas Having Linear Counterexamples | BibTeX data for On ACTL Formulas Having Linear Counterexamples

• [43]

  A comparison of structural CSP decomposition methods

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Artif. Intell.. Vol. 124. No. 2. Pages 243−282. 2000.

  Details about A comparison of structural CSP decomposition methods | BibTeX data for A comparison of structural CSP decomposition methods | DOI (10.1016/S0004-3702(00)00078-3)

• [44]

  Existential second−order logic over strings

  Thomas Eiter‚ Yuri Gurevich and Georg Gottlob

  In J. ACM. Vol. 47. No. 1. Pages 77−131. 2000.

  Details about Existential second−order logic over strings | BibTeX data for Existential second−order logic over strings | DOI (10.1145/331605.331609)

• [45]

  Succinctness as a Source of Complexity in Logical Formalisms

  Georg Gottlob‚ Nicola Leone and Helmut Veith

  In Ann. Pure Appl. Logic. Vol. 97. No. 1−3. Pages 231−260. 1999.

  Details about Succinctness as a Source of Complexity in Logical Formalisms | BibTeX data for Succinctness as a Source of Complexity in Logical Formalisms

• [46]

  Enhancing Model Checking in Verification by AI Techniques

  Francesco Buccafurri‚ Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In Artif. Intell.. Vol. 112. No. 1−2. Pages 57−104. 1999.

  Details about Enhancing Model Checking in Verification by AI Techniques | BibTeX data for Enhancing Model Checking in Verification by AI Techniques | DOI (10.1016/S0004-3702(99)00039-9)

• [47]

  On the Complexity of Some Inductive Logic Programming Problems

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In New Generation Comput.. Vol. 17. No. 1. Pages 53−75. 1999.

  Details about On the Complexity of Some Inductive Logic Programming Problems | BibTeX data for On the Complexity of Some Inductive Logic Programming Problems

• [48]

  Hypertree Decompositions and Tractable Queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In CoRR. Vol. cs.DB/9812022. 1998.

  Details about Hypertree Decompositions and Tractable Queries | BibTeX data for Hypertree Decompositions and Tractable Queries | Link to Hypertree Decompositions and Tractable Queries

• [49]

  On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic

  Thomas Eiter and Georg Gottlob

  In J. Symb. Log.. Vol. 63. No. 1. Pages 73−82. 1998.

  Details about On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic | BibTeX data for On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic

• [50]

  Capturing Relativized Complexity Classes without Order

  Anuj Dawar‚ Georg Gottlob and Lauri Hella

  In Math. Log. Q.. Vol. 44. Pages 109−122. 1998.

  Details about Capturing Relativized Complexity Classes without Order | BibTeX data for Capturing Relativized Complexity Classes without Order

• [51]

  Disjunctive Datalog

  Thomas Eiter‚ Georg Gottlob and Heikki Mannila

  In ACM Trans. Database Syst.. Vol. 22. No. 3. Pages 364−418. 1997.

  Details about Disjunctive Datalog | BibTeX data for Disjunctive Datalog | DOI (10.1145/261124.261126) | Link to Disjunctive Datalog

• [52]

  Semantics and Complexity of Abduction from Default Theories

  Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In Artif. Intell.. Vol. 90. No. 1−2. Pages 177−223. 1997.

  Details about Semantics and Complexity of Abduction from Default Theories | BibTeX data for Semantics and Complexity of Abduction from Default Theories | DOI (10.1016/S0004-3702(96)00040-9)

• [53]

  Well−Founded Semantics for Default Logic

  Gerhard Brewka and Georg Gottlob

  In Fundam. Inform.. Vol. 31. No. 3/4. Pages 221−236. 1997.

  Details about Well−Founded Semantics for Default Logic | BibTeX data for Well−Founded Semantics for Default Logic

• [54]

  Default Logic as a Query Language

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In IEEE Trans. Knowl. Data Eng.. Vol. 9. No. 3. Pages 448−463. 1997.

  Details about Default Logic as a Query Language | BibTeX data for Default Logic as a Query Language | DOI (http://www.informatik.uni-trier.de/~ley/db/journals/tkde/CadoliEG97.html)

• [55]

  On the Indiscernibility of Individuals in Logic Programming

  Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In J. Log. Comput.. Vol. 7. No. 6. Pages 805−824. 1997.

  Details about On the Indiscernibility of Individuals in Logic Programming | BibTeX data for On the Indiscernibility of Individuals in Logic Programming

• [56]

  Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions

  Thomas Eiter and Georg Gottlob

  In J. Log. Program.. Vol. 33. No. 2. Pages 167−178. 1997.

  Details about Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions | BibTeX data for Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions

• [57]

  Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures

  Georg Gottlob

  In J. Symb. Log.. Vol. 62. No. 2. Pages 545−574. 1997.

  Details about Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures | BibTeX data for Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures

• [58]

  Abduction from Logic Programs: Semantics and Complexity

  Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In Theor. Comput. Sci.. Vol. 189. No. 1−2. Pages 129−177. 1997.

  Details about Abduction from Logic Programs: Semantics and Complexity | BibTeX data for Abduction from Logic Programs: Semantics and Complexity | DOI (10.1016/S0304-3975(96)00179-X)

• [59]

  Extending Object−Oriented Systems with Roles

  Georg Gottlob‚ Michael Schrefl and Brigitte Röck

  In ACM Trans. Inf. Syst.. Vol. 14. No. 3. Pages 268−296. 1996.

  Details about Extending Object−Oriented Systems with Roles | BibTeX data for Extending Object−Oriented Systems with Roles | DOI (10.1145/230538.230540)

• [60]

  Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems

  Thomas Eiter‚ Georg Gottlob and Yuri Gurevich

  In Ann. Pure Appl. Logic. Vol. 78. No. 1−3. Pages 111−125. 1996.

  Details about Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems | BibTeX data for Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems

• [61]

  Approximating the Stable Model Semantics is Hard

  Georg Gottlob and Miroslaw Truszczynski

  In Fundam. Inform.. Vol. 28. No. 1−2. Pages 123−128. 1996.

  Details about Approximating the Stable Model Semantics is Hard | BibTeX data for Approximating the Stable Model Semantics is Hard

• [62]

  The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

  Thomas Eiter and Georg Gottlob

  In J. Comput. Syst. Sci.. Vol. 53. No. 3. Pages 497−512. 1996.

  Details about The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions | BibTeX data for The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

• [63]

  Mächtigkeit von Logikprogrammierung über Datenbanken

  Thomas Eiter and Georg Gottlob

  In KI. Vol. 10. No. 3. Pages 32−39. 1996.

  Details about Mächtigkeit von Logikprogrammierung über Datenbanken | BibTeX data for Mächtigkeit von Logikprogrammierung über Datenbanken

• [64]

  A Non−Ground Realization of the Stable and Well−Founded Semantics

  Georg Gottlob‚ Sherry Marcus‚ Anil Nerode‚ Gernot Salzer and V. S. Subrahmanian

  In Theor. Comput. Sci.. Vol. 166. No. 1&2. Pages 221−262. 1996.

  Details about A Non−Ground Realization of the Stable and Well−Founded Semantics | BibTeX data for A Non−Ground Realization of the Stable and Well−Founded Semantics | DOI (10.1016/0304-3975(95)00207-3)

• [65]

  On the Computational Cost of Disjunctive Logic Programming: Propositional Case

  Thomas Eiter and Georg Gottlob

  In Ann. Math. Artif. Intell.. Vol. 15. No. 3−4. Pages 289−323. 1995.

  Details about On the Computational Cost of Disjunctive Logic Programming: Propositional Case | BibTeX data for On the Computational Cost of Disjunctive Logic Programming: Propositional Case

• [66]

  The Complexity of Default Reasoning under the Stationary Fixed Point Semantics

  Georg Gottlob

  In Inf. Comput.. Vol. 121. No. 1. Pages 81−92. 1995.

  Details about The Complexity of Default Reasoning under the Stationary Fixed Point Semantics | BibTeX data for The Complexity of Default Reasoning under the Stationary Fixed Point Semantics

• [67]

  The Complexity of Logic−Based Abduction

  Thomas Eiter and Georg Gottlob

  In J. ACM. Vol. 42. No. 1. Pages 3−42. 1995.

  Details about The Complexity of Logic−Based Abduction | BibTeX data for The Complexity of Logic−Based Abduction | DOI (10.1145/200836.200838) | Link to The Complexity of Logic−Based Abduction

• [68]

  NP Trees and Carnap's Modal Logic

  Georg Gottlob

  In J. ACM. Vol. 42. No. 2. Pages 421−457. 1995.

  Details about NP Trees and Carnap's Modal Logic | BibTeX data for NP Trees and Carnap's Modal Logic | DOI (10.1145/201019.201031)

• [69]

  Translating Default Logic into Standard Autoepistemic Logic

  Georg Gottlob

  In J. ACM. Vol. 42. No. 4. Pages 711−740. 1995.

  Details about Translating Default Logic into Standard Autoepistemic Logic | BibTeX data for Translating Default Logic into Standard Autoepistemic Logic | DOI (10.1145/210332.210334) | Link to Translating Default Logic into Standard Autoepistemic Logic

• [70]

  Identifying the Minimal Transversals of a Hypergraph and Related Problems

  Thomas Eiter and Georg Gottlob

  In SIAM J. Comput.. Vol. 24. No. 6. Pages 1278−1304. 1995.

  Details about Identifying the Minimal Transversals of a Hypergraph and Related Problems | BibTeX data for Identifying the Minimal Transversals of a Hypergraph and Related Problems

• [71]

  Formalizing the Repair Process − Extended Report

  Gerhard Friedrich‚ Georg Gottlob and Wolfgang Nejdl

  In Ann. Math. Artif. Intell.. Vol. 11. No. 1−4. Pages 187−201. 1994.

  Details about Formalizing the Repair Process − Extended Report | BibTeX data for Formalizing the Repair Process − Extended Report

• [72]

  Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity

  Georg Gottlob and Zhang Mingyi

  In Artif. Intell.. Vol. 69. No. 1−2. Pages 329−345. 1994.

  Details about Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity | BibTeX data for Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity

• [73]

  Removing Redundancy from a Clause

  Georg Gottlob and Christian G. Fermüller

  In Artif. Intell.. Vol. 61. No. 2. Pages 263−289. 1993.

  Details about Removing Redundancy from a Clause | BibTeX data for Removing Redundancy from a Clause

• [74]

  Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete

  Thomas Eiter and Georg Gottlob

  In Theor. Comput. Sci.. Vol. 114. No. 2. Pages 231−245. 1993.

  Details about Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete | BibTeX data for Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete

• [75]

  An Efficient Method for Eliminating Varying Predicates from a Circumscription

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In Artif. Intell.. Vol. 54. No. 2. Pages 397−410. 1992.

  Details about An Efficient Method for Eliminating Varying Predicates from a Circumscription | BibTeX data for An Efficient Method for Eliminating Varying Predicates from a Circumscription

• [76]

  On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals

  Thomas Eiter and Georg Gottlob

  In Artif. Intell.. Vol. 57. No. 2−3. Pages 227−270. 1992.

  Details about On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals | BibTeX data for On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals

• [77]

  Selective Inheritance of Attribute Values in Relational Databases

  Georg Gottlob‚ Michael Schrefl and Markus Stumptner

  In Discrete Applied Mathematics. Vol. 40. No. 2. Pages 187−216. 1992.

  Details about Selective Inheritance of Attribute Values in Relational Databases | BibTeX data for Selective Inheritance of Attribute Values in Relational Databases

• [78]

  Reasoning with parsimonious and moderately grounded expansions

  Thomas Eiter and Georg Gottlob

  In Fundam. Inform.. Vol. 17. No. 1−2. Pages 31−53. 1992.

  Details about Reasoning with parsimonious and moderately grounded expansions | BibTeX data for Reasoning with parsimonious and moderately grounded expansions

• [79]

  Complexity Results for Nonmonotonic Logics

  Georg Gottlob

  In J. Log. Comput.. Vol. 2. No. 3. Pages 397−425. 1992.

  Details about Complexity Results for Nonmonotonic Logics | BibTeX data for Complexity Results for Nonmonotonic Logics

• [80]

  Investigation on Armstrong relations‚ dependency inference‚ and excluded functional dependencies

  Georg Gottlob and Leonid Libkin

  In Acta Cybern.. Vol. 9. No. 4. Pages 385−402. 1990.

  Details about Investigation on Armstrong relations‚ dependency inference‚ and excluded functional dependencies | BibTeX data for Investigation on Armstrong relations‚ dependency inference‚ and excluded functional dependencies

• [81]

  What you Always Wanted to Know About Datalog (And Never Dared to Ask)

  Stefano Ceri‚ Georg Gottlob and Letizia Tanca

  In IEEE Trans. Knowl. Data Eng.. Vol. 1. No. 1. Pages 146−166. 1989.

  Details about What you Always Wanted to Know About Datalog (And Never Dared to Ask) | BibTeX data for What you Always Wanted to Know About Datalog (And Never Dared to Ask) | Link to What you Always Wanted to Know About Datalog (And Never Dared to Ask)

• [82]

  Efficient Database Access from Prolog

  Stefano Ceri‚ Georg Gottlob and Gio Wiederhold

  In IEEE Trans. Software Eng.. Vol. 15. No. 2. Pages 153−164. 1989.

  Details about Efficient Database Access from Prolog | BibTeX data for Efficient Database Access from Prolog | Link to Efficient Database Access from Prolog

• [83]

  Magic Semi−Joins

  Stefano Ceri‚ Georg Gottlob‚ Letizia Tanca and Gio Wiederhold

  In Inf. Process. Lett.. Vol. 33. No. 2. Pages 97−107. 1989.

  Details about Magic Semi−Joins | BibTeX data for Magic Semi−Joins

• [84]

  Properties and Update Semantics of Consistent Views

  Georg Gottlob‚ Paolo Paolini and Roberto Zicari

  In ACM Trans. Database Syst.. Vol. 13. No. 4. Pages 486−524. 1988.

  Details about Properties and Update Semantics of Consistent Views | BibTeX data for Properties and Update Semantics of Consistent Views | DOI (10.1145/49346.50068) | Link to Properties and Update Semantics of Consistent Views

• [85]

  Subsumption and Implication

  Georg Gottlob

  In Inf. Process. Lett.. Vol. 24. No. 2. Pages 109−111. 1987.

  Details about Subsumption and Implication | BibTeX data for Subsumption and Implication

• [86]

  On the Size of Nonredundant FD−Covers

  Georg Gottlob

  In Inf. Process. Lett.. Vol. 24. No. 6. Pages 355−360. 1987.

  Details about On the Size of Nonredundant FD−Covers | BibTeX data for On the Size of Nonredundant FD−Covers

• [87]

  Normalization of Relations and PROLOG

  Stefano Ceri and Georg Gottlob

  In Commun. ACM. Vol. 29. No. 6. Pages 524−544. 1986.

  Details about Normalization of Relations and PROLOG | BibTeX data for Normalization of Relations and PROLOG | Link to Normalization of Relations and PROLOG

• [88]

  Taxonomy and formal properties of distributed joins

  Stefano Ceri‚ Georg Gottlob and Giuseppe Pelagatti

  In Inf. Syst.. Vol. 11. No. 1. Pages 25−40. 1986.

  Details about Taxonomy and formal properties of distributed joins | BibTeX data for Taxonomy and formal properties of distributed joins

• [89]

  Optimizing Joins between Two Partitioned Relations in Distributed Databases

  Stefano Ceri and Georg Gottlob

  In J. Parallel Distrib. Comput.. Vol. 3. No. 2. Pages 183−205. 1986.

  Details about Optimizing Joins between Two Partitioned Relations in Distributed Databases | BibTeX data for Optimizing Joins between Two Partitioned Relations in Distributed Databases

• [90]

  Translating SQL Into Relational Algebra: Optimization‚ Semantics‚ and Equivalence of SQL Queries

  Stefano Ceri and Georg Gottlob

  In IEEE Trans. Software Eng.. Vol. 11. No. 4. Pages 324−345. 1985.

  Details about Translating SQL Into Relational Algebra: Optimization‚ Semantics‚ and Equivalence of SQL Queries | BibTeX data for Translating SQL Into Relational Algebra: Optimization‚ Semantics‚ and Equivalence of SQL Queries

• [91]

  On the Efficiency of Subsumption Algorithms

  Georg Gottlob and Alexander Leitsch

  In J. ACM. Vol. 32. No. 2. Pages 280−295. 1985.

  Details about On the Efficiency of Subsumption Algorithms | BibTeX data for On the Efficiency of Subsumption Algorithms | Link to On the Efficiency of Subsumption Algorithms

Conference papers

• [1]

  Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports

  Zehua Cheng‚ Lianlong Wu‚ Thomas Lukasiewicz‚ Emanuel Sallinger and Georg Gottlob

  In Maya Ramanath and Themis Palpanas, editors, Proceedings of the Workshops of the EDBT/ICDT 2022 Joint Conference‚ Edinburgh‚ UK‚ March 29‚ 2022. Vol. 3135 of CEUR Workshop Proceedings. CEUR−WS.org. 2022.

  Details about Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports | BibTeX data for Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports | Download (pdf) of Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports

• [2]

  Expressive Languages for Querying the Semantic Web

  Marcelo Arenas‚ Georg Gottlob and Andreas Pieris

  In Georg Gottlob and Jorge Pérez, editors, Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management‚ Cartagena de Indias‚ Colombia‚ June 4−6‚ 2014. Vol. 1189 of CEUR Workshop Proceedings. CEUR−WS.org. 2014.

  Details about Expressive Languages for Querying the Semantic Web | BibTeX data for Expressive Languages for Querying the Semantic Web | Link to Expressive Languages for Querying the Semantic Web

• [3]

  Datalog+⁄−: Questions and Answers

  Georg Gottlob‚ Thomas Lukasiewicz and Andreas Pieris

  In Chitta Baral and Giuseppe De Giacomo, editors, Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning‚ KR 2014‚ Vienna‚ Austria‚ July 20−24‚ 2014. Pages 682−685. AAAI Press. 2014.

  Details about Datalog+⁄−: Questions and Answers | BibTeX data for Datalog+⁄−: Questions and Answers | Link to Datalog+⁄−: Questions and Answers

• [4]

  Stable Model Semantics for Guarded Existential Rules and Description Logics

  Georg Gottlob‚ André Hernich‚ Clemens Kupke and Thomas Lukasiewicz

  In Chitta Baral and Giuseppe De Giacomo, editors, Proceedings of the 14th International Conference on the Principles of Knowledge Representation and Reasoning‚ KR 2014‚ Vienna‚ Austria‚ July 20−24‚ 2014. Pages 258−267. AAAI Press. July, 2014.

  Details about Stable Model Semantics for Guarded Existential Rules and Description Logics | BibTeX data for Stable Model Semantics for Guarded Existential Rules and Description Logics | Link to Stable Model Semantics for Guarded Existential Rules and Description Logics

• [5]

  Well−Founded Semantics for Extended Datalog and Ontological Reasoning

  André Hernich‚ Clemens Kupke‚ Thomas Lukasiewicz and Georg Gottlob

  In Thomas Eiter‚ Birte Glimm‚ Yevgeny Kazakov and Markus Krötzsch, editors, Proceedings of the 26th International Workshop on Description Logics‚ DL 2013‚ Ulm‚ Germany‚ July 23−26‚ 2013. Vol. 1014 of CEUR Workshop Proceedings. Pages 209−220. CEUR−WS.org. 2013.

  Details about Well−Founded Semantics for Extended Datalog and Ontological Reasoning | BibTeX data for Well−Founded Semantics for Extended Datalog and Ontological Reasoning | Download (pdf) of Well−Founded Semantics for Extended Datalog and Ontological Reasoning

• [6]

  Well−Founded Semantics for Extended Datalog and Ontological Reasoning

  André Hernich‚ Clemens Kupke‚ Thomas Lukasiewicz and Georg Gottlob

  In Richard Hull and Wenfei Fan, editors, Proceedings of the 32nd ACM Symposium on Principles of Database Systems‚ PODS 2013‚ New York‚ New York‚ USA‚ June 22−27‚ 2013. Pages 225−236. ACM Press. 2013.

  Details about Well−Founded Semantics for Extended Datalog and Ontological Reasoning | BibTeX data for Well−Founded Semantics for Extended Datalog and Ontological Reasoning | Link to Well−Founded Semantics for Extended Datalog and Ontological Reasoning

• [7]

  Equality−Friendly Well−Founded Semantics and Applications to Description Logics

  Georg Gottlob‚ André Hernich‚ Clemens Kupke and Thomas Lukasiewicz

  In Yevgeny Kazakov‚ Domenico Lembo and Frank Wolter, editors, Proceedings of the 25th International Workshop on Description Logics‚ DL 2012‚ Rome‚ Italy‚ June 7−10‚ 2012. Vol. 846 of CEUR Workshop Proceedings. CEUR−WS.org. 2012.

  Details about Equality−Friendly Well−Founded Semantics and Applications to Description Logics | BibTeX data for Equality−Friendly Well−Founded Semantics and Applications to Description Logics | Download (pdf) of Equality−Friendly Well−Founded Semantics and Applications to Description Logics

• [8]

  Equality−Friendly Well−Founded Semantics and Applications to Description Logics

  Georg Gottlob‚ André Hernich‚ Clemens Kupke and Thomas Lukasiewicz

  In J. Hoffmann and B. Selman, editors, Proceedings of the 26th National Conference on Artificial Intelligence‚ AAAI 2012‚ Toronto‚ Ontario‚ Canada‚ July 2012. AAAI Press. 2012.

  Details about Equality−Friendly Well−Founded Semantics and Applications to Description Logics | BibTeX data for Equality−Friendly Well−Founded Semantics and Applications to Description Logics | Link to Equality−Friendly Well−Founded Semantics and Applications to Description Logics

• [9]

  Datalog+⁄−: A Family of Languages for Ontology Querying

  Andrea Calì‚ Georg Gottlob‚ Thomas Lukasiewicz and Andreas Pieris

  In Oege de Moor‚ Georg Gottlob‚ Tim Furche and Andrew Jon Sellers, editors, Datalog Reloaded − 1st International Workshop‚ Datalog 2010‚ Oxford‚ UK‚ March 16−19‚ 2010. Revised Selected Papers. Vol. 6702 of Lecture Notes in Computer Science. Pages 351−368. Springer. 2011.

  Details about Datalog+⁄−: A Family of Languages for Ontology Querying | BibTeX data for Datalog+⁄−: A Family of Languages for Ontology Querying | Link to Datalog+⁄−: A Family of Languages for Ontology Querying

• [10]

  Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies

  Georg Gottlob‚ Thomas Lukasiewicz and Gerardo I. Simari

  In Sebastian Rudolph and Claudio Gutierrez, editors, Proceedings of the 5th International Conference on Web Reasoning and Rule Systems‚ RR 2011‚ Galway‚ Ireland‚ August 29−30‚ 2011. Vol. 6902 of Lecture Notes in Computer Science. Pages 77−92. Springer. 2011.

  Details about Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies | BibTeX data for Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies | Link to Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies

• [11]

  On Minimal Constraint Networks

  Georg Gottlob

  In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming‚ CP 2011. Perugia‚ Italy. 2011.

  Details about On Minimal Constraint Networks | BibTeX data for On Minimal Constraint Networks | Download  (pdf) of On Minimal Constraint Networks

• [12]

  Introducing LoCo‚ a Logic for Configuration Problems

  Markus Aschinger‚ Conrad Drescher and Georg Gottlob

  In Proceedings of the 2nd Workshop on Logics for Component Configuration‚ LoCoCo 2011. Perugia‚ Italy. 2011.

  Details about Introducing LoCo‚ a Logic for Configuration Problems | BibTeX data for Introducing LoCo‚ a Logic for Configuration Problems | Download  (pdf) of Introducing LoCo‚ a Logic for Configuration Problems

• [13]

  Tackling the Partner Units Configuration Problem

  Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen

  In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). Barcelona‚ Spain. 2011.

  Details about Tackling the Partner Units Configuration Problem | BibTeX data for Tackling the Partner Units Configuration Problem | Download  (pdf) of Tackling the Partner Units Configuration Problem

• [14]

  Optimization Methods for the Partner Units Problem

  Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen

  In Proceedings of the 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011). Berlin‚ Germany. 2011.

  Details about Optimization Methods for the Partner Units Problem | BibTeX data for Optimization Methods for the Partner Units Problem | Download  (pdf) of Optimization Methods for the Partner Units Problem

• [15]

  Combining Semantic Web Search with the Power of Inductive Reasoning

  Claudia d'Amato‚ Nicola Fanizzi‚ Bettina Fazzinga‚ Georg Gottlob and Thomas Lukasiewicz

  In Amol Deshpande and Anthony Hunter, editors, Proceedings of the 4th International Conference on Scalable Uncertainty Management‚ SUM 2010‚ Toulouse‚ France‚ September 27−29‚ 2010. Vol. 6379 of Lecture Notes in Computer Science. Pages 137−150. Springer. 2010.

  Details about Combining Semantic Web Search with the Power of Inductive Reasoning | BibTeX data for Combining Semantic Web Search with the Power of Inductive Reasoning | Link to Combining Semantic Web Search with the Power of Inductive Reasoning

• [16]

  Inductive Reasoning and Semantic Web Search

  Claudia d'Amato‚ Floriana Esposito‚ Nicola Fanizzi‚ Bettina Fazzinga‚ Georg Gottlob and Thomas Lukasiewicz

  In Sung Y. Shin‚ Sascha Ossowski‚ Michael Schumacher‚ Mathew J. Palakal and Chih−Cheng Hung, editors, Proceedings of the 25th ACM Symposium on Applied Computing‚ SAC 2010‚ Sierre‚ Switzerland‚ March 22−26‚ 2010. Pages 1446−1447. ACM Press. 2010.

  Details about Inductive Reasoning and Semantic Web Search | BibTeX data for Inductive Reasoning and Semantic Web Search | Link to Inductive Reasoning and Semantic Web Search

• [17]

  Ontological Reasoning with F−Logic Lite and its Extensions

  Andrea Calì‚ Georg Gottlob‚ Michael Kifer‚ Thomas Lukasiewicz and Andreas Pieris

  In Maria Fox and David Poole, editors, Proceedings of the 24th AAAI Conference on Artificial Intelligence‚ AAAI 2010‚ Atlanta‚ Georgia‚ USA‚ July 11−15‚ 2010. AAAI Press. 2010.

  Details about Ontological Reasoning with F−Logic Lite and its Extensions | BibTeX data for Ontological Reasoning with F−Logic Lite and its Extensions | Link to Ontological Reasoning with F−Logic Lite and its Extensions

• [18]

  Semantic Web Search Based on Ontological Conjunctive Queries

  Bettina Fazzinga‚ Giorgio Gianforme‚ Georg Gottlob and Thomas Lukasiewicz

  In Sebastian Link and Henri Prade, editors, Proceedings of the 6th International Symposium on the Foundations of Information and Knowledge Systems‚ FoIKS 2010‚ Sofia‚ Bulgaria‚ February 15−19‚ 2010. Vol. 5956 of Lecture Notes in Computer Science. Pages 153−172. Springer. 2010.

  Details about Semantic Web Search Based on Ontological Conjunctive Queries | BibTeX data for Semantic Web Search Based on Ontological Conjunctive Queries | Link to Semantic Web Search Based on Ontological Conjunctive Queries

• [19]

  Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications

  Andrea Calì‚ Georg Gottlob‚ Thomas Lukasiewicz‚ Bruno Marnette and Andreas Pieris

  In Proceedings of the 25th IEEE Symposium on Logic in Computer Science‚ LICS 2010‚ Edinburgh‚ UK‚ July 2010. Pages 228–242. IEEE Computer Society. 2010.

  Details about Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications | BibTeX data for Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications | Link to Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications

• [20]

  A General Datalog−Based Framework for Tractable Query Answering over Ontologies

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Jan Paredaens and Jianwen Su, editors, Proceedings of the 28th ACM Symposium on Principles of Database Systems‚ PODS 2009‚ Providence‚ Rhode Island‚ USA‚ June 19 − July 1‚ 2009. Pages 77−86. ACM Press. 2009.

  Details about A General Datalog−Based Framework for Tractable Query Answering over Ontologies | BibTeX data for A General Datalog−Based Framework for Tractable Query Answering over Ontologies | Link to A General Datalog−Based Framework for Tractable Query Answering over Ontologies

• [21]

  A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract)

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Valeria De Antonellis‚ Silvana Castano‚ Barbara Catania and Giovanna Guerrini, editors, Proceedings of the 17th Italian Symposium on Advanced Database Systems‚ SEBD 2009‚ Camogli‚ Italy‚ June 21−24‚ 2009. Pages 29−36. Edizioni Seneca. 2009.

  Details about A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract) | BibTeX data for A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract) | Download (pdf) of A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract)

• [22]

  Combining Semantic Web Search with the Power of Inductive Reasoning

  Claudia d'Amato‚ Nicola Fanizzi‚ Bettina Fazzinga‚ Georg Gottlob and Thomas Lukasiewicz

  In Fernando Bobillo‚ Paulo Cesar G. da Costa‚ Claudia d'Amato‚ Nicola Fanizzi‚ Kathryn B. Laskey‚ Kenneth J. Laskey‚ Thomas Lukasiewicz‚ Trevor Martin‚ Matthias Nickles‚ Michael Pool and Pavel Smrz, editors, Proceedings of the 5th International Workshop on Uncertainty Reasoning for the Semantic Web‚ URSW 2009‚ Washington DC‚ USA‚ October 26‚ 2009. Vol. 527 of CEUR Workshop Proceedings. Pages 15−26. CEUR−WS.org. 2009.

  Details about Combining Semantic Web Search with the Power of Inductive Reasoning | BibTeX data for Combining Semantic Web Search with the Power of Inductive Reasoning | Download (pdf) of Combining Semantic Web Search with the Power of Inductive Reasoning

• [23]

  Datalog^±: A Unified Approach to Ontologies and Integrity Constraints

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Ronald Fagin, editor, Proceedings of the 12th International Conference on Database Theory‚ ICDT 2009‚ St. Petersburg‚ Russia‚ March 23−25‚ 2009. Vol. 361 of ACM International Conference Proceeding Series. Pages 14−30. ACM Press. 2009.

  Details about Datalog^±: A Unified Approach to Ontologies and Integrity Constraints | BibTeX data for Datalog^±: A Unified Approach to Ontologies and Integrity Constraints | Link to Datalog^±: A Unified Approach to Ontologies and Integrity Constraints

• [24]

  Tractable Query Answering over Ontologies with Datalog+⁄−

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  In Bernardo Cuenca Grau‚ Ian Horrocks‚ Boris Motik and Ulrike Sattler, editors, Proceedings of the 22nd International Workshop on Description Logics‚ DL 2009‚ Oxford‚ UK‚ July 27−30‚ 2009. Vol. 477 of CEUR Workshop Proceedings. CEUR−WS.org. 2009.

  Details about Tractable Query Answering over Ontologies with Datalog+⁄− | BibTeX data for Tractable Query Answering over Ontologies with Datalog+⁄− | Download (pdf) of Tractable Query Answering over Ontologies with Datalog+⁄−

• [25]

  Efficient Datalog Abduction through Bounded Treewidth

  Georg Gottlob‚ Reinhard Pichler and Fang Wei

  In Proceedings of the Twenty−Second AAAI Conference on Artificial Intelligence‚ July 22−26‚ 2007‚ Vancouver‚ British Columbia‚ Canada. Pages 1626−1631. AAAI Press. 2007.

  Details about Efficient Datalog Abduction through Bounded Treewidth | BibTeX data for Efficient Datalog Abduction through Bounded Treewidth

• [26]

  On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition

  Georg Gottlob and Gianluigi Greco

  In Jeffrey K. MacKie−Mason‚ David C. Parkes and Paul Resnick, editors, Proceedings 8th ACM Conference on Electronic Commerce (EC−2007)‚ San Diego‚ California‚ USA‚ June 11−15‚ 2007. Pages 152−161. ACM. 2007.

  Details about On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition | BibTeX data for On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition | DOI (10.1145/1250910.1250934)

• [27]

  The Lixto Systems Applications in Business Intelligence and Semantic Web

  Robert Baumgartner‚ Oliver Frölich and Georg Gottlob

  In Enrico Franconi‚ Michael Kifer and Wolfgang May, editors, The Semantic Web: Research and Applications‚ 4th European Semantic Web Conference‚ ESWC 2007‚ Innsbruck‚ Austria‚ June 3−7‚ 2007‚ Proceedings. Vol. 4519 of Lecture Notes in Computer Science. Pages 16−26. Springer. 2007.

  Details about The Lixto Systems Applications in Business Intelligence and Semantic Web | BibTeX data for The Lixto Systems Applications in Business Intelligence and Semantic Web | DOI (10.1007/978-3-540-72667-8_3)

• [28]

  Complexity of Pure Equilibria in Bayesian Games

  Georg Gottlob‚ Gianluigi Greco and Toni Mancini

  In Manuela M. Veloso, editor, IJCAI 2007‚ Proceedings of the 20th International Joint Conference on Artificial Intelligence‚ Hyderabad‚ India‚ January 6−12‚ 2007. Pages 1294−1299. 2007.

  Details about Complexity of Pure Equilibria in Bayesian Games | BibTeX data for Complexity of Pure Equilibria in Bayesian Games | Download (pdf) of Complexity of Pure Equilibria in Bayesian Games

• [29]

  Conditional Constraint Satisfaction: Logical Foundations and Complexity

  Georg Gottlob‚ Gianluigi Greco and Toni Mancini

  In Manuela M. Veloso, editor, IJCAI 2007‚ Proceedings of the 20th International Joint Conference on Artificial Intelligence‚ Hyderabad‚ India‚ January 6−12‚ 2007. Pages 88−93. 2007.

  Details about Conditional Constraint Satisfaction: Logical Foundations and Complexity | BibTeX data for Conditional Constraint Satisfaction: Logical Foundations and Complexity | Download (pdf) of Conditional Constraint Satisfaction: Logical Foundations and Complexity

• [30]

  Generalized hypertree decompositions: np−hardness and tractable variants

  Georg Gottlob‚ Zoltán Miklós and Thomas Schwentick

  In Leonid Libkin, editor, Proceedings of the Twenty−Sixth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 11−13‚ 2007‚ Beijing‚ China. Pages 13−22. ACM. 2007.

  Details about Generalized hypertree decompositions: np−hardness and tractable variants | BibTeX data for Generalized hypertree decompositions: np−hardness and tractable variants | DOI (10.1145/1265530.1265533)

• [31]

  Monadic datalog over finite structures with bounded treewidth

  Georg Gottlob‚ Reinhard Pichler and Fang Wei

  In Leonid Libkin, editor, Proceedings of the Twenty−Sixth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 11−13‚ 2007‚ Beijing‚ China. Pages 165−174. ACM. 2007.

  Details about Monadic datalog over finite structures with bounded treewidth | BibTeX data for Monadic datalog over finite structures with bounded treewidth | DOI (10.1145/1265530.1265554)

• [32]

  Foundations of Rule−Based Query Answering

  François Bry‚ Norbert Eisinger‚ Thomas Eiter‚ Tim Furche‚ Georg Gottlob‚ Clemens Ley‚ Benedikt Linse‚ Reinhard Pichler and Fang Wei

  In Grigoris Antoniou‚ Uwe Aßmann‚ Cristina Baroglio‚ Stefan Decker‚ Nicola Henze‚ Paula−Lavinia Patranjan and Robert Tolksdorf, editors, Reasoning Web. Vol. 4636 of Lecture Notes in Computer Science. Pages 1−153. Springer. 2007.

  Details about Foundations of Rule−Based Query Answering | BibTeX data for Foundations of Rule−Based Query Answering | Download  (pdf) of Foundations of Rule−Based Query Answering

• [33]

  Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

  Georg Gottlob‚ Reinhard Pichler and Fang Wei

  In Proceedings‚ The Twenty−First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference‚ July 16−20‚ 2006‚ Boston‚ Massachusetts‚ USA. AAAI Press. 2006.

  Details about Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning | BibTeX data for Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

• [34]

  The Lixto Project: Exploring New Frontiers of Web Data Extraction

  Julien Carme‚ Michal Ceresna‚ Oliver Frölich‚ Georg Gottlob‚ Tamir Hassan‚ Marcus Herzog‚ Wolfgang Holzinger and Bernhard Krüpl

  In BNCOD. Pages 1−15. 2006.

  Details about The Lixto Project: Exploring New Frontiers of Web Data Extraction | BibTeX data for The Lixto Project: Exploring New Frontiers of Web Data Extraction | DOI (10.1007/11788911_1)

• [35]

  Tractable database design through bounded treewidth

  Georg Gottlob‚ Reinhard Pichler and Fang Wei

  In Stijn Vansummeren, editor, Proceedings of the Twenty−Fifth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 26−28‚ 2006‚ Chicago‚ Illinois‚ Maryland‚ USA. Pages 124−133. ACM. 2006.

  Details about Tractable database design through bounded treewidth | BibTeX data for Tractable database design through bounded treewidth | DOI (10.1145/1142351.1142370)

• [36]

  Data exchange: computing cores in polynomial time

  Georg Gottlob and Alan Nash

  In Stijn Vansummeren, editor, Proceedings of the Twenty−Fifth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 26−28‚ 2006‚ Chicago‚ Illinois‚ Maryland‚ USA. Pages 40−49. ACM. 2006.

  Details about Data exchange: computing cores in polynomial time | BibTeX data for Data exchange: computing cores in polynomial time | DOI (10.1145/1142351.1142358)

• [37]

  RDF Querying: Language Constructs and Evaluation Methods Compared

  Tim Furche‚ Benedikt Linse‚ François Bry‚ Dimitris Plexousakis and Georg Gottlob

  In Pedro Barahona‚ François Bry‚ Enrico Franconi‚ Nicola Henze and Ulrike Sattler, editors, Reasoning Web‚ Second International Summer School 2006‚ Lisbon‚ Portugal‚ September 4−8‚ 2006‚ Tutorial Lectures. Vol. 4126 of Lecture Notes in Computer Science. Pages 1−52. Springer. 2006.

  Details about RDF Querying: Language Constructs and Evaluation Methods Compared | BibTeX data for RDF Querying: Language Constructs and Evaluation Methods Compared | DOI (10.1007/11837787_1)

• [38]

  A Formal Comparison of Visual Web Wrapper Generators

  Georg Gottlob and Christoph Koch

  In Jirí Wiedermann‚ Gerard Tel‚ Jaroslav Pokorný‚ Mária Bieliková and Julius Stuller, editors, SOFSEM 2006: Theory and Practice of Computer Science‚ 32nd Conference on Current Trends in Theory and Practice of Computer Science‚ Merín‚ Czech Republic‚ January 21−27‚ 2006‚ Proceedings. Vol. 3831 of Lecture Notes in Computer Science. Pages 30−48. Springer. 2006.

  Details about A Formal Comparison of Visual Web Wrapper Generators | BibTeX data for A Formal Comparison of Visual Web Wrapper Generators | DOI (10.1007/11611257_3)

• [39]

  Web Data Extraction for Business Intelligence: The Lixto Approach

  Georg Gottlob

  In Gottfried Vossen‚ Frank Leymann‚ Peter C. Lockemann and Wolffried Stucky, editors, Datenbanksysteme in Business‚ Technologie und Web‚ 11. Fachtagung des GI−Fachbereichs "Datenbanken und Informationssysteme" (DBIS)‚ Karlsruhe‚ 2.−4. März 2005. Vol. 65 of LNI. Pages 30−47. GI. 2005.

  Details about Web Data Extraction for Business Intelligence: The Lixto Approach | BibTeX data for Web Data Extraction for Business Intelligence: The Lixto Approach

• [40]

  Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic

  Riccardo Rosati and Georg Gottlob

  In Leslie Pack Kaelbling and Alessandro Saffiotti, editors, IJCAI−05‚ Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence‚ Edinburgh‚ Scotland‚ UK‚ July 30−August 5‚ 2005. Pages 1378−1383. Professional Book Center. 2005.

  Details about Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic | BibTeX data for Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic | Download (pdf) of Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic

• [41]

  The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

  Georg Gottlob‚ Gianluigi Greco and Francesco Scarcello

  In Leslie Pack Kaelbling and Alessandro Saffiotti, editors, IJCAI−05‚ Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence‚ Edinburgh‚ Scotland‚ UK‚ July 30−August 5‚ 2005. Pages 150−155. Professional Book Center. 2005.

  Details about The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions | BibTeX data for The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions | Download (pdf) of The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

• [42]

  The Personal Publication Reader

  Fabian Abel‚ Robert Baumgartner‚ Adrian Brooks‚ Christian Enzi‚ Georg Gottlob‚ Nicola Henze‚ Marcus Herzog‚ Matthias Kriesell‚ Wolfgang Nejdl and Kai Tomaschewski

  In Yolanda Gil‚ Enrico Motta‚ V. Richard Benjamins and Mark A. Musen, editors, The Semantic Web − ISWC 2005‚ 4th International Semantic Web Conference‚ ISWC 2005‚ Galway‚ Ireland‚ November 6−10‚ 2005‚ Proceedings. Vol. 3729 of Lecture Notes in Computer Science. Pages 1050−1053. Springer. 2005.

  Details about The Personal Publication Reader | BibTeX data for The Personal Publication Reader | DOI (10.1007/11574620_75)

• [43]

  Data 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 and Giorgio Terracina

  In Chitta Baral‚ Gianluigi Greco‚ Nicola Leone and Giorgio Terracina, editors, Logic Programming and Nonmonotonic Reasoning‚ 8th International Conference‚ LPNMR 2005‚ Diamante‚ Italy‚ September 5−8‚ 2005‚ Proceedings. Vol. 3662 of Lecture Notes in Computer Science. Pages 379−383. Springer. 2005.

  Details about Data Integration: a Challenging ASP Application | BibTeX data for Data Integration: a Challenging ASP Application | DOI (10.1007/11546207_31)

• [44]

  Computing cores for data exchange: new algorithms and practical solutions

  Georg Gottlob

  In Chen Li, editor, Proceedings of the Twenty−fourth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 13−15‚ 2005‚ Baltimore‚ Maryland‚ USA. Pages 148−159. ACM. 2005.

  Details about Computing cores for data exchange: new algorithms and practical solutions | BibTeX data for Computing cores for data exchange: new algorithms and practical solutions | DOI (10.1145/1065167.1065187)

• [45]

  Information Extraction for the Semantic Web

  Robert Baumgartner‚ Thomas Eiter‚ Georg Gottlob‚ Marcus Herzog and Christoph Koch

  In Norbert Eisinger and Jan Maluszynski, editors, Reasoning Web‚ First International Summer School 2005‚ Msida‚ Malta‚ July 25−29‚ 2005‚ Tutorial Lectures. Vol. 3564 of Lecture Notes in Computer Science. Pages 275−289. Springer. 2005.

  Details about Information Extraction for the Semantic Web | BibTeX data for Information Extraction for the Semantic Web | DOI (10.1007/11526988_8)

• [46]

  Boosting Information Integration: The INFOMIX System

  Nicola Leone‚ Thomas Eiter‚ Wolfgang Faber‚ Michael Fink‚ Georg Gottlob and Gianluigi Greco

  In Andrea Calì‚ Diego Calvanese‚ Enrico Franconi‚ Maurizio Lenzerini and Letizia Tanca, editors, Proceedings of the Thirteenth Italian Symposium on Advanced Database Systems‚ SEBD 2005‚ Brixen−Bressanone (near Bozen−Bolzano)‚ Italy‚ June 19−22‚ 2005. Pages 55−66. 2005.

  Details about Boosting Information Integration: The INFOMIX System | BibTeX data for Boosting Information Integration: The INFOMIX System

• [47]

  The 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 and Witold Staniszkis

  In Fatma Özcan, editor, Proceedings of the ACM SIGMOD International Conference on Management of Data‚ Baltimore‚ Maryland‚ USA‚ June 14−16‚ 2005. Pages 915−917. ACM. 2005.

  Details about The INFOMIX system for advanced integration of incomplete and inconsistent data | BibTeX data for The INFOMIX system for advanced integration of incomplete and inconsistent data | DOI (10.1145/1066157.1066286)

• [48]

  Hypertree Decompositions: Structure‚ Algorithms‚ and Applications

  Georg Gottlob‚ Martin Grohe‚ Nysret Musliu‚ Marko Samer and Francesco Scarcello

  In Dieter Kratsch, editor, Graph−Theoretic Concepts in Computer Science‚ 31st International Workshop‚ WG 2005‚ Metz‚ France‚ June 23−25‚ 2005‚ Revised Selected Papers. Vol. 3787 of Lecture Notes in Computer Science. Pages 1−15. Springer. 2005.

  Details about Hypertree Decompositions: Structure‚ Algorithms‚ and Applications | BibTeX data for Hypertree Decompositions: Structure‚ Algorithms‚ and Applications | DOI (10.1007/11604686_1)

• [49]

  Integrating Semi−structured Data into Business Applications: A Web Intelligence Example

  Robert Baumgartner‚ Oliver Frölich‚ Georg Gottlob‚ Marcus Herzog and Peter Lehmann

  In Klaus−Dieter Althoff‚ Andreas Dengel‚ Ralph Bergmann‚ Markus Nick and Thomas Roth−Berghofer, editors, Professional Knowledge Management‚ Third Biennial Conference‚ WM 2005‚ Kaiserslautern‚ Germany‚ April 10−13‚ 2005‚ Revised Selected Papers. Vol. 3782 of Lecture Notes in Computer Science. Pages 469−482. Springer. 2005.

  Details about Integrating Semi−structured Data into Business Applications: A Web Intelligence Example | BibTeX data for Integrating Semi−structured Data into Business Applications: A Web Intelligence Example | DOI (10.1007/11590019_54)

• [50]

  Hypergraph Transversals

  Georg Gottlob

  In Dietmar Seipel and Jose Maria Turull Torres, editors, Foundations of Information and Knowledge Systems‚ Third International Symposium‚ FoIKS 2004‚ Wilhelminenburg Castle‚ Austria‚ February 17−20‚ 2004‚ Proceedings. Vol. 2942 of Lecture Notes in Computer Science. Pages 1−5. Springer. 2004.

  Details about Hypergraph Transversals | BibTeX data for Hypergraph Transversals | Link to Hypergraph Transversals

• [51]

  Second−Order Logic over Finite Structures − Report on a Research Programme

  Georg Gottlob

  In David A. Basin and Michaël Rusinowitch, editors, Automated Reasoning − Second International Joint Conference‚ IJCAR 2004‚ Cork‚ Ireland‚ July 4−8‚ 2004‚ Proceedings. Vol. 3097 of Lecture Notes in Computer Science. Pages 229−243. Springer. 2004.

  Details about Second−Order Logic over Finite Structures − Report on a Research Programme | BibTeX data for Second−Order Logic over Finite Structures − Report on a Research Programme | Link to Second−Order Logic over Finite Structures − Report on a Research Programme

• [52]

  The Lixto Data Extraction Project − Back and Forth between Theory and Practice

  Georg Gottlob‚ Christoph Koch‚ Robert Baumgartner‚ Marcus Herzog and Sergio Flesca

  In Alin Deutsch, editor, Proceedings of the Twenty−third ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 14−16‚ 2004‚ Paris‚ France. Pages 1−12. ACM. 2004.

  Details about The Lixto Data Extraction Project − Back and Forth between Theory and Practice | BibTeX data for The Lixto Data Extraction Project − Back and Forth between Theory and Practice | DOI (10.1145/1055558.1055560) | Download (pdf) of The Lixto Data Extraction Project − Back and Forth between Theory and Practice

• [53]

  Conjunctive Queries over Trees

  Georg Gottlob‚ Christoph Koch and Klaus U. Schulz

  In Alin Deutsch, editor, Proceedings of the Twenty−third ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 14−16‚ 2004‚ Paris‚ France. Pages 189−200. ACM. 2004.

  Details about Conjunctive Queries over Trees | BibTeX data for Conjunctive Queries over Trees | DOI (10.1145/1055558.1055585) | Download (pdf) of Conjunctive Queries over Trees

• [54]

  Interactively Adding Web Service Interfaces to Existing Web Applications

  Robert Baumgartner‚ Georg Gottlob‚ Marcus Herzog and Wolfgang Slany

  In 2004 Symposium on Applications and the Internet (SAINT 2004)‚ 26−30 January 2004‚ Tokyo‚ Japan. Pages 74−80. IEEE Computer Society. 2004.

  Details about Interactively Adding Web Service Interfaces to Existing Web Applications | BibTeX data for Interactively Adding Web Service Interfaces to Existing Web Applications | Link to Interactively Adding Web Service Interfaces to Existing Web Applications

• [55]

  XPath Query Processing

  Georg Gottlob and Christoph Koch

  In Georg Lausen and Dan Suciu, editors, Database Programming Languages‚ 9th International Workshop‚ DBPL 2003‚ Potsdam‚ Germany‚ September 6−8‚ 2003‚ Revised Papers. Vol. 2921 of Lecture Notes in Computer Science. Pages 20. Springer. 2003.

  Details about XPath Query Processing | BibTeX data for XPath Query Processing | Link to XPath Query Processing

• [56]

  XPath Query Evaluation: Improving Time and Space Efficiency

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In Umeshwar Dayal‚ Krithi Ramamritham and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering‚ March 5−8‚ 2003‚ Bangalore‚ India. Pages 379−390. IEEE Computer Society. 2003.

  Details about XPath Query Evaluation: Improving Time and Space Efficiency | BibTeX data for XPath Query Evaluation: Improving Time and Space Efficiency | Link to XPath Query Evaluation: Improving Time and Space Efficiency

• [57]

  Web Information Acquisition with Lixto Suite

  Robert Baumgartner‚ Michal Ceresna‚ Georg Gottlob‚ Marcus Herzog and Viktor Zigo

  In Umeshwar Dayal‚ Krithi Ramamritham and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering‚ March 5−8‚ 2003‚ Bangalore‚ India. Pages 747−749. IEEE Computer Society. 2003.

  Details about Web Information Acquisition with Lixto Suite | BibTeX data for Web Information Acquisition with Lixto Suite | Link to Web Information Acquisition with Lixto Suite

• [58]

  Visual Programming of Web Data Aggregation Applications

  Robert Baumgartner‚ Georg Gottlob and Marcus Herzog

  In Subbarao Kambhampati and Craig A. Knoblock, editors, Proceedings of IJCAI−03 Workshop on Information Integration on the Web (IIWeb−03)‚ August 9−10‚ 2003‚ Acapulco‚ Mexico. Pages 137−142. 2003.

  Details about Visual Programming of Web Data Aggregation Applications | BibTeX data for Visual Programming of Web Data Aggregation Applications | DOI (http://www.isi.edu/info-agents/workshops/ijcai03/papers/Herzog-ijcai03-herzog.pdf)

• [59]

  The complexity of XPath query evaluation

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In Proceedings of the Twenty−Second ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 9−12‚ 2003‚ San Diego‚ CA‚ USA. Pages 179−190. ACM. 2003.

  Details about The complexity of XPath query evaluation | BibTeX data for The complexity of XPath query evaluation | DOI (10.1145/773153.773171)

• [60]

  Pure Nash equilibria: hard and easy games

  Georg Gottlob‚ Gianluigi Greco and Francesco Scarcello

  In Joseph Y. Halpern and Moshe Tennenholtz, editors, Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK−2003)‚ Bloomington‚ Indiana‚ USA‚ June 20−22‚ 2003. Pages 215−230. ACM. 2003.

  Details about Pure Nash equilibria: hard and easy games | BibTeX data for Pure Nash equilibria: hard and easy games | DOI (10.1145/846241.846269)

• [61]

  Multiagent Compromises‚ Joint Fixpoints‚ and Stable Models

  Francesco Buccafurri and Georg Gottlob

  In Antonis C. Kakas and Fariba Sadri, editors, Computational Logic: Logic Programming and Beyond‚ Essays in Honour of Robert A. Kowalski‚ Part I. Vol. 2407 of Lecture Notes in Computer Science. Pages 561−585. Springer. 2002.

  Details about Multiagent Compromises‚ Joint Fixpoints‚ and Stable Models | BibTeX data for Multiagent Compromises‚ Joint Fixpoints‚ and Stable Models | Link to Multiagent Compromises‚ Joint Fixpoints‚ and Stable Models

• [62]

  Combining hypertree‚ bicomp‚ and hinge decomposition

  Georg Gottlob‚ Martin Hutle and Franz Wotawa

  In Frank van Harmelen, editor, Proceedings of the 15th Eureopean Conference on Artificial Intelligence‚ ECAI'2002‚ Lyon‚ France‚ July 2002. Pages 161−165. IOS Press. 2002.

  Details about Combining hypertree‚ bicomp‚ and hinge decomposition | BibTeX data for Combining hypertree‚ bicomp‚ and hinge decomposition

• [63]

  The 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 and Axel Polleres

  In Sergio Flesca‚ Sergio Greco‚ Nicola Leone and Giovambattista Ianni, editors, Logics in Artificial Intelligence‚ European Conference‚ JELIA 2002‚ Cosenza‚ Italy‚ September‚ 23−26‚ Proceedings. Vol. 2424 of Lecture Notes in Computer Science. Pages 537−540. Springer. 2002.

  Details about The DLV System | BibTeX data for The DLV System | Link to The DLV System

• [64]

  Hypergraph Transversal Computation and Related Problems in Logic and AI

  Thomas Eiter and Georg Gottlob

  In Sergio Flesca‚ Sergio Greco‚ Nicola Leone and Giovambattista Ianni, editors, Logics in Artificial Intelligence‚ European Conference‚ JELIA 2002‚ Cosenza‚ Italy‚ September‚ 23−26‚ Proceedings. Vol. 2424 of Lecture Notes in Computer Science. Pages 549−564. Springer. 2002.

  Details about Hypergraph Transversal Computation and Related Problems in Logic and AI | BibTeX data for Hypergraph Transversal Computation and Related Problems in Logic and AI | Link to Hypergraph Transversal Computation and Related Problems in Logic and AI

• [65]

  Monadic Queries over Tree−Structured Data

  Georg Gottlob and Christoph Koch

  In 17th IEEE Symposium on Logic in Computer Science (LICS 2002)‚ 22−25 July 2002‚ Copenhagen‚ Denmark‚ Proceedings. Pages 189−202. IEEE Computer Society. 2002.

  Details about Monadic Queries over Tree−Structured Data | BibTeX data for Monadic Queries over Tree−Structured Data | DOI (10.1109/LICS.2002.1029828)

• [66]

  Visual Data Extraction Through Visual Logic Programming

  Georg Gottlob

  In Salem Benferhat and Enrico Giunchiglia, editors, 9th International Workshop on Non−Monotonic Reasoning (NMR 2002)‚ April 19−21‚ Toulouse‚ France‚ Proceedings. Pages 4. 2002.

  Details about Visual Data Extraction Through Visual Logic Programming | BibTeX data for Visual Data Extraction Through Visual Logic Programming

• [67]

  Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

  Georg Gottlob and Christoph Koch

  In Lucian Popa, editor, Proceedings of the Twenty−first ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 3−5‚ Madison‚ Wisconsin‚ USA. Pages 17−28. ACM. 2002.

  Details about Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | BibTeX data for Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | DOI (10.1145/543613.543617) | Download (pdf) of Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

• [68]

  New results on monotone dualization and generating hypergraph transversals

  Thomas Eiter‚ Georg Gottlob and Kazuhisa Makino

  In STOC. Pages 14−22. 2002.

  Details about New results on monotone dualization and generating hypergraph transversals | BibTeX data for New results on monotone dualization and generating hypergraph transversals | DOI (10.1145/509907.509912)

• [69]

  Efficient Algorithms for Processing XPath Queries

  Georg Gottlob‚ Christoph Koch and Reinhard Pichler

  In VLDB 2002‚ Proceedings of 28th International Conference on Very Large Data Bases‚ August 20−23‚ 2002‚ Hong Kong‚ China. Pages 95−106. Morgan Kaufmann. 2002.

  Details about Efficient Algorithms for Processing XPath Queries | BibTeX data for Efficient Algorithms for Processing XPath Queries | Download (pdf) of Efficient Algorithms for Processing XPath Queries

• [70]

  Second−Order Logic over Strings: Regular and Non−regular Fragments

  Thomas Eiter‚ Georg Gottlob and Thomas Schwentick

  In Werner Kuich‚ Grzegorz Rozenberg and Arto Salomaa, editors, Developments in Language Theory‚ 5th International Conference‚ DLT 2001‚ Vienna‚ Austria‚ July 16−21‚ 2001‚ Revised Papers. Vol. 2295 of Lecture Notes in Computer Science. Pages 37−56. Springer. 2001.

  Details about Second−Order Logic over Strings: Regular and Non−regular Fragments | BibTeX data for Second−Order Logic over Strings: Regular and Non−regular Fragments | Link to Second−Order Logic over Strings: Regular and Non−regular Fragments

• [71]

  Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width

  Georg Gottlob and Reinhard Pichler

  In Fernando Orejas‚ Paul G. Spirakis and Jan van Leeuwen, editors, Automata‚ Languages and Programming‚ 28th International Colloquium‚ ICALP 2001‚ Crete‚ Greece‚ July 8−12‚ 2001‚ Proceedings. Vol. 2076 of Lecture Notes in Computer Science. Pages 708−719. Springer. 2001.

  Details about Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width | BibTeX data for Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width | Link to Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width

• [72]

  Complexity of Nested Circumscription and Abnormality Theories

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In Bernhard Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence‚ IJCAI 2001‚ Seattle‚ Washington‚ USA‚ August 4−10‚ 2001. Pages 169−174. Morgan Kaufmann. 2001.

  Details about Complexity of Nested Circumscription and Abnormality Theories | BibTeX data for Complexity of Nested Circumscription and Abnormality Theories

• [73]

  The Elog Web Extraction Language

  Robert Baumgartner‚ Sergio Flesca and Georg Gottlob

  In Robert Nieuwenhuis and Andrei Voronkov, editors, Logic for Programming‚ Artificial Intelligence‚ and Reasoning‚ 8th International Conference‚ LPAR 2001‚ Havana‚ Cuba‚ December 3−7‚ 2001‚ Proceedings. Vol. 2250 of Lecture Notes in Computer Science. Pages 548−560. Springer. 2001.

  Details about The Elog Web Extraction Language | BibTeX data for The Elog Web Extraction Language | Link to The Elog Web Extraction Language

• [74]

  Declarative Information Extraction‚ Web Crawling‚ and Recursive Wrapping with Lixto

  Robert Baumgartner‚ Sergio Flesca and Georg Gottlob

  In Thomas Eiter‚ Wolfgang Faber and Miroslaw Truszczynski, editors, Logic Programming and Nonmonotonic Reasoning‚ 6th International Conference‚ LPNMR 2001‚ Vienna‚ Austria‚ September 17−19‚ 2001‚ Proceedings. Vol. 2173 of Lecture Notes in Computer Science. Pages 21−41. Springer. 2001.

  Details about Declarative Information Extraction‚ Web Crawling‚ and Recursive Wrapping with Lixto | BibTeX data for Declarative Information Extraction‚ Web Crawling‚ and Recursive Wrapping with Lixto | Link to Declarative Information Extraction‚ Web Crawling‚ and Recursive Wrapping with Lixto

• [75]

  Hypertree Decompositions: A Survey

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Jiri Sgall‚ Ales Pultr and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001‚ 26th International Symposium‚ MFCS 2001 Marianske Lazne‚ Czech Republic‚ August 27−31‚ 2001‚ Proceedings. Vol. 2136 of Lecture Notes in Computer Science. Pages 37−57. Springer. 2001.

  Details about Hypertree Decompositions: A Survey | BibTeX data for Hypertree Decompositions: A Survey | Link to Hypertree Decompositions: A Survey

• [76]

  Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Proceedings of the Twentieth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ May 21−23‚ 2001‚ Santa Barbara‚ California‚ USA. ACM. 2001.

  Details about Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | BibTeX data for Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | DOI (10.1145/375551.375579) | Download (pdf) of Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

• [77]

  Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In SEBD. Pages 147−154. 2001.

  Details about Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | BibTeX data for Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

• [78]

  The Lixto Wrapper Generation Tool

  Georg Gottlob

  In SEBD. Pages 3−10. 2001.

  Details about The Lixto Wrapper Generation Tool | BibTeX data for The Lixto Wrapper Generation Tool

• [79]

  InfoPipes: A Flexible Framework for M−Commerce Applications

  Marcus Herzog and Georg Gottlob

  In Fabio Casati‚ Dimitrios Georgakopoulos and Ming−Chien Shan, editors, Technologies for E−Services‚ Second International Workshop‚ TES 2001‚ Rome‚ Italy‚ September 14−15‚ 2001‚ Proceedings. Vol. 2193 of Lecture Notes in Computer Science. Pages 175−186. Springer. 2001.

  Details about InfoPipes: A Flexible Framework for M−Commerce Applications | BibTeX data for InfoPipes: A Flexible Framework for M−Commerce Applications | Link to InfoPipes: A Flexible Framework for M−Commerce Applications

• [80]

  Visual Web Information Extraction with Lixto

  Robert Baumgartner‚ Sergio Flesca and Georg Gottlob

  In Peter M. G. Apers‚ Paolo Atzeni‚ Stefano Ceri‚ Stefano Paraboschi‚ Kotagiri Ramamohanarao and Richard T. Snodgrass, editors, VLDB 2001‚ Proceedings of 27th International Conference on Very Large Data Bases‚ September 11−14‚ 2001‚ Roma‚ Italy. Pages 119−128. Morgan Kaufmann. 2001.

  Details about Visual Web Information Extraction with Lixto | BibTeX data for Visual Web Information Extraction with Lixto | Download (pdf) of Visual Web Information Extraction with Lixto

• [81]

  Supervised Wrapper Generation with Lixto

  Robert Baumgartner‚ Sergio Flesca and Georg Gottlob

  In Peter M. G. Apers‚ Paolo Atzeni‚ Stefano Ceri‚ Stefano Paraboschi‚ Kotagiri Ramamohanarao and Richard T. Snodgrass, editors, VLDB 2001‚ Proceedings of 27th International Conference on Very Large Data Bases‚ September 11−14‚ 2001‚ Roma‚ Italy. Pages 715−716. Morgan Kaufmann. 2001.

  Details about Supervised Wrapper Generation with Lixto | BibTeX data for Supervised Wrapper Generation with Lixto | Download (pdf) of Supervised Wrapper Generation with Lixto

• [82]

  Existential Second−Order Logic over Graphs: Charting the Tractability Frontier

  Georg Gottlob‚ Phokion G. Kolaitis and Thomas Schwentick

  In FOCS. Pages 664−674. 2000.

  Details about Existential Second−Order Logic over Graphs: Charting the Tractability Frontier | BibTeX data for Existential Second−Order Logic over Graphs: Charting the Tractability Frontier

• [83]

  On the Complexity of Theory Curbing

  Thomas Eiter and Georg Gottlob

  In Michel Parigot and Andrei Voronkov, editors, Logic for Programming and Automated Reasoning‚ 7th International Conference‚ LPAR 2000‚ Reunion Island‚ France‚ November 11−12‚ 2000‚ Proceedings. Vol. 1955 of Lecture Notes in Computer Science. Pages 1−19. Springer. 2000.

  Details about On the Complexity of Theory Curbing | BibTeX data for On the Complexity of Theory Curbing | Link to On the Complexity of Theory Curbing

• [84]

  On Tractable Queries and Constraints

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Trevor J. M. Bench−Capon‚ Giovanni Soda and A. Min Tjoa, editors, Database and Expert Systems Applications‚ 10th International Conference‚ DEXA '99‚ Florence‚ Italy‚ August 30 − September 3‚ 1999‚ Proceedings. Vol. 1677 of Lecture Notes in Computer Science. Pages 1−15. Springer. 1999.

  Details about On Tractable Queries and Constraints | BibTeX data for On Tractable Queries and Constraints | Link to On Tractable Queries and Constraints

• [85]

  Computing LOGCFL Certificates

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Jirí Wiedermann‚ Peter van Emde Boas and Mogens Nielsen, editors, Automata‚ Languages and Programming‚ 26th International Colloquium‚ ICALP'99‚ Prague‚ Czech Republic‚ July 11−15‚ 1999‚ Proceedings. Vol. 1644 of Lecture Notes in Computer Science. Pages 361−371. Springer. 1999.

  Details about Computing LOGCFL Certificates | BibTeX data for Computing LOGCFL Certificates | Link to Computing LOGCFL Certificates

• [86]

  A Comparison of Structural CSP Decomposition Methods

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence‚ IJCAI 99‚ Stockholm‚ Sweden‚ July 31 − August 6‚ 1999. 2 Volumes‚ 1450 pages. Pages 394−399. Morgan Kaufmann. 1999.

  Details about A Comparison of Structural CSP Decomposition Methods | BibTeX data for A Comparison of Structural CSP Decomposition Methods

• [87]

  On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases

  Robert Baumgartner and Georg Gottlob

  In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence‚ IJCAI 99‚ Stockholm‚ Sweden‚ July 31 − August 6‚ 1999. 2 Volumes‚ 1450 pages. Pages 64−69. Morgan Kaufmann. 1999.

  Details about On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases | BibTeX data for On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases

• [88]

  Working with Arms: Complexity Results on Atomic Representations of Herbrand Models

  Georg Gottlob and Reinhard Pichler

  In LICS. Pages 306−315. 1999.

  Details about Working with Arms: Complexity Results on Atomic Representations of Herbrand Models | BibTeX data for Working with Arms: Complexity Results on Atomic Representations of Herbrand Models | Link to Working with Arms: Complexity Results on Atomic Representations of Herbrand Models

• [89]

  On the Complexity of Single−Rule Datalog Queries

  Georg Gottlob and Christos H. Papadimitriou

  In Harald Ganzinger‚ David A. McAllester and Andrei Voronkov, editors, Logic Programming and Automated Reasoning‚ 6th International Conference‚ LPAR'99‚ Tbilisi‚ Georgia‚ September 6−10‚ 1999‚ Proceedings. Vol. 1705 of Lecture Notes in Computer Science. Pages 201−222. Springer. 1999.

  Details about On the Complexity of Single−Rule Datalog Queries | BibTeX data for On the Complexity of Single−Rule Datalog Queries

• [90]

  Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning

  Georg Gottlob‚ Francesco Scarcello and Martha Sideri

  In Michael Gelfond‚ Nicola Leone and Gerald Pfeifer, editors, Logic Programming and Nonmonotonic Reasoning‚ 5th International Conference‚ LPNMR'99‚ El Paso‚ Texas‚ USA‚ December 2−4‚ 1999‚ Proceedings. Vol. 1730 of Lecture Notes in Computer Science. Pages 1−18. Springer. 1999.

  Details about Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning | BibTeX data for Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning | Link to Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning

• [91]

  Hypertree Decompositions and Tractable Queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Proceedings of the Eighteenth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ May 31 − June 2‚ 1999‚ Philadelphia‚ Pennsylvania. Pages 21−32. ACM Press. 1999.

  Details about Hypertree Decompositions and Tractable Queries | BibTeX data for Hypertree Decompositions and Tractable Queries | DOI (10.1145/303976.303979) | Link to Hypertree Decompositions and Tractable Queries

• [92]

  Hypertree Decompositions and Tractable Queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In SEBD. Pages 275−289. 1999.

  Details about Hypertree Decompositions and Tractable Queries | BibTeX data for Hypertree Decompositions and Tractable Queries

• [93]

  The Complexity of Acyclic Conjunctive Queries

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In FOCS. Pages 706−715. 1998.

  Details about The Complexity of Acyclic Conjunctive Queries | BibTeX data for The Complexity of Acyclic Conjunctive Queries | Link to The Complexity of Acyclic Conjunctive Queries

• [94]

  Existential Second−Order Logic over Strings

  Thomas Eiter‚ Georg Gottlob and Yuri Gurevich

  In LICS. Pages 16−27. 1998.

  Details about Existential Second−Order Logic over Strings | BibTeX data for Existential Second−Order Logic over Strings

• [95]

  Generalized Quantifiers in Logic Programs

  Thomas Eiter‚ Georg Gottlob and Helmut Veith

  In Jouko A. Väänänen, editor, Generalized Quantifiers and Computation‚ 9th European Summer School in Logic‚ Language‚ and Information‚ ESSLLI'97 Workshop‚ Aix−en−Provence‚ France‚ August 11−22‚ 1997‚ Revised Lectures. Vol. 1754 of Lecture Notes in Computer Science. Pages 72−98. Springer. 1997.

  Details about Generalized Quantifiers in Logic Programs | BibTeX data for Generalized Quantifiers in Logic Programs | Link to Generalized Quantifiers in Logic Programs

• [96]

  The Complexity Class Theta₂^p: Recent Results and Applications in AI and Modal Logic

  Thomas Eiter and Georg Gottlob

  In Bogdan S. Chlebus and Ludwik Czaja, editors, Fundamentals of Computation Theory‚ 11th International Symposium‚ FCT '97‚ Kraków‚ Poland‚ September 1−3‚ 1997‚ Proceedings. Vol. 1279 of Lecture Notes in Computer Science. Pages 1−18. Springer. 1997.

  Details about The Complexity Class Theta₂^p: Recent Results and Applications in AI and Modal Logic | BibTeX data for The Complexity Class Theta₂^p: Recent Results and Applications in AI and Modal Logic

• [97]

  Complexity and Expressive Power of Logic Programming

  Evgeny Dantsin‚ Thomas Eiter‚ Georg Gottlob and Andrei Voronkov

  In IEEE Conference on Computational Complexity. Pages 82−101. 1997.

  Details about Complexity and Expressive Power of Logic Programming | BibTeX data for Complexity and Expressive Power of Logic Programming | Link to Complexity and Expressive Power of Logic Programming

• [98]

  On the Complexity of Some Inductive Logic Programming Problems

  Georg Gottlob‚ Nicola Leone and Francesco Scarcello

  In Nada Lavrac and Saso Dzeroski, editors, Inductive Logic Programming‚ 7th International Workshop‚ ILP−97‚ Prague‚ Czech Republic‚ September 17−20‚ 1997‚ Proceedings. Vol. 1297 of Lecture Notes in Computer Science. Pages 17−32. Springer. 1997.

  Details about On the Complexity of Some Inductive Logic Programming Problems | BibTeX data for On the Complexity of Some Inductive Logic Programming Problems

• [99]

  Modular Logic Programming and Generalized Quantifiers

  Thomas Eiter‚ Georg Gottlob and Helmut Veith

  In Jürgen Dix‚ Ulrich Furbach and Anil Nerode, editors, Logic Programming and Nonmonotonic Reasoning‚ 4th International Conference‚ LPNMR'97‚ Dagstuhl Castle‚ Germany‚ July 28−31‚ 1997‚ Proceedings. Vol. 1265 of Lecture Notes in Computer Science. Pages 290−309. Springer. 1997.

  Details about Modular Logic Programming and Generalized Quantifiers | BibTeX data for Modular Logic Programming and Generalized Quantifiers

• [100]

  The 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 and Francesco Scarcello

  In WLP. Pages 0−. 1997.

  Details about The dlv System: Model Generator and Advanced Frontends (system description) | BibTeX data for The dlv System: Model Generator and Advanced Frontends (system description)

• [101]

  The PARK Semantics for Active Rules

  Georg Gottlob‚ Guido Moerkotte and V. S. Subrahmanian

  In Peter M. G. Apers‚ Mokrane Bouzeghoub and Georges Gardarin, editors, Advances in Database Technology − EDBT'96‚ 5th International Conference on Extending Database Technology‚ Avignon‚ France‚ March 25−29‚ 1996‚ Proceedings. Vol. 1057 of Lecture Notes in Computer Science. Pages 35−55. Springer. 1996.

  Details about The PARK Semantics for Active Rules | BibTeX data for The PARK Semantics for Active Rules | Link to The PARK Semantics for Active Rules

• [102]

  Collapsing Oracle−Tape Hierarchies

  Georg Gottlob

  In IEEE Conference on Computational Complexity. Pages 33−42. 1996.

  Details about Collapsing Oracle−Tape Hierarchies | BibTeX data for Collapsing Oracle−Tape Hierarchies | Link to Collapsing Oracle−Tape Hierarchies

• [103]

  Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract)

  Georg Gottlob

  In KR. Pages 647−649. 1996.

  Details about Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract) | BibTeX data for Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract)

• [104]

  Semantics and Complexity of Abduction from Default Theories

  Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In IJCAI (1). Pages 870−877. 1995.

  Details about Semantics and Complexity of Abduction from Default Theories | BibTeX data for Semantics and Complexity of Abduction from Default Theories

• [105]

  Relativized Logspace and Generalized Quantifiers over Finite Structures

  Georg Gottlob

  In Proceedings‚ Tenth Annual IEEE Symposium on Logic in Computer Science‚ 26−29 June 1995‚ San Diego‚ California‚ USA. Pages 65−78. IEEE Computer Society. 1995.

  Details about Relativized Logspace and Generalized Quantifiers over Finite Structures | BibTeX data for Relativized Logspace and Generalized Quantifiers over Finite Structures

• [106]

  Complexity Results for Abductive Logic Programming

  Thomas Eiter‚ Georg Gottlob and Nicola Leone

  In V. Wiktor Marek and Anil Nerode, editors, Logic Programming and Nonmonotonic Reasoning‚ Third International Conference‚ LPNMR'95‚ Lexington‚ KY‚ USA‚ June 26−28‚ 1995‚ Proceedings. Vol. 928 of Lecture Notes in Computer Science. Pages 1−14. Springer. 1995.

  Details about Complexity Results for Abductive Logic Programming | BibTeX data for Complexity Results for Abductive Logic Programming

• [107]

  Second Order Logic and the Weak Exponential Hierarchies

  Georg Gottlob‚ Nicola Leone and Helmut Veith

  In Jirí Wiedermann and Petr Hájek, editors, Mathematical Foundations of Computer Science 1995‚ 20th International Symposium‚ MFCS'95‚ Prague‚ Czech Republic‚ August 28 − September 1‚ 1995‚ Proceedings. Vol. 969 of Lecture Notes in Computer Science. Pages 66−81. Springer. 1995.

  Details about Second Order Logic and the Weak Exponential Hierarchies | BibTeX data for Second Order Logic and the Weak Exponential Hierarchies

• [108]

  The Evolving Algebra Semantics of Class and Role Hierarchies

  Georg Gottlob‚ Gerti Kappel and Michael Schrefl

  In Leonid Libkin and Bernhard Thalheim, editors, Semantics in Databases‚ Selected Papers from a Workshop‚ Prague‚ Czech Republic‚ 1995. Vol. 1358 of Lecture Notes in Computer Science. Pages 92−113. Springer. 1995.

  Details about The Evolving Algebra Semantics of Class and Role Hierarchies | BibTeX data for The Evolving Algebra Semantics of Class and Role Hierarchies

• [109]

  Disjunctive Logic Programming over Finite Structures

  Thomas Eiter‚ Georg Gottlob and Heikki Mannila

  In GI Jahrestagung. Pages 69−73. 1994.

  Details about Disjunctive Logic Programming over Finite Structures | BibTeX data for Disjunctive Logic Programming over Finite Structures

• [110]

  Causal Models of Disjunctive Logic Programs

  Jürgen Dix‚ Georg Gottlob and V. Wiktor Marek

  In ICLP. Pages 290−302. 1994.

  Details about Causal Models of Disjunctive Logic Programs | BibTeX data for Causal Models of Disjunctive Logic Programs

• [111]

  Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics

  Thomas Eiter‚ Georg Gottlob and Heikki Mannila

  In Kai von Luck and Heinz Marburger, editors, Management and Processing of Complex Data Structures‚ Third Workshop on Information Systems and Artificial Intelligence‚ Hamburg‚ Germany‚ February 28 − March 2‚ 1994‚ Proceedings. Vol. 777 of Lecture Notes in Computer Science. Pages 83−103. Springer. 1994.

  Details about Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics | BibTeX data for Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics

• [112]

  From Carnap's Modal Logic to Autoepistemic Logic

  Georg Gottlob

  In Craig MacNish‚ David Pearce and Luís Moniz Pereira, editors, Logics in Artificial Intelligence‚ European Workshop‚ JELIA '94‚ York‚ UK‚ September 5−8‚ 1994‚ Proceedings. Vol. 838 of Lecture Notes in Computer Science. Pages 1−18. Springer. 1994.

  Details about From Carnap's Modal Logic to Autoepistemic Logic | BibTeX data for From Carnap's Modal Logic to Autoepistemic Logic

• [113]

  Default Logic as a Query Language

  Marco Cadoli‚ Thomas Eiter and Georg Gottlob

  In KR. Pages 99−108. 1994.

  Details about Default Logic as a Query Language | BibTeX data for Default Logic as a Query Language

• [114]

  Adding Disjunction to Datalog

  Thomas Eiter‚ Georg Gottlob and Heikki Mannila

  In Proceedings of the Thirteenth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ May 24−26‚ 1994‚ Minneapolis‚ Minnesota. Pages 267−278. ACM Press. 1994.

  Details about Adding Disjunction to Datalog | BibTeX data for Adding Disjunction to Datalog | DOI (10.1145/182591.182639) | Link to Adding Disjunction to Datalog

• [115]

  Complexity and Expressive Power of Disjunctive Logic Programming

  Georg Gottlob

  In SLP. Pages 23−42. 1994.

  Details about Complexity and Expressive Power of Disjunctive Logic Programming | BibTeX data for Complexity and Expressive Power of Disjunctive Logic Programming

• [116]

  The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

  Georg Gottlob

  In Gerhard Lakemeyer and Bernhard Nebel, editors, Foundation of Knowledge Representation and Reasoning (the book grew out of an ECAI−92 workshop). Vol. 810 of Lecture Notes in Computer Science. Pages 133−144. Springer. 1994.

  Details about The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic | BibTeX data for The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

• [117]

  NP Trees and Carnap's Modal Logic

  Georg Gottlob

  In 34th Annual Symposium on Foundations of Computer Science‚ 3−5 November 1993‚ Palo Alto‚ California‚ USA. Pages 42−51. IEEE. 1993.

  Details about NP Trees and Carnap's Modal Logic | BibTeX data for NP Trees and Carnap's Modal Logic

• [118]

  The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

  Thomas Eiter and Georg Gottlob

  In IJCAI. Pages 526−533. 1993.

  Details about The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions | BibTeX data for The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

• [119]

  The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

  Georg Gottlob

  In IJCAI. Pages 570−577. 1993.

  Details about The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic | BibTeX data for The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

• [120]

  Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information

  Thomas Eiter‚ Georg Gottlob and Yuri Gurevich

  In IJCAI. Pages 634−639. 1993.

  Details about Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information | BibTeX data for Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information

• [121]

  Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics

  Thomas Eiter and Georg Gottlob

  In ILPS. Pages 266−278. 1993.

  Details about Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics | BibTeX data for Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics

• [122]

  Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)

  Georg Gottlob

  In LPNMR. Pages 265. 1993.

  Details about Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract) | BibTeX data for Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)

• [123]

  Complexity Aspects of Various Semantics for Disjunctive Databases

  Thomas Eiter and Georg Gottlob

  In Proceedings of the Twelfth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ May 25−28‚ 1993‚ Washington‚ DC. Pages 158−167. ACM Press. 1993.

  Details about Complexity Aspects of Various Semantics for Disjunctive Databases | BibTeX data for Complexity Aspects of Various Semantics for Disjunctive Databases | DOI (10.1145/153850.153864) | Link to Complexity Aspects of Various Semantics for Disjunctive Databases

• [124]

  The Complexity of Logic−Based Abduction

  Thomas Eiter and Georg Gottlob

  In Patrice Enjalbert‚ Alain Finkel and Klaus W. Wagner, editors, STACS 93‚ 10th Annual Symposium on Theoretical Aspects of Computer Science‚ Würzburg‚ Germany‚ February 25−27‚ 1993‚ Proceedings. Vol. 665 of Lecture Notes in Computer Science. Pages 70−79. Springer. 1993.

  Details about The Complexity of Logic−Based Abduction | BibTeX data for The Complexity of Logic−Based Abduction

• [125]

  Complexity of Propositional Knowledge Base Revision

  Thomas Eiter and Georg Gottlob

  In Gérard Comyn‚ Matthias Jarke and Suryanarayana M. Sripada, editors, CNKBS'92‚ Proceedings of the First Compulog Net Meeting on Knowledge Bases‚ Munich‚ Germany‚ 6−7 February 1992. Vol. ECRC−92−2. Pages 38−40. European Computer−Industry Research Centre‚ Munich. 1992.

  Details about Complexity of Propositional Knowledge Base Revision | BibTeX data for Complexity of Propositional Knowledge Base Revision

• [126]

  Formaiizing the Repair Process

  Gerhard Friedrich‚ Georg Gottlob and Wolfgang Nejdl

  In ECAI. Pages 709−713. 1992.

  Details about Formaiizing the Repair Process | BibTeX data for Formaiizing the Repair Process

• [127]

  On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals

  Thomas Eiter and Georg Gottlob

  In Proceedings of the Eleventh ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ June 2−4‚ 1992‚ San Diego‚ California. Pages 261−273. ACM Press. 1992.

  Details about On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals | BibTeX data for On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals | DOI (10.1145/137097.137886) | Link to On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals

• [128]

  Complexity Results for Logic−Based Abduction

  Thomas Eiter and Georg Gottlob

  In Structural Complexity and Recursion−theoretic methods in Logic−Programming. Pages 29−44. 1992.

  Details about Complexity Results for Logic−Based Abduction | BibTeX data for Complexity Results for Logic−Based Abduction

• [129]

  On the Complexity of Clause Condensing

  Georg Gottlob

  In Hermann Kaindl, editor, Proc. 7th Austrian Conference on Artificial Intelligence‚ ÖGAI−91‚ Wien‚ 24.−27. September 1991. Vol. 287 of Informatik−Fachberichte. Pages 16−29. Springer. 1991.

  Details about On the Complexity of Clause Condensing | BibTeX data for On the Complexity of Clause Condensing

• [130]

  Towards a Theory of the Repair Process

  Gerhard Friedrich‚ Georg Gottlob and Wolfgang Nejdl

  In Pedro Barahona‚ Luís Moniz Pereira and António Porto, editors, EPIA 91‚ 5th Portuguese Conference on Artificial Intelligence‚ Albufeira‚ Portugal‚ October 1−3‚ 1991‚ Proceedings. Vol. 541 of Lecture Notes in Computer Science. Pages 222−236. Springer. 1991.

  Details about Towards a Theory of the Repair Process | BibTeX data for Towards a Theory of the Repair Process

• [131]

  Physical Impossibility Instead of Fault Models

  Gerhard Friedrich‚ Georg Gottlob and Wolfgang Nejdl

  In AAAI. Pages 331−336. 1990.

  Details about Physical Impossibility Instead of Fault Models | BibTeX data for Physical Impossibility Instead of Fault Models

• [132]

  Semantics of Object−Oriented Data Models − The Evolving Algebra Approach

  Georg Gottlob‚ Gerti Kappel and Michael Schrefl

  In East/West Database Workshop. Pages 144−160. 1990.

  Details about Semantics of Object−Oriented Data Models − The Evolving Algebra Approach | BibTeX data for Semantics of Object−Oriented Data Models − The Evolving Algebra Approach

• [133]

  Hypothesis Classification‚ Abductive Diagnosis and Therapy

  Gerhard Friedrich‚ Georg Gottlob and Wolfgang Nejdl

  In Georg Gottlob and Wolfgang Nejdl, editors, Expert Systems in Engineering‚ Principles and Applications‚ International Workshop‚ Vienna‚ Austria‚ September 24−26‚ 1990‚ Proceedings. Vol. 462 of Lecture Notes in Computer Science. Pages 69−78. Springer. 1990.

  Details about Hypothesis Classification‚ Abductive Diagnosis and Therapy | BibTeX data for Hypothesis Classification‚ Abductive Diagnosis and Therapy

• [134]

  On the Interaction between Transitive Closure and Functional Dependencies

  Georg Gottlob‚ Michael Schrefl and Markus Stumptner

  In János Demetrovics and Bernhard Thalheim, editors, MFDBS 89‚ 2nd Symposium on Mathematical Fundamentals of Database Systems‚ Visegrád‚ Hungary‚ June 26−30‚ 1989. Vol. 364 of Lecture Notes in Computer Science. Pages 187−206. Springer. 1989.

  Details about On the Interaction between Transitive Closure and Functional Dependencies | BibTeX data for On the Interaction between Transitive Closure and Functional Dependencies | Link to On the Interaction between Transitive Closure and Functional Dependencies

• [135]

  The Algres Project

  Stefano Ceri‚ Stefano Crespi−Reghizzi‚ Georg Gottlob‚ F. Lamperti‚ Luigi Lavazza‚ Letizia Tanca and Roberto Zicari

  In Joachim W. Schmidt‚ Stefano Ceri and Michele Missikoff, editors, Advances in Database Technology − EDBT'88‚ Proceedings of the International Conference on Extending Database Technology‚ Venice‚ Italy‚ March 14−18‚ 1988. Vol. 303 of Lecture Notes in Computer Science. Pages 551−555. Springer. 1988.

  Details about The Algres Project | BibTeX data for The Algres Project | Link to The Algres Project

• [136]

  Closed World Databases Opened Through Null Values

  Georg Gottlob and Roberto Zicari

  In François Bancilhon and David J. DeWitt, editors, Fourteenth International Conference on Very Large Data Bases‚ August 29 − September 1‚ 1988‚ Los Angeles‚ California‚ USA‚ Proceedings. Pages 50−61. Morgan Kaufmann. 1988.

  Details about Closed World Databases Opened Through Null Values | BibTeX data for Closed World Databases Opened Through Null Values | Link to Closed World Databases Opened Through Null Values

• [137]

  Computing Covers for Embedded Functional Dependencies

  Georg Gottlob

  In Proceedings of the Sixth ACM SIGACT−SIGMOD−SIGART Symposium on Principles of Database Systems‚ March 23−25‚ 1987‚ San Diego‚ California. Pages 58−69. ACM. 1987.

  Details about Computing Covers for Embedded Functional Dependencies | BibTeX data for Computing Covers for Embedded Functional Dependencies | DOI (10.1145/28659.28665) | Link to Computing Covers for Embedded Functional Dependencies

• [138]

  Interfacing Relational Databases and Prolog Efficiently

  Stefano Ceri‚ Georg Gottlob and Gio Wiederhold

  In Expert Database Conf.. Pages 207−223. 1986.

  Details about Interfacing Relational Databases and Prolog Efficiently | BibTeX data for Interfacing Relational Databases and Prolog Efficiently

• [139]

  Translation and Optimization of Logic Queries: The Algebraic Approach

  Stefano Ceri‚ Georg Gottlob and Luigi Lavazza

  In Wesley W. Chu‚ Georges Gardarin‚ Setsuo Ohsuga and Yahiko Kambayashi, editors, VLDB'86 Twelfth International Conference on Very Large Data Bases‚ August 25−28‚ 1986‚ Kyoto‚ Japan‚ Proceedings. Pages 395−402. Morgan Kaufmann. 1986.

  Details about Translation and Optimization of Logic Queries: The Algebraic Approach | BibTeX data for Translation and Optimization of Logic Queries: The Algebraic Approach | Link to Translation and Optimization of Logic Queries: The Algebraic Approach

• [140]

  Fast Subsumption Algorithms

  Georg Gottlob and Alexander Leitsch

  In B. F. Caviness, editor, EUROCAL '85‚ European Conference on Computer Algebra‚ Linz‚ Austria‚ April 1−3‚ 1985‚ Proceedings Volume 2: Research Contributions. Vol. 204 of Lecture Notes in Computer Science. Pages 64−77. Springer. 1985.

  Details about Fast Subsumption Algorithms | BibTeX data for Fast Subsumption Algorithms

• [141]

  Implementation of a Distributed File System on a Geographic Network of Personal Computers

  S. Copelli and Georg Gottlob

  In DDSS. Pages 203−219. 1984.

  Details about Implementation of a Distributed File System on a Geographic Network of Personal Computers | BibTeX data for Implementation of a Distributed File System on a Geographic Network of Personal Computers

• [142]

  Joining Fragmented Relations in Distributed Databases

  Stefano Ceri‚ Georg Gottlob and Giuseppe Pelagatti

  In XP4.5 Workshop on Database Theory‚ 1983 Palo Alto‚ California‚ USA. 1983.

  Details about Joining Fragmented Relations in Distributed Databases | BibTeX data for Joining Fragmented Relations in Distributed Databases | Link to Joining Fragmented Relations in Distributed Databases

Technical reports

• [1]

  A General Datalog−Based Framework for Tractable Query Answering over Ontologies

  Andrea Calì‚ Georg Gottlob and Thomas Lukasiewicz

  No. RR−10−21. OUCL. March, 2012.

  Details about A General Datalog−Based Framework for Tractable Query Answering over Ontologies | BibTeX data for A General Datalog−Based Framework for Tractable Query Answering over Ontologies | Download  (pdf) of A General Datalog−Based Framework for Tractable Query Answering over Ontologies

• [2]

  Semantic Web Search Based on Ontological Conjunctive Queries

  Bettina Fazzinga‚ Giorgio Gianforme‚ Georg Gottlob and Thomas Lukasiewicz

  No. RR−11−08. DCS. October, 2011.

  Details about Semantic Web Search Based on Ontological Conjunctive Queries | BibTeX data for Semantic Web Search Based on Ontological Conjunctive Queries | Download  (pdf) of Semantic Web Search Based on Ontological Conjunctive Queries

• [3]

  Tackling the Partner Units Configuration Problem

  Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen

  No. CS−RR−10−28. Computing Laboratory‚ University of Oxford. 2010.

  Details about Tackling the Partner Units Configuration Problem | BibTeX data for Tackling the Partner Units Configuration Problem | Download  (pdf) of Tackling the Partner Units Configuration Problem

Miscellaneous

• [1]

  Structural Decomposition Methods‚ and What They are Good For

  Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen

  2011.

  Invited Paper at STACS 2011

  Details about Structural Decomposition Methods‚ and What They are Good For | BibTeX data for Structural Decomposition Methods‚ and What They are Good For | Download  (pdf) of Structural Decomposition Methods‚ and What They are Good For