Recursion in a Quantifier vs. Elementary Induction. - Phokion G. Kolaitis (J. Symb. Log., 1979)

On Asymptotic Probability of Inductive Queries and Their Decision Problem. - Phokion G. Kolaitis (Logic of Programs, 1985)

The Decision Problem for the Probabilities of Higher-Order Properties - Phokion G. Kolaitis; Moshe Y. Vardi (STOC, 1987)

Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report) - Phokion G. Kolaitis (LICS, 1990)

0-1 Laws for Infinitary Logics (Preliminary Report) - Phokion G. Kolaitis; Moshe Y. Vardi (LICS, 1990)

0-1 Laws and Decision Problems for Fragments of Second-Order Logic - Phokion G. Kolaitis; Moshe Y. Vardi (Inf. Comput., 1990)

Some Computational Aspects of Circumscription - Phokion G. Kolaitis; Christos H. Papadimitriou (J. ACM, 1990)

Why not Negation by Fixpoint? - Phokion G. Kolaitis; Christos H. Papadimitriou (J. Comput. Syst. Sci., 1991)

The Expressive Power of Stratified Programs - Phokion G. Kolaitis (Inf. Comput., 1991)

Infinitary Logic for Computer Science. - Phokion G. Kolaitis; Moshe Y. Vardi (ICALP, 1992)

Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory - Phokion G. Kolaitis; Moshe Y. Vardi (LICS, 1992)

Infinitary Logics and 0-1 Laws - Phokion G. Kolaitis; Moshe Y. Vardi (Inf. Comput., 1992)

Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). - Phokion G. Kolaitis; Madhukar N. Thakur (SCT, 1993)

A Tutorial on Finite Model Theory (Abstract) - Phokion G. Kolaitis (LICS, 1993)

Logical Definability of NP Optimization Problems - Phokion G. Kolaitis; Madhukar N. Thakur (Inf. Comput., 1994)

Implicit Definability and Infinitary Logic in Finite Model Theory. - Anuj Dawar; Lauri Hella; Phokion G. Kolaitis (ICALP, 1995)

Languages for Polynomial-Time Queries - An Ongoing Quest. - Phokion G. Kolaitis (ICDT, 1995)

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). - Miki Hermann; Phokion G. Kolaitis (MFCS, 1995)

Combinatorial Games In Database Theory. - Phokion G. Kolaitis (PODS, 1995)

Generalized Quantifiers and Pebble Games on Finite Structures. - Phokion G. Kolaitis; Jouko A. Väänänen (Ann. Pure Appl. Log., 1995)

Approximation Properties of NP Minimization Classes. - Phokion G. Kolaitis; Madhukar N. Thakur (J. Comput. Syst. Sci., 1995)

On the Expressive Power of Datalog: Tools and a Case Study. - Phokion G. Kolaitis; Moshe Y. Vardi (J. Comput. Syst. Sci., 1995)

The Complexity of Counting Problems in Equational Matching. - Miki Hermann; Phokion G. Kolaitis (J. Symb. Comput., 1995)

On the Expressive Power of Variable-Confined Logics. - Phokion G. Kolaitis; Moshe Y. Vardi (LICS, 1996)

Almost everywhere equivalence of logics in finite model theory. - Lauri Hella; Phokion G. Kolaitis; Kerkko Luosto (Bull. Symb. Log., 1996)

On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. - Miki Hermann; Phokion G. Kolaitis (CP, 1997)

How to Define a Linear Order on Finite Models. - Lauri Hella; Phokion G. Kolaitis; Kerkko Luosto (Ann. Pure Appl. Log., 1997)

On the decision problem for two-variable first-order logic. - Erich Grädel; Phokion G. Kolaitis; Moshe Y. Vardi (Bull. Symb. Log., 1997)

Can Datalog Be Approximated? - Surajit Chaudhuri; Phokion G. Kolaitis (J. Comput. Syst. Sci., 1997)

