Felip Manyà

ORCID

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 46

Top Venues

Publications

Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, Felip Manyà
A Tableau Calculus for Signed Maximum Satisfiability. ISMVL (2023)
Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI (2023)
Zuzana Haniková, Felip Manyà, Amanda Vidal
The MaxSAT Problem in the Real-Valued MV-Algebra. TABLEAUX (2023)
Sandro Preto, Felip Manyà, Marcelo Finger
Linking Łukasiewicz Logic and Boolean Maximum Satisfiability. ISMVL (2023)
Sandro Preto, Felip Manyà, Marcelo Finger
Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks. ISMVL (2023)
Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li, Felip Manyà, Zhang-Hua Fu
Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. 38 (5) (2023)
Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA (2023)
Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
MaxSAT resolution for regular propositional logic. Int. J. Approx. Reason. 162 (2023)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR (2022)
Teddy Nurcahyadi, Christian Blum, Felip Manyà
Negative Learning Ant Colony Optimization for MaxSAT. Int. J. Comput. Intell. Syst. 15 (1) (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR (2022)
Chu Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal
Clausal Forms in MaxSAT and MinSAT. Int. J. Comput. Intell. Syst. 15 (1) (2022)
Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics 28 (4) (2022)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). IJCAI (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI (2022)
Chu Min Li, Felip Manyà
Inference in MaxSAT and MinSAT. The Logic of Software. A Tasting Menu of Formal Methods (2022)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun. 35 (2) (2022)
Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà
A Tableau Calculus for MaxSAT Based on Resolution. CCIA (2022)
Chu-Min Li, Fan Xiao, Felip Manyà
A resolution calculus for MinSAT. Log. J. IGPL 29 (1) (2021)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Combining Clause Learning and Branch and Bound for MaxSAT. CP (2021)
Chu-Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal
From Non-Clausal to Clausal MinSAT. CCIA (2021)
Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler
Clause tableaux for maximum and minimum satisfiability. Log. J. IGPL 29 (1) (2021)
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125 (2021)
Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
Incomplete MaxSAT Approaches for Combinatorial Testing. CoRR (2021)
Chu Min Li, Felip Manyà, Amanda Vidal
Tableaux for Maximum Satisfiability in Łukasiewicz Logic. ISMVL (2020)
Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. 279 (2020)
Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler
Solving the Team Composition Problem in a Classroom. Fundam. Informaticae 174 (1) (2020)
Fan Xiao, Chu-Min Li, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62 (7) (2019)
Chu Min Li, Felip Manyà, Joan Ramon Soler
Clausal Form Transformation in MaxSAT. ISMVL (2019)
Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
New complexity results for Łukasiewicz logic. Soft Comput. 23 (7) (2019)
Chu Min Li, Felip Manyà, Joan Ramon Soler
A Tableau Calculus for Non-clausal Maximum Satisfiability. TABLEAUX (2019)
Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler
Clause Branching in MaxSAT and MinSAT. CCIA (2018)
Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR (2018)
Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI (2018)
Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, Yu Li
A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. 270 (1) (2018)
Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler
A MaxSAT-Based Approach to the Team Composition Problem in a Classroom. AAMAS Workshops (Visionary Papers) (2017)
Josep Argelich, Chu Min Li, Felip Manyà
Exploiting Many-Valued Variables in MaxSAT. ISMVL (2017)
Hua Jiang, Chu-Min Li, Felip Manyà
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. AAAI (2017)
Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI (2017)
Joan Casas-Roma, Antonia Huertas, Felip Manyà
Solving MaxSAT with Natural Deduction. CCIA (2017)
Chu-Min Li, Hua Jiang, Felip Manyà
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84 (2017)
Chu Min Li, Felip Manyà, Joan Ramon Soler
A Clause Tableau Calculus for MaxSAT. IJCAI (2016)
Chu Min Li, Felip Manyà, Joan Ramon Soler
A Clause Tableau Calculus for MinSAT. CCIA (2016)
Joan Ramon Soler, Felip Manyà
A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics. ISMVL (2016)
Hua Jiang, Chu Min Li, Felip Manyà
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. ECAI (2016)
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. 292 (2016)
Chu Min Li, Felip Manyà
An Exact Inference Scheme for MinSAT. IJCAI (2015)
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. 24 (1-4) (2015)
Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
Approximate dynamic programming for automated vacuum waste collection systems. Environ. Model. Softw. 67 (2015)
Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL (2015)
Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
The Complexity of 3-Valued Łukasiewicz Rules. MDAI (2015)
Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
Modeling energy consumption in automated vacuum waste collection systems. Environ. Model. Softw. 56 (2014)
Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu
Many-Valued MinSAT Solving. ISMVL (2014)
Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu
MinSAT versus MaxSAT for Optimization Problems. CP (2013)
Carlos Ansótegui, Idelfonso Izquierdo, Felip Manyà, José Torres-Jiménez
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. CCIA (2013)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Resolution procedures for multiple-valued optimization. Inf. Sci. 227 (2013)
Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich
A New Encoding from MinSAT into MaxSAT. CP (2012)
Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu
A SAT-Based Approach to MinSAT. CCIA (2012)
Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal
The Automated Vacuum Waste Collection Optimization Problem. AAAI (2012)
Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI (2012)
Francesc Esteva, Joan Gispert, Felip Manyà
Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic. J. Multiple Valued Log. Soft Comput. 19 (1-3) (2012)
Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon
Optimizing with minimum satisfiability. Artif. Intell. 190 (2012)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. J. Multiple Valued Log. Soft Comput. 19 (1-3) (2012)
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL (2012)
Francesc Esteva, Joan Gispert, Felip Manyà
Foreward. J. Multiple Valued Log. Soft Comput. 19 (4) (2012)
Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL (2011)
Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon
Minimum Satisfiability and Its Applications. IJCAI (2011)
Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
Analyzing the Instances of the MaxSAT Evaluation. SAT (2011)
Chu Min Li, Felip Manyà, Jordi Planes
New Inference Rules for Max-SAT CoRR (2011)
Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
Experimenting with the Instances of the MaxSAT Evaluation. CCIA (2011)
Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu
Exact MinSAT Solving. SAT (2010)
Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
Resolution-based lower bounds in MaxSAT. Constraints An Int. J. 15 (4) (2010)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL (2010)
Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
Exploiting Cycle Structures in Max-SAT. SAT (2009)
Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes
Generating Hard Instances for MaxSAT. ISMVL (2009)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL (2009)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
Sequential Encodings from Max-CSP into Partial Max-SAT. SAT (2009)
Josep Argelich, Chu Min Li, Felip Manyà
A Preprocessor for Max-SAT Solvers. SAT (2008)
Teresa Alsinet, Felip Manyà, Jordi Planes
An efficient solver for weighted Max-SAT. J. Glob. Optim. 41 (1) (2008)
Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP (2008)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
Encoding Max-CSP into Partial Max-SAT. ISMVL (2008)
Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
The First and Second Max-SAT Evaluations. J. Satisf. Boolean Model. Comput. 4 (2-4) (2008)
Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
Modelling Max-CSP as Partial Max-SAT. SAT (2008)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Measuring the Hardness of SAT Instances. AAAI (2008)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
A Complete Resolution Calculus for Signed Max-SAT. ISMVL (2007)
Josep Argelich, Felip Manyà
Partial Max-SAT Solvers with Clause Learning. SAT (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
The Logic Behind Weighted CSP. IJCAI (2007)
Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49 (1-4) (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Mapping CSP into Many-Valued SAT. SAT (2007)
Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes
Regular-SAT: A many-valued approach to solving combinatorial problems. Discret. Appl. Math. 155 (12) (2007)
Maria Luisa Bonet, Jordi Levy, Felip Manyà
Resolution for Max-SAT. Artif. Intell. 171 (8-9) (2007)
Chu Min Li, Felip Manyà, Jordi Planes
New Inference Rules for Max-SAT. J. Artif. Intell. Res. 30 (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Inference Rules for High-Order Consistency in Weighted CSP. AAAI (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
What Is a Real-World SAT Instance? CCIA (2007)
Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes
Towards Solving Many-Valued MaxSAT. ISMVL (2006)
Chu Min Li, Felip Manyà, Jordi Planes
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI (2006)
Maria Luisa Bonet, Jordi Levy, Felip Manyà
A Complete Calculus for Max-SAT. SAT (2006)
Josep Argelich, Felip Manyà
Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12 (4-5) (2006)
Chu Min Li, Felip Manyà, Jordi Planes
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP (2005)
Josep Argelich, Felip Manyà
Solving Over-Constrained Problems with SAT. CP (2005)

Felip Manyà.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Felip Manyà