| Publication | Date of Publication | Type |
|---|
| Decision problems in information theory | 2026-03-18 | Paper |
| When do homomorphism counts help in query algorithms? | 2025-11-11 | Paper |
Consistency of relations over monoids
Journal of the ACM | 2025-08-21 | Paper |
| Consistency, acyclicity, and positive Semirings | 2024-10-01 | Paper |
| scientific article; zbMATH DE number 7760478 (Why is no real title available?) | 2023-11-02 | Paper |
A declarative framework for linking entities
ACM Transactions on Database Systems | 2021-11-25 | Paper |
The Complexity of Mining Maximal Frequent Subgraphs
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Universal solutions for temporal data exchange
Information and Computation | 2021-11-25 | Paper |
Approximation algorithms for schema-mapping discovery from data examples
ACM Transactions on Database Systems | 2021-11-25 | Paper |
On the computational complexity of non-dictatorial aggregation
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
| On the Expressive Power of Homomorphism Counts | 2021-01-29 | Paper |
| Foundations of information integration under bag semantics | 2021-01-19 | Paper |
A SAT-based system for consistent query answering
(available as arXiv preprint) | 2020-05-20 | Paper |
On recursion in E and semi-Spector classes
Ordinal Definability and Recursion Theory The Cabal Seminar Volume III | 2020-03-09 | Paper |
The complexity of counting problems in equational matching
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
Infinitary logic for computer science
Automata, Languages and Programming | 2019-12-04 | Paper |
Generalized satisfiability problems via operator assignments
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Expressive power of entity-linking frameworks
Journal of Computer and System Sciences | 2019-05-02 | Paper |
Unification algorithms cannot be combined in polynomial time
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
Implicit definability and infinitary logic in finite model theory (extended abstract)
Automata, Languages and Programming | 2019-01-10 | Paper |
On the computational complexity of non-dictatorial aggregation
(available as arXiv preprint) | 2018-11-08 | Paper |
| Expressive power of entity-linking frameworks | 2018-07-18 | Paper |
Limits of schema mappings
Theory of Computing Systems | 2018-07-16 | Paper |
Generalized satisfiability problems via operator assignments
Fundamentals of Computation Theory | 2017-11-22 | Paper |
On the Computational Complexity of Non-dictatorial Aggregation
(available as arXiv preprint) | 2017-11-05 | Paper |
Aggregation of votes with multiple positions on each issue
Relational and Algebraic Methods in Computer Science | 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
Theory of Computing Systems | 2016-04-18 | Paper |
Learning schema mappings
ACM Transactions on Database Systems | 2015-09-03 | Paper |
Existential second-order logic over graphs: charting the tractability frontier
Journal of the ACM | 2015-08-01 | Paper |
Schema mappings: a case of logical dynamics in database theory
Outstanding Contributions to Logic | 2015-05-11 | Paper |
Random graphs and the parity quantifier
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Probabilistic data exchange
Journal of the ACM | 2014-02-17 | Paper |
Random graphs and the parity quantifier
Journal of the ACM | 2014-02-17 | Paper |
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters | 2012-03-09 | Paper |
| Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics | 2011-04-08 | Paper |
Computational complexity of simultaneous elementary matching problems
Lecture Notes in Computer Science | 2010-06-17 | Paper |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
SIAM Journal on Computing | 2010-01-06 | Paper |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Automata, Languages and Programming | 2009-03-12 | Paper |
A Logical Approach to Constraint Satisfaction
Complexity of Constraints | 2009-01-22 | Paper |
Data exchange: getting to the core
ACM Transactions on Database Systems | 2008-12-21 | Paper |
On the expressive power of Datalog: tools and a case study.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM | 2008-12-21 | Paper |
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences | 2008-11-19 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Methods and Applications of Artificial Intelligence
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics | 2007-08-23 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science | 2005-09-22 | Paper |
Data exchange: semantics and query answering
Theoretical Computer Science | 2005-06-10 | Paper |
A dichotomy in the complexity of propositional circumscription
Theory of Computing Systems | 2005-02-24 | Paper |
Finite model theory and its applications.
Texts in Theoretical Computer Science. An EATCS Series | 2005-01-12 | Paper |
The complexity of minimal satisfiability problems
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2084722 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 1953133 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1884382 (Why is no real title available?) | 2003-03-18 | Paper |
Unification algorithms cannot be combined in polynomial time.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759397 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1759419 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1688380 (Why is no real title available?) | 2002-01-09 | Paper |
| Phase transitions of PP-complete satisfiability problems. (Abstract) | 2001-09-24 | Paper |
On the unusual effectiveness of logic in computer science
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
On the unusual effectiveness of logic in computer science
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences | 2000-12-19 | Paper |
Computational complexity of simultaneous elementary matching problems
Journal of Automated Reasoning | 2000-05-17 | Paper |
| scientific article; zbMATH DE number 1392279 (Why is no real title available?) | 2000-01-24 | Paper |
Integer programming as a framework for optimization and approximability
Journal of Computer and System Sciences | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1405441 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1163986 (Why is no real title available?) | 1998-06-11 | Paper |
How to define a linear order on finite models
Annals of Pure and Applied Logic | 1998-01-07 | Paper |
Can datalog be approximated?
Journal of Computer and System Sciences | 1997-12-17 | Paper |
Almost Everywhere Equivalence of Logics in Finite Model Theory
The Bulletin of Symbolic Logic | 1997-09-02 | Paper |
Almost Everywhere Equivalence of Logics in Finite Model Theory
The Bulletin of Symbolic Logic | 1997-09-02 | Paper |
On the Decision Problem for Two-Variable First-Order Logic
The Bulletin of Symbolic Logic | 1997-06-30 | Paper |
On the Decision Problem for Two-Variable First-Order Logic
The Bulletin of Symbolic Logic | 1997-06-30 | Paper |
The complexity of counting problems in equational matching
Journal of Symbolic Computation | 1996-08-13 | Paper |
Approximation properties of NP minimization classes
Journal of Computer and System Sciences | 1996-04-29 | Paper |
Generalized quantifiers and pebble games on finite structures
Annals of Pure and Applied Logic | 1995-07-03 | Paper |
Logical definability of NP optimization problems
Information and Computation | 1995-01-11 | Paper |
| scientific article; zbMATH DE number 65748 (Why is no real title available?) | 1992-09-27 | Paper |
Infinitary logics and 0-1 laws
Information and Computation | 1992-09-27 | Paper |
Why not negation by fixpoint?
Journal of Computer and System Sciences | 1992-06-25 | Paper |
The expressive power of stratified logic programs
Information and Computation | 1991-01-01 | Paper |
0-1 laws and decision problems for fragments of second-order logic
Information and Computation | 1990-01-01 | Paper |
Some computational aspects of circumscription
Journal of the ACM | 1990-01-01 | Paper |
K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
Transactions of the American Mathematical Society | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3984616 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3914307 (Why is no real title available?) | 1985-01-01 | Paper |
Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
Bulletin of the American Mathematical Society | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3786768 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3733894 (Why is no real title available?) | 1980-01-01 | Paper |
Recursion in a quantifier vs. elementary induction
Journal of Symbolic Logic | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3628937 (Why is no real title available?) | 1978-01-01 | Paper |
