Pierre Bourhis

According to our database, Pierre Bourhis authored at least 70 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032).

Pablo Barceló, Pierre Bourhis, Stefan Mengel, Sudeepa Roy

Dagstuhl Reports, 2024

Dynamic direct access of MSO query evaluation over strings.

Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros

CoRR, 2024

Ranked Enumeration for MSO on Trees via Knowledge Compilation.

Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet

Proceedings of the 27th International Conference on Database Theory, 2024

2023

Reasoning on Feature Models: Compilation-Based vs. Direct Approaches.

Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton

CoRR, 2023

On Distances Between Words with Parameters.

Pierre Bourhis, Aaron Boussidan, Philippe Gambette

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits.

Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton

CoRR, 2022

Revisiting Semiring Provenance for Datalog.

Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michaël Thomazo

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

2021

Balancing Expressiveness and Inexpressiveness in View Design.

Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura

ACM Trans. Database Syst., 2021

Inference from Visible Information and Background Knowledge.

Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom

ACM Trans. Comput. Log., 2021

Ranked Enumeration of MSO Logic on Words.

Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros

Proceedings of the 24th International Conference on Database Theory, 2021

2020

Monadic Datalog, Tree Validity, and Limited Access Containment.

Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart

ACM Trans. Comput. Log., 2020

Making AI Machines Work for Humans in FoW.

Sihem Amer-Yahia, Senjuti Basu Roy, Lei Chen, Atsuyuki Morishima, James Abello Monedero, Pierre Bourhis, François Charoy, Marina Danilevsky, Gautam Das, Gianluca Demartini, Shady Elbassuoni, David Gross-Amblard, Emilie Hoareau, Munenari Inoguchi, Jared B. Kenworthy, Itaru Kitahara, Dongwon Lee, Yunyao Li, Ria Mae Borromeo, Paolo Papotti, H. Raghav Rao, Sudeepa Roy, Pierre Senellart, Keishi Tajima, Saravanan Thirumuruganathan, Marion Tommasi, Kazutoshi Umemoto, Andrea Wiggins, Koichiro Yoshida

SIGMOD Rec., 2020

Constant-Delay Enumeration for Nondeterministic Document Spanners.

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth

SIGMOD Rec., 2020

JSON: Data model and query languages.

Pierre Bourhis, Juan L. Reutter, Domagoj Vrgoc

Inf. Syst., 2020

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries.

Pierre Bourhis, Daniel Deutch, Yuval Moskovitch

Proceedings of the 2020 International Conference on Management of Data, 2020

Data Centric Workflows for Crowdsourcing.

Pierre Bourhis, Loïc Hélouët, Zoltán Miklós, Rituraj Singh

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019

Evaluating Datalog via Tree Automata and Cycluits.

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

Theory Comput. Syst., 2019

Definability and Interpolation within Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

Log. Methods Comput. Sci., 2019

Ethical Challenges in the Future of Work.

Pierre Bourhis, Gianluca Demartini, Shady Elbassuoni, Emilie Hoareau, H. Raghav Rao

IEEE Data Eng. Bull., 2019

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Oblivious and Semi-Oblivious Boundedness for Existential Rules.

Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois

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

Mixed-World Reasoning with Existential Rules under Active-Domain Semantics.

Meghyn Bienvenu, Pierre Bourhis

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

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

Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo

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

Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract).

Meghyn Bienvenu, Pierre Bourhis

Proceedings of the 32nd International Workshop on Description Logics, 2019

2018

Query Answering with Transitive and Linear-Ordered Data.

Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

J. Artif. Intell. Res., 2018

Explanations and Transparency in Collaborative Workflows.

Serge Abiteboul, Pierre Bourhis, Victor Vianu

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

Enumeration on Trees under Relabelings.

Antoine Amarilli, Pierre Bourhis, Stefan Mengel

Proceedings of the 21st International Conference on Database Theory, 2018

2017

JSON: Data model, Query languages and Schema specification.

Pierre Bourhis, Juan L. Reutter, Fernando Suárez, Domagoj Vrgoc

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

Making Cross Products and Guarded Ontology Languages Compatible.

Pierre Bourhis, Michael Morak, Andreas Pieris

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

Ontology-Mediated Query Answering for Key-Value Stores.

Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana

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

Combined Tractability of Query Evaluation via Tree Automata and Cycluits.

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

Proceedings of the 20th International Conference on Database Theory, 2017

