Efficient Interpretation of Propositional Multiple-valued Logic Programs. - Gonzalo Escalada-Imaz; Felip Manyà (IPMU, 1994)

The Satisfiability Problem in Multiple-Valued Horn Formulae. - Gonzalo Escalada-Imaz; Felip Manyà (ISMVL, 1994)

The satisfiability problem in regular CNF-formulas. - Felip Manyà; Ramón Béjar; Gonzalo Escalada-Imaz (Soft Comput., 1998)

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. - Ramón Béjar; Felip Manyà (ESCQARU, 1999)

Phase Transitions in the Regular Random 3-SAT Problem. - Ramón Béjar; Felip Manyà (ISMIS, 1999)

Transformations between Signed and Classical Clause Logic. - Bernhard Beckert; Reiner Hähnle; Felip Manyà (ISMVL, 1999)

Solving Combinatorial Problems with Regular Local Search Algorithms. - Ramón Béjar; Felip Manyà (LPAR, 1999)

Solving the Round Robin Problem Using Propositional Logic. - Ramón Béjar; Felip Manyà (AAAI/IAAI, 2000)

A Multi-agent system architecture for monitoring medical protocols. - Teresa Alsinet; Ramón Béjar; Cèsar Fernández; Felip Manyà (Agents, 2000)

The 2-SAT Problem of Regular Signed CNF Formulas. - Bernhard Beckert; Reiner Hähnle; Felip Manyà (ISMVL, 2000)

Capturing Structure with Satisfiability. - Ramón Béjar; Alba Cabiscol; Cèsar Fernández; Felip Manyà; Carla P. Gomes (CP, 2001)

A Modular Reduction of Regular Logic to Classical Logic. - Ramón Béjar; Reiner Hähnle; Felip Manyà (ISMVL, 2001)

Extending the Reach of SAT with Many-Valued Logics. - Ramón Béjar; Alba Cabiscol; Cèsar Fernández; Felip Manyà; Carla P. Gomes (Electron. Notes Discret. Math., 2001)

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. - Teresa Alsinet; Ramón Béjar; Alba Cabiscol; Cèsar Fernández; Felip Manyà (CCIA, 2002)

Bridging the Gap between SAT and CSP. - Carlos Ansótegui; Felip Manyà (CP, 2002)

Boosting Chaff's Performance by Incorporating CSP Heuristics. - Carlos Ansótegui; Jose Larrubia; Felip Manyà (CP, 2003)

New Logical and Complexity Results for Signed-SAT. - Carlos Ansótegui; Felip Manyà (ISMVL, 2003)

Una introducción a los algoritmos de satisfactibilidad. - Carlos Ansótegui; Felip Manyà (Inteligencia Artif., 2003)

Técnicas de resolución de problemas de satisfacción de restricciones. - Felip Manyà; Carla P. Gomes (Inteligencia Artif., 2003)

Automated monitoring of medical protocols: a secure and distributed architecture. - Teresa Alsinet; Carlos Ansótegui; Ramón Béjar; Cèsar Fernández; Felip Manyà (Artif. Intell. Medicine, 2003)

Exact Algorithms for MAX-SAT. - Hantao Zhang 001; Haiou Shen; Felip Manyà (FTP, 2003)

Modeling Choices in Quasigroup Completion: SAT vs. CSP. - Carlos Ansótegui; Alvaro del Val; Iván Dotú; Cèsar Fernández; Felip Manyà (AAAI, 2004)

A Max-SAT Solver with Lazy Data Structures. - Teresa Alsinet; Felip Manyà; Jordi Planes (IBERAMIA, 2004)

