Ronald Fagin

Christos H. Papadimitriou

Georg Gottlob

Proceedings of the 29th Italian Symposium on Advanced Database Systems, 2021

Multi-Structural Games and Number of Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Ontology-Enriched Query Answering on Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Foundations of Reasoning with Uncertainty via Real-valued Logics.

[BibT_eX]

[DOI]

Ryan Riegel

Alexander G. Gray

CoRR, 2020

Logical Neural Networks.

[BibT_eX]

[DOI]

Ismail Yunus Akhalwaya

Santosh K. Srivastava

CoRR, 2020

2019

Expressive power of entity-linking frameworks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Recursive Programs for Document Spanners.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

Tuple-Generating Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Score Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Equality-Generating Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

2016

Declarative Cleaning of Inconsistencies in Information Extraction.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

A Declarative Framework for Linking Entities.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

An Algorithmic View of Voting.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Optimal Score Aggregation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

A Relational Framework for Information Extraction.

[BibT_eX]

[DOI]

SIGMOD Rec., 2015

Document Spanners: A Formal Approach to Information Extraction.

[BibT_eX]

[DOI]

J. ACM, 2015

Dichotomies in the Complexity of Preferred Repairs.

[BibT_eX]

[DOI]

Benny Kimelfeld

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

Cleaning inconsistencies in information extraction via prioritized repairs.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

The ICDT 2014 Test of Time Award.

[BibT_eX]

[DOI]

Michael Benedikt

Wim Martens

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2013

Solutions and query rewriting in data exchange.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Spanners: a formal framework for information extraction.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Applying theory to practice.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Local transformations and conjunctive-query equivalence.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

A normal form for preventing redundant tuples in relational databases.

[BibT_eX]

[DOI]

Hugh Darwen

C. J. Date

Proceedings of the 15th International Conference on Database Theory, 2012

2011

Reverse data exchange: Coping with nulls.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2011

Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Probabilistic data exchange.

[BibT_eX]

[DOI]

Benny Kimelfeld

J. ACM, 2011

Composition with Target Constraints

[BibT_eX]

[DOI]

Marcelo Arenas

Alan Nash

Log. Methods Comput. Sci., 2011

Rewrite rules for search database systems.

[BibT_eX]

[DOI]

Shivakumar Vaithyanathan

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Schema Mapping Evolution Through Composition and Inversion.

[BibT_eX]

[DOI]

Proceedings of the Schema Matching and Mapping, 2011

2010

The structure of inverses in schema mappings.

[BibT_eX]

[DOI]

Alan Nash

J. ACM, 2010

Epistemic privacy.

[BibT_eX]

[DOI]

Alexandre V. Evfimievski

David P. Woodruff

J. ACM, 2010

Understanding queries in a search database system.

[BibT_eX]

[DOI]

Shivakumar Vaithyanathan

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

Tuple-Generating Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Equality-Generating Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Clio: Schema Mapping Creation and Data Exchange.

[BibT_eX]

[DOI]

Laura M. Haas

Renée J. Miller

Lucian Popa

Yannis Velegrakis

Proceedings of the Conceptual Modeling: Foundations and Applications, 2009

Finite Model Theory and its Origins.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Modelling 2009, 2009

2008

Quasi-inverses of schema mappings.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2008

Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03).

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Towards a theory of schema-mapping optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

2007

Inverting schema mappings.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2007

2006

Comparing Partial Rankings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

2005

Composing schema mappings: Second-order dependencies to the rescue.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2005

Data exchange: getting to the core.

[BibT_eX]

[DOI]

Lucian Popa

ACM Trans. Database Syst., 2005

Data exchange: semantics and query answering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Efficient Implementation of Large-Scale Multi-Structural Databases.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Multi-structural databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

2004

Comparing and Aggregating Rankings with Ties.

[BibT_eX]

[DOI]

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Locally Consistent Transformations and Query Answering in Data Exchange.

[BibT_eX]

[DOI]

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

2003

Comparing Top k Lists.

[BibT_eX]

[DOI]

Ravi Kumar

D. Sivakumar

SIAM J. Discret. Math., 2003

Optimal aggregation algorithms for middleware.

[BibT_eX]

[DOI]

Amnon Lotem

Moni Naor

J. Comput. Syst. Sci., 2003

Searching the workplace web.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International World Wide Web Conference, 2003

Efficient similarity search and classification via rank aggregation.

[BibT_eX]

[DOI]

Ravi Kumar

D. Sivakumar

Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

2002

Combining Fuzzy Information: an Overview.

[BibT_eX]

[DOI]

SIGMOD Rec., 2002

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Query Strategies for Priced Information.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Compactly encoding unstructured inputs with differential compression.

[BibT_eX]

[DOI]

J. ACM, 2002

Schema Management.

[BibT_eX]

[DOI]

Anastasios Kementsietsidis

C. T. Howard Ho

IEEE Data Eng. Bull., 2002

Translating Web Data.

[BibT_eX]

[DOI]

Lucian Popa

Yannis Velegrakis

Renée J. Miller

Proceedings of 28th International Conference on Very Large Data Bases, 2002

2001

The Clio Project: Managing Heterogeneity.

[BibT_eX]

[DOI]

Renée J. Miller

SIGMOD Rec., 2001

Data-Driven Understanding and Refinement of Schema Mappings.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM SIGMOD international conference on Management of data, 2001

Static Index Pruning for Information Retrieval Systems.

[BibT_eX]

[DOI]

Proceedings of the SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2001

2000

A formula for incorporating weights into scoring rules.

[BibT_eX]

[DOI]

Edward L. Wimmers

Theor. Comput. Sci., 2000

The Closure of Monadic NP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Random walks with "back buttons" (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Query strategies for priced information (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Allowing users to weight search terms.

[BibT_eX]

[DOI]

Yoëlle S. Maarek

Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 2000

Logic, Complexity, and Games.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999

Combining Fuzzy Information from Multiple Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

The hierarchical approach to modeling knowledge and common knowledge.

[BibT_eX]

[DOI]

Int. J. Game Theory, 1999

Common Knowledge Revisited.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

1998

Relaxing the Triangle Inequality in Pattern Matching.

[BibT_eX]

[DOI]

Int. J. Comput. Vis., 1998

The Closure of Monadic NP (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Fuzzy Queries in Multimedia Database Systems.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1997

On Winning Strategies in Ehrenfeucht-Fraïssé Games.

[BibT_eX]

[DOI]

Sanjeev Arora

Theor. Comput. Sci., 1997

Comparing the Power of Games on Graphs.

[BibT_eX]

[DOI]

Math. Log. Q., 1997

Reasoning about Knowledge: A Response by the Authors.

[BibT_eX]

[DOI]

Minds Mach., 1997

Knowledge-Based Programs.

[BibT_eX]

[DOI]

Distributed Comput., 1997

Incorporating User Preferences in Multimedia Queries.

[BibT_eX]

[DOI]

Edward L. Wimmers

Proceedings of the Database Theory, 1997

Spectra with Only Unary Function Symbols.

[BibT_eX]

[DOI]

Arnaud Durand

Bernd Loescher

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

Comparing Information Without Leaking It.

[BibT_eX]

[DOI]

Moni Naor

Peter Winkler

Commun. ACM, 1996

Efficiently Extendible Mappings for Balanced Data Distribution.

[BibT_eX]

[DOI]

David M. Choy

Algorithmica, 1996

The Garlic Project.

[BibT_eX]

[DOI]

Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Easier Ways to Win Logical Games.

[BibT_eX]

[DOI]

Proceedings of the Descriptive Complexity and Finite Models, 1996

1995

On Monadic NP vs. Monadic co-NP

[BibT_eX]

[DOI]

Inf. Comput., July, 1995

A Nonstandard Approach to the Logical Omniscience Problem.

[BibT_eX]

[DOI]

Artif. Intell., 1995

Querying Multimedia Data from Multiple Repositories by Content: the Garlic Project.

[BibT_eX]

Proceedings of the Visual Database Systems 3, 1995

Towards Heterogeneous Multimedia Information Systems: The Garlic Approach.

[BibT_eX]

[DOI]

Proceedings of the Proceedings RIDE-DOM '95, Fifth International Workshop on Research Issues in Data Engineering, 1995

Reasoning About Knowledge.

[BibT_eX]

[DOI]

MIT Press, ISBN: 9780262562003, 1995

Reasoning about knowledge.

[BibT_eX]

[DOI]

MIT Press, ISBN: 0262061627, 1995

1994

A Quantitative Analysis of Modal Logic.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

Reasoning About Knowledge and Probability.

[BibT_eX]

[DOI]

J. ACM, 1994

Comparing the Power of Monadic NP Games.

[BibT_eX]

[DOI]

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

An Operational Semantics for Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

Finite-Model Theory - A Personal Perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Response to "Remarks on Two New Theorems of Date and Fagin".

[BibT_eX]

[DOI]

C. J. Date

SIGMOD Rec., 1993

On Monadic NP vs. Monadic co-NP (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Simple Conditions for Guaranteeing Higher Normal Forms in Relational Databases.

[BibT_eX]

[DOI]

C. J. Date

ACM Trans. Database Syst., 1992

What Is an Inference Rule?

[BibT_eX]

[DOI]

J. Symb. Log., 1992

What Can Machines Know? On the Properties of Knowledge in Distributed Systems.

[BibT_eX]

[DOI]

J. ACM, 1992

Two Views of Belief: Belief as Generalized Probability and Belief as Evidence.

[BibT_eX]

[DOI]

Artif. Intell., 1992

The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge.

[BibT_eX]

Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

1991

A Model-Theoretic Analysis of Knowledge.

[BibT_eX]

[DOI]

J. ACM, 1991

Uncertainty, belief, and probability.

[BibT_eX]

[DOI]

Comput. Intell., 1991

1990

Reachability Is Harder for Directed than for Undirected Finite Graphs.

[BibT_eX]

[DOI]

J. Symb. Log., 1990

A Logic for Reasoning about Probabilities

[BibT_eX]

[DOI]

Nimrod Megiddo

Inf. Comput., 1990

A new approach to updating beliefs.

[BibT_eX]

[DOI]

Proceedings of the UAI '90: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence, 1990

1989

Modelling Knowledge and Action in Distributed Systems.

[BibT_eX]

[DOI]

Distributed Comput., 1989

1988

I'm OK if you're OK: On the notion of trusting communication.

[BibT_eX]

[DOI]

J. Philos. Log., 1988

Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Correction to "An equivalence between relational database dependencies and a fragment of propositional logic".

[BibT_eX]

[DOI]

Yehoshua Sagiv

Claude Delobel

Douglas Stott Parker Jr.

J. ACM, 1987

Belief, Awareness, and Limited Reasoning. .

[BibT_eX]

[DOI]

Artif. Intell., 1987

1986

A Simple Characterization of Database Dependency Implication.

[BibT_eX]

[DOI]

Yoshito Hanatani

Inf. Process. Lett., 1986

Updating Logical Databases.

[BibT_eX]

Adv. Comput. Res., 1986

Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report.

[BibT_eX]

Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

What Can Machines Know? On the Epistemic Properties of Machines.

[BibT_eX]

[DOI]

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985

Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Decreasing the Nesting Depth of Expressions Involving Square Roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 1985

An Internal Semantics for Modal Logic: Preliminary Report

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

A Formal Model of Knowledge, Action, and Communication in Distributed Systems: Preliminary Report.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Belief, Awareness, and Limited Reasoning: Preliminary Report.

[BibT_eX]

[DOI]

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1984

Inclusion Dependencies and Their Interaction with Functional Dependencies.

[BibT_eX]

[DOI]

Marco A. Casanova

Christos H. Papadimitriou

J. Comput. Syst. Sci., 1984

On the Structure of Armstrong Relations for Functional Dependencies.

[BibT_eX]

[DOI]

J. ACM, 1984

The Theory of Data Dependencies - An Overview.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

A Model-Theoretic Analysis of Knowledge: Preliminary Report

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Degrees of Acyclicity for Hypergraphs and Relational Database Schemes

[BibT_eX]

[DOI]

J. ACM, July, 1983

On the Desirability of Acyclic Database Schemes

[BibT_eX]

[DOI]

J. ACM, July, 1983

Tools for Template Dependencies.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Armstrong Databases for Functional and Inclusion Dependencies.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

A Fair Carpool Scheduling Algorithm.

[BibT_eX]

[DOI]

John H. Williams

IBM J. Res. Dev., 1983

On the Semantics of Updates in Databases.

[BibT_eX]

[DOI]

Jeffrey D. Ullman

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

Acyclic Database Schemes (of Various Degrees): A Painless Introduction.

[BibT_eX]

[DOI]

Proceedings of the CAAP'83, 1983

1982

A Simplified Universal Relation Assumption and Its Properties.

[BibT_eX]

[DOI]

Alberto O. Mendelzon

Jeffrey D. Ullman

ACM Trans. Database Syst., 1982

Horn clauses and database dependencies.

[BibT_eX]

[DOI]

J. ACM, 1982

1981

A Normal Form for Relational Databases That Is Based on Domians and Keys.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1981

A Note on the Existence of Continuous Functionals.

[BibT_eX]

[DOI]

J. Lawrence Carter

Theor. Comput. Sci., 1981

An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.

[BibT_eX]

[DOI]

Yehoshua Sagiv

Claude Delobel

Douglas Stott Parker Jr.

J. ACM, 1981

Properties of Acyclic Database Schemes

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Horn Clauses and Database Dependencies (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Extendible Hashing - A Fast Access Method for Dynamic Files.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1979

Normal Forms and Relational Database Operators.

[BibT_eX]

[DOI]

Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, USA, May 30, 1979

1978

On an Authorization Mechanism.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1978

Efficient Calculation of Expected Miss Ratios in the Independent Reference Model.

[BibT_eX]

[DOI]

Thomas G. Price

SIAM J. Comput., 1978

Cold-Start vs. Warm-Start Miss Ratios.

[BibT_eX]

[DOI]

Malcolm C. Easton

Commun. ACM, 1978

1977

Multivalued Dependencies and a New Normal Form for Relational Databases.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1977

Asymptotic Miss Ratios over Independent References.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1977

Functional Dependencies in a Relational Data Base and Propositional Logic.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 1977

The number of finite relational structures.

[BibT_eX]

[DOI]

Discret. Math., 1977

The Decomposition Versus Synthetic Approach to Relational Database Design.

[BibT_eX]

Proceedings of the Third International Conference on Very Large Data Bases, 1977

A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations.

[BibT_eX]

[DOI]

Catriel Beeri

John H. Howard

Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, 1977

1976

Probabilities on Finite Models.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

The independence of miss ratio on page size.

[BibT_eX]

[DOI]

Malcolm C. Easton

J. ACM, 1976

A Counterintuitive Example of Computer Paging.

[BibT_eX]

[DOI]

Commun. ACM, 1976

1975

A spectrum hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 1975

A two-cardinal characterization of double spectra.

[BibT_eX]

[DOI]

Math. Log. Q., 1975

Monadic generalized spectra.

[BibT_eX]

[DOI]