Incremental View Maintenance for Active Documents. - Serge Abiteboul; Pierre Bourhis; Bogdan Marinoiu (BDA, 2007)

Distributed Monitoring of Peer-to-Peer Systems. - Serge Abiteboul; Bogdan Marinoiu; Pierre Bourhis (ICDE, 2008)

Efficient maintenance techniques for views over active documents. - Serge Abiteboul; Pierre Bourhis; Bogdan Marinoiu (EDBT, 2009)

Satisfiability and relevance for queries over active documents. - Serge Abiteboul; Pierre Bourhis; Bogdan Marinoiu (PODS, 2009)

The AXML Artifact Model. - Serge Abiteboul; Pierre Bourhis; Alban Galland; Bogdan Marinoiu (TIME, 2009)

AXART - Enabling Collaborative Work with AXML Artifacts. - Bogdan Marinoiu; Serge Abiteboul; Pierre Bourhis; Alban Galland (Proc. VLDB Endow., 2010)

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 (2011)

Monadic Datalog Containment. - Michael Benedikt; Pierre Bourhis; Pierre Senellart (ICALP (2), 2012)

Querying Schemas With Access Restrictions. - Michael Benedikt; Pierre Bourhis; Clemens Ley (Proc. VLDB Endow., 2012)

Comparing workflow specification languages: A matter of views. - Serge Abiteboul; Pierre Bourhis; Victor Vianu (ACM Trans. Database Syst., 2012)

Recursive queries on trees and data trees. - Serge Abiteboul; Pierre Bourhis; Anca Muscholl; Zhilin Wu (ICDT, 2013)

Access patterns and integrity constraints revisited. - Vince Bárány; Michael Benedikt; Pierre Bourhis (ICDT, 2013)

Which DTDs are streaming bounded repairable? - Pierre Bourhis; Gabriele Puppis; Cristian Riveros (ICDT, 2013)

The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. - Pierre Bourhis; Michael Morak; Andreas Pieris (IJCAI, 2013)

How to Best Nest Regular Path Queries. - Pierre Bourhis; Markus Krötzsch; Sebastian Rudolph (Description Logics, 2014)

Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs. - Pierre Bourhis; Michael Morak; Andreas Pieris (Description Logics, 2014)

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules. - Pierre Bourhis; Michael Morak; Andreas Pieris (MFCS (1), 2014)

Query Containment for Highly Expressive Datalog Fragments. - Pierre Bourhis; Markus Krötzsch; Sebastian Rudolph (CoRR, 2014)

Approximated Summarization of Data Provenance. - Eleanor Ainy; Pierre Bourhis; Susan B. Davidson; Daniel Deutch; Tova Milo (CIKM, 2015)

Provenance Circuits for Trees and Treelike Instances. - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (ICALP (2), 2015)

Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention). - Pierre Bourhis; Markus Krötzsch; Sebastian Rudolph (IJCAI, 2015)

Provenance Circuits for Trees and Treelike Instances (Extended Version). - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (CoRR, 2015)

Querying Visible and Invisible Tables in the Presence of Integrity Constraints. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis (CoRR, 2015)

Highly Expressive Query Languages for Unordered Data Trees. - Serge Abiteboul; Pierre Bourhis; Victor Vianu (Theory Comput. Syst., 2015)

Which XML Schemas are Streaming Bounded Repairable? - Pierre Bourhis; Gabriele Puppis; Cristian Riveros (Theory Comput. Syst., 2015)

Analysis of Schemas with Access Restrictions. - Michael Benedikt; Pierre Bourhis; Clemens Ley (ACM Trans. Database Syst., 2015)

PROX: Approximated Summarization of Data Provenance. - Eleanor Ainy; Pierre Bourhis; Susan B. Davidson; Daniel Deutch; Tova Milo (EDBT, 2016)

Analyzing data-centric applications: Why, what-if, and how-to. - Pierre Bourhis; Daniel Deutch; Yuval Moskovitch (ICDE, 2016)

A Formal Study of Collaborative Access Control in Distributed Datalog. - Serge Abiteboul; Pierre Bourhis; Victor Vianu (ICDT, 2016)

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. - Pierre Bourhis; Carsten Lutz (KR, 2016)

A Step Up in Expressiveness of Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (LICS, 2016)

Querying Visible and Invisible Information. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis (LICS, 2016)

Tractable Lineages on Treelike Instances: Limits and Extensions. - Antoine Amarilli; Pierre Bourhis; Pierre Senellart (PODS, 2016)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (CoRR, 2016)

Guarded-Based Disjunctive Tuple-Generating Dependencies. - Pierre Bourhis; Marco Manna; Michael Morak; Andreas Pieris (ACM Trans. Database Syst., 2016)

Bounded Repairability for Regular Tree Languages. - Pierre Bourhis; Gabriele Puppis; Cristian Riveros; Slawek Staworko (ACM Trans. Database Syst., 2016)

