Publicaciones en colaboración con investigadores/as de Universitat Politècnica de Catalunya (25)

2022

  1. Scale-Free Random SAT Instances

    Algorithms, Vol. 15, Núm. 6

2019

  1. Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Community structure in industrial SAT instances

    Journal of Artificial Intelligence Research, Vol. 66, pp. 443-472

  3. Phase transition in realistic random SAT models

    Frontiers in Artificial Intelligence and Applications

2017

  1. Structure features for SAT instances classification

    Journal of Applied Logic, Vol. 23, pp. 27-39

2015

  1. On the Classification of Industrial SAT Families

    Frontiers in Artificial Intelligence and Applications

2014

  1. The fractal dimension of SAT formulas

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013

  1. Improving WPM2 for (weighted) partial MaxSAT

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Resolution procedures for multiple-valued optimization

    Information Sciences, Vol. 227, pp. 43-59

  3. SAT-based MaxSAT algorithms

    Artificial Intelligence, Vol. 196, pp. 77-105

2012

  1. Analysis and generation of pseudo-industrial MaxSAT instances

    Frontiers in Artificial Intelligence and Applications

  2. Improving SAT-based weighted MaxSAT solvers

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2010

  1. A new algorithm for Weighted Partial MaxSAT

    Proceedings of the National Conference on Artificial Intelligence

  2. The Logic Behind Weighted CSP

    Trends in Constraint Programming (Wiley-ISTE), pp. 303-316

2009

  1. On solving MaxSAT through SAT

    Frontiers in Artificial Intelligence and Applications

  2. On the Structure of Industrial SAT Instances

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Solving (Weighted) partial MaxSAT through satisfiability testing

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Towards industrial-like random SAT instances

    IJCAI International Joint Conference on Artificial Intelligence

2008

  1. Measuring the hardness of sat instances

    Proceedings of the National Conference on Artificial Intelligence

  2. Random SAT instances à la carte

    Frontiers in Artificial Intelligence and Applications