Michael Benedikt

Cécilia Pradic

Proc. ACM Program. Lang., 2021

2020

Monadic Datalog, Tree Validity, and Limited Access Containment.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Finite Open-world Query Answering with Number Restrictions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Scalable Querying of Nested Data.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Generating collection queries from proofs.

[BibT_eX]

[DOI]

Cécilia Pradic

CoRR, 2020

Two Variable Logic with Ultimately Periodic Counting.

[BibT_eX]

[DOI]

Egor V. Kostylev

Tony Tan

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Guest Editorial: Special Issue on Database Theory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Definability and Interpolation within Decidable Fixpoint Logics.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Logic and Learning (Dagstuhl Seminar 19361).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Reasoning about Disclosure in Data Integration in the Presence of Source Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Logic-based Perspectives on Query Reformulationover Restricted Interfaces.

[BibT_eX]

[DOI]

SIGMOD Rec., 2018

Some Model Theory of Guarded Negation.

[BibT_eX]

[DOI]

Vince Bárány

J. Symb. Log., 2018

Query Answering with Transitive and Linear-Ordered Data.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Logical foundations of information disclosure in ontology-based data integration.

[BibT_eX]

[DOI]

Bernardo Cuenca Grau

Egor V. Kostylev

Artif. Intell., 2018

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?

[BibT_eX]

[DOI]

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Form Filling Based on Constraint Solving.

[BibT_eX]

[DOI]

Ben Spencer

Proceedings of the Web Engineering - 18th International Conference, 2018

Goal-Driven Query Answering for Existential Rules With Equality.

[BibT_eX]

[DOI]

Boris Motik

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Determinacy and rewriting of functional top-down and MSO tree transformations.

[BibT_eX]

[DOI]

Joost Engelfriet

Sebastian Maneth

J. Comput. Syst. Sci., 2017

Benchmarking the Chase.

[BibT_eX]

[DOI]

George Konstantinidis

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Polynomial automata: Zeroness and applications.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

ArtForm: a tool for exploring the codebase of form-based websites.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, USA, July 10, 2017

Reformulating Queries: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Characterizing Definability in Decidable Fixpoint Logics.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Source Information Disclosure in Ontology-Based Data Integration.

[BibT_eX]

[DOI]

Bernardo Cuenca Grau

Egor V. Kostylev

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation

[BibT_eX]

[DOI]

Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01856-5, 2016

Generating Plans from Proofs.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

Limiting Until in Ordered Tree Query Languages.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

Effective Interpolation and Preservation in Guarded Logics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

Complexity of Two-Variable Logic on Finite Trees.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

SPARQLByE: Querying RDF data by example.

[BibT_eX]

[DOI]

Gonzalo I. Diaz

Marcelo Arenas

Proc. VLDB Endow., 2016

Querying Visible and Invisible Information.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Step Up in Expressiveness of Decidable Fixpoint Logics.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Biological Web Services: Integration, Optimization, and Reasoning.

[BibT_eX]

[DOI]

Rodrigo Lopez-Serrano

Proceedings of the Workshop on Advances in Bioinformatics and Artificial Intelligence: Bridging the Gap co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016

2015

Analysis of Schemas with Access Restrictions.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2015

Querying with Access Patterns and Integrity Constraints.

[BibT_eX]

[DOI]

Julien Leblay

Proc. VLDB Endow., 2015

The complexity of higher-order queries.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Querying Visible and Invisible Tables in the Presence of Integrity Constraints.

[BibT_eX]

[DOI]

CoRR, 2015