A Circuit-Based Approach to Efficient Enumeration. - Antoine Amarilli; Pierre Bourhis; Louis Jachiet; Stefan Mengel (ICALP, 2017)

Characterizing Definability in Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (ICALP, 2017)

POLYTICS: Provenance-Based Analytics of Data-Centric Applications. - Pierre Bourhis; Daniel Deutch; Yuval Moskovitch (ICDE, 2017)

Combined Tractability of Query Evaluation via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (ICDT, 2017)

Ontology-Mediated Query Answering for Key-Value Stores. - Meghyn Bienvenu; Pierre Bourhis; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana (IJCAI, 2017)

Making Cross Products and Guarded Ontology Languages Compatible. - Pierre Bourhis; Michael Morak; Andreas Pieris (IJCAI, 2017)

JSON: Data model, Query languages and Schema specification. - Pierre Bourhis; Juan L. Reutter; Fernando Suárez; Domagoj Vrgoc (PODS, 2017)

Enumeration on Trees under Relabelings. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel (ICDT, 2018)

Explanations and Transparency in Collaborative Workflows. - Serge Abiteboul; Pierre Bourhis; Victor Vianu (PODS, 2018)

Query Answering with Transitive and Linear-Ordered Data. - Antoine Amarilli; Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (J. Artif. Intell. Res., 2018)

Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract). - Meghyn Bienvenu; Pierre Bourhis (Description Logics, 2019)

Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. - Michael Benedikt; Pierre Bourhis; Louis Jachiet; Michaël Thomazo (IJCAI, 2019)

Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. - Meghyn Bienvenu; Pierre Bourhis (IJCAI, 2019)

Oblivious and Semi-Oblivious Boundedness for Existential Rules. - Pierre Bourhis; Michel Leclère; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana; Lily Gallois (IJCAI, 2019)

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (PODS, 2019)

Ethical Challenges in the Future of Work. - Pierre Bourhis; Gianluca Demartini; Shady Elbassuoni; Emilie Hoareau; H. Raghav Rao (IEEE Data Eng. Bull., 2019)

Definability and Interpolation within Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (Log. Methods Comput. Sci., 2019)

Evaluating Datalog via Tree Automata and Cycluits. - Antoine Amarilli; Pierre Bourhis; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2019)

Data Centric Workflows for Crowdsourcing. - Pierre Bourhis; Loïc Hélouët; Zoltán Miklós 001; Rituraj Singh (Petri Nets, 2020)

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries. - Pierre Bourhis; Daniel Deutch; Yuval Moskovitch (SIGMOD Conference, 2020)

JSON: Data model and query languages. - Pierre Bourhis; Juan L. Reutter; Domagoj Vrgoc (Inf. Syst., 2020)

Constant-Delay Enumeration for Nondeterministic Document Spanners. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (SIGMOD Rec., 2020)

Making AI Machines Work for Humans in FoW. - Sihem Amer-Yahia; Senjuti Basu Roy; Lei Chen 002; Atsuyuki Morishima; James Abello Monedero; Pierre Bourhis; François Charoy; Marina Danilevsky; Gautam Das 001; Gianluca Demartini; Shady Elbassuoni; David Gross-Amblard; et al. (SIGMOD Rec., 2020)

Monadic Datalog, Tree Validity, and Limited Access Containment. - Michael Benedikt; Pierre Bourhis; Georg Gottlob; Pierre Senellart (ACM Trans. Comput. Log., 2020)

Ranked Enumeration of MSO Logic on Words. - Pierre Bourhis; Alejandro Grez; Louis Jachiet; Cristian Riveros (ICDT, 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)

Balancing Expressiveness and Inexpressiveness in View Design. - Michael Benedikt; Pierre Bourhis; Louis Jachiet; Efthymia Tsamoura (ACM Trans. Database Syst., 2021)

Revisiting Semiring Provenance for Datalog. - Camille Bourgaux; Pierre Bourhis; Liat Peterfreund; Michaël Thomazo (KR, 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)

On Distances Between Words with Parameters. - Pierre Bourhis; Aaron Boussidan; Philippe Gambette (CPM, 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)

Dialog Between Logic, Trees and Circuits. (Dialogue entre Logique, Arbres et Circuits). - Pierre Bourhis (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation. - Antoine Amarilli; Pierre Bourhis; Florent Capelli; Mikaël Monet (ICDT, 2024)

Challenges & Opportunities in Automating DBMS: A Qualitative Study. - Yifan Wang; Pierre Bourhis; Romain Rouvoy; Patrick Royer (ASE, 2024)

Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). - Pablo Barceló; Pierre Bourhis; Stefan Mengel; Sudeepa Roy 001 (Dagstuhl Reports, 2024)

Dynamic Direct Access of MSO Query Evaluation over Strings. - Pierre Bourhis; Florent Capelli; Stefan Mengel; Cristian Riveros (ICDT, 2025)