Skip to content

Pierre Bourhis

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

46

Venues

14

Active years

2008–2026

Best venue rank

A*

Where they publish

Papers

46 indexed papers, newest first.

YearVenueTitleAuthors
2026ICDTA Formal Query Language and Automata Model for Aggregation in Complex Event Recognition.Pierre Bourhis, Cristian Riveros, Amaranta Salas
2025IC2EDEMO: REST-Q - A Framework to Assess Energy Consumption in Web Applications.Ostap Kilbasovych, Belkis Djeffal, Pierre Bourhis, Romain Rouvoy
2025ICDTDynamic Direct Access of MSO Query Evaluation over Strings.Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros
2024ICDTRanked Enumeration for MSO on Trees via Knowledge Compilation.Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikal Monet
2023CPMOn Distances Between Words with Parameters.Pierre Bourhis, Aaron Boussidan, Philippe Gambette
2022KRRevisiting Semiring Provenance for Datalog.Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michal Thomazo
2021ICDTRanked Enumeration of MSO Logic on Words.Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros
2020KRBalancing Expressiveness and Inexpressiveness in View Design.Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
2020SIGMODEquivalence-Invariant Algebraic Provenance for Hyperplane Update Queries.Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
2019ICDTConstant-Delay Enumeration for Nondeterministic Document Spanners.Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2019IJCAIReasoning about Disclosure in Data Integration in the Presence of Source Constraints.Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michal Thomazo
2019IJCAIMixed-World Reasoning with Existential Rules under Active-Domain Semantics.Meghyn Bienvenu, Pierre Bourhis
2019IJCAIOblivious and Semi-Oblivious Boundedness for Existential Rules.Pierre Bourhis, Michel Leclre, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
2019PODSEnumeration on Trees with Tractable Combined Complexity and Efficient Updates.Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018ICDTEnumeration on Trees under Relabelings.Antoine Amarilli, Pierre Bourhis, Stefan Mengel
2018PODSExplanations and Transparency in Collaborative Workflows.Serge Abiteboul, Pierre Bourhis, Victor Vianu
2017ICALPA Circuit-Based Approach to Efficient Enumeration.Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
2017ICALPCharacterizing Definability in Decidable Fixpoint Logics.Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2017ICDEPOLYTICS: Provenance-Based Analytics of Data-Centric Applications.Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
2017ICDTCombined Tractability of Query Evaluation via Tree Automata and Cycluits.Antoine Amarilli, Pierre Bourhis, Mikal Monet, Pierre Senellart
2017IJCAIOntology-Mediated Query Answering for Key-Value Stores.Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana
2017IJCAIMaking Cross Products and Guarded Ontology Languages Compatible.Pierre Bourhis, Michael Morak, Andreas Pieris
2017PODSJSON: Data model, Query languages and Schema specification.Pierre Bourhis, Juan L. Reutter, Fernando Surez, Domagoj Vrgoc
2016EDBTPROX: Approximated Summarization of Data Provenance.Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo
2016ICDEAnalyzing data-centric applications: Why, what-if, and how-to.Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
2016ICDTA Formal Study of Collaborative Access Control in Distributed Datalog.Serge Abiteboul, Pierre Bourhis, Victor Vianu
2016IJCAIQuery Answering with Transitive and Linear-Ordered Data.Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016KRContainment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.Pierre Bourhis, Carsten Lutz
2016LICSA Step Up in Expressiveness of Decidable Fixpoint Logics.Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016LICSQuerying Visible and Invisible Information.Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
2016PODSTractable Lineages on Treelike Instances: Limits and Extensions.Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2015CIKMApproximated Summarization of Data Provenance.Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo
2015ICALPProvenance Circuits for Trees and Treelike Instances.Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2015IJCAIReasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention).Pierre Bourhis, Markus Krtzsch, Sebastian Rudolph
2014MFCSTowards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules.Pierre Bourhis, Michael Morak, Andreas Pieris
2013ICDTRecursive queries on trees and data trees.Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu
2013ICDTAccess patterns and integrity constraints revisited.Vince Brny, Michael Benedikt, Pierre Bourhis
2013ICDTWhich DTDs are streaming bounded repairable?Pierre Bourhis, Gabriele Puppis, Cristian Riveros
2013IJCAIThe Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules.Pierre Bourhis, Michael Morak, Andreas Pieris
2012ICALPMonadic Datalog Containment.Michael Benedikt, Pierre Bourhis, Pierre Senellart
2012ICDTHighly expressive query languages for unordered data trees.Serge Abiteboul, Pierre Bourhis, Victor Vianu
2011ICDTComparing workflow specification languages: a matter of views.Serge Abiteboul, Pierre Bourhis, Victor Vianu
2009EDBTEfficient maintenance techniques for views over active documents.Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
2009PODSSatisfiability and relevance for queries over active documents.Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
2009TIMEThe AXML Artifact Model.Serge Abiteboul, Pierre Bourhis, Alban Galland, Bogdan Marinoiu
2008ICDEDistributed Monitoring of Peer-to-Peer Systems.Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis