Georg Gottlob

From MaRDI portal
Revision as of 11:32, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:202112

Available identifiers

zbMath Open gottlob.georgDBLPg/GeorgGottlobFactGridQ886219WikidataQ89467 ScholiaQ89467MaRDI QIDQ202112

List of research outcomes





PublicationDate of PublicationType
Fast parallel hypertree decompositions in logarithmic recursion depth2024-04-30Paper
Incremental Updates of Generalized Hypertree Decompositions2024-04-14Paper
Fractional covers of hypergraphs with bounded multi-intersection2023-10-26Paper
Polynomial combined first-order rewritings for linear and guarded existential rules2023-07-26Paper
The HyperTrac project: recent progress and future research directions on hypergraph decompositions2022-12-21Paper
The complexity class θp2: Recent results and applications in AI and modal logic2022-12-09Paper
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity2022-12-08Paper
Complexity Analysis of Generalized and Fractional Hypertree Decompositions2022-12-08Paper
Semantic Optimization of Conjunctive Queries2022-12-08Paper
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations2022-09-30Paper
Fast and parallel decomposition of constraint satisfaction problems2022-09-29Paper
HyperBench2022-09-06Paper
Complexity results for abductive logic programming2022-08-30Paper
Datalog: Bag Semantics via Set Semantics2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892082022-07-18Paper
Guarded Ontology-Mediated Queries2021-12-10Paper
Query Rewriting and Optimization for Ontological Databases2021-11-25Paper
Vadalog: recent advances and applications2020-02-18Paper
Monadic Datalog, Tree Validity, and Limited Access Containment2019-11-22Paper
Tractable reasoning in description logics with functionality constraints2018-10-18Paper
The Impact of Active Domain Predicates on Guarded Existential Rules2018-05-03Paper
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic2018-04-26Paper
Achieving new upper bounds for the hypergraph duality problem through logic2018-04-23Paper
Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms2018-04-18Paper
Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - CORRIGENDUM2017-11-09Paper
The ICDT 2016 Test of Time Award Announcement2017-07-14Paper
Complexity of propositional nested circumscription and nested abnormality theories2017-07-12Paper
The DLV system for knowledge representation and reasoning2017-07-12Paper
The Impact of Active Domain Predicates on Guarded Existential Rules2017-06-20Paper
Datalog LITE2017-06-13Paper
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data2017-06-01Paper
Recent Advances in Datalog$$^\pm $$2017-03-30Paper
Tractability frontiers of the partner units configuration problem2016-04-18Paper
Generalized hypertree decompositions: NP-hardness and tractable variants2015-11-11Paper
The complexity of acyclic conjunctive queries2015-10-30Paper
Monadic datalog over finite structures of bounded treewidth2015-09-17Paper
LoCo—A Logic for Configuration Problems2015-09-17Paper
Monadic datalog and the expressive power of languages for Web information extraction2015-08-01Paper
Existential second-order logic over graphs2015-08-01Paper
Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies2014-06-26Paper
The price of query rewriting in ontology-based data access2014-06-10Paper
Querying the Guarded Fragment2014-05-22Paper
A backtracking-based algorithm for hypertree decomposition2014-04-01Paper
Combining decidability paradigms for existential rules2014-02-27Paper
Size and Treewidth Bounds for Conjunctive Queries2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q53957212014-02-17Paper
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints2013-10-29Paper
On minimal constraint networks2013-08-23Paper
Towards more expressive ontology languages: the query answering problem2013-08-23Paper
Querying the Guarded Fragment with Transitivity2013-08-07Paper
Ontology-based semantic search on the web and its combination with the power of inductive reasoning2013-01-04Paper
Datalog and Its Extensions for Semantic Web Databases2012-11-08Paper
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules2012-09-25Paper
On the Interaction of Existential Rules and Equality Constraints in Ontology Querying2012-07-23Paper
Querying UML Class Diagrams2012-06-22Paper
https://portal.mardi4nfdi.de/entity/Q31136692012-01-23Paper
Distributed XML design2012-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31717642011-10-05Paper
Optimization Methods for the Partner Units Problem2011-05-26Paper
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey2010-09-03Paper
Balanced Queries: Divide and Conquer2010-09-03Paper
New results on monotone dualization and generating hypergraph transversals2010-08-05Paper
https://portal.mardi4nfdi.de/entity/Q35766502010-07-30Paper
Schema mapping discovery from data instances2010-07-14Paper
Second order logic and the weak exponential hierarchies2010-06-17Paper
A logical approach to multicut problems2010-03-24Paper
Bounded treewidth as a key to tractability of knowledge representation and reasoning2010-03-16Paper
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results2010-01-07Paper
Tree Projections: Game Characterization and Computational Aspects2010-01-07Paper
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions2009-07-14Paper
Foundations of Information and Knowledge Systems2009-05-14Paper
Foundations of Rule-Based Query Answering2009-02-17Paper
Uniform Constraint Satisfaction Problems and Database Theory2009-01-22Paper
The complexity of XPath query evaluation and XML typing2008-12-21Paper
Conjunctive queries over trees2008-12-21Paper
Efficient core computation in data exchange2008-12-21Paper
Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$2008-10-27Paper
Computational aspects of monotone dualization: a brief survey2008-09-10Paper
Hypertree width and related hypergraph invariants2007-11-21Paper
Automated Reasoning2007-09-25Paper
Second-Order Logic over Finite Structures – Report on a Research Programme2007-05-29Paper
Reasoning under minimal upper bounds in propositional logic2007-01-09Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
https://portal.mardi4nfdi.de/entity/Q57157202006-01-04Paper
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47378942004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44457572004-02-02Paper
Semantics and complexity of abduction from default theories2003-08-28Paper
On the complexity of single-rule datalog queries.2003-08-19Paper
Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.2003-08-19Paper
Existential second-order logic over strings2003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47089522003-06-20Paper
https://portal.mardi4nfdi.de/entity/Q47089572003-06-20Paper
New Results on Monotone Dualization and Generating Hypergraph Transversals2003-06-19Paper
https://portal.mardi4nfdi.de/entity/Q47077512003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47992902003-03-18Paper
Propositional default logics made easier: computational complexity of model checking.2003-01-21Paper
Working with ARMs: Complexity results on atomic representations of Herbrand models2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47791332002-11-25Paper
Hypertree decompositions and tractable queries2002-09-12Paper
Enhancing model checking in verification by AI techniques2002-07-24Paper
https://portal.mardi4nfdi.de/entity/Q27670022002-07-22Paper
Fixed-parameter complexity in AI and nonmonotonic reasoning2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45374262002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45358022002-06-16Paper
Computing LOGCFL certificates2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27027422001-12-18Paper
On ACTL formulas having linear counterexamples2001-09-09Paper
https://portal.mardi4nfdi.de/entity/Q27349482001-08-30Paper
Complexity results for some eigenvector problems2001-08-21Paper
A comparison of structural CSP decomposition methods2000-12-12Paper
https://portal.mardi4nfdi.de/entity/Q49384262000-09-26Paper
https://portal.mardi4nfdi.de/entity/Q49553252000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q49386362000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q49553522000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49361472000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q42500381999-10-18Paper
Succinctness as a source of complexity in logical formalisms1999-09-22Paper
On the expressiveness of frame satisfiability and fragments of second-order logic1999-01-19Paper
Expressiveness of stable model semantics for disjunctive logic programs with functions1998-07-16Paper
Abduction from logic programs: Semantics and complexity1998-06-30Paper
On the indiscernibility of individuals in logic programming1998-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43817091998-04-01Paper
Capturing Relativized Complexity Classes without Order1998-03-30Paper
The complexity of logic-based abduction1998-02-02Paper
NP trees and Carnap's modal logic1998-02-02Paper
Translating default logic into standard autoepistemic logic1998-01-28Paper
Relativized logspace and generalized quantifiers over finite ordered structures1997-09-28Paper
The complexity of nested counterfactuals and iterated knowledge base revisions1997-08-20Paper
https://portal.mardi4nfdi.de/entity/Q43324161997-06-03Paper
https://portal.mardi4nfdi.de/entity/Q43324181997-06-03Paper
On the computational cost of disjunctive logic programming: Propositional case1997-03-25Paper
A non-ground realization of the stable and well-founded semantics1997-02-27Paper
Datalog: A self-contained tutorial. II1997-01-14Paper
Formalizing the repair process --- extended report1996-12-03Paper
Identifying the Minimal Transversals of a Hypergraph and Related Problems1996-07-28Paper
Normal forms for second-order logic over finite structures, and classification of NP optimization problems1996-07-24Paper
The complexity of default reasoning under the stationary fixed point semantics1996-02-20Paper
https://portal.mardi4nfdi.de/entity/Q42815091994-11-13Paper
Cumulative default logic: Finite characterization, algorithms, and complexity1994-11-08Paper
Removing redundancy from a clause1993-10-31Paper
Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete1993-09-19Paper
Selective inheritance of attribute values in relational databases1993-01-31Paper
On the complexity of propositional knowledge base revision, updates, and counterfactuals1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q40222221993-01-17Paper
Complexity Results for Nonmonotonic Logics1993-01-16Paper
An efficient method for eliminating varying predicates from a circumscription1992-09-27Paper
Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33499691990-01-01Paper
Magic semi-joins1989-01-01Paper
Properties and update semantics of consistent views1988-01-01Paper
Subsumption and implication1987-01-01Paper
On the size of nonredundant FD-covers1987-01-01Paper
Taxonomy and formal properties of distributed joins1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37163191985-01-01Paper
On the efficiency of subsumption algorithms1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33366781982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39290021981-01-01Paper

Research outcomes over time

This page was built for person: Georg Gottlob