POLYTICS: Provenance-Based Analytics of Data-Centric Applications.

Pierre Bourhis, Daniel Deutch, Yuval Moskovitch

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Characterizing Definability in Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

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

A Circuit-Based Approach to Efficient Enumeration.

Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel

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

2016

Bounded Repairability for Regular Tree Languages.

Pierre Bourhis, Gabriele Puppis, Cristian Riveros, Slawek Staworko

ACM Trans. Database Syst., 2016

Guarded-Based Disjunctive Tuple-Generating Dependencies.

Pierre Bourhis, Marco Manna, Michael Morak, Andreas Pieris

ACM Trans. Database Syst., 2016

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version).

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

CoRR, 2016

Tractable Lineages on Treelike Instances: Limits and Extensions.

Antoine Amarilli, Pierre Bourhis, Pierre Senellart

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

Querying Visible and Invisible Information.

Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis

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

A Step Up in Expressiveness of Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

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

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.

Pierre Bourhis, Carsten Lutz

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

A Formal Study of Collaborative Access Control in Distributed Datalog.

Serge Abiteboul, Pierre Bourhis, Victor Vianu

Proceedings of the 19th International Conference on Database Theory, 2016

Analyzing data-centric applications: Why, what-if, and how-to.

Pierre Bourhis, Daniel Deutch, Yuval Moskovitch

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

PROX: Approximated Summarization of Data Provenance.

Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo

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

2015

Analysis of Schemas with Access Restrictions.

Michael Benedikt, Pierre Bourhis, Clemens Ley

ACM Trans. Database Syst., 2015

Which XML Schemas are Streaming Bounded Repairable?

Pierre Bourhis, Gabriele Puppis, Cristian Riveros

Theory Comput. Syst., 2015

Highly Expressive Query Languages for Unordered Data Trees.

Serge Abiteboul, Pierre Bourhis, Victor Vianu

Theory Comput. Syst., 2015

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

Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis

CoRR, 2015

Provenance Circuits for Trees and Treelike Instances (Extended Version).

Antoine Amarilli, Pierre Bourhis, Pierre Senellart

CoRR, 2015

Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention).

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph

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

Provenance Circuits for Trees and Treelike Instances.

Antoine Amarilli, Pierre Bourhis, Pierre Senellart

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Approximated Summarization of Data Provenance.

Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Query Containment for Highly Expressive Datalog Fragments.

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph

CoRR, 2014

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules.

Pierre Bourhis, Michael Morak, Andreas Pieris

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs.

Pierre Bourhis, Michael Morak, Andreas Pieris

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

How to Best Nest Regular Path Queries.

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

2013

The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules.

Pierre Bourhis, Michael Morak, Andreas Pieris

Proceedings of the IJCAI 2013, 2013

Which DTDs are streaming bounded repairable?

Pierre Bourhis, Gabriele Puppis, Cristian Riveros

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Access patterns and integrity constraints revisited.

Vince Bárány, Michael Benedikt, Pierre Bourhis

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Recursive queries on trees and data trees.

Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Comparing workflow specification languages: A matter of views.

Serge Abiteboul, Pierre Bourhis, Victor Vianu

ACM Trans. Database Syst., 2012

Querying Schemas With Access Restrictions.

Michael Benedikt, Pierre Bourhis, Clemens Ley

Proc. VLDB Endow., 2012

Monadic Datalog Containment.

Michael Benedikt, Pierre Bourhis, Pierre Senellart

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

2011

On the dynamics of active documents for distributed data management. (Etude de la dynamique des documents actifs pour la gestion d'information distribuées).

Pierre Bourhis

PhD thesis, 2011

2010

AXART - Enabling Collaborative Work with AXML Artifacts.

Bogdan Marinoiu, Serge Abiteboul, Pierre Bourhis, Alban Galland

Proc. VLDB Endow., 2010

2009

The AXML Artifact Model.

Serge Abiteboul, Pierre Bourhis, Alban Galland, Bogdan Marinoiu

Proceedings of the TIME 2009, 2009

Satisfiability and relevance for queries over active documents.

Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Efficient maintenance techniques for views over active documents.

Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu

Proceedings of the EDBT 2009, 2009

2008

Distributed Monitoring of Peer-to-Peer Systems.

Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

Incremental View Maintenance for Active Documents.

Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu

Proceedings of the 23èmes Journées Bases de Données Avancées, 2007