The Interface between P and NP in Signed CNF Formulas. - Carlos Ansótegui; Ramón Béjar; Alba Cabiscol; Felip Manyà (ISMVL, 2004)

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. - Carlos Ansótegui; Felip Manyà (SAT, 2004)

Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. - Carlos Ansótegui; Felip Manyà (SAT (Selected Papers, 2004)

Solving Over-Constrained Problems with SAT. - Josep Argelich; Felip Manyà (CP, 2005)

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. - Chu Min Li 001; Felip Manyà; Jordi Planes (CP, 2005)

Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. - Carlos Ansótegui; Felip Manyà (ISMVL, 2005)

Improved Exact Solvers for Weighted Max-SAT. - Teresa Alsinet; Felip Manyà; Jordi Planes (SAT, 2005)

Solving Over-Constrained Problems with SAT Technology. - Josep Argelich; Felip Manyà (SAT, 2005)

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. - Chu Min Li 001; Felip Manyà; Jordi Planes (AAAI, 2006)

Towards Solving Many-Valued MaxSAT. - Josep Argelich; Xavier Domingo; Chu Min Li 001; Felip Manyà; Jordi Planes (ISMVL, 2006)

A Complete Calculus for Max-SAT. - Maria Luisa Bonet; Jordi Levy; Felip Manyà (SAT, 2006)

Exact Max-SAT solvers for over-constrained problems. - Josep Argelich; Felip Manyà (J. Heuristics, 2006)

Inference Rules for High-Order Consistency in Weighted CSP. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (AAAI, 2007)

What Is a Real-World SAT Instance? - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (CCIA, 2007)

The Logic Behind Weighted CSP. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (IJCAI, 2007)

A Complete Resolution Calculus for Signed Max-SAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (ISMVL, 2007)

Mapping CSP into Many-Valued SAT. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (SAT, 2007)

Partial Max-SAT Solvers with Clause Learning. - Josep Argelich; Felip Manyà (SAT, 2007)

Resolution for Max-SAT. - Maria Luisa Bonet; Jordi Levy; Felip Manyà (Artif. Intell., 2007)

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. - Carlos Ansótegui; Jose Larrubia; Chu Min Li 001; Felip Manyà (Ann. Math. Artif. Intell., 2007)

Regular-SAT: A many-valued approach to solving combinatorial problems. - Ramón Béjar; Felip Manyà; Alba Cabiscol; Cèsar Fernández; Carla P. Gomes (Discret. Appl. Math., 2007)

New Inference Rules for Max-SAT. - Chu Min Li 001; Felip Manyà; Jordi Planes (J. Artif. Intell. Res., 2007)

Measuring the Hardness of SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (AAAI, 2008)

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (CP, 2008)

Encoding Max-CSP into Partial Max-SAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (ISMVL, 2008)

Modelling Max-CSP as Partial Max-SAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (SAT, 2008)

A Preprocessor for Max-SAT Solvers. - Josep Argelich; Chu Min Li 001; Felip Manyà (SAT, 2008)

An efficient solver for weighted Max-SAT. - Teresa Alsinet; Felip Manyà; Jordi Planes (J. Glob. Optim., 2008)

The First and Second Max-SAT Evaluations. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (J. Satisf. Boolean Model. Comput., 2008)

Regular Encodings from Max-CSP into Partial Max-SAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (ISMVL, 2009)

Generating Hard Instances for MaxSAT. - Ramón Béjar; Alba Cabiscol; Felip Manyà; Jordi Planes (ISMVL, 2009)

Sequential Encodings from Max-CSP into Partial Max-SAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (SAT, 2009)

Exploiting Cycle Structures in Max-SAT. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (SAT, 2009)

MaxSAT, Hard and Soft Constraints. - Chu Min Li 001; Felip Manyà (Handbook of Satisfiability, 2009)

New Insights into Encodings from MaxCSP into Partial MaxSAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (ISMVL, 2010)

Exact MinSAT Solving. - Chu Min Li 001; Felip Manyà; Zhe Quan; Zhu Zhu (SAT, 2010)

Resolution-based lower bounds in MaxSAT. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (Constraints An Int. J., 2010)

Experimenting with the Instances of the MaxSAT Evaluation. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (CCIA, 2011)

Minimum Satisfiability and Its Applications. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (IJCAI, 2011)

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2011)

Analyzing the Instances of the MaxSAT Evaluation. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (SAT, 2011)

The Automated Vacuum Waste Collection Optimization Problem. - Ramón Béjar; Cèsar Fernández; Carles Mateu; Felip Manyà; Francina Sole-Mauri; David Vidal (AAAI, 2012)

A SAT-Based Approach to MinSAT. - Carlos Ansótegui; Chu Min Li 001; Felip Manyà; Zhu Zhu (CCIA, 2012)

A New Encoding from MinSAT into MaxSAT. - Zhu Zhu; Chu Min Li 001; Felip Manyà; Josep Argelich (CP, 2012)

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. - Ramón Béjar; Cèsar Fernández; Felip Manyà; Carles Mateu; Francina Sole-Mauri (ICTAI, 2012)

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2012)

