Pierre Bourhis

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 74

Top Venues

CoRR

IJCAI

ICDT

ACM Trans. Database Syst.

University of Paris-Sud, Orsay, France (PHD)

Education History

University of Paris-Sud, Orsay, France

PHD

Publications

Pablo Barceló, Pierre Bourhis, Stefan Mengel, Sudeepa Roy
Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). Dagstuhl Reports 14 (1) (2024)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT (2024)
Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches. CoRR (2023)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR (2023)
Pierre Bourhis, Aaron Boussidan, Philippe Gambette
On Distances Between Words with Parameters. CPM (2023)
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michaël Thomazo
Revisiting Semiring Provenance for Datalog. CoRR (2022)
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michaël Thomazo
Revisiting Semiring Provenance for Datalog. KR (2022)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2022)
Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits. CoRR (2022)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing Expressiveness and Inexpressiveness in View Design. ACM Trans. Database Syst. 46 (4) (2021)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46 (1) (2021)
Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros
Ranked Enumeration of MSO Logic on Words. ICDT (2021)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom
Inference from Visible Information and Background Knowledge. ACM Trans. Comput. Log. 22 (2) (2021)
Pierre Bourhis, Loïc Hélouët, Zoltán Miklós, Rituraj Singh
Data Centric Workflows for Crowdsourcing. Petri Nets (2020)
Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries. CoRR (2020)
Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries. SIGMOD Conference (2020)
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
Making AI Machines Work for Humans in FoW. SIGMOD Rec. 49 (2) (2020)
Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart
Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Trans. Comput. Log. 21 (1) (2020)
Pierre Bourhis, Carsten Lutz
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. CoRR (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49 (1) (2020)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2020)
Pierre Bourhis, Juan L. Reutter, Domagoj Vrgoc
JSON: Data model and query languages. Inf. Syst. 89 (2020)
Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros
Ranked enumeration of MSO logic on words. CoRR (2020)
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
Oblivious and Semi-Oblivious Boundedness for Existential Rules. CoRR (2020)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing expressiveness and inexpressiveness in view design. CoRR (2020)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura
Balancing Expressiveness and Inexpressiveness in View Design. KR (2020)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. 63 (7) (2019)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15 (3) (2019)
Meghyn Bienvenu, Pierre Bourhis
Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. IJCAI (2019)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. IJCAI (2019)
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI (2019)
Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
Reasoning about disclosure in data integration in the presence of source constraints. CoRR (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT (2019)
Pierre Bourhis, Gianluca Demartini, Shady Elbassuoni, Emilie Hoareau, H. Raghav Rao
Ethical Challenges in the Future of Work. IEEE Data Eng. Bull. 42 (4) (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS (2019)
Meghyn Bienvenu, Pierre Bourhis
Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract). Description Logics (2019)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR (2018)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
Explanations and Transparency in Collaborative Workflows. PODS (2018)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63 (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR (2018)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. ICDT (2018)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. CoRR (2018)
Pierre Bourhis, Juan L. Reutter, Fernando Suárez, Domagoj Vrgoc
JSON: Data model, Query languages and Schema specification. PODS (2017)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. CoRR (2017)
Pierre Bourhis, Juan L. Reutter, Fernando Suárez, Domagoj Vrgoc
JSON: data model, query languages and schema specification. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
Enumeration on Trees under Relabelings. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. CoRR (2017)
Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
POLYTICS: Provenance-Based Analytics of Data-Centric Applications. ICDE (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. ICALP (2017)
Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel
A Circuit-Based Approach to Efficient Enumeration. ICALP (2017)
Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana
Ontology-Mediated Query Answering for Key-Value Stores. IJCAI (2017)
Pierre Bourhis, Michael Morak, Andreas Pieris
Making Cross Products and Guarded Ontology Languages Compatible. IJCAI (2017)
Pierre Bourhis, Daniel Deutch, Yuval Moskovitch
Analyzing data-centric applications: Why, what-if, and how-to. ICDE (2016)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
A Formal Study of Collaborative Access Control in Distributed Datalog. ICDT (2016)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Tractable Lineages on Treelike Instances: Limits and Extensions. CoRR (2016)
Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo
PROX: Approximated Summarization of Data Provenance. EDBT (2016)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR (2016)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. IJCAI (2016)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
Querying Visible and Invisible Information. LICS (2016)
Pierre Bourhis, Carsten Lutz
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. KR (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2016)
Pierre Bourhis, Gabriele Puppis, Cristian Riveros, Slawek Staworko
Bounded Repairability for Regular Tree Languages. ACM Trans. Database Syst. 41 (3) (2016)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Tractable Lineages on Treelike Instances: Limits and Extensions. PODS (2016)
Pierre Bourhis, Marco Manna, Michael Morak, Andreas Pieris
Guarded-Based Disjunctive Tuple-Generating Dependencies. ACM Trans. Database Syst. 41 (4) (2016)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
Highly Expressive Query Languages for Unordered Data Trees. Theory Comput. Syst. 57 (4) (2015)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Provenance Circuits for Trees and Treelike Instances (Extended Version). CoRR (2015)
Michael Benedikt, Pierre Bourhis, Clemens Ley
Analysis of Schemas with Access Restrictions. ACM Trans. Database Syst. 40 (1) (2015)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Provenance Circuits for Trees and Treelike Instances. ICALP (2) (2015)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis
Querying Visible and Invisible Tables in the Presence of Integrity Constraints. CoRR (2015)
Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo
Approximated Summarization of Data Provenance. CIKM (2015)
Pierre Bourhis, Gabriele Puppis, Cristian Riveros
Which XML Schemas are Streaming Bounded Repairable? Theory Comput. Syst. 57 (4) (2015)
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention). IJCAI (2015)
Pierre Bourhis, Michael Morak, Andreas Pieris
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules. MFCS (1) (2014)
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
How to Best Nest Regular Path Queries. Description Logics (2014)
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
Query Containment for Highly Expressive Datalog Fragments. CoRR (2014)
Pierre Bourhis, Michael Morak, Andreas Pieris
Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs. Description Logics (2014)
Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu
Recursive queries on trees and data trees. ICDT (2013)
Pierre Bourhis, Michael Morak, Andreas Pieris
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. IJCAI (2013)
Pierre Bourhis, Gabriele Puppis, Cristian Riveros
Which DTDs are streaming bounded repairable? ICDT (2013)
Vince Bárány, Michael Benedikt, Pierre Bourhis
Access patterns and integrity constraints revisited. ICDT (2013)
Pierre Bourhis, Michael Morak, Andreas Pieris
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. Description Logics (2013)
Michael Benedikt, Pierre Bourhis, Pierre Senellart
Monadic Datalog Containment. ICALP (2) (2012)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
Comparing workflow specification languages: A matter of views. ACM Trans. Database Syst. 37 (2) (2012)
Michael Benedikt, Pierre Bourhis, Clemens Ley
Querying Schemas With Access Restrictions CoRR (2012)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
Highly expressive query languages for unordered data trees. ICDT (2012)
Michael Benedikt, Pierre Bourhis, Clemens Ley
Querying Schemas With Access Restrictions. Proc. VLDB Endow. 5 (7) (2012)
Serge Abiteboul, Pierre Bourhis, Victor Vianu
Comparing workflow specification languages: a matter of views. ICDT (2011)
Bogdan Marinoiu, Serge Abiteboul, Pierre Bourhis, Alban Galland
AXART - Enabling Collaborative Work with AXML Artifacts. Proc. VLDB Endow. 3 (2) (2010)
Serge Abiteboul, Pierre Bourhis, Alban Galland, Bogdan Marinoiu
The AXML Artifact Model. TIME (2009)
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Efficient maintenance techniques for views over active documents. EDBT (2009)
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Satisfiability and relevance for queries over active documents. PODS (2009)
Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis
Distributed Monitoring of Peer-to-Peer Systems. ICDE (2008)
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Incremental View Maintenance for Active Documents. BDA (2007)

Pierre Bourhis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Bourhis