Publications

{ "response":{ "numFound":19, "start":0, "numFoundExact":true, "docs":[{ "citationRef_s":"2024", "citationFull_s":"Florent Capelli, Nofar Carmeli, Oliver Irwin, Sylvain Salvati. Direct Access for Conjunctive Queries with Negations. 2024. <a target=\"_blank\" href=\"https://hal.science/hal-04260203v1\">⟨hal-04260203⟩</a>", "title_s":["Direct Access for Conjunctive Queries with Negations","Accès direct pour les requêtes conjonctives avec négations"], "authFullName_s":["Florent Capelli","Nofar Carmeli","Oliver Irwin","Sylvain Salvati"], "halId_s":"hal-04260203", "docType_s":"UNDEFINED", "producedDateY_i":2024 },{ "citationRef_s":"2024", "citationFull_s":"Florent Capelli, Oliver Irwin, Sylvain Salvati. A Simple Algorithm for Worst Case Optimal Join and Sampling. 2024. <a target=\"_blank\" href=\"https://hal.science/hal-04707428v1\">⟨hal-04707428⟩</a>", "title_s":["A Simple Algorithm for Worst Case Optimal Join and Sampling","Un algorithme simple pour la jointure dans le pire cas et l'échantillonnage uniforme"], "authFullName_s":["Florent Capelli","Oliver Irwin","Sylvain Salvati"], "halId_s":"hal-04707428", "docType_s":"UNDEFINED", "producedDateY_i":2024 },{ "citationRef_s":"International Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. pp.5:1-25:18, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.25\">⟨10.4230/LIPIcs.ICDT.2024.25⟩</a>", "citationFull_s":"Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet. Ranked Enumeration for MSO on Trees via Knowledge Compilation. International Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. pp.5:1-25:18, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.25\">⟨10.4230/LIPIcs.ICDT.2024.25⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-04377344v2\">⟨hal-04377344v2⟩</a>", "title_s":["Ranked Enumeration for MSO on Trees via Knowledge Compilation"], "authFullName_s":["Antoine Amarilli","Pierre Bourhis","Florent Capelli","Mikaël Monet"], "halId_s":"hal-04377344", "docType_s":"COMM", "producedDateY_i":2024 },{ "citationRef_s":"International Conference on Database Theory, Mar 2024, Paestum, Italy. pp.13:1-13:20, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.13\">⟨10.4230/LIPIcs.ICDT.2024.13⟩</a>", "citationFull_s":"Florent Capelli, Oliver Irwin. Direct Access for Conjunctive Queries with Negations. International Conference on Database Theory, Mar 2024, Paestum, Italy. pp.13:1-13:20, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.13\">⟨10.4230/LIPIcs.ICDT.2024.13⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04504243v1\">⟨hal-04504243⟩</a>", "title_s":["Direct Access for Conjunctive Queries with Negations"], "authFullName_s":["Florent Capelli","Oliver Irwin"], "halId_s":"hal-04504243", "docType_s":"COMM", "producedDateY_i":2024 },{ "citationRef_s":"Logical Methods in Computer Science, In press, Volume 20, Issue 1, <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/lmcs-20(1:9)2024\">⟨10.46298/lmcs-20(1:9)2024⟩</a>", "citationFull_s":"Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon. Linear Programs with Conjunctive Database Queries. Logical Methods in Computer Science, In press, Volume 20, Issue 1, <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/lmcs-20(1:9)2024\">⟨10.46298/lmcs-20(1:9)2024⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04317553v1\">⟨hal-04317553⟩</a>", "title_s":["Linear Programs with Conjunctive Database Queries"], "authFullName_s":["Florent Capelli","Nicolas Crosetti","Joachim Niehren","Jan Ramon"], "halId_s":"hal-04317553", "docType_s":"ART", "producedDateY_i":2024 },{ "citationRef_s":"40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Mar 2023, Hamburg, Germany. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.STACS.2023.18\">⟨10.4230/LIPIcs.STACS.2023.18⟩</a>", "citationFull_s":"Florent Capelli, Yann Strozecki. Geometric Amortization of Enumeration Algorithms. 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Mar 2023, Hamburg, Germany. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.STACS.2023.18\">⟨10.4230/LIPIcs.STACS.2023.18⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03955911v1\">⟨hal-03955911⟩</a>", "title_s":["Geometric Amortization of Enumeration Algorithms"], "authFullName_s":["Florent Capelli","Yann Strozecki"], "halId_s":"hal-03955911", "docType_s":"COMM", "producedDateY_i":2023 },{ "citationRef_s":"ICDT 2022 - 25th International Conference on Database Theory, Mar 2022, Edinburgh, United Kingdom", "citationFull_s":"Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon. Linear Programs with Conjunctive Queries. ICDT 2022 - 25th International Conference on Database Theory, Mar 2022, Edinburgh, United Kingdom. <a target=\"_blank\" href=\"https://hal.science/hal-01981553v1\">⟨hal-01981553⟩</a>", "title_s":["Linear Programs with Conjunctive Queries"], "authFullName_s":["Florent Capelli","Nicolas Crosetti","Joachim Niehren","Jan Ramon"], "halId_s":"hal-01981553", "docType_s":"COMM", "producedDateY_i":2022 },{ "citationRef_s":"AAAI 2021 - 35th Conference on Artificial Intelligence, Feb 2021, Virtual, France", "citationFull_s":"Florent Capelli, Jean-Marie Lagniez, Pierre Marquis. Certifying Top-Down Decision-DNNF Compilers. AAAI 2021 - 35th Conference on Artificial Intelligence, Feb 2021, Virtual, France. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03111679v1\">⟨hal-03111679⟩</a>", "title_s":["Certifying Top-Down Decision-DNNF Compilers"], "authFullName_s":["Florent Capelli","Jean-Marie Lagniez","Pierre Marquis"], "halId_s":"hal-03111679", "docType_s":"COMM", "producedDateY_i":2021 },{ "citationRef_s":"Theory of Computing Systems, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-019-09930-2\">⟨10.1007/s00224-019-09930-2⟩</a>", "citationFull_s":"Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart. Connecting Knowledge Compilation Classes and Width Parameters. Theory of Computing Systems, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-019-09930-2\">⟨10.1007/s00224-019-09930-2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02163749v1\">⟨hal-02163749⟩</a>", "title_s":["Connecting Knowledge Compilation Classes and Width Parameters"], "authFullName_s":["Antoine Amarilli","Florent Capelli","Mikaël Monet","Pierre Senellart"], "halId_s":"hal-02163749", "docType_s":"ART", "producedDateY_i":2020 },{ "citationRef_s":"Discrete Applied Mathematics, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.dam.2020.02.014\">⟨10.1016/j.dam.2020.02.014⟩</a>", "citationFull_s":"Florent Capelli, Yann Strozecki. Enumerating models of DNF faster: breaking the dependency on the formula size. Discrete Applied Mathematics, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.dam.2020.02.014\">⟨10.1016/j.dam.2020.02.014⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01891483v1\">⟨hal-01891483⟩</a>", "title_s":["Enumerating models of DNF faster: breaking the dependency on the formula size","Énumérer les modèles des DNF plus rapidement : enlever la dépendance en la taille de la formule"], "authFullName_s":["Florent Capelli","Yann Strozecki"], "halId_s":"hal-01891483", "docType_s":"ART", "producedDateY_i":2020 },{ "citationRef_s":"Theory and Applications of Satisfiability Testing – SAT 2019, Jul 2019, Lisbon, Portugal. pp.90-99, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-24258-9_6\">⟨10.1007/978-3-030-24258-9_6⟩</a>", "citationFull_s":"Florent Capelli. Knowledge Compilation Languages as Proof Systems. Theory and Applications of Satisfiability Testing – SAT 2019, Jul 2019, Lisbon, Portugal. pp.90-99, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-24258-9_6\">⟨10.1007/978-3-030-24258-9_6⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02445523v1\">⟨hal-02445523⟩</a>", "title_s":["Knowledge Compilation Languages as Proof Systems"], "authFullName_s":["Florent Capelli"], "halId_s":"hal-02445523", "docType_s":"COMM", "producedDateY_i":2019 },{ "citationRef_s":"2019", "citationFull_s":"Florent Capelli. Knowledge compilation languages as proof systems. 2019. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02163761v1\">⟨hal-02163761⟩</a>", "title_s":["Knowledge compilation languages as proof systems"], "authFullName_s":["Florent Capelli"], "halId_s":"hal-02163761", "docType_s":"UNDEFINED", "producedDateY_i":2019 },{ "citationRef_s":"Journal of Computer and System Sciences, 2019, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2018.10.002\">⟨10.1016/j.jcss.2018.10.002⟩</a>", "citationFull_s":"Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté. Counting Minimal Transversals of β-Acyclic Hypergraphs. Journal of Computer and System Sciences, 2019, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2018.10.002\">⟨10.1016/j.jcss.2018.10.002⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01923090v1\">⟨hal-01923090⟩</a>", "title_s":["Counting Minimal Transversals of β-Acyclic Hypergraphs"], "authFullName_s":["Benjamin Bergougnoux","Florent Capelli","Mamadou Moustapha Kanté"], "halId_s":"hal-01923090", "docType_s":"ART", "producedDateY_i":2019 },{ "citationRef_s":"36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany", "citationFull_s":"Florent Capelli, Stefan Mengel. Tractable QBF by Knowledge Compilation. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. <a target=\"_blank\" href=\"https://hal.science/hal-01836402v1\">⟨hal-01836402⟩</a>", "title_s":["Tractable QBF by Knowledge Compilation"], "authFullName_s":["Florent Capelli","Stefan Mengel"], "halId_s":"hal-01836402", "docType_s":"COMM", "producedDateY_i":2019 },{ "citationRef_s":"2018", "citationFull_s":"Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté. Counting Minimal Transversals of ß-Acyclic Hypergraphs . 2018. <a target=\"_blank\" href=\"https://hal.science/hal-01610959v2\">⟨hal-01610959v2⟩</a>", "title_s":["Counting Minimal Transversals of ß-Acyclic Hypergraphs"], "authFullName_s":["Benjamin Bergougnoux","Florent Capelli","Mamadou Moustapha Kanté"], "halId_s":"hal-01610959", "docType_s":"UNDEFINED", "producedDateY_i":2018 },{ "citationRef_s":"Discrete Applied Mathematics, 2018, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.dam.2018.06.038\">⟨10.1016/j.dam.2018.06.038⟩</a>", "citationFull_s":"Florent Capelli, Yann Strozecki. Incremental delay enumeration: Space and time. Discrete Applied Mathematics, 2018, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.dam.2018.06.038\">⟨10.1016/j.dam.2018.06.038⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01923091v1\">⟨hal-01923091⟩</a>", "title_s":["Incremental delay enumeration: Space and time"], "authFullName_s":["Florent Capelli","Yann Strozecki"], "halId_s":"hal-01923091", "docType_s":"ART", "producedDateY_i":2018 },{ "citationRef_s":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.1109/LICS.2017.8005121\">⟨10.1109/LICS.2017.8005121⟩</a>", "citationFull_s":"Florent Capelli. Understanding the complexity of #SAT using knowledge compilation. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.1109/LICS.2017.8005121\">⟨10.1109/LICS.2017.8005121⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01836195v1\">⟨hal-01836195⟩</a>", "title_s":["Understanding the complexity of #SAT using knowledge compilation"], "authFullName_s":["Florent Capelli"], "halId_s":"hal-01836195", "docType_s":"COMM", "producedDateY_i":2017 },{ "citationRef_s":"Theory of Computing Systems, 2016, 58 (4), pp.506 - 527. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9630-8\">⟨10.1007/s00224-015-9630-8⟩</a>", "citationFull_s":"Florent Capelli, Arnaud Durand, Stefan Mengel. The Arithmetic Complexity of Tensor Contraction. Theory of Computing Systems, 2016, 58 (4), pp.506 - 527. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s00224-015-9630-8\">⟨10.1007/s00224-015-9630-8⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01700746v1\">⟨hal-01700746⟩</a>", "title_s":["The Arithmetic Complexity of Tensor Contraction"], "authFullName_s":["Florent Capelli","Arnaud Durand","Stefan Mengel"], "halId_s":"hal-01700746", "docType_s":"ART", "producedDateY_i":2016 },{ "citationRef_s":"25th International Joint Conference on Artificial Intelligence (IJCAI'16), 2016, New York, NY, USA, Unknown Region. pp.1008--1014", "citationFull_s":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky. Knowledge Compilation Meets Communication Complexity. 25th International Joint Conference on Artificial Intelligence (IJCAI'16), 2016, New York, NY, USA, Unknown Region. pp.1008--1014. <a target=\"_blank\" href=\"https://univ-artois.hal.science/hal-03301001v1\">⟨hal-03301001⟩</a>", "title_s":["Knowledge Compilation Meets Communication Complexity"], "authFullName_s":["Simone Bova","Florent Capelli","Stefan Mengel","Friedrich Slivovsky"], "halId_s":"hal-03301001", "docType_s":"COMM", "producedDateY_i":2016 }] } }

Rechercher

Paramétrage

Thèmes

Accessibilité

Florent Capelli