Pierre Bourhis

Chargé de recherche epst - Informatique
    +33 3 5935 8731
Batiment B INRIA Parc scientifique de la Haute Borne
pierre_bourhis.png

Pierre Bourhis

Chargé de recherche epst - Informatique

Publications

Article dans des revues

  • Senjuti Basu Roy, Lei Chen, Atsuyuki Morishima, James Monedero, Pierre Bourhis, et al.. Making AI Machines Work for Humans in FoW. SIGMOD record, ACM, 2020, 49 (2), pp.30-35. ⟨10.1145/3442322.3442327⟩. ⟨hal-03103700v2⟩
  • Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD record, ACM, 2020, 49 (1), pp.25-32. ⟨10.1145/3422648.3422655⟩. ⟨hal-03046848⟩
  • Pierre Bourhis, Juan Reutter, Domagoj Vrgoč. JSON: Data model and query languages. Information Systems, Elsevier, 2020, 89, ⟨10.1016/j.is.2019.101478⟩. ⟨hal-03094643⟩
  • Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart. Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (1), pp.6:1-6:45. ⟨10.1145/3344514⟩. ⟨hal-02307999⟩
  • Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Definability and Interpolation within Decidable Fixpoint Logics. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (3), ⟨10.23638/LMCS-15(3:29)2019⟩. ⟨hal-02392433⟩
  • Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Evaluating Datalog via Tree Automata and Cycluits. Theory of Computing Systems, Springer Verlag, 2019, 63 (7), pp.1620-1678. ⟨10.1007/s00224-018-9901-2⟩. ⟨hal-01891811⟩
  • Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Query Answering with Transitive and Linear-Ordered Data. Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2018, 63, pp.191-264. ⟨10.1613/jair.1.11240⟩. ⟨hal-02338348⟩
  • Pierre Bourhis, Cristian Riveros, Slawomir Staworko, Gabriele Puppis. Bounded Repairability for Regular Tree Languages. ACM Transactions on Database Systems, Association for Computing Machinery, 2016, 41 (3), pp.1-45. ⟨10.1145/2898995⟩. ⟨hal-01411116⟩
  • Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Which XML Schemas are Streaming Bounded Repairable?. Theory of Computing Systems, Springer Verlag, 2015, ⟨10.1007/s00224-015-9611-y⟩. ⟨hal-01211290⟩
  • Michael Benedikt, Pierre Bourhis, Clemens Ley. Analysis of Schemas with Access Restrictions. ACM Transactions on Database Systems, Association for Computing Machinery, 2015, 40 (1), pp.Article No. 5. ⟨10.1145/2699500⟩. ⟨hal-01211288⟩
  • Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees. Theory of Computing Systems, Springer Verlag, 2015, 57, pp.927-966. ⟨10.1007/s00224-015-9617-5⟩. ⟨hal-01167068⟩
  • Serge Abiteboul, Pierre Bourhis, Victor Vianu. Comparing workflow specification languages: A matter of views. ACM Transactions on Database Systems, Association for Computing Machinery, 2012, 37 (10), ⟨10.1145/2188349.2188352⟩. ⟨hal-00766210⟩

