Publicaciones en las que colabora con Felip Manyà Serres (24)

2022

  1. Incomplete MaxSAT approaches for combinatorial testing

    Journal of Heuristics, Vol. 28, Núm. 4, pp. 377-431

2016

  1. Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers

    Fuzzy Sets and Systems, Vol. 292, pp. 32-48

2014

  1. SAT and SMT technology for many-valued logics

    Journal of Multiple-Valued Logic and Soft Computing, Vol. 24, Núm. 1-4, pp. 151-172

2013

  1. A Max-SAT-based approach to constructing optimal covering arrays

    Frontiers in Artificial Intelligence and Applications

  2. Resolution procedures for multiple-valued optimization

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

2012

  1. A SAT-based approach to MinSAT

    Frontiers in Artificial Intelligence and Applications

  2. Building automated theorem provers for infinitely-valued logics with satisfiability modulo theory solvers

    Proceedings of The International Symposium on Multiple-Valued Logic

2011

  1. Extending multiple-valued clausal forms with linear integer arithmetic

    Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2011

2010

  1. The Logic Behind Weighted CSP

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

2008

  1. Measuring the hardness of sat instances

    Proceedings of the National Conference on Artificial Intelligence

2007

  1. A complete resolution calculus for signed max-SAT

    Proceedings of The International Symposium on Multiple-Valued Logic

  2. Exploiting multivalued knowledge in variable selection heuristics for SAT solvers

    Annals of Mathematics and Artificial Intelligence, Vol. 49, Núm. 1-4, pp. 191-205

  3. Inference rules for high-order consistency in weighted CSP

    Proceedings of the National Conference on Artificial Intelligence

  4. Mapping CSP into many-valued SAT

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

  5. The logic behind weighted CSP

    IJCAI International Joint Conference on Artificial Intelligence

  6. What is a real-world SAT instance?

    Frontiers in Artificial Intelligence and Applications

2005

  1. Mapping many-valued CNF formulas to Boolean CNF formulas

    Proceedings of The International Symposium on Multiple-Valued Logic

  2. Mapping problems with finite-domain variables to problems with Boolean variables

    Lecture Notes in Computer Science

2004

  1. Modeling choices in quasigroup completion: SAT vs. CSP

    Proceedings of the National Conference on Artificial Intelligence

  2. The interface between P and NP in signed CNF formulas

    Proceedings of The International Symposium on Multiple-Valued Logic