| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6060097 | 2023-11-02 | Paper |
| Universal solutions for temporal data exchange | 2021-11-25 | Paper |
| The Complexity of Mining Maximal Frequent Subgraphs | 2021-11-25 | Paper |
| A Declarative Framework for Linking Entities | 2021-11-25 | Paper |
| Approximation Algorithms for Schema-Mapping Discovery from Data Examples | 2021-11-25 | Paper |
| On the Computational Complexity of Non-Dictatorial Aggregation | 2021-10-05 | Paper |
| On the Expressive Power of Homomorphism Counts | 2021-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144651 | 2021-01-19 | Paper |
| A SAT-based system for consistent query answering | 2020-05-20 | Paper |
| On recursion in E and semi-Spector classes | 2020-03-09 | Paper |
| The complexity of counting problems in equational matching | 2020-01-21 | Paper |
| Infinitary logic for computer science | 2019-12-04 | Paper |
| Generalized satisfiability problems via operator assignments | 2019-08-07 | Paper |
| Expressive power of entity-linking frameworks | 2019-05-02 | Paper |
| Unification algorithms cannot be combined in polynomial time | 2019-01-15 | Paper |
| Implicit definability and infinitary logic in finite model theory | 2019-01-10 | Paper |
| On the computational complexity of non-dictatorial aggregation | 2018-11-08 | Paper |
| Expressive Power of Entity-Linking Frameworks | 2018-07-18 | Paper |
| Limits of schema mappings | 2018-07-16 | Paper |
| Generalized satisfiability problems via operator assignments | 2017-11-22 | Paper |
| On the Computational Complexity of Non-dictatorial Aggregation | 2017-11-05 | Paper |
| Aggregation of Votes with Multiple Positions on Each Issue | 2017-07-21 | Paper |
| Dependence Logic vs. Constraint Satisfaction | 2017-07-19 | Paper |
| Limits of Schema Mappings. | 2017-07-14 | Paper |
| A Declarative Framework for Linking Entities | 2017-06-13 | Paper |
| On the data complexity of consistent query answering | 2016-04-18 | Paper |
| Learning schema mappings | 2015-09-03 | Paper |
| Existential second-order logic over graphs | 2015-08-01 | Paper |
| Schema Mappings: A Case of Logical Dynamics in Database Theory | 2015-05-11 | Paper |
| Random graphs and the parity quantifier | 2015-02-04 | Paper |
| Probabilistic data exchange | 2014-02-17 | Paper |
| Random graphs and the parity quantifier | 2014-02-17 | Paper |
| A dichotomy in the complexity of consistent query answering for queries with two atoms | 2012-03-09 | Paper |
| Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics | 2011-04-08 | Paper |
| Computational complexity of simultaneous elementary matching problems | 2010-06-17 | Paper |
| The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies | 2010-01-06 | Paper |
| The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies | 2009-03-12 | Paper |
| A Logical Approach to Constraint Satisfaction | 2009-01-22 | Paper |
| On the expressive power of Datalog: tools and a case study. | 2008-12-21 | Paper |
| On preservation under homomorphisms and unions of conjunctive queries | 2008-12-21 | Paper |
| Data exchange: getting to the core | 2008-12-21 | Paper |
| Structure identification of Boolean relations and plain bases for co-clones | 2008-11-19 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Methods and Applications of Artificial Intelligence | 2007-09-25 | Paper |
| Phase transitions of PP-complete satisfiability problems | 2007-08-23 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Subtractive reductions and complete problems for counting complexity classes | 2005-09-22 | Paper |
| Data exchange: semantics and query answering | 2005-06-10 | Paper |
| A dichotomy in the complexity of propositional circumscription | 2005-02-24 | Paper |
| Finite model theory and its applications. | 2005-01-12 | Paper |
| The complexity of minimal satisfiability problems | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475651 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414536 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799291 | 2003-03-18 | Paper |
| Unification algorithms cannot be combined in polynomial time. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536345 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536368 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762521 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741517 | 2001-09-24 | Paper |
| On the Unusual Effectiveness of Logic in Computer Science | 2001-09-10 | Paper |
| Conjunctive-query containment and constraint satisfaction | 2000-12-19 | Paper |
| Computational complexity of simultaneous elementary matching problems | 2000-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936118 | 2000-01-24 | Paper |
| Integer programming as a framework for optimization and approximability | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938414 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395613 | 1998-06-11 | Paper |
| How to define a linear order on finite models | 1998-01-07 | Paper |
| Can datalog be approximated? | 1997-12-17 | Paper |
| Almost Everywhere Equivalence of Logics in Finite Model Theory | 1997-09-02 | Paper |
| On the Decision Problem for Two-Variable First-Order Logic | 1997-06-30 | Paper |
| The complexity of counting problems in equational matching | 1996-08-13 | Paper |
| Approximation properties of NP minimization classes | 1996-04-29 | Paper |
| Generalized quantifiers and pebble games on finite structures | 1995-07-03 | Paper |
| Logical definability of NP optimization problems | 1995-01-11 | Paper |
| Infinitary logics and 0-1 laws | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010359 | 1992-09-27 | Paper |
| Why not negation by fixpoint? | 1992-06-25 | Paper |
| The expressive power of stratified logic programs | 1991-01-01 | Paper |
| 0-1 laws and decision problems for fragments of second-order logic | 1990-01-01 | Paper |
| Some computational aspects of circumscription | 1990-01-01 | Paper |
| K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690805 | 1985-01-01 | Paper |
| Asymptotic enumeration and a 0-1 law for $m$-clique free graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747761 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3964558 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921208 | 1980-01-01 | Paper |
| Recursion in a quantifier vs. elementary induction | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190624 | 1978-01-01 | Paper |