On the Boundedness Problem for Two-Variable First-Order Logic. - Phokion G. Kolaitis; Martin Otto 001 (LICS, 1998)

On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. - Phokion G. Kolaitis; David L. Martin 001; Madhukar N. Thakur (PODS, 1998)

Panel: logic in the computer science curriculum. - Kim B. Bruce; Phokion G. Kolaitis; Daniel Leivant; Moshe Y. Vardi (SIGCSE, 1998)

Integer Programming as a Framework for Optimization and Approximability. - Ian Barland; Phokion G. Kolaitis; Madhukar N. Thakur (J. Comput. Syst. Sci., 1998)

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. - Albert Atserias; Phokion G. Kolaitis (LICS, 1999)

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. - Miki Hermann; Laurent Juban; Phokion G. Kolaitis (LPAR, 1999)

Computational Complexity of Simultaneous Elementary Matching Problems. - Miki Hermann; Phokion G. Kolaitis (J. Autom. Reason., 1999)

A Game-Theoretic Approach to Constraint Satisfaction. - Phokion G. Kolaitis; Moshe Y. Vardi (AAAI/IAAI, 2000)

0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. - Phokion G. Kolaitis; Moshe Y. Vardi (MFCS, 2000)

The Complexity of Minimal Satisfiability Problems - Lefteris M. Kirousis; Phokion G. Kolaitis (Electron. Colloquium Comput. Complex., 2000)

Unification Algorithms Cannot Be Combined in Polynomial Time. - Miki Hermann; Phokion G. Kolaitis (Inf. Comput., 2000)

Conjunctive-Query Containment and Constraint Satisfaction. - Phokion G. Kolaitis; Moshe Y. Vardi (J. Comput. Syst. Sci., 2000)

Foreword: Selected Papers from ICDT 1997. - Foto N. Afrati; Phokion G. Kolaitis (Theor. Comput. Sci., 2000)

In Search of a Phase Transition in the AC-Matching Problem. - Phokion G. Kolaitis; Thomas Raffill (CP, 2001)

On the Complexity of Model Checking and Inference in Minimal Models. - Lefteris M. Kirousis; Phokion G. Kolaitis (LPNMR, 2001)

On the unusual effectiveness of logic in computer science. - Joseph Y. Halpern; Robert Harper 001; Neil Immerman; Phokion G. Kolaitis; Moshe Y. Vardi; Victor Vianu (Bull. Symb. Log., 2001)

Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. - Delbert D. Bailey; Víctor Dalmau; Phokion G. Kolaitis (AAAI/IAAI, 2002)

Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. - Víctor Dalmau; Phokion G. Kolaitis; Moshe Y. Vardi (CP, 2002)

On the Complexity of Existential Pebble Games. - Phokion G. Kolaitis; Jonathan Panttaja (CSL, 2003)

Phase Transitions of Bounded Satisfiability Problems. - Delbert D. Bailey; Phokion G. Kolaitis (IJCAI, 2003)

Constraint Satisfaction, Databases, and Logic. - Phokion G. Kolaitis (IJCAI, 2003)

Constraint Propagation as a Proof System. - Albert Atserias; Phokion G. Kolaitis; Moshe Y. Vardi (CP, 2004)

Constraint Satisfaction, Complexity, and Logic. - Phokion G. Kolaitis (SETN, 2004)

Existential second-order logic over graphs: Charting the tractability frontier. - Georg Gottlob; Phokion G. Kolaitis; Thomas Schwentick (J. ACM, 2004)

Foreword. - Phokion G. Kolaitis; Victor Vianu (J. ACM, 2004)

A Dichotomy in the Complexity of Propositional Circumscription. - Lefteris M. Kirousis; Phokion G. Kolaitis (Theory Comput. Syst., 2004)

Foreword. - Phokion G. Kolaitis; Michael J. Franklin (ACM Trans. Database Syst., 2004)

Schema mappings, data exchange, and metadata management. - Phokion G. Kolaitis (PODS, 2005)

Efficient Implementation of Large-Scale Multi-Structural Databases. - Ronald Fagin; Phokion G. Kolaitis; Ravi Kumar 001; Jasmine Novak; D. Sivakumar 001; Andrew Tomkins (VLDB, 2005)

Preferred representations of Boolean relations - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (Electron. Colloquium Comput. Complex., 2005)

Exchange, integration, and consistency of data: report on the ARISE/NISR workshop. - Leopoldo E. Bertossi; Jan Chomicki; Parke Godfrey; Phokion G. Kolaitis; Alex Thomo; Calisto Zuzarte (SIGMOD Rec., 2005)

Subtractive reductions and complete problems for counting complexity classes. - Arnaud Durand 001; Miki Hermann; Phokion G. Kolaitis (Theor. Comput. Sci., 2005)

Data exchange: semantics and query answering. - Ronald Fagin; Phokion G. Kolaitis; Renée J. Miller; Lucian Popa 001 (Theor. Comput. Sci., 2005)

LICS 2003 special issue. - Phokion G. Kolaitis (ACM Trans. Comput. Log., 2005)

Data exchange: getting to the core. - Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001 (ACM Trans. Database Syst., 2005)

Composing schema mappings: Second-order dependencies to the rescue. - Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang Chiew Tan (ACM Trans. Database Syst., 2005)

06401 Executive Summary - Complexity of Constraints. - Nadia Creignou; Phokion G. Kolaitis; Heribert Vollmer (Complexity of Constraints, 2006)

06401 Abstracts Collection - Complexity of Constraints. - Nadia Creignou; Phokion G. Kolaitis; Heribert Vollmer (Complexity of Constraints, 2006)

The containment problem for REAL conjunctive queries with inequalities. - T. S. Jayram; Phokion G. Kolaitis; Erik Vee (PODS, 2006)

The complexity of data exchange. - Phokion G. Kolaitis; Jonathan Panttaja; Wang Chiew Tan (PODS, 2006)

Closures and dichotomies for quantified constraints. - Tomás Feder; Phokion G. Kolaitis (Electron. Colloquium Comput. Complex., 2006)

On preservation under homomorphisms and unions of conjunctive queries. - Albert Atserias; Anuj Dawar; Phokion G. Kolaitis (J. ACM, 2006)

Peer data exchange. - Ariel Fuxman; Phokion G. Kolaitis; Renée J. Miller; Wang Chiew Tan (ACM Trans. Database Syst., 2006)

Reflections on Finite Model Theory. - Phokion G. Kolaitis (LICS, 2007)

Semi-Automatic Schema Integration in Clio. - Laura Chiticariu; Mauricio A. Hernández; Phokion G. Kolaitis; Lucian Popa 001 (VLDB, 2007)

Phase transitions of PP-complete satisfiability problems. - Delbert D. Bailey; Víctor Dalmau; Phokion G. Kolaitis (Discret. Appl. Math., 2007)

Finite Model Theory and Its Applications - Erich Grädel; Phokion G. Kolaitis; Leonid Libkin; Maarten Marx; Joel Spencer; Moshe Y. Vardi; Yde Venema; Scott Weinstein (Springer, 2007)

A Logical Approach to Constraint Satisfaction. - Phokion G. Kolaitis; Moshe Y. Vardi (Complexity of Constraints, 2008)

Answering aggregate queries in data exchange. - Foto N. Afrati; Phokion G. Kolaitis (PODS, 2008)

Towards a theory of schema-mapping optimization. - Ronald Fagin; Phokion G. Kolaitis; Alan Nash; Lucian Popa 001 (PODS, 2008)

Interactive generation of integrated schemas. - Laura Chiticariu; Phokion G. Kolaitis; Lucian Popa 001 (SIGMOD Conference, 2008)

Structure identification of Boolean relations and plain bases for co-clones. - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (J. Comput. Syst. Sci., 2008)

Paper and proposal reviews: is the process flawed? - Henry F. Korth; Philip A. Bernstein; Mary F. Fernández; Le Gruenwald; Phokion G. Kolaitis; Kathryn S. McKinley; M. Tamer Özsu (SIGMOD Rec., 2008)

Quasi-inverses of schema mappings. - Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang Chiew Tan (ACM Trans. Database Syst., 2008)

09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. - Andrei A. Bulatov; Martin Grohe; Phokion G. Kolaitis; Andrei A. Krokhin (The Constraint Satisfaction Problem: Complexity and Approximability, 2009)

09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. - Andrei A. Bulatov; Martin Grohe; Phokion G. Kolaitis; Andrei A. Krokhin (The Constraint Satisfaction Problem: Complexity and Approximability, 2009)

Repair checking in inconsistent databases: algorithms and complexity. - Foto N. Afrati; Phokion G. Kolaitis (ICDT, 2009)

The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. - Catriel Beeri; Phokion G. Kolaitis; Christos H. Papadimitriou (PODS, 2009)

Laconic schema mappings: computing core universal solutions by means of SQL queries - Balder ten Cate; Laura Chiticariu; Phokion G. Kolaitis; Wang Chiew Tan (CoRR, 2009)

Random Graphs and the Parity Quantifier. - Phokion G. Kolaitis; Swastik Kopparty (Electron. Colloquium Comput. Complex., 2009)

Laconic Schema Mappings: Computing the Core with SQL Queries. - Balder ten Cate; Laura Chiticariu; Phokion G. Kolaitis; Wang Chiew Tan (Proc. VLDB Endow., 2009)

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. - Parikshit Gopalan; Phokion G. Kolaitis; Elitza N. Maneva; Christos H. Papadimitriou (SIAM J. Comput., 2009)

Database Constraints and Homomorphism Dualities. - Balder ten Cate; Phokion G. Kolaitis; Wang Chiew Tan (CP, 2010)

Characterizing schema mappings via data examples. - Bogdan Alexe; Phokion G. Kolaitis; Wang Chiew Tan (PODS, 2010)

The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. - Jianwen Su; Phokion G. Kolaitis (PODS, 2010)

Structural characterizations of schema-mapping languages. - Balder ten Cate; Phokion G. Kolaitis (Commun. ACM, 2010)

Schema Mapping Evolution Through Composition and Inversion. - Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang Chiew Tan (Schema Matching and Mapping, 2011)

On the tractability and intractability of consistent conjunctive query answering. - Enela Pema; Phokion G. Kolaitis; Wang Chiew Tan (EDBT/ICDT Ph.D. Workshop, 2011)

Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). - Phokion G. Kolaitis (FSTTCS, 2011)

Schema mappings and data examples. - Phokion G. Kolaitis (LID, 2011)

Designing and refining schema mappings via data examples. - Bogdan Alexe; Balder ten Cate; Phokion G. Kolaitis; Wang Chiew Tan (SIGMOD Conference, 2011)

The quest for a logic for polynomial-time computation: technical perspective. - Phokion G. Kolaitis (Commun. ACM, 2011)

Probabilistic data exchange. - Ronald Fagin; Benny Kimelfeld; Phokion G. Kolaitis (J. ACM, 2011)

EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples. - Bogdan Alexe; Balder ten Cate; Phokion G. Kolaitis; Wang Chiew Tan (Proc. VLDB Endow., 2011)

Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). - Phokion G. Kolaitis; Maurizio Lenzerini; Nicole Schweikardt (SIGMOD Rec., 2011)

Characterizing schema mappings via data examples. - Bogdan Alexe; Balder ten Cate; Phokion G. Kolaitis; Wang Chiew Tan (ACM Trans. Database Syst., 2011)

Reverse data exchange: Coping with nulls. - Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang Chiew Tan (ACM Trans. Database Syst., 2011)

