Balder ten Cate

Victor Dalmau

ACM Trans. Database Syst., 2022

On the non-efficient PAC learnability of acyclic conjunctive queries.

[BibT_eX]

[DOI]

CoRR, 2022

Characterising Modal Formulas with Examples.

[BibT_eX]

[DOI]

Raoul Koudijs

CoRR, 2022

Local Dependence and Guarding.

[BibT_eX]

[DOI]

Raoul Koudijs

Johan van Benthem

Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021

Inference from Visible Information and Background Knowledge.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

2020

The Homomorphism Lattice, Unique Characterizations, and Concept Learning.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

2019

Learning Multilingual Word Embeddings Using Image-Text Data.

[BibT_eX]

[DOI]

Karan Singhal

Karthik Raman

CoRR, 2019

Recursive Programs for Document Spanners.

[BibT_eX]

[DOI]

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

2018

Some Model Theory of Guarded Negation.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

Active Learning of GAV Schema Mappings.

[BibT_eX]

[DOI]

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

2017

Approximation Algorithms for Schema-Mapping Discovery from Data Examples.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2017

Declarative Probabilistic Programming with Datalog.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 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]

Efthymia Tsamoura

ACM Trans. Database Syst., 2016

Effective Interpolation and Preservation in Guarded Logics.

[BibT_eX]

[DOI]

Michael Vanden Boom

ACM Trans. Comput. Log., 2016

Exchange-Repairs - Managing Inconsistency in Data Exchange.

[BibT_eX]

[DOI]

Richard L. Halpert

J. Data Semant., 2016

Querying Visible and Invisible Information.

[BibT_eX]

[DOI]

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

Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics.

[BibT_eX]

[DOI]

Richard L. Halpert

Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015

Foreword: Special Issue on Database Theory.

[BibT_eX]

[DOI]

Wang-Chiew Tan

Theory Comput. Syst., 2015

On the Data Complexity of Consistent Query Answering.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Guarded Negation.

[BibT_eX]

[DOI]

J. ACM, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Design and Implementation of the LogicBlox System.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

High-Level Why-Not Explanations using Ontologies.

[BibT_eX]

[DOI]

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 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]

Michael Vanden Boom

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

The Product Homomorphism Problem and Applications.

[BibT_eX]

[DOI]

Víctor Dalmau

Proceedings of the 18th International Conference on Database Theory, 2015

PPDL: Probabilistic Programming with Datalog.

[BibT_eX]

[DOI]

Benny Kimelfeld

Dan Olteanu

Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014

Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2014

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

[BibT_eX]

[DOI]

Carsten Lutz

Dagstuhl Reports, 2014

Declarative Statistical Modeling with Datalog.

[BibT_eX]

[DOI]

CoRR, 2014

Generating low-cost plans from proofs.

[BibT_eX]

[DOI]

Efthymia Tsamoura

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

Schema Mappings: A Case of Logical Dynamics in Database Theory.

[BibT_eX]

[DOI]

Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013

Learning schema mappings.

[BibT_eX]

[DOI]

Víctor Dalmau

ACM Trans. Database Syst., 2013

On the equivalence of distributed systems with queries and communication.

[BibT_eX]

[DOI]

Serge Abiteboul

Yannis Katsis

J. Comput. Syst. Sci., 2013

Beth Definability in Expressive Description Logics.

[BibT_eX]

[DOI]

Enrico Franconi

Inanç Seylan

J. Artif. Intell. Res., 2013

On Core XPath with Inflationary Fixed Points.

[BibT_eX]

[DOI]

Loredana Afanasiev

RAIRO Theor. Informatics Appl., 2013

Unary negation.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Rewriting Guarded Negation Queries.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Schema mappings and data examples.

[BibT_eX]

[DOI]

Wang Chiew Tan

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Data exchange with arithmetic operations.

[BibT_eX]

[DOI]

Walied Othman

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Queries with Guarded Negation.

[BibT_eX]

[DOI]

Martin Otto

Proc. VLDB Endow., 2012

A note on the product homomorphism problem and CQ-definability

[BibT_eX]

[DOI]

Víctor Dalmau

CoRR, 2012

Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees

[BibT_eX]

[DOI]

Amélie Gheerbrant

