Pol Rodríguez-Farrés,
Rocco Ballester,
Carlos Ansótegui,
Jordi Levy,
& Jesus Cerquides
(2024).Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances.Leonardo Franco, Clélia Mulatier, Maciej Paszynski, Valeria V. Krzhizhanovskaya, Jack J. Dongarra, & Peter M. A. Sloot (Eds.),Computational Science -- ICCS 2024(pp. 277--291).
Springer Nature Switzerland.[BibTeX]
[PDF]
Eduardo Calò,
& Jordi Levy
(2023).General Boolean Formula Minimization with QBF Solvers.Ismael Sanz, Raquel Ros, & Jordi Nin (Eds.),Artificial Intelligence Research and Development - Proceedings of the 25th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2023, Món Sant Benet, Spain, 25-27 October 2023(pp. 347--358).
{IOS}Press.https://doi.org/10.3233/FAIA230705.[BibTeX]
[PDF]
Eduardo Calò,
Jordi Levy,
Albert Gatt,
& Kees Deemter
(2023).Is Shortest Always Best? The Role of Brevity in Logic-to-Text Generation.Alexis Palmer, & José Camacho-Collados (Eds.),Proceedings of the The 12th Joint Conference on Lexical and Computational Semantics, *SEM@ACL 2023, Toronto, Canada, July 13-14, 2023(pp. 180--192).
Association for Computational Linguistics.https://doi.org/10.18653/V1/2023.STARSEM-1.17.[BibTeX]
[PDF]
Carlos Ansótegui,
Maria Luisa Bonet,
& Jordi Levy
(2023).On the Density of States of Boolean Formulas.Ismael Sanz, Raquel Ros, & Jordi Nin (Eds.),Artificial Intelligence Research and Development - Proceedings of the 25th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2023, Món Sant Benet, Spain, 25-27 October 2023(pp. 369--382).
{IOS}Press.https://doi.org/10.3233/FAIA230707.[BibTeX]
[PDF]
Ilario Bonacina,
Maria Luisa Bonet,
& Jordi Levy
(2023).Polynomial Calculus for MaxSAT.Meena Mahajan, & Friedrich Slivovsky (Eds.),26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy(pp. 5:1--5:17).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SAT.2023.5.[BibTeX]
[PDF]
Thomas Bläsius,
Tobias Friedrich,
Andreas Göbel,
Jordi Levy,
& Ralf Rothenberger
(2023).The impact of heterogeneity and geometry on the proof complexity of random satisfiability.Random Struct. Algorithms, 63, 885--941.https://doi.org/10.1002/RSA.21168.[BibTeX]
[PDF]
Manfred Schmidt-Schauss,
Temur Kutsia,
Jordi Levy,
Mateu Villaret,
& Yunus D. K. Kutz
(2022).Nominal Unification and Matching of Higher Order Expressions with Recursive Let.Fundam. Informaticae, 185, 247--283.https://doi.org/10.3233/FI-222110.[BibTeX]
[PDF]
Carlos Ansótegui,
& Jordi Levy
(2022).Yet Another (Fake) Proof of P=NP.Atia Cortés, Francisco Grimaldo, & Tommaso Flaminio (Eds.),Artificial Intelligence Research and Development(pp. 25--34).
IOS Press.https://doi.org/10.3233/FAIA220310.[BibTeX]
[PDF]
2021
Dave de Jonge,
Filippo Bistaffa,
& Jordi Levy
(2021).A Heuristic Algorithm for Multi-Agent Vehicle Routing with Automated Negotiation.Frank Dignum, Alessio Lomuscio, Ulle Endriss, & Ann Now{\\'{e}} (Eds.),{AAMAS}'21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021(pp. 404--412).
{ACM}.https://dl.acm.org/doi/10.5555/3463952.3464004.[BibTeX]
[PDF]
Manfred Schmidt-Schauß,
Temur Kutsia,
Jordi Levy,
Mateu Villaret,
& Yunus Kutz
(2021).Nominal Unification and Matching of Higher Order Expressions with Recursive Let.[BibTeX]
[PDF]
Carlos Ansótegui,
& Jordi Levy
(2021).Reducing SAT to Max2SAT.Zhi-Hua Zhou (Eds.),Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, {IJCAI-21}(pp. 1367--1373).
International Joint Conferences on Artificial Intelligence Organization.https://doi.org/10.24963/ijcai.2021/189.[BibTeX]
[PDF]
Thomas Bläsius,
Tobias Friedrich,
Andreas Göbel,
Jordi Levy,
& Ralf Rothenberger
(2021).The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability.Dániel Marx (Eds.),Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021(pp. 42--53).
SIAM.https://doi.org/10.1137/1.9781611976465.4.[BibTeX]
[PDF]
2020
Maria Luisa Bonet,
& Jordi Levy
(2020).Equivalence Between Systems Stronger Than Resolution.Proc. of the 23rd Int. Conf. on Theory and Applications of Satisfiability Testing, SAT'20, Alghero, Italy, July 3-10, 2020(pp. 166--181).
https://doi.org/10.1007/978-3-030-51825-7\_13.[BibTeX]
[PDF]
Carlos Ansótegui,
Maria Luisa Bonet,
& Jordi Levy
(2019).Phase Transition in Realistic Random {SAT}Models.Jordi Sabater{-}Mir, Vicenç Torra, Isabel Aguiló, & Manuel González Hidalgo (Eds.),Artificial Intelligence Research and Development - Proceedings of the 22nd International Conference of the Catalan Association for Artificial Intelligence, {CCIA}2019, Mallorca, Spain, 23-25 October 2019(pp. 213--222).
{IOS}Press.https://doi.org/10.3233/FAIA190126.[BibTeX]
[PDF]
2018
Alexander Baumgartner,
Temur Kutsia,
Jordi Levy,
& Mateu Villaret
(2018).Term-Graph Anti-Unification.H{\\'{e}}l{\\`{e}}ne Kirchner (Eds.),3rd International Conference on Formal Structures for Computation and Deduction, {FSCD}2018, July 9-12, 2018, Oxford, {UK}(pp. 9:1--9:17).
Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik.https://doi.org/10.4230/LIPIcs.FSCD.2018.9.[BibTeX]
[PDF]