Finite Open-World Query Answering with Number Restrictions (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

Combining Existential Rules and Description Logics (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

The Complexity of Boundedness for Guarded Logics.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Interpolation with Decidable Fixpoint Logics.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Combining Existential Rules and Description Logics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

The per-character cost of repairing word languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

PDQ: Proof-driven Query Answering over Web-based Data.

[BibT_eX]

[DOI]

Julien Leblay

Proc. VLDB Endow., 2014

Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331).

[BibT_eX]

[DOI]

Carsten Lutz

Dagstuhl Reports, 2014

Model Checking Markov Chains Against Unambiguous Buchi Automata.

[BibT_eX]

[DOI]

CoRR, 2014

Generating low-cost plans from proofs.

[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]

Ronald Fagin

Wim Martens

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

Logical Approaches to Query Optimization over Web-Based Sources.

[BibT_eX]

[DOI]

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013

Report on the first workshop on innovative querying of streams.

[BibT_eX]

[DOI]

Dan Olteanu

SIGMOD Rec., 2013

Aggregating Semantic Annotators.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

ROSeAnn: Reconciling Opinions of Semantic Annotators.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Bounded repairability of word languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees

[BibT_eX]

[DOI]

CoRR, 2013

Two Variable vs. Linear Temporal Logic in Model Checking and Games

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

LTL Model Checking of Interval Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

The ACM PODS Alberto O. Mendelzon test-of-time award 2013.

[BibT_eX]

[DOI]

Tova Milo

Dirk Van Gucht

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

Determinacy and Rewriting of Top-Down and MSO Tree Transformations.

[BibT_eX]

[DOI]

Joost Engelfriet

Sebastian Maneth

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Rewriting Guarded Negation Queries.

[BibT_eX]

[DOI]

Vince Bárány

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bisimilarity of Pushdown Automata is Nonelementary.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Access patterns and integrity constraints revisited.

[BibT_eX]

[DOI]

Vince Bárány

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Report on PODS 2012.

[BibT_eX]

[DOI]

SIGACT News, 2012

Querying Schemas With Access Restrictions.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

Bisimilarity of Pushdown Systems is Nonelementary

[BibT_eX]

[DOI]

CoRR, 2012

ProFoUnd: program-analysis-based form understanding.

[BibT_eX]

[DOI]

Proceedings of the 21st World Wide Web Conference, 2012

HigherOrder Functions and Structured Datatypes.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on the Web and Databases 2012, 2012

Verification of Two-Variable Logic Revisited.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Monadic Datalog Containment.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

QUASAR: querying annotation, structure, and reasoning.

[BibT_eX]

[DOI]

Luying Chen

Evgeny Kharlamov

Proceedings of the 15th International Conference on Extending Database Technology, 2012

2011

HOMES: A Higher-Order Mapping Evaluation System.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2011

Determining Relevance of Accesses at Runtime (Extended Version)

[BibT_eX]

[DOI]

Georg Gottlob

CoRR, 2011

Determining relevance of accesses at runtime.

[BibT_eX]

[DOI]

Georg Gottlob

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

Regular Repair of Specifications.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Complexity of higher-order queries.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2011

The Cost of Traveling between Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Databases.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010

Report on the EDBT/ICDT 2010 workshop on updates in XML.

[BibT_eX]

[DOI]

SIGMOD Rec., 2010

Probabilistic XML via Markov Chains.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2010

The Impact of Virtual Views on Containment.

[BibT_eX]

[DOI]

Georg Gottlob

Proc. VLDB Endow., 2010

Destabilizers and Independence of XML Updates.

[BibT_eX]

[DOI]

James Cheney

Proc. VLDB Endow., 2010

Positive higher-order queries.

[BibT_eX]

[DOI]

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

Analysis of declarative updates: invited talk.

[BibT_eX]

[DOI]

Proceedings of the 2010 EDBT/ICDT Workshops, Lausanne, Switzerland, March 22-26, 2010, 2010

Automata vs. Logics on Data Words.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

What You Must Remember When Processing Data Words.

[BibT_eX]

[DOI]

Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

2009

From XQuery to relational logics.

[BibT_eX]

[DOI]

Christoph Koch

ACM Trans. Database Syst., 2009

Regular tree languages definable in FO and in FO<sub><i>mod</i></sub>.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Schema-Based Independence Analysis for XML Updates.

[BibT_eX]

[DOI]

James Cheney

Proc. VLDB Endow., 2009

Towards a characterization of order-invariant queries over tame graphs.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

How big must complete XML query languages be?

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2009

Semantics, Types and Effects for XML Updates.

[BibT_eX]

[DOI]

James Cheney

Proceedings of the Database Programming Languages, 2009

2008

Efficient network aware search in collaborative tagging sites.

[BibT_eX]

[DOI]

Sihem Amer-Yahia

Laks V. S. Lakshmanan

Julia Stoyanovich

Proc. VLDB Endow., 2008

XPath satisfiability in the presence of DTDs.

[BibT_eX]

[DOI]

Wenfei Fan

Floris Geerts

J. ACM, 2008

XPath leashed.

[BibT_eX]

[DOI]

Christoph Koch

ACM Comput. Surv., 2008

Stream firewalling of xml constraints.

[BibT_eX]

[DOI]

Alan Jeffrey

Ruy Ley-Wild

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

2007

Logical definability and query languages over ranked and unranked trees.

[BibT_eX]

[DOI]

Frank Neven

ACM Trans. Comput. Log., 2007

Database Theory 2004.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Challenges in Searching Online Communities.

[BibT_eX]

[DOI]

Sihem Amer-Yahia

Philip Bohannon

IEEE Data Eng. Bull., 2007

Efficient and Expressive Tree Filters.

[BibT_eX]

[DOI]

Alan Jeffrey

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

A characterization of first-order topological properties of planar spatial data.

[BibT_eX]

[DOI]

J. ACM, 2006

Interpreting Tree-to-Tree Queries.

[BibT_eX]

[DOI]

Christoph Koch

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Data Cleaning for Decision Support.

[BibT_eX]

[DOI]

Philip Bohannon

Glenn Bruns

Proceedings of the First Int'l VLDB Workshop on Clean Databases, 2006

2005

Analysis of recursive state machines.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2005

Structural properties of XPath fragments.

[BibT_eX]

[DOI]

Wenfei Fan

Gabriel M. Kuper

Theor. Comput. Sci., 2005

Adding Updates to XQuery: Semantics, Optimization, and Static Analysis.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on XQuery Implementation, 2005

Regular Tree Languages Definable in FO.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

An Insider's Guide to Logic in Telecommunications Data.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

XML Subtree Queries: Specification and Composition.

[BibT_eX]

[DOI]

Irini Fundulaki

Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Towards a Characterization of Order-Invariant Queries over Tame Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Verification of Tree Updates for Optimization.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

Managing XML data: an abridged overview.

[BibT_eX]

[DOI]

Juliana Freire

Comput. Sci. Eng., 2004

A Characterization of First-Order Topological Properties of Planar Spatial Data.

[BibT_eX]

[DOI]

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

On Guard: Producing Run-Time Checks from Integrity Constraints.

[BibT_eX]

[DOI]

Glenn Bruns

Proceedings of the Algebraic Methodology and Software Technology, 2004

2003

Definability with a predicate for a semi-linear set.

[BibT_eX]

[DOI]

H. Jerome Keisler

J. Symb. Log., 2003

Reachability and connectivity queries in constraint databases.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Definable relations and first-order query languages over strings.

[BibT_eX]

[DOI]

J. ACM, 2003

Capturing both Types and Constraints in Data Integration.

[BibT_eX]

[DOI]

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

E-services: a look behind the curtain.

[BibT_eX]

[DOI]

Richard Hull

Vassilis Christophides

Jianwen Su

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

2002

Aggregate Operators in Constraint Query Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

DTD-Directed Publishing with Attribute Translation Grammars.

[BibT_eX]

[DOI]

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

Tree Extension Algebras: Logics, Automata, and Query Languages.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

String Operations in Query Languages.

[BibT_eX]

[DOI]

Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

A Model-Theoretic Approach to Regular String Relations.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Model Checking of Unrestricted Hierarchical State Machines.

[BibT_eX]

[DOI]

Patrice Godefroid

Thomas W. Reps

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Safe Constraint Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Relational queries over interpreted structures.

[BibT_eX]

[DOI]

J. ACM, 2000

Definability over Linear Constraints.

[BibT_eX]

[DOI]

H. Jerome Keisler

Proceedings of the Computer Science Logic, 2000

Query Safety with Constraints.

[BibT_eX]

Proceedings of the Constraint Databases, 2000

Expressive Power: The Finite Case.

[BibT_eX]

Proceedings of the Constraint Databases, 2000

1999

Hierarchies of Measure-Theoretic Ultrafilters.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

Exact and Approximate Aggregation in Constraint Query.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

A Decidable Logic for Describing Linked Data Structures.

[BibT_eX]

[DOI]

Thomas W. Reps

Shmuel Sagiv

Proceedings of the Programming Languages and Systems, 1999

1998

Ultrafilters which Extend Measures.

[BibT_eX]

[DOI]

J. Symb. Log., 1998

Relational Expressive Power of Constraint Query Languages.

[BibT_eX]

[DOI]

J. ACM, 1998

Verifiable Properties of Database Transactions.

[BibT_eX]

[DOI]

Timothy Griffin

Inf. Comput., 1998

Embedded Finite Models, Stability Theory and the Impact of Order.

[BibT_eX]

[DOI]

John T. Baldwin

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

Integrated web and telephone service creation.

[BibT_eX]

[DOI]

J. Christopher Ramming

Kenneth Rehor

Curtis Tuckey

Bell Labs Tech. J., 1997

Languages for Relational Databases over Interpreted Structures.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

Experience with a Domain Specific Language for Form-based Services.

[BibT_eX]

[DOI]

Proceedings of the Conference on Domain-Specific Languages, 1997

Expressive Power of Unary Counters.

[BibT_eX]

[DOI]

H. Jerome Keisler

Proceedings of the Structures in Logic and Computer Science, 1997

1996

On the Structure of Queries in Constraint Query Languages.

[BibT_eX]

[DOI]