Communication dans un congrès

  • Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura. Balancing expressiveness and inexpressiveness in view design. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Sep 2020, Rhodes, Greece. pp.109--118, ⟨10.24963/kr.2020/12⟩. ⟨hal-02964692⟩
  • Pierre Bourhis, Loïc Hélouët, Zoltan Miklos, Rituraj Singh. Data Centric Workflows for Crowdsourcing. Petri Nets 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2020, Paris, France. pp.1-39. ⟨hal-02508838⟩
  • Pierre Bourhis, Daniel Deutch, Yuval Moskovitch. Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries. Sigmod, Jun 2020, Portland, United States. ⟨10.1145/3318464.3380578⟩. ⟨hal-03094605⟩
  • Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo. Reasoning about disclosure in data integration in the presence of source constraints. IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. ⟨hal-02145369v3⟩
  • Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI 2019 - International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. ⟨lirmm-02148142⟩
  • Meghyn Bienvenu, Pierre Bourhis. Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI), Aug 2019, Macao, Macau SAR China. ⟨10.24963/ijcai.2019/216⟩. ⟨hal-02342129⟩
  • Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS, Jun 2019, Amsterdam, France. pp.89-103, ⟨10.1145/3294052.3319702⟩. ⟨hal-02326243⟩
  • Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT, Mar 2019, Lisbon, Portugal. ⟨10.4230/LIPIcs.ICDT.2019.19⟩. ⟨hal-02338344⟩
  • Antoine Amarilli, Pierre Bourhis, Stefan Mengel. Enumeration on Trees under Relabelings. 21st International Conference on Database Theory,ICDT 2018, Mar 2018, Vienna, Austria. ⟨hal-02412744⟩
  • Pierre Bourhis, Michael Morak, Andréas Pieris. Making Cross Products and Guarded Ontology Languages Compatible. IJCAI 2017 - Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.880-886, ⟨10.24963/ijcai.2017/122⟩. ⟨hal-01638346⟩
  • Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana. Ontology-Mediated Query Answering for Key-Value Stores. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. ⟨lirmm-01632090⟩
  • Michael Benedikt, Pierre Bourhis, Michael Boom. Characterizing Definability in Decidable Fixpoint Logics . ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.14, ⟨10.4230/LIPIcs.ICALP.2017.107⟩. ⟨hal-01639015⟩
  • Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel. A Circuit-Based Approach to Efficient Enumeration . ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.111⟩. ⟨hal-01639179⟩
  • Pierre Bourhis, Juan Reutter, Fernando Suárez, Domagoj Vrgoč. JSON: Data model, Query languages and Schema specification. PODS 2017 - Proceedings of the Thirty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 2017, Chicago, United States. ⟨10.1145/3034786.3056120⟩. ⟨hal-01639182⟩
  • Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.6⟩. ⟨hal-01439294⟩
  • Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Query Answering with Transitive and Linear-Ordered Data. Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, Jul 2016, New York, United States. ⟨hal-01413881⟩
  • Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. A Step Up in Expressiveness of Decidable Fixpoint Logics. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. ⟨hal-01413890⟩
  • Pierre Bourhis, Michael Benedikt, Balder ten Cate, Gabriele Puppis. Querying Visible and Invisible Information. LICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York City, United States. pp.297-306 ⟨10.1145/2933575.2935306⟩. ⟨hal-01411118⟩
  • Pierre Bourhis, Daniel Deutch, Yuval Moskovitch:. Analyzing data-centric applications: Why, what-if, and how-to. . 32nd IEEE International Conference on Data Engineering, ICDE 2016, May 2016, Helsinki, Finland. ⟨hal-01413879⟩
  • Pierre Bourhis, Carsten Lutz. Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics . Principles of Knowledge Representation and Reasoning, Apr 2016, Cape Town, South Africa. ⟨hal-01413887⟩
  • Serge Abiteboul, Pierre Bourhis, Victor Vianu. A formal study of collaborative access control in distributed datalog. ICDT 2016 - 19th International Conference on Database Theory , Mar 2016, Bordeaux, France. ⟨hal-01290497⟩
  • Ainy Eleanor, Pierre Bourhis, Susan Davidson, Daniel Deutch, Tova Milo. Approximated Summarization of Data Provenance. CIKM, Oct 2015, Melbourn, Australia. ⟨hal-01211286⟩
  • Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Reasonable Highly Expressive Query Languages. IJCAI, Jul 2015, Buenos Aires, Argentina. ⟨10.1007/978-3-662-47666-6_5⟩. ⟨hal-01211282⟩
  • Pierre Bourhis, Michael Morak, Andréas Pieris. Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules. Mathematical Foundations of Computer Science (MFCS), Aug 2014, Budapest, Hungary. ⟨hal-01053179⟩
  • Pierre Bourhis, Michael Morak, Andréas Pieris. Acyclic Query Answering Under Guarded Disjunctive Existential Rules and Consequences to DLs. Informal Proceedings of the 27th International Workshop on Description Logics, Jul 2014, Vienne, Austria. ⟨hal-01098983⟩
  • Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. How to Best Nest Regular Path Queries. Informal Proceedings of the 27th International Workshop on Description Logics, Jul 2014, Vienne, Austria. ⟨hal-01098979⟩
  • Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu. Recursive queries on trees and data trees. Proceedings of the 16th International Conference on Database Theory, Mar 2013, Genoa, Italy. ⟨hal-00809297⟩
  • Gabriele Puppis, Cristian Riveros, Pierre Bourhis. Which DTDs are Streaming Bounded Repairable?. International Conference on Database Theory (ICDT), Mar 2013, Genoa, Italy. pp.57-68, ⟨10.1145/2448496.2448505⟩. ⟨hal-00829423⟩
  • Michael Benedikt, Pierre Bourhis, Pierre Senellart. Monadic Datalog Containment. ICALP (2), Jul 2012, Warwick, United Kingdom. pp.79-91. ⟨hal-00809306⟩
  • Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly expressive query languages for unordered data trees. ICDT, Mar 2012, Berlin, Germany. pp.46-60. ⟨hal-00765558⟩
  • Serge Abiteboul, Pierre Bourhis, Victor Vianu. Comparing Workflow Specification Languages: A Matter of Views. International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden. ⟨inria-00539579⟩
  • Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu, Alban Galland. [Demo] AXART - Enabling Collaborative Work with AXML Artifacts. VLDB 2010 - 36th International Conference on Very Large Data Bases Endowment, Sep 2010, Singapour, Singapore. pp.1553-1556. ⟨inria-00521726⟩
  • Serge Abiteboul, Pierre Bourhis, Alban Galland, Bogdan Marinoiu. The AXML Artifact Model. 16th International Symposium on Temporal Representation and Reasoning, Jul 2009, Brixen-Bressanone, Italy. ⟨inria-00447694⟩
  • Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Satisfiability and relevance for queries over active documents. Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009,, Jun 2009, Providence, United States. ⟨inria-00429645⟩
  • Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Efficient Maintenance Techniques for Views over Active Documents. EDBT 2009, 12th International Conference on Extending Database Technology, Mar 2009, Saint Petersburg, Russia. ⟨inria-00429637⟩
  • Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis. Distributed Monitoring of Peer-to-Peer Systems (demo). International Conference on Data Engineering, IEEE, Apr 2008, Cancun, Mexico. ⟨inria-00259059⟩
  • Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Incremental View Maintenance for Active Documents. Bases de données avancées, Oct 2007, Marseille, France. ⟨inria-00259069⟩

Poster

  • Eleanor Ainy, Pierre Bourhis, Susan Davidson, Daniel Deutch, Tova Milo. PROX: Approximated Summarization of Data Provenance. International Conference on Extending Database Technology, Mar 2016, Bordeaux, France. 2016. ⟨hal-01420452⟩

Pré-publication, Document de travail

  • Pierre Bourhis, Loïc Hélouët, Rituraj Singh, Zoltán Miklós. Data Centric Workflows for Crowdsourcing. 2019. ⟨hal-01976280v2⟩
  • Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). 2016. ⟨hal-01439309⟩
  • Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Query Containment for Highly Expressive Datalog Fragments. 2014. ⟨hal-01098974⟩

Rapport

  • Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. [Research Report] LIRMM (UM, CNRS). 2020. ⟨lirmm-02920624⟩