| Publication | Date of Publication | Type |
|---|
| Fast parallel hypertree decompositions in logarithmic recursion depth | 2024-04-30 | Paper |
| Incremental Updates of Generalized Hypertree Decompositions | 2024-04-14 | Paper |
| Fractional covers of hypergraphs with bounded multi-intersection | 2023-10-26 | Paper |
| Polynomial combined first-order rewritings for linear and guarded existential rules | 2023-07-26 | Paper |
| The HyperTrac project: recent progress and future research directions on hypergraph decompositions | 2022-12-21 | Paper |
| The complexity class θp2: Recent results and applications in AI and modal logic | 2022-12-09 | Paper |
| Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity | 2022-12-08 | Paper |
| Complexity Analysis of Generalized and Fractional Hypertree Decompositions | 2022-12-08 | Paper |
| Semantic Optimization of Conjunctive Queries | 2022-12-08 | Paper |
| MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations | 2022-09-30 | Paper |
| Fast and parallel decomposition of constraint satisfaction problems | 2022-09-29 | Paper |
| HyperBench | 2022-09-06 | Paper |
| Complexity results for abductive logic programming | 2022-08-30 | Paper |
| Datalog: Bag Semantics via Set Semantics | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089208 | 2022-07-18 | Paper |
| Guarded Ontology-Mediated Queries | 2021-12-10 | Paper |
| Query Rewriting and Optimization for Ontological Databases | 2021-11-25 | Paper |
| Vadalog: recent advances and applications | 2020-02-18 | Paper |
| Monadic Datalog, Tree Validity, and Limited Access Containment | 2019-11-22 | Paper |
| Tractable reasoning in description logics with functionality constraints | 2018-10-18 | Paper |
| The Impact of Active Domain Predicates on Guarded Existential Rules | 2018-05-03 | Paper |
| Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | 2018-04-26 | Paper |
| Achieving new upper bounds for the hypergraph duality problem through logic | 2018-04-23 | Paper |
| Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms | 2018-04-18 | Paper |
| Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - CORRIGENDUM | 2017-11-09 | Paper |
| The ICDT 2016 Test of Time Award Announcement | 2017-07-14 | Paper |
| The DLV system for knowledge representation and reasoning | 2017-07-12 | Paper |
| Complexity of propositional nested circumscription and nested abnormality theories | 2017-07-12 | Paper |
| The Impact of Active Domain Predicates on Guarded Existential Rules | 2017-06-20 | Paper |
| Datalog LITE | 2017-06-13 | Paper |
| Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data | 2017-06-01 | Paper |
| Recent Advances in Datalog$$^\pm $$ | 2017-03-30 | Paper |
| Tractability frontiers of the partner units configuration problem | 2016-04-18 | Paper |
| Generalized hypertree decompositions: NP-hardness and tractable variants | 2015-11-11 | Paper |
| The complexity of acyclic conjunctive queries | 2015-10-30 | Paper |
| LoCo—A Logic for Configuration Problems | 2015-09-17 | Paper |
| Monadic datalog over finite structures of bounded treewidth | 2015-09-17 | Paper |
| Existential second-order logic over graphs | 2015-08-01 | Paper |
| Monadic datalog and the expressive power of languages for Web information extraction | 2015-08-01 | Paper |
| Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies | 2014-06-26 | Paper |
| The price of query rewriting in ontology-based data access | 2014-06-10 | Paper |
| Querying the Guarded Fragment | 2014-05-22 | Paper |
| A backtracking-based algorithm for hypertree decomposition | 2014-04-01 | Paper |
| Combining decidability paradigms for existential rules | 2014-02-27 | Paper |
| Size and Treewidth Bounds for Conjunctive Queries | 2014-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395721 | 2014-02-17 | Paper |
| Taming the infinite chase: query answering under expressive relational constraints | 2013-10-29 | Paper |
| On minimal constraint networks | 2013-08-23 | Paper |
| Towards more expressive ontology languages: the query answering problem | 2013-08-23 | Paper |
| Querying the Guarded Fragment with Transitivity | 2013-08-07 | Paper |
| Ontology-based semantic search on the web and its combination with the power of inductive reasoning | 2013-01-04 | Paper |
| Datalog and Its Extensions for Semantic Web Databases | 2012-11-08 | Paper |
| On the Complexity of Ontological Reasoning under Disjunctive Existential Rules | 2012-09-25 | Paper |
| On the Interaction of Existential Rules and Equality Constraints in Ontology Querying | 2012-07-23 | Paper |
| Querying UML Class Diagrams | 2012-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113669 | 2012-01-23 | Paper |
| Distributed XML design | 2012-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171764 | 2011-10-05 | Paper |
| Optimization Methods for the Partner Units Problem | 2011-05-26 | Paper |
| The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey | 2010-09-03 | Paper |
| Balanced Queries: Divide and Conquer | 2010-09-03 | Paper |
| New results on monotone dualization and generating hypergraph transversals | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576650 | 2010-07-30 | Paper |
| Schema mapping discovery from data instances | 2010-07-14 | Paper |
| Second order logic and the weak exponential hierarchies | 2010-06-17 | Paper |
| A logical approach to multicut problems | 2010-03-24 | Paper |
| Bounded treewidth as a key to tractability of knowledge representation and reasoning | 2010-03-16 | Paper |
| Tree Projections: Game Characterization and Computational Aspects | 2010-01-07 | Paper |
| HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results | 2010-01-07 | Paper |
| Tractable Optimization Problems through Hypergraph-Based Structural Restrictions | 2009-07-14 | Paper |
| Foundations of Information and Knowledge Systems | 2009-05-14 | Paper |
| Foundations of Rule-Based Query Answering | 2009-02-17 | Paper |
| Uniform Constraint Satisfaction Problems and Database Theory | 2009-01-22 | Paper |
| The complexity of XPath query evaluation and XML typing | 2008-12-21 | Paper |
| Conjunctive queries over trees | 2008-12-21 | Paper |
| Efficient core computation in data exchange | 2008-12-21 | Paper |
| Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ | 2008-10-27 | Paper |
| Computational aspects of monotone dualization: a brief survey | 2008-09-10 | Paper |
| Hypertree width and related hypergraph invariants | 2007-11-21 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| Second-Order Logic over Finite Structures – Report on a Research Programme | 2007-05-29 | Paper |
| Reasoning under minimal upper bounds in propositional logic | 2007-01-09 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715720 | 2006-01-04 | Paper |
| Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737894 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4445757 | 2004-02-02 | Paper |
| Semantics and complexity of abduction from default theories | 2003-08-28 | Paper |
| On the complexity of single-rule datalog queries. | 2003-08-19 | Paper |
| Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. | 2003-08-19 | Paper |
| Existential second-order logic over strings | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708957 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708952 | 2003-06-20 | Paper |
| New Results on Monotone Dualization and Generating Hypergraph Transversals | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707751 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799290 | 2003-03-18 | Paper |
| Propositional default logics made easier: computational complexity of model checking. | 2003-01-21 | Paper |
| Working with ARMs: Complexity results on atomic representations of Herbrand models | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779133 | 2002-11-25 | Paper |
| Hypertree decompositions and tractable queries | 2002-09-12 | Paper |
| Enhancing model checking in verification by AI techniques | 2002-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767002 | 2002-07-22 | Paper |
| Fixed-parameter complexity in AI and nonmonotonic reasoning | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537426 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535802 | 2002-06-16 | Paper |
| Computing LOGCFL certificates | 2002-03-03 | Paper |
| Remarks on a Carnapian extension of S5 | 2001-12-18 | Paper |
| On ACTL formulas having linear counterexamples | 2001-09-09 | Paper |
| Linear time Datalog and branching time logic | 2001-08-30 | Paper |
| Complexity results for some eigenvector problems | 2001-08-21 | Paper |
| A comparison of structural CSP decomposition methods | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938426 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955325 | 2000-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938636 | 2000-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955352 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936147 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250038 | 1999-10-18 | Paper |
| Succinctness as a source of complexity in logical formalisms | 1999-09-22 | Paper |
| On the expressiveness of frame satisfiability and fragments of second-order logic | 1999-01-19 | Paper |
| Expressiveness of stable model semantics for disjunctive logic programs with functions | 1998-07-16 | Paper |
| Abduction from logic programs: Semantics and complexity | 1998-06-30 | Paper |
| On the indiscernibility of individuals in logic programming | 1998-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381709 | 1998-04-01 | Paper |
| Capturing Relativized Complexity Classes without Order | 1998-03-30 | Paper |
| The complexity of logic-based abduction | 1998-02-02 | Paper |
| NP trees and Carnap's modal logic | 1998-02-02 | Paper |
| Translating default logic into standard autoepistemic logic | 1998-01-28 | Paper |
| Relativized logspace and generalized quantifiers over finite ordered structures | 1997-09-28 | Paper |
| The complexity of nested counterfactuals and iterated knowledge base revisions | 1997-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4332418 | 1997-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4332416 | 1997-06-03 | Paper |
| On the computational cost of disjunctive logic programming: Propositional case | 1997-03-25 | Paper |
| A non-ground realization of the stable and well-founded semantics | 1997-02-27 | Paper |
| Datalog: A self-contained tutorial. II | 1997-01-14 | Paper |
| Formalizing the repair process --- extended report | 1996-12-03 | Paper |
| Identifying the Minimal Transversals of a Hypergraph and Related Problems | 1996-07-28 | Paper |
| Normal forms for second-order logic over finite structures, and classification of NP optimization problems | 1996-07-24 | Paper |
| The complexity of default reasoning under the stationary fixed point semantics | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281509 | 1994-11-13 | Paper |
| Cumulative default logic: Finite characterization, algorithms, and complexity | 1994-11-08 | Paper |
| Removing redundancy from a clause | 1993-10-31 | Paper |
| Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete | 1993-09-19 | Paper |
| Selective inheritance of attribute values in relational databases | 1993-01-31 | Paper |
| On the complexity of propositional knowledge base revision, updates, and counterfactuals | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4022222 | 1993-01-17 | Paper |
| Complexity Results for Nonmonotonic Logics | 1993-01-16 | Paper |
| An efficient method for eliminating varying predicates from a circumscription | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3349969 | 1990-01-01 | Paper |
| Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques | 1990-01-01 | Paper |
| Magic semi-joins | 1989-01-01 | Paper |
| Properties and update semantics of consistent views | 1988-01-01 | Paper |
| On the size of nonredundant FD-covers | 1987-01-01 | Paper |
| Subsumption and implication | 1987-01-01 | Paper |
| Taxonomy and formal properties of distributed joins | 1986-01-01 | Paper |
| On the efficiency of subsumption algorithms | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716319 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336678 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929002 | 1981-01-01 | Paper |