Optimizing with minimum satisfiability. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (Artif. Intell., 2012)

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. - Josep Argelich; Alba Cabiscol; Inês Lynce; Felip Manyà (J. Multiple Valued Log. Soft Comput., 2012)

Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic. - Francesc Esteva; Joan Gispert; Felip Manyà (J. Multiple Valued Log. Soft Comput., 2012)

Foreward. - Francesc Esteva; Joan Gispert; Felip Manyà (J. Multiple Valued Log. Soft Comput., 2012)

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. - Carlos Ansótegui; Idelfonso Izquierdo; Felip Manyà; José Torres-Jiménez (CCIA, 2013)

MinSAT versus MaxSAT for Optimization Problems. - Josep Argelich; Chu Min Li 001; Felip Manyà; Zhu Zhu (CP, 2013)

Resolution procedures for multiple-valued optimization. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Felip Manyà (Inf. Sci., 2013)

Many-Valued MinSAT Solving. - Josep Argelich; Chu Min Li 001; Felip Manyà; Zhu Zhu (ISMVL, 2014)

Modeling energy consumption in automated vacuum waste collection systems. - Cèsar Fernández; Felip Manyà; Carles Mateu; Francina Sole-Mauri (Environ. Model. Softw., 2014)

An Exact Inference Scheme for MinSAT. - Chu Min Li 001; Felip Manyà (IJCAI, 2015)

Finding Hard Instances of Satisfiability in Lukasiewicz Logics. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (ISMVL, 2015)

The Complexity of 3-Valued Łukasiewicz Rules. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (MDAI, 2015)

Approximate dynamic programming for automated vacuum waste collection systems. - Cèsar Fernández; Felip Manyà; Carles Mateu; Francina Sole-Mauri (Environ. Model. Softw., 2015)

SAT and SMT Technology for Many-Valued Logics. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (J. Multiple Valued Log. Soft Comput., 2015)

A Clause Tableau Calculus for MinSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (CCIA, 2016)

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. - Hua Jiang; Chu Min Li 001; Felip Manyà (ECAI, 2016)

A Clause Tableau Calculus for MaxSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (IJCAI, 2016)

A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics. - Joan Ramon Soler; Felip Manyà (ISMVL, 2016)

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (Fuzzy Sets Syst., 2016)

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. - Hua Jiang; Chu-Min Li 001; Felip Manyà (AAAI, 2017)

A MaxSAT-Based Approach to the Team Composition Problem in a Classroom. - Felip Manyà; Santiago Negrete; Carme Roig; Joan Ramon Soler (AAMAS Workshops (Visionary Papers), 2017)

Solving MaxSAT with Natural Deduction. - Joan Casas-Roma; Antonia Huertas; Felip Manyà (CCIA, 2017)

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. - Mao Luo; Chu-Min Li 001; Fan Xiao; Felip Manyà; Zhipeng Lü (IJCAI, 2017)

Exploiting Many-Valued Variables in MaxSAT. - Josep Argelich; Chu Min Li 001; Felip Manyà (ISMVL, 2017)

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. - Chu-Min Li 001; Hua Jiang; Felip Manyà (Comput. Oper. Res., 2017)

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. - Hua Jiang; Chu-Min Li 001; Yanli Liu 001; Felip Manyà (AAAI, 2018)

Clause Branching in MaxSAT and MinSAT. - Josep Argelich; Chu Min Li 001; Felip Manyà; Joan Ramon Soler (CCIA, 2018)

A new upper bound for the maximum weight clique problem. - Chu-Min Li 001; Yanli Liu 001; Hua Jiang; Felip Manyà; Yu Li 012 (Eur. J. Oper. Res., 2018)

Clausal Form Transformation in MaxSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (ISMVL, 2019)

A Tableau Calculus for Non-clausal Maximum Satisfiability. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (TABLEAUX, 2019)

A branching heuristic for SAT solvers based on complete implication graphs. - Fan Xiao; Chu-Min Li 001; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Sci. China Inf. Sci., 2019)

New complexity results for Łukasiewicz logic. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (Soft Comput., 2019)

Tableaux for Maximum Satisfiability in Łukasiewicz Logic. - Chu Min Li 001; Felip Manyà; Amanda Vidal (ISMVL, 2020)