Local transformations and conjunctive-query equivalence. - Ronald Fagin; Phokion G. Kolaitis (PODS, 2012)

The ACM PODS Alberto O. Mendelzon test-of-time award 2012. - Richard Hull 001; Phokion G. Kolaitis; Dirk Van Gucht (PODS, 2012)

A dichotomy in the complexity of consistent query answering for queries with two atoms. - Phokion G. Kolaitis; Enela Pema (Inf. Process. Lett., 2012)

The Query Containment Problem: Set Semantics vs. Bag Semantics. - Phokion G. Kolaitis (AMW, 2013)

Data exchange with arithmetic operations. - Balder ten Cate; Phokion G. Kolaitis; Walied Othman (EDBT, 2013)

Schema mappings and data examples. - Balder ten Cate; Phokion G. Kolaitis; Wang Chiew Tan (EDBT, 2013)

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. - Samson Abramsky; Georg Gottlob; Phokion G. Kolaitis (IJCAI, 2013)

The Semantics of Aggregate Queries in Data Exchange Revisited. - Phokion G. Kolaitis; Francesca Spezzano (SUM, 2013)

Efficient Querying of Inconsistent Databases with Binary Integer Programming. - Phokion G. Kolaitis; Enela Pema; Wang-Chiew Tan (Proc. VLDB Endow., 2013)

Learning schema mappings. - Balder ten Cate; Víctor Dalmau; Phokion G. Kolaitis (ACM Trans. Database Syst., 2013)

Schema Mappings: A Case of Logical Dynamics in Database Theory. - Balder ten Cate; Phokion G. Kolaitis (Johan van Benthem on Logic and Information Dynamics, 2014)

Nested dependencies: structure and reasoning. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (PODS, 2014)

The Complexity of Mining Maximal Frequent Subgraphs. - Benny Kimelfeld; Phokion G. Kolaitis (ACM Trans. Database Syst., 2014)

Dichotomies in the Complexity of Preferred Repairs. - Ronald Fagin; Benny Kimelfeld; Phokion G. Kolaitis (PODS, 2015)

Consistent Answers of Conjunctive Queries on Graphs. - Foto N. Afrati; Phokion G. Kolaitis; Angelos Vasilakopoulos (CoRR, 2015)

Aggregation of Votes with Multiple Positions on Each Issue. - Lefteris M. Kirousis; Phokion G. Kolaitis (CoRR, 2015)

Invited Articles Foreword. - Avi Wigderson; Phokion G. Kolaitis (J. ACM, 2015)

On the Data Complexity of Consistent Query Answering. - Balder ten Cate; Gaëlle Fontaine; Phokion G. Kolaitis (Theory Comput. Syst., 2015)

Dependence Logic vs. Constraint Satisfaction. - Lauri Hella; Phokion G. Kolaitis (CSL, 2016)

Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics. - Balder ten Cate; Richard L. Halpert; Phokion G. Kolaitis (EDBT, 2016)

Exchange-Repairs - Managing Inconsistency in Data Exchange. - Balder ten Cate; Richard L. Halpert; Phokion G. Kolaitis (J. Data Semant., 2016)

A Declarative Framework for Linking Entities. - Douglas Burdick; Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang-Chiew Tan (ACM Trans. Database Syst., 2016)

Schema Mappings: Structural Properties and Limits (Invited Talk). - Phokion G. Kolaitis (CSL, 2017)

Foundations of information integration under bag semantics. - André Hernich; Phokion G. Kolaitis (LICS, 2017)

Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). - Anuj Dawar; Erich Grädel; Phokion G. Kolaitis; Thomas Schwentick (Dagstuhl Reports, 2017)

Approximation Algorithms for Schema-Mapping Discovery from Data Examples. - Balder ten Cate; Phokion G. Kolaitis; Kun Qian 002; Wang-Chiew Tan (ACM Trans. Database Syst., 2017)