Log. Methods Comput. Sci., 2012

Queries with Guarded Negation (full version)

[BibT_eX]

[DOI]

Martin Otto

CoRR, 2012

Guarded Negation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 9, 2012

2011

Characterizing schema mappings via data examples.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2011

EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2011

Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Designing and refining schema mappings via data examples.

[BibT_eX]

[DOI]

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

Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs.

[BibT_eX]

[DOI]

Alessandro Facchini

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Complete axiomatizations for XPath fragments.

[BibT_eX]

[DOI]

Tadeusz Litak

J. Appl. Log., 2010

Some modal aspects of XPath.

[BibT_eX]

[DOI]

Tadeusz Litak

J. Appl. Non Class. Logics, 2010

Transitive closure logic, nested tree walking automata, and XPath.

[BibT_eX]

[DOI]

J. ACM, 2010

Structural characterizations of schema-mapping languages.

[BibT_eX]

[DOI]

Commun. ACM, 2010

An Easy Completeness Proof for the Modal <i>µ</i>-Calculus on Finite Trees.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2010

Database Constraints and Homomorphism Dualities.

[BibT_eX]

[DOI]

Wang Chiew Tan

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

Laconic Schema Mappings: Computing the Core with SQL Queries.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

Axiomatizing the Logical Core of XPath 2.0.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

The complexity of query containment in expressive fragments of XPath 2.0.

[BibT_eX]

[DOI]

Carsten Lutz

J. ACM, 2009

A note on the expressibility problem for modal logics and star-free regular expressions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Lindström theorems for fragments of first-order logic

[BibT_eX]

[DOI]

Johan van Benthem

Jouko A. Väänänen

Log. Methods Comput. Sci., 2009

Laconic schema mappings: computing core universal solutions by means of SQL queries

[BibT_eX]

[DOI]

CoRR, 2009

Modal languages for topology: Expressivity and definability.

[BibT_eX]

[DOI]

David Gabelaia

Dmitry Sustretov

Ann. Pure Appl. Log., 2009

Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees.

[BibT_eX]

[DOI]

Amélie Gheerbrant

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Craig Interpolation for Linear Temporal Languages.

[BibT_eX]

[DOI]

Amélie Gheerbrant

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

XPath, transitive closure logic, and nested tree walking automata.

[BibT_eX]

[DOI]

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

2007

Navigational XPath: calculus and algebra.

[BibT_eX]

[DOI]

SIGMOD Rec., 2007

Hybrid logics.

[BibT_eX]

[DOI]

Carlos Areces

Proceedings of the Handbook of Modal Logic., 2007

2006

Pure Extensions, Proof Rules, and Hybrid Axiomatics.

[BibT_eX]

[DOI]

Patrick Blackburn

Stud Logica, 2006

Multimo dal Logics of Products of Topologies.

[BibT_eX]

[DOI]

Stud Logica, 2006

Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators.

[BibT_eX]

[DOI]

Nick Bezhanishvili

J. Log. Comput., 2006

Expressivity of Second Order Propositional Modal Logic.

[BibT_eX]

[DOI]

J. Philos. Log., 2006

Topological Perspective on the Hybrid Proof Rules.

[BibT_eX]

[DOI]

Tadeusz Litak

Proceedings of the International Workshop on Hybrid Logic, 2006

The expressivity of XPath with transitive closure.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Definitorially Complete Description Logics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Interpolation for extended modal languages.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

Guarded Fragments with Constants.

[BibT_eX]

[DOI]

Massimo Franceschet

J. Log. Lang. Inf., 2005

Hybrid logics with Sahlqvist axioms.

[BibT_eX]

[DOI]

Jorge Petrucio Viana

Log. J. IGPL, 2005

On the Complexity of Hybrid Logics with Binders.

[BibT_eX]

[DOI]

Massimo Franceschet

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

2002

The partition semantics of questions, syntactically

[BibT_eX]

[DOI]

Chung-chieh Shan

CoRR, 2002

Question Answering: From Partitions to Prolog.

[BibT_eX]

[DOI]

Chung-chieh Shan

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

On the Logic of d-separation.

[BibT_eX]

Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001

The dynamics of information exchange dialogues.

[BibT_eX]

[DOI]