Clause vivification by unit propagation in CDCL SAT solvers. - Chu-Min Li 001; Fan Xiao; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Artif. Intell., 2020)

Solving the Team Composition Problem in a Classroom. - Felip Manyà; Santiago Negrete; Carme Roig; Joan Ramon Soler (Fundam. Informaticae, 2020)

From Non-Clausal to Clausal MinSAT. - Chu-Min Li 001; Felip Manyà; Joan Ramon Soler; Amanda Vidal (CCIA, 2021)

Combining Clause Learning and Branch and Bound for MaxSAT. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (CP, 2021)

Solving longest common subsequence problems via a transformation to the maximum clique problem. - Christian Blum 001; Marko Djukanovic; Alberto Santini; Hua Jiang; Chu-Min Li 001; Felip Manyà; Günther R. Raidl (Comput. Oper. Res., 2021)

Clause tableaux for maximum and minimum satisfiability. - Josep Argelich; Chu Min Li 001; Felip Manyà; Joan Ramon Soler (Log. J. IGPL, 2021)

A resolution calculus for MinSAT. - Chu-Min Li 001; Fan Xiao; Felip Manyà (Log. J. IGPL, 2021)

MaxSAT, Hard and Soft Constraints. - Chu Min Li 001; Felip Manyà (Handbook of Satisfiability, 2021)

Inference in MaxSAT and MinSAT. - Chu Min Li 001; Felip Manyà (The Logic of Software. A Tasting Menu of Formal Methods, 2022)

A Tableau Calculus for MaxSAT Based on Resolution. - Shoulin Li; Jordi Coll; Djamal Habet; Chu-Min Li 001; Felip Manyà (CCIA, 2022)

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (IJCAI, 2022)

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (IJCAI, 2022)

Boosting branch-and-bound MaxSAT solvers with clause learning. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (AI Commun., 2022)

Incorporating Multi-armed Bandit with Local Search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (CoRR, 2022)

Incomplete MaxSAT approaches for combinatorial testing. - Carlos Ansótegui; Felip Manyà; Jesus Ojeda; Josep M. Salvia; Eduard Torres (J. Heuristics, 2022)

Clausal Forms in MaxSAT and MinSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler; Amanda Vidal (Int. J. Comput. Intell. Syst., 2022)

Negative Learning Ant Colony Optimization for MaxSAT. - Teddy Nurcahyadi; Christian Blum 001; Felip Manyà (Int. J. Comput. Intell. Syst., 2022)

A Complete Tableau Calculus for the Regular MaxSAT Problem. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (CCIA, 2023)

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. - Shuolin Li; Chu-Min Li 001; Mao Luo; Jordi Coll; Djamal Habet; Felip Manyà (IJCAI, 2023)

A Tableau Calculus for Signed Maximum Satisfiability. - Shuolin Li; Jordi Coll; Djamal Habet; Chu Min Li 001; Felip Manyà (ISMVL, 2023)

Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks. - Sandro Preto; Felip Manyà; Marcelo Finger (ISMVL, 2023)

Linking Łukasiewicz Logic and Boolean Maximum Satisfiability. - Sandro Preto; Felip Manyà; Marcelo Finger (ISMVL, 2023)

The MaxSAT Problem in the Real-Valued MV-Algebra. - Zuzana Haniková; Felip Manyà; Amanda Vidal (TABLEAUX, 2023)

Parallel Bounded Search for the Maximum Clique Problem. - Hua Jiang; Ke Bai; Hai-Jiao Liu; Chu-Min Li 001; Felip Manyà; Zhang-Hua Fu (J. Comput. Sci. Technol., 2023)

MaxSAT resolution for regular propositional logic. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (Int. J. Approx. Reason., 2023)

A Complete Tableau Calculus for Non-Clausal Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (CCIA, 2024)

A Tableau Calculus for Non-Clausal Regular MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2024)

Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. - Shuolin Li; Chu-Min Li 001; Jordi Coll; Djamal Habet; Felip Manyà (AAAI, 2025)

A Complete Tableau Calculus for Signed MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2025)

Integrating multi-armed bandit with local search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (Artif. Intell., 2025)

Complete tableau calculi for Regular MaxSAT and Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (Cogn. Syst. Res., 2025)

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. - Jordi Coll; Chu Min Li 001; Shuolin Li; Djamal Habet; Felip Manyà (Comput. Oper. Res., 2025)