Computational Social Choice Meets Databases. - Benny Kimelfeld; Phokion G. Kolaitis; Julia Stoyanovich (IJCAI, 2018)

Active Learning of GAV Schema Mappings. - Balder ten Cate; Phokion G. Kolaitis; Kun Qian 002; Wang-Chiew Tan (PODS, 2018)

Reflections on Schema Mappings, Data Exchange, and Metadata Management. - Phokion G. Kolaitis (PODS, 2018)

Limits of Schema Mappings. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (Theory Comput. Syst., 2018)

Knowledge Refinement via Rule Selection. - Phokion G. Kolaitis; Lucian Popa 001; Kun Qian 002 (AAAI, 2019)

Query Evaluation in Election Databases. - Benny Kimelfeld; Phokion G. Kolaitis; Muhammad Tibi (PODS, 2019)

A SAT-Based System for Consistent Query Answering. - Akhil A. Dixit; Phokion G. Kolaitis (SAT, 2019)

Logic and Learning (Dagstuhl Seminar 19361). - Michael Benedikt; Kristian Kersting; Phokion G. Kolaitis; Daniel Neider (Dagstuhl Reports, 2019)

Logics for Dependence and Independence (Dagstuhl Seminar 19031). - Erich Grädel; Phokion G. Kolaitis; Juha Kontinen; Heribert Vollmer (Dagstuhl Reports, 2019)

Generalized satisfiability problems via operator assignments. - Albert Atserias; Phokion G. Kolaitis; Simone Severini (J. Comput. Syst. Sci., 2019)

Expressive power of entity-linking frameworks. - Douglas Burdick; Ronald Fagin; Phokion G. Kolaitis; Lucian Popa 001; Wang-Chiew Tan (J. Comput. Syst. Sci., 2019)

Aggregation of Votes with Multiple Positions on Each Issue. - Lefteris M. Kirousis; Phokion G. Kolaitis; John Livieratos (ACM Trans. Economics and Comput., 2019)

Temporal Enrichment and Querying of Ontology-Compliant Data. - Jing Ao; Zehui Cheng 001; Rada Chirkova; Phokion G. Kolaitis (ADBIS (Short Papers), 2020)

Decision Problems in Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ICALP, 2020)

The Complexity of Possible Winners on Partial Chains. - Vishal Chakraborty; Phokion G. Kolaitis (CoRR, 2020)

Consistency, Acyclicity, and Positive Semirings. - Albert Atserias; Phokion G. Kolaitis (CoRR, 2020)

On the Language of Nested Tuple Generating Dependencies. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (ACM Trans. Database Syst., 2020)

Ontology-Enriched Query Answering on Relational Databases. - Shqiponja Ahmetaj; Vasilis Efthymiou; Ronald Fagin; Phokion G. Kolaitis; Chuan Lei; Fatma Özcan; Lucian Popa 001 (AAAI, 2021)

Classifying the Complexity of the Possible Winner Problem on Partial Chains. - Vishal Chakraborty; Phokion G. Kolaitis (AAMAS, 2021)

Model-theoretic Characterizations of Rule-based Ontologies. - Marco Console; Phokion G. Kolaitis; Andreas Pieris (Description Logics, 2021)

On the Expressive Power of Homomorphism Counts. - Albert Atserias; Phokion G. Kolaitis; Wei-Lin Wu (LICS, 2021)

Computational Social Choice and Incomplete Information. - Phokion G. Kolaitis (SEBD, 2021)

CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving. - Akhil A. Dixit; Phokion G. Kolaitis (SIGMOD Conference, 2021)

Consistent Answers of Aggregation Queries using SAT Solvers. - Akhil A. Dixit; Phokion G. Kolaitis (CoRR, 2021)

Universal solutions for temporal data exchange. - Zehui Cheng 001; Phokion G. Kolaitis (Inf. Comput., 2021)

On the Computational Complexity of Non-Dictatorial Aggregation. - John Livieratos; Phokion G. Kolaitis; Lefteris M. Kirousis (J. Artif. Intell. Res., 2021)

Algorithmic Techniques for Necessary and Possible Winners. - Vishal Chakraborty; Theo Delemazure; Benny Kimelfeld; Phokion G. Kolaitis; Kunal Relia; Julia Stoyanovich (Trans. Data Sci., 2021)

Bag Query Containment and Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ACM Trans. Database Syst., 2021)

Consistent Answers of Aggregation Queries via SAT. - Akhil A. Dixit; Phokion G. Kolaitis (ICDE, 2022)

Logic and Random Discrete Structures (Dagstuhl Seminar 22061). - Erich Grädel; Phokion G. Kolaitis; Marc Noy (Dagstuhl Reports, 2022)

Structure and Complexity of Bag Consistency. - Albert Atserias; Phokion G. Kolaitis (SIGMOD Rec., 2022)

Algorithmic Aspects of Information Theory (Dagstuhl Seminar 22301). - Phokion G. Kolaitis; Andrei E. Romashchenko; Milan Studený; Dan Suciu; Tobias Boege (Dagstuhl Reports, 2022)

A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases. - Ronald Fagin; Phokion G. Kolaitis; Domenico Lembo; Lucian Popa 001; Federico Scafoglieri (KR, 2023)

A Finer Analysis of Multi-Structural Games and Beyond. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (CoRR, 2023)

Theory and Practice of Relational-to-RDF Temporal Data Exchange and Query Answering. - Jing Ao; Zehui Cheng 001; Rada Chirkova; Phokion G. Kolaitis (ACM J. Data Inf. Qual., 2023)

When Do Homomorphism Counts Help in Query Algorithms? - Balder ten Cate; Victor Dalmau; Phokion G. Kolaitis; Wei-Lin Wu (ICDT, 2024)

On the Number of Quantifiers Needed to Define Boolean Functions. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (MFCS, 2024)

Combining Entity Resolution and Query Answering in Ontologies: A Formal Conceptual Framework. - Ronald Fagin; Phokion G. Kolaitis; Domenico Lembo; Lucian Popa 001; Federico Scafoglieri (SEBD, 2024)

Parallel Play Saves Quantifiers. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta; R. Ryan Williams (CoRR, 2024)

Characterizing Data Dependencies Then and Now. - Phokion G. Kolaitis; Andreas Pieris (CoRR, 2024)

Rewriting Consistent Answers on Annotated Data. - Phokion G. Kolaitis; Nina Pardal; Jonni Virtema (CoRR, 2024)

Multi-Structural Games and Beyond. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (Log. Methods Comput. Sci., 2024)

Consistency of Relations over Monoids. - Albert Atserias; Phokion G. Kolaitis (Proc. ACM Manag. Data, 2024)

A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases. - Benny Kimelfeld; Phokion G. Kolaitis (Commun. ACM, 2024)

Query Repairs. - Balder ten Cate; Phokion G. Kolaitis; Carsten Lutz (ICDT, 2025)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts. - Balder ten Cate; Phokion G. Kolaitis; Arnar Á. Kristjánsson (MFCS, 2025)

Codd's Theorem for Databases over Semirings. - Guillermo Badia; Phokion G. Kolaitis; Carles Noguera (CoRR, 2025)

Rewriting Consistent Answers On Annotated Data. - Phokion G. Kolaitis; Nina Pardal; Jonni Virtema; Jef Wijsen (Proc. ACM Manag. Data, 2025)

A Unifying Algorithm for Hierarchical Queries. - Mahmoud Abo Khamis; Jesse Comer; Phokion G. Kolaitis; Sudeepa Roy 001; Val Tannen (CoRR, 2025)

Consistency Witnesses for Annotated Relations. - Albert Atserias; Phokion G. Kolaitis (SIGMOD Rec., 2025)

Who Wins the Multi-Structural Game? - Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta (CoRR, 2025)