Pierre Bourhis
Chargé de recherche epst
Laboratoire / équipe
Contact
pierre.bourhis[chez]univ-lille[point].fr
+33 3 5935 8731
Batiment B INRIA Parc scientifique de la Haute Borne
Publications
{
"response":{
"numFound":61,
"start":0,
"numFoundExact":true,
"docs":[{
"citationRef_s":"Computer Science [cs]. Université de Lille, 2024",
"citationFull_s":"Pierre Bourhis. Dialog Between Logic, Trees and Circuits. Computer Science [cs]. Université de Lille, 2024. <a target=\"_blank\" href=\"https://hal.science/tel-04743648v1\">⟨tel-04743648⟩</a>",
"title_s":["Dialog Between Logic, Trees and Circuits","Dialogue entre Logique, Arbres et Circuits"],
"authFullName_s":["Pierre Bourhis"],
"halId_s":"tel-04743648",
"docType_s":"HDR",
"producedDateY_i":2024
},{
"citationRef_s":"<i>JADT 2024</i>, Jun 2024, Bruxelles (BE), Belgium. pp.139-148",
"citationFull_s":"Pierre Bourhis, Aaron Boussidan, Céline Fournial, Philippe Gambette. Detecting semantic or structural similarities for theater play comparison. <i>JADT 2024</i>, Jun 2024, Bruxelles (BE), Belgium. pp.139-148. <a target=\"_blank\" href=\"https://univ-eiffel.hal.science/hal-04722464v1\">⟨hal-04722464⟩</a>",
"title_s":["Detecting semantic or structural similarities for theater play comparison","Détection de similarités sémantiques ou structurelles pour la comparaison de pièces de théâtre"],
"authFullName_s":["Pierre Bourhis","Aaron Boussidan","Céline Fournial","Philippe Gambette"],
"halId_s":"hal-04722464",
"docType_s":"COMM",
"producedDateY_i":2024
},{
"citationRef_s":"<i>Mathematics of Evolution - Phylogenetic Trees and Networks. Workshop 1: Foundations of Phylogenetic Networks</i>, Sep 2023, Singapour, Singapore. pp.5-8",
"citationFull_s":"Sarah J. Berkemer, Pierre Bourhis, Philippe Gambette, Lionel Seinturier, Marion Tommasi. A Database Approach to Solve the Tree Containment Problem in Phylogenetic Networks. <i>Mathematics of Evolution - Phylogenetic Trees and Networks. Workshop 1: Foundations of Phylogenetic Networks</i>, Sep 2023, Singapour, Singapore. pp.5-8. <a target=\"_blank\" href=\"https://hal.science/hal-04722546v1\">⟨hal-04722546⟩</a>",
"title_s":["A Database Approach to Solve the Tree Containment Problem in Phylogenetic Networks"],
"authFullName_s":["Sarah J. Berkemer","Pierre Bourhis","Philippe Gambette","Lionel Seinturier","Marion Tommasi"],
"halId_s":"hal-04722546",
"docType_s":"COMM",
"producedDateY_i":2023
},{
"citationRef_s":"<i>CPM 2023</i>, Jun 2023, Champs-sur-Marne, Marne-la-Vallée, France. pp.6:1-6:23, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CPM.2023.6\">⟨10.4230/LIPIcs.CPM.2023.6⟩</a>",
"citationFull_s":"Pierre Bourhis, Aaron Boussidan, Philippe Gambette. On Distances between Words with Parameters. <i>CPM 2023</i>, Jun 2023, Champs-sur-Marne, Marne-la-Vallée, France. pp.6:1-6:23, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CPM.2023.6\">⟨10.4230/LIPIcs.CPM.2023.6⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04080842v1\">⟨hal-04080842⟩</a>",
"title_s":["On Distances between Words with Parameters"],
"authFullName_s":["Pierre Bourhis","Aaron Boussidan","Philippe Gambette"],
"halId_s":"hal-04080842",
"docType_s":"COMM",
"producedDateY_i":2023
},{
"citationRef_s":"2022",
"citationFull_s":"Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, et al.. Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits. 2022. <a target=\"_blank\" href=\"https://hal.science/hal-03778758v1\">⟨hal-03778758⟩</a>",
"title_s":["Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits"],
"authFullName_s":["Pierre Bourhis","Laurence Duchien","Jérémie Dusart","Emmanuel Lonca","Pierre Marquis","Clément Quinton"],
"halId_s":"hal-03778758",
"docType_s":"UNDEFINED",
"producedDateY_i":2022
},{
"citationRef_s":"<i>ACM Transactions on Computational Logic</i>, 2021",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom. INFERENCE FROM VISIBLE INFORMATION AND BACKGROUND KNOWLEDGE. <i>ACM Transactions on Computational Logic</i>, 2021. <a target=\"_blank\" href=\"https://hal.science/hal-03454215v1\">⟨hal-03454215⟩</a>",
"title_s":["INFERENCE FROM VISIBLE INFORMATION AND BACKGROUND KNOWLEDGE"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Balder ten Cate","Gabriele Puppis","Michael Vanden Boom"],
"halId_s":"hal-03454215",
"docType_s":"ART",
"producedDateY_i":2021
},{
"citationRef_s":"<i>SIGMOD record</i>, 2020, 49 (2), pp.30-35. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3442322.3442327\">⟨10.1145/3442322.3442327⟩</a>",
"citationFull_s":"Senjuti Basu Roy, Lei Chen, Atsuyuki Morishima, James Abello Monedero, Pierre Bourhis, et al.. Making AI Machines Work for Humans in FoW. <i>SIGMOD record</i>, 2020, 49 (2), pp.30-35. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3442322.3442327\">⟨10.1145/3442322.3442327⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03103700v2\">⟨hal-03103700v2⟩</a>",
"title_s":["Making AI Machines Work for Humans in FoW"],
"authFullName_s":["Senjuti Basu Roy","Lei Chen","Atsuyuki Morishima","James Abello Monedero","Pierre Bourhis","François Charoy","Marina Danilevsky","Gautam Das","Gianluca Demartini","Abishek Dubey","Shady Elbassuoni","David Gross-Amblard","Emilie Hoareau","Munenari Inoguchi","Jared Kenworthy","Itaru Kitahara","Dongwon Lee","Yunyao Li","Ria Mae Borromeo","Paolo Papotti","Raghav Rao","Sudeepa Roy","Pierre Senellart","Keishi Tajima","Saravanan Thirumuruganathan","Marion Tommasi","Kazutoshi Umemoto","Andrea Wiggins","Koichiro Yoshida","Sihem Amer-Yahia"],
"halId_s":"hal-03103700",
"docType_s":"ART",
"producedDateY_i":2020
},{
"citationRef_s":"<i>KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning</i>, Sep 2020, Rhodes, Greece. pp.109--118, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/kr.2020/12\">⟨10.24963/kr.2020/12⟩</a>",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Louis Jachiet, Efthymia Tsamoura. Balancing expressiveness and inexpressiveness in view design. <i>KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning</i>, Sep 2020, Rhodes, Greece. pp.109--118, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/kr.2020/12\">⟨10.24963/kr.2020/12⟩</a>. <a target=\"_blank\" href=\"https://telecom-paris.hal.science/hal-02964692v1\">⟨hal-02964692⟩</a>",
"title_s":["Balancing expressiveness and inexpressiveness in view design"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Louis Jachiet","Efthymia Tsamoura"],
"halId_s":"hal-02964692",
"docType_s":"COMM",
"producedDateY_i":2020
},{
"citationRef_s":"<i>SIGMOD record</i>, 2020, 49 (1), pp.25-32. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3422648.3422655\">⟨10.1145/3422648.3422655⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Constant-Delay Enumeration for Nondeterministic Document Spanners. <i>SIGMOD record</i>, 2020, 49 (1), pp.25-32. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3422648.3422655\">⟨10.1145/3422648.3422655⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03046848v1\">⟨hal-03046848⟩</a>",
"title_s":["Constant-Delay Enumeration for Nondeterministic Document Spanners"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Stefan Mengel","Matthias Niewerth"],
"halId_s":"hal-03046848",
"docType_s":"ART",
"producedDateY_i":2020
},{
"citationRef_s":"<i>Petri Nets 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency</i>, Jun 2020, Paris, France. pp.1-39",
"citationFull_s":"Pierre Bourhis, Loïc Hélouët, Zoltan Miklos, Rituraj Singh. Data Centric Workflows for Crowdsourcing. <i>Petri Nets 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency</i>, Jun 2020, Paris, France. pp.1-39. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02508838v1\">⟨hal-02508838⟩</a>",
"title_s":["Data Centric Workflows for Crowdsourcing"],
"authFullName_s":["Pierre Bourhis","Loïc Hélouët","Zoltan Miklos","Rituraj Singh"],
"halId_s":"hal-02508838",
"docType_s":"COMM",
"producedDateY_i":2020
},{
"citationRef_s":"[Research Report] LIRMM (UM, CNRS). 2020",
"citationFull_s":"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. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-02920624v1\">⟨lirmm-02920624⟩</a>",
"title_s":["Oblivious and Semi-Oblivious Boundedness for Existential Rules"],
"authFullName_s":["Pierre Bourhis","Michel Leclère","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana","Lily Galois"],
"halId_s":"lirmm-02920624",
"docType_s":"REPORT",
"producedDateY_i":2020
},{
"citationRef_s":"<i>Sigmod</i>, Jun 2020, Portland, United States. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3318464.3380578\">⟨10.1145/3318464.3380578⟩</a>",
"citationFull_s":"Pierre Bourhis, Daniel Deutch, Yuval Moskovitch. Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries. <i>Sigmod</i>, Jun 2020, Portland, United States. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3318464.3380578\">⟨10.1145/3318464.3380578⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03094605v1\">⟨hal-03094605⟩</a>",
"title_s":["Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries"],
"authFullName_s":["Pierre Bourhis","Daniel Deutch","Yuval Moskovitch"],
"halId_s":"hal-03094605",
"docType_s":"COMM",
"producedDateY_i":2020
},{
"citationRef_s":"<i>Information Systems</i>, 2020, 89, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.is.2019.101478\">⟨10.1016/j.is.2019.101478⟩</a>",
"citationFull_s":"Pierre Bourhis, Juan L Reutter, Domagoj Vrgoč. JSON: Data model and query languages. <i>Information Systems</i>, 2020, 89, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.is.2019.101478\">⟨10.1016/j.is.2019.101478⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03094643v1\">⟨hal-03094643⟩</a>",
"title_s":["JSON: Data model and query languages"],
"authFullName_s":["Pierre Bourhis","Juan L Reutter","Domagoj Vrgoč"],
"halId_s":"hal-03094643",
"docType_s":"ART",
"producedDateY_i":2020
},{
"citationRef_s":"<i>ACM Transactions on Computational Logic</i>, 2020, 21 (1), pp.6:1-6:45. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3344514\">⟨10.1145/3344514⟩</a>",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart. Monadic Datalog, Tree Validity, and Limited Access Containment. <i>ACM Transactions on Computational Logic</i>, 2020, 21 (1), pp.6:1-6:45. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3344514\">⟨10.1145/3344514⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02307999v1\">⟨hal-02307999⟩</a>",
"title_s":["Monadic Datalog, Tree Validity, and Limited Access Containment"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Georg Gottlob","Pierre Senellart"],
"halId_s":"hal-02307999",
"docType_s":"ART",
"producedDateY_i":2020
},{
"citationRef_s":"<i>Theory of Computing Systems</i>, 2019, 63 (7), pp.1620-1678. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-018-9901-2\">⟨10.1007/s00224-018-9901-2⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Evaluating Datalog via Tree Automata and Cycluits. <i>Theory of Computing Systems</i>, 2019, 63 (7), pp.1620-1678. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-018-9901-2\">⟨10.1007/s00224-018-9901-2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01891811v1\">⟨hal-01891811⟩</a>",
"title_s":["Evaluating Datalog via Tree Automata and Cycluits"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Mikaël Monet","Pierre Senellart"],
"halId_s":"hal-01891811",
"docType_s":"ART",
"producedDateY_i":2019
},{
"citationRef_s":"2019",
"citationFull_s":"Pierre Bourhis, Loïc Hélouët, Rituraj Singh, Zoltán Miklós. Data Centric Workflows for Crowdsourcing. 2019. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01976280v2\">⟨hal-01976280v2⟩</a>",
"title_s":["Data Centric Workflows for Crowdsourcing"],
"authFullName_s":["Pierre Bourhis","Loïc Hélouët","Rituraj Singh","Zoltán Miklós"],
"halId_s":"hal-01976280",
"docType_s":"UNDEFINED",
"producedDateY_i":2019
},{
"citationRef_s":"<i>Bulletin of the Technical Committee on Data Engineering</i>, 2019",
"citationFull_s":"Pierre Bourhis, Gianluca Demartini, Shady Elbassuoni, Emile Hoareau, H Raghav Rao. Ethical Challenges in the Future of Work. <i>Bulletin of the Technical Committee on Data Engineering</i>, 2019. <a target=\"_blank\" href=\"https://hal.science/hal-03094585v1\">⟨hal-03094585⟩</a>",
"title_s":["Ethical Challenges in the Future of Work"],
"authFullName_s":["Pierre Bourhis","Gianluca Demartini","Shady Elbassuoni","Emile Hoareau","H Raghav Rao"],
"halId_s":"hal-03094585",
"docType_s":"ART",
"producedDateY_i":2019
},{
"citationRef_s":"<i>IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence</i>, Aug 2019, Macao, China. pp.1581-1587, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/219\">⟨10.24963/ijcai.2019/219⟩</a>",
"citationFull_s":"Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. <i>IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence</i>, Aug 2019, Macao, China. pp.1581-1587, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/219\">⟨10.24963/ijcai.2019/219⟩</a>. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-02148142v1\">⟨lirmm-02148142⟩</a>",
"title_s":["Oblivious and Semi-Oblivious Boundedness for Existential Rules"],
"authFullName_s":["Pierre Bourhis","Michel Leclère","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana","Lily Gallois"],
"halId_s":"lirmm-02148142",
"docType_s":"COMM",
"producedDateY_i":2019
},{
"citationRef_s":"<i>IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence</i>, Aug 2019, Macao, China",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo. Reasoning about disclosure in data integration in the presence of source constraints. <i>IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence</i>, Aug 2019, Macao, China. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02145369v3\">⟨hal-02145369v3⟩</a>",
"title_s":["Reasoning about disclosure in data integration in the presence of source constraints"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Louis Jachiet","Michaël Thomazo"],
"halId_s":"hal-02145369",
"docType_s":"COMM",
"producedDateY_i":2019
},{
"citationRef_s":"<i>Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)</i>, Aug 2019, Macao, Macau SAR China. <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/216\">⟨10.24963/ijcai.2019/216⟩</a>",
"citationFull_s":"Meghyn Bienvenu, Pierre Bourhis. Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. <i>Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)</i>, Aug 2019, Macao, Macau SAR China. <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/216\">⟨10.24963/ijcai.2019/216⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02342129v1\">⟨hal-02342129⟩</a>",
"title_s":["Mixed-World Reasoning with Existential Rules under Active-Domain Semantics"],
"authFullName_s":["Meghyn Bienvenu","Pierre Bourhis"],
"halId_s":"hal-02342129",
"docType_s":"COMM",
"producedDateY_i":2019
},{
"citationRef_s":"<i>PODS</i>, Jun 2019, Amsterdam, France. pp.89-103, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3294052.3319702\">⟨10.1145/3294052.3319702⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. <i>PODS</i>, Jun 2019, Amsterdam, France. pp.89-103, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3294052.3319702\">⟨10.1145/3294052.3319702⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02326243v1\">⟨hal-02326243⟩</a>",
"title_s":["Enumeration on Trees with Tractable Combined Complexity and Efficient Updates"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Stefan Mengel","Matthias Niewerth"],
"halId_s":"hal-02326243",
"docType_s":"COMM",
"producedDateY_i":2019
},{
"citationRef_s":"<i>ICDT</i>, Mar 2019, Lisbon, Portugal. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2019.22\">⟨10.4230/LIPIcs.ICDT.2019.22⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Constant-Delay Enumeration for Nondeterministic Document Spanners. <i>ICDT</i>, Mar 2019, Lisbon, Portugal. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2019.22\">⟨10.4230/LIPIcs.ICDT.2019.22⟩</a>. <a target=\"_blank\" href=\"https://telecom-paris.hal.science/hal-02338344v1\">⟨hal-02338344⟩</a>",
"title_s":["Constant-Delay Enumeration for Nondeterministic Document Spanners"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Stefan Mengel","Matthias Niewerth"],
"halId_s":"hal-02338344",
"docType_s":"COMM",
"producedDateY_i":2019
},{
"citationRef_s":"<i>Logical Methods in Computer Science</i>, 2019, 15 (3), <a target=\"_blank\" href=\"https://dx.doi.org/10.23638/LMCS-15(3:29)2019\">⟨10.23638/LMCS-15(3:29)2019⟩</a>",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Definability and Interpolation within Decidable Fixpoint Logics. <i>Logical Methods in Computer Science</i>, 2019, 15 (3), <a target=\"_blank\" href=\"https://dx.doi.org/10.23638/LMCS-15(3:29)2019\">⟨10.23638/LMCS-15(3:29)2019⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02392433v1\">⟨hal-02392433⟩</a>",
"title_s":["Definability and Interpolation within Decidable Fixpoint Logics"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Michael Vanden Boom"],
"halId_s":"hal-02392433",
"docType_s":"ART",
"producedDateY_i":2019
},{
"citationRef_s":"<i>Journal of Artificial Intelligence Research</i>, 2018, 63, pp.191-264. <a target=\"_blank\" href=\"https://dx.doi.org/10.1613/jair.1.11240\">⟨10.1613/jair.1.11240⟩</a>",
"citationFull_s":"Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Query Answering with Transitive and Linear-Ordered Data. <i>Journal of Artificial Intelligence Research</i>, 2018, 63, pp.191-264. <a target=\"_blank\" href=\"https://dx.doi.org/10.1613/jair.1.11240\">⟨10.1613/jair.1.11240⟩</a>. <a target=\"_blank\" href=\"https://telecom-paris.hal.science/hal-02338348v1\">⟨hal-02338348⟩</a>",
"title_s":["Query Answering with Transitive and Linear-Ordered Data"],
"authFullName_s":["Antoine Amarilli","Michael Benedikt","Pierre Bourhis","Michael Vanden Boom"],
"halId_s":"hal-02338348",
"docType_s":"ART",
"producedDateY_i":2018
},{
"citationRef_s":"<i>21st International Conference on Database Theory,ICDT 2018</i>, Mar 2018, Vienna, Austria. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2018.5\">⟨10.4230/LIPIcs.ICDT.2018.5⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Stefan Mengel. Enumeration on Trees under Relabelings. <i>21st International Conference on Database Theory,ICDT 2018</i>, Mar 2018, Vienna, Austria. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2018.5\">⟨10.4230/LIPIcs.ICDT.2018.5⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02412744v1\">⟨hal-02412744⟩</a>",
"title_s":["Enumeration on Trees under Relabelings"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Stefan Mengel"],
"halId_s":"hal-02412744",
"docType_s":"COMM",
"producedDateY_i":2018
},{
"citationRef_s":"<i>IJCAI 2017 - Twenty-Sixth International Joint Conference on Artificial Intelligence</i>, Aug 2017, Melbourne, Australia. pp.880-886, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2017/122\">⟨10.24963/ijcai.2017/122⟩</a>",
"citationFull_s":"Pierre Bourhis, Michael Morak, Andréas Pieris. Making Cross Products and Guarded Ontology Languages Compatible. <i>IJCAI 2017 - Twenty-Sixth International Joint Conference on Artificial Intelligence</i>, Aug 2017, Melbourne, Australia. pp.880-886, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2017/122\">⟨10.24963/ijcai.2017/122⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01638346v1\">⟨hal-01638346⟩</a>",
"title_s":["Making Cross Products and Guarded Ontology Languages Compatible"],
"authFullName_s":["Pierre Bourhis","Michael Morak","Andréas Pieris"],
"halId_s":"hal-01638346",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"<i>IJCAI: International Joint Conference on Artificial Intelligence</i>, Aug 2017, Melbourne, Australia",
"citationFull_s":"Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana. Ontology-Mediated Query Answering for Key-Value Stores. <i>IJCAI: International Joint Conference on Artificial Intelligence</i>, Aug 2017, Melbourne, Australia. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-01632090v1\">⟨lirmm-01632090⟩</a>",
"title_s":["Ontology-Mediated Query Answering for Key-Value Stores"],
"authFullName_s":["Meghyn Bienvenu","Pierre Bourhis","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana"],
"halId_s":"lirmm-01632090",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"<i>ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming</i>, Jul 2017, Varsovie, Poland. pp.1-15, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.111\">⟨10.4230/LIPIcs.ICALP.2017.111⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel. A Circuit-Based Approach to Efficient Enumeration . <i>ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming</i>, Jul 2017, Varsovie, Poland. pp.1-15, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.111\">⟨10.4230/LIPIcs.ICALP.2017.111⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01639179v1\">⟨hal-01639179⟩</a>",
"title_s":["A Circuit-Based Approach to Efficient Enumeration"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Louis Jachiet","Stefan Mengel"],
"halId_s":"hal-01639179",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"<i> ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming</i>, Jul 2017, Varsovie, Poland. pp.14, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.107\">⟨10.4230/LIPIcs.ICALP.2017.107⟩</a>",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Characterizing Definability in Decidable Fixpoint Logics . <i> ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming</i>, Jul 2017, Varsovie, Poland. pp.14, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.107\">⟨10.4230/LIPIcs.ICALP.2017.107⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01639015v1\">⟨hal-01639015⟩</a>",
"title_s":["Characterizing Definability in Decidable Fixpoint Logics"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Michael Vanden Boom"],
"halId_s":"hal-01639015",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"<i>PODS 2017 - Proceedings of the Thirty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, May 2017, Chicago, United States. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3034786.3056120\">⟨10.1145/3034786.3056120⟩</a>",
"citationFull_s":"Pierre Bourhis, Juan L Reutter, Fernando Suárez, Domagoj Vrgoč. JSON: Data model, Query languages and Schema specification. <i>PODS 2017 - Proceedings of the Thirty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, May 2017, Chicago, United States. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/3034786.3056120\">⟨10.1145/3034786.3056120⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01639182v1\">⟨hal-01639182⟩</a>",
"title_s":["JSON: Data model, Query languages and Schema specification"],
"authFullName_s":["Pierre Bourhis","Juan L Reutter","Fernando Suárez","Domagoj Vrgoč"],
"halId_s":"hal-01639182",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"<i>ICDT 2017 - International Conference on Database Theory</i>, Mar 2017, Venice, Italy. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2017.6\">⟨10.4230/LIPIcs.ICDT.2017.6⟩</a>",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits. <i>ICDT 2017 - International Conference on Database Theory</i>, Mar 2017, Venice, Italy. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2017.6\">⟨10.4230/LIPIcs.ICDT.2017.6⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01439294v1\">⟨hal-01439294⟩</a>",
"title_s":["Combined Tractability of Query Evaluation via Tree Automata and Cycluits"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Mikaël Monet","Pierre Senellart"],
"halId_s":"hal-01439294",
"docType_s":"COMM",
"producedDateY_i":2017
},{
"citationRef_s":"2016",
"citationFull_s":"Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). 2016. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01439309v1\">⟨hal-01439309⟩</a>",
"title_s":["Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)"],
"authFullName_s":["Antoine Amarilli","Pierre Bourhis","Mikaël Monet","Pierre Senellart"],
"halId_s":"hal-01439309",
"docType_s":"UNDEFINED",
"producedDateY_i":2016
},{
"citationRef_s":"<i>Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016</i>, Jul 2016, New York, United States",
"citationFull_s":"Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Query Answering with Transitive and Linear-Ordered Data. <i>Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016</i>, Jul 2016, New York, United States. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01413881v1\">⟨hal-01413881⟩</a>",
"title_s":["Query Answering with Transitive and Linear-Ordered Data"],
"authFullName_s":["Antoine Amarilli","Michael Benedikt","Pierre Bourhis","Michael Vanden Boom"],
"halId_s":"hal-01413881",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Jul 2016, New York, United States",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. A Step Up in Expressiveness of Decidable Fixpoint Logics. <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Jul 2016, New York, United States. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01413890v1\">⟨hal-01413890⟩</a>",
"title_s":["A Step Up in Expressiveness of Decidable Fixpoint Logics"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Michael Vanden Boom"],
"halId_s":"hal-01413890",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>LICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Jul 2016, New York City, United States. pp.297-306 <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2933575.2935306\">⟨10.1145/2933575.2935306⟩</a>",
"citationFull_s":"Pierre Bourhis, Michael Benedikt, Balder ten Cate, Gabriele Puppis. Querying Visible and Invisible Information. <i>LICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Jul 2016, New York City, United States. pp.297-306 <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2933575.2935306\">⟨10.1145/2933575.2935306⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01411118v1\">⟨hal-01411118⟩</a>",
"title_s":["Querying Visible and Invisible Information"],
"authFullName_s":["Pierre Bourhis","Michael Benedikt","Balder ten Cate","Gabriele Puppis"],
"halId_s":"hal-01411118",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>ACM Transactions on Database Systems</i>, 2016, 41 (3), pp.1-45. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2898995\">⟨10.1145/2898995⟩</a>",
"citationFull_s":"Pierre Bourhis, Cristian Riveros, Slawomir Staworko, Gabriele Puppis. Bounded Repairability for Regular Tree Languages. <i>ACM Transactions on Database Systems</i>, 2016, 41 (3), pp.1-45. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2898995\">⟨10.1145/2898995⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01411116v1\">⟨hal-01411116⟩</a>",
"title_s":["Bounded Repairability for Regular Tree Languages"],
"authFullName_s":["Pierre Bourhis","Cristian Riveros","Slawomir Staworko","Gabriele Puppis"],
"halId_s":"hal-01411116",
"docType_s":"ART",
"producedDateY_i":2016
},{
"citationRef_s":"<i>32nd IEEE International Conference on Data Engineering, ICDE 2016</i>, May 2016, Helsinki, Finland",
"citationFull_s":"Pierre Bourhis, Daniel Deutch, Yuval Moskovitch:. Analyzing data-centric applications: Why, what-if, and how-to. . <i>32nd IEEE International Conference on Data Engineering, ICDE 2016</i>, May 2016, Helsinki, Finland. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01413879v1\">⟨hal-01413879⟩</a>",
"title_s":["Analyzing data-centric applications: Why, what-if, and how-to."],
"authFullName_s":["Pierre Bourhis","Daniel Deutch","Yuval Moskovitch:"],
"halId_s":"hal-01413879",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>Principles of Knowledge Representation and Reasoning</i>, Apr 2016, Cape Town, South Africa",
"citationFull_s":"Pierre Bourhis, Carsten Lutz. Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics\r\n. <i>Principles of Knowledge Representation and Reasoning</i>, Apr 2016, Cape Town, South Africa. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01413887v1\">⟨hal-01413887⟩</a>",
"title_s":["Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics"],
"authFullName_s":["Pierre Bourhis","Carsten Lutz"],
"halId_s":"hal-01413887",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>International Conference on Extending Database Technology</i>, Mar 2016, Bordeaux, France. 2016",
"citationFull_s":"Eleanor Ainy, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo. PROX: Approximated Summarization of Data Provenance. <i>International Conference on Extending Database Technology</i>, Mar 2016, Bordeaux, France. 2016. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01420452v1\">⟨hal-01420452⟩</a>",
"title_s":["PROX: Approximated Summarization of Data Provenance"],
"authFullName_s":["Eleanor Ainy","Pierre Bourhis","Susan B. Davidson","Daniel Deutch","Tova Milo"],
"halId_s":"hal-01420452",
"docType_s":"POSTER",
"producedDateY_i":2016
},{
"citationRef_s":"<i>ICDT 2016 - 19th International Conference on Database Theory </i>, Mar 2016, Bordeaux, France",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Victor Vianu. A formal study of collaborative access control in distributed datalog. <i>ICDT 2016 - 19th International Conference on Database Theory </i>, Mar 2016, Bordeaux, France. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01290497v1\">⟨hal-01290497⟩</a>",
"title_s":["A formal study of collaborative access control in distributed datalog"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Victor Vianu"],
"halId_s":"hal-01290497",
"docType_s":"COMM",
"producedDateY_i":2016
},{
"citationRef_s":"<i>CIKM</i>, Oct 2015, Melbourn, Australia",
"citationFull_s":"Ainy Eleanor, Pierre Bourhis, Susan B. Davidson, Daniel Deutch, Tova Milo. Approximated Summarization of Data Provenance. <i>CIKM</i>, Oct 2015, Melbourn, Australia. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01211286v1\">⟨hal-01211286⟩</a>",
"title_s":["Approximated Summarization of Data Provenance"],
"authFullName_s":["Ainy Eleanor","Pierre Bourhis","Susan B. Davidson","Daniel Deutch","Tova Milo"],
"halId_s":"hal-01211286",
"docType_s":"COMM",
"producedDateY_i":2015
},{
"citationRef_s":"<i>IJCAI</i>, Jul 2015, Buenos Aires, Argentina. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-47666-6_5\">⟨10.1007/978-3-662-47666-6_5⟩</a>",
"citationFull_s":"Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Reasonable Highly Expressive Query Languages. <i>IJCAI</i>, Jul 2015, Buenos Aires, Argentina. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-47666-6_5\">⟨10.1007/978-3-662-47666-6_5⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01211282v1\">⟨hal-01211282⟩</a>",
"title_s":["Reasonable Highly Expressive Query Languages"],
"authFullName_s":["Pierre Bourhis","Markus Krötzsch","Sebastian Rudolph"],
"halId_s":"hal-01211282",
"docType_s":"COMM",
"producedDateY_i":2015
},{
"citationRef_s":"<i>Theory of Computing Systems</i>, 2015, 57, pp.927-966. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9617-5\">⟨10.1007/s00224-015-9617-5⟩</a>",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees. <i>Theory of Computing Systems</i>, 2015, 57, pp.927-966. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9617-5\">⟨10.1007/s00224-015-9617-5⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01167068v1\">⟨hal-01167068⟩</a>",
"title_s":["Highly Expressive Query Languages for Unordered Data Trees"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Victor Vianu"],
"halId_s":"hal-01167068",
"docType_s":"ART",
"producedDateY_i":2015
},{
"citationRef_s":"<i>Theory of Computing Systems</i>, 2015, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9611-y\">⟨10.1007/s00224-015-9611-y⟩</a>",
"citationFull_s":"Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Which XML Schemas are Streaming Bounded Repairable?. <i>Theory of Computing Systems</i>, 2015, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9611-y\">⟨10.1007/s00224-015-9611-y⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01211290v1\">⟨hal-01211290⟩</a>",
"title_s":["Which XML Schemas are Streaming Bounded Repairable?"],
"authFullName_s":["Pierre Bourhis","Gabriele Puppis","Cristian Riveros"],
"halId_s":"hal-01211290",
"docType_s":"ART",
"producedDateY_i":2015
},{
"citationRef_s":"<i>ACM Transactions on Database Systems</i>, 2015, 40 (1), pp.Article No. 5. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2699500\">⟨10.1145/2699500⟩</a>",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Clemens Ley. Analysis of Schemas with Access Restrictions. <i>ACM Transactions on Database Systems</i>, 2015, 40 (1), pp.Article No. 5. <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2699500\">⟨10.1145/2699500⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01211288v1\">⟨hal-01211288⟩</a>",
"title_s":["Analysis of Schemas with Access Restrictions"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Clemens Ley"],
"halId_s":"hal-01211288",
"docType_s":"ART",
"producedDateY_i":2015
},{
"citationRef_s":"<i>Mathematical Foundations of Computer Science (MFCS)</i>, Aug 2014, Budapest, Hungary",
"citationFull_s":"Pierre Bourhis, Michael Morak, Andréas Pieris. Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules. <i>Mathematical Foundations of Computer Science (MFCS)</i>, Aug 2014, Budapest, Hungary. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01053179v1\">⟨hal-01053179⟩</a>",
"title_s":["Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules"],
"authFullName_s":["Pierre Bourhis","Michael Morak","Andréas Pieris"],
"halId_s":"hal-01053179",
"docType_s":"COMM",
"producedDateY_i":2014
},{
"citationRef_s":"<i>Informal Proceedings of the 27th International Workshop on Description Logics</i>, Jul 2014, Vienne, Austria",
"citationFull_s":"Pierre Bourhis, Michael Morak, Andréas Pieris. Acyclic Query Answering Under Guarded Disjunctive Existential Rules and Consequences to DLs. <i>Informal Proceedings of the 27th International Workshop on Description Logics</i>, Jul 2014, Vienne, Austria. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01098983v1\">⟨hal-01098983⟩</a>",
"title_s":["Acyclic Query Answering Under Guarded Disjunctive Existential Rules and Consequences to DLs"],
"authFullName_s":["Pierre Bourhis","Michael Morak","Andréas Pieris"],
"halId_s":"hal-01098983",
"docType_s":"COMM",
"producedDateY_i":2014
},{
"citationRef_s":"<i>Informal Proceedings of the 27th International Workshop on Description Logics</i>, Jul 2014, Vienne, Austria",
"citationFull_s":"Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. How to Best Nest Regular Path Queries. <i>Informal Proceedings of the 27th International Workshop on Description Logics</i>, Jul 2014, Vienne, Austria. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01098979v1\">⟨hal-01098979⟩</a>",
"title_s":["How to Best Nest Regular Path Queries"],
"authFullName_s":["Pierre Bourhis","Markus Krötzsch","Sebastian Rudolph"],
"halId_s":"hal-01098979",
"docType_s":"COMM",
"producedDateY_i":2014
},{
"citationRef_s":"2014",
"citationFull_s":"Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph. Query Containment for Highly Expressive Datalog Fragments. 2014. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01098974v1\">⟨hal-01098974⟩</a>",
"title_s":["Query Containment for Highly Expressive Datalog Fragments"],
"authFullName_s":["Pierre Bourhis","Markus Krötzsch","Sebastian Rudolph"],
"halId_s":"hal-01098974",
"docType_s":"UNDEFINED",
"producedDateY_i":2014
},{
"citationRef_s":"<i>Proceedings of the 16th International Conference on Database Theory</i>, Mar 2013, Genoa, Italy",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu. Recursive queries on trees and data trees. <i>Proceedings of the 16th International Conference on Database Theory</i>, Mar 2013, Genoa, Italy. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00809297v1\">⟨hal-00809297⟩</a>",
"title_s":["Recursive queries on trees and data trees"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Anca Muscholl","Zhilin Wu"],
"halId_s":"hal-00809297",
"docType_s":"COMM",
"producedDateY_i":2013
},{
"citationRef_s":"<i>International Conference on Database Theory (ICDT)</i>, Mar 2013, Genoa, Italy. pp.57-68, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2448496.2448505\">⟨10.1145/2448496.2448505⟩</a>",
"citationFull_s":"Gabriele Puppis, Cristian Riveros, Pierre Bourhis. Which DTDs are Streaming Bounded Repairable?. <i>International Conference on Database Theory (ICDT)</i>, Mar 2013, Genoa, Italy. pp.57-68, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2448496.2448505\">⟨10.1145/2448496.2448505⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00829423v1\">⟨hal-00829423⟩</a>",
"title_s":["Which DTDs are Streaming Bounded Repairable?"],
"authFullName_s":["Gabriele Puppis","Cristian Riveros","Pierre Bourhis"],
"halId_s":"hal-00829423",
"docType_s":"COMM",
"producedDateY_i":2013
},{
"citationRef_s":"<i>ICALP (2)</i>, Jul 2012, Warwick, United Kingdom. pp.79-91",
"citationFull_s":"Michael Benedikt, Pierre Bourhis, Pierre Senellart. Monadic Datalog Containment. <i>ICALP (2)</i>, Jul 2012, Warwick, United Kingdom. pp.79-91. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00809306v1\">⟨hal-00809306⟩</a>",
"title_s":["Monadic Datalog Containment"],
"authFullName_s":["Michael Benedikt","Pierre Bourhis","Pierre Senellart"],
"halId_s":"hal-00809306",
"docType_s":"COMM",
"producedDateY_i":2012
},{
"citationRef_s":"<i>ACM Transactions on Database Systems</i>, 2012, 37 (10), <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2188349.2188352\">⟨10.1145/2188349.2188352⟩</a>",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Victor Vianu. Comparing workflow specification languages: A matter of views. <i>ACM Transactions on Database Systems</i>, 2012, 37 (10), <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/2188349.2188352\">⟨10.1145/2188349.2188352⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00766210v1\">⟨hal-00766210⟩</a>",
"title_s":["Comparing workflow specification languages: A matter of views"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Victor Vianu"],
"halId_s":"hal-00766210",
"docType_s":"ART",
"producedDateY_i":2012
},{
"citationRef_s":"<i>ICDT</i>, Mar 2012, Berlin, Germany. pp.46-60",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly expressive query languages for unordered data trees. <i>ICDT</i>, Mar 2012, Berlin, Germany. pp.46-60. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00765558v1\">⟨hal-00765558⟩</a>",
"title_s":["Highly expressive query languages for unordered data trees"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Victor Vianu"],
"halId_s":"hal-00765558",
"docType_s":"COMM",
"producedDateY_i":2012
},{
"citationRef_s":"<i>International Conference on Database Theory (ICDT)</i>, Mar 2011, Uppsala, Sweden",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Victor Vianu. Comparing Workflow Specification Languages: A Matter of Views. <i>International Conference on Database Theory (ICDT)</i>, Mar 2011, Uppsala, Sweden. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00539579v1\">⟨inria-00539579⟩</a>",
"title_s":["Comparing Workflow Specification Languages: A Matter of Views"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Victor Vianu"],
"halId_s":"inria-00539579",
"docType_s":"COMM",
"producedDateY_i":2011
},{
"citationRef_s":"<i>VLDB 2010 - 36th International Conference on Very Large Data Bases Endowment</i>, Sep 2010, Singapour, Singapore. pp.1553-1556",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu, Alban Galland. [Demo] AXART - Enabling Collaborative Work with AXML Artifacts. <i>VLDB 2010 - 36th International Conference on Very Large Data Bases Endowment</i>, Sep 2010, Singapour, Singapore. pp.1553-1556. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00521726v1\">⟨inria-00521726⟩</a>",
"title_s":["[Demo] AXART - Enabling Collaborative Work with AXML Artifacts"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Bogdan Marinoiu","Alban Galland"],
"halId_s":"inria-00521726",
"docType_s":"COMM",
"producedDateY_i":2010
},{
"citationRef_s":"<i>16th International Symposium on Temporal Representation and Reasoning</i>, Jul 2009, Brixen-Bressanone, Italy",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Alban Galland, Bogdan Marinoiu. The AXML Artifact Model. <i>16th International Symposium on Temporal Representation and Reasoning</i>, Jul 2009, Brixen-Bressanone, Italy. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00447694v1\">⟨inria-00447694⟩</a>",
"title_s":["The AXML Artifact Model"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Alban Galland","Bogdan Marinoiu"],
"halId_s":"inria-00447694",
"docType_s":"COMM",
"producedDateY_i":2009
},{
"citationRef_s":"<i>Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009,</i>, Jun 2009, Providence, United States",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Satisfiability and relevance for queries over active documents. <i>Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009,</i>, Jun 2009, Providence, United States. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00429645v1\">⟨inria-00429645⟩</a>",
"title_s":["Satisfiability and relevance for queries over active documents"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Bogdan Marinoiu"],
"halId_s":"inria-00429645",
"docType_s":"COMM",
"producedDateY_i":2009
},{
"citationRef_s":"<i>EDBT 2009, 12th International Conference on Extending Database Technology</i>, Mar 2009, Saint Petersburg, Russia",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Efficient Maintenance Techniques for Views over Active Documents. <i>EDBT 2009, 12th International Conference on Extending Database Technology</i>, Mar 2009, Saint Petersburg, Russia. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00429637v1\">⟨inria-00429637⟩</a>",
"title_s":["Efficient Maintenance Techniques for Views over Active Documents"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Bogdan Marinoiu"],
"halId_s":"inria-00429637",
"docType_s":"COMM",
"producedDateY_i":2009
},{
"citationRef_s":"<i>International Conference on Data Engineering</i>, IEEE, Apr 2008, Cancun, Mexico",
"citationFull_s":"Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis. Distributed Monitoring of Peer-to-Peer Systems (demo). <i>International Conference on Data Engineering</i>, IEEE, Apr 2008, Cancun, Mexico. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00259059v1\">⟨inria-00259059⟩</a>",
"title_s":["Distributed Monitoring of Peer-to-Peer Systems (demo)"],
"authFullName_s":["Serge Abiteboul","Bogdan Marinoiu","Pierre Bourhis"],
"halId_s":"inria-00259059",
"docType_s":"COMM",
"producedDateY_i":2008
},{
"citationRef_s":"<i>Bases de données avancées</i>, Oct 2007, Marseille, France",
"citationFull_s":"Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. Incremental View Maintenance for Active Documents. <i>Bases de données avancées</i>, Oct 2007, Marseille, France. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00259069v1\">⟨inria-00259069⟩</a>",
"title_s":["Incremental View Maintenance for Active Documents"],
"authFullName_s":["Serge Abiteboul","Pierre Bourhis","Bogdan Marinoiu"],
"halId_s":"inria-00259069",
"docType_s":"COMM",
"producedDateY_i":2007
}]
}
}