Felip Manyà - RankMe

142 papers A* 16A 23B 5C 2Journal 47Unranked 46

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	A Complete Tableau Calculus for Signed MaxSAT. ISMVL Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin
2025	J	`jnl`	ByteShield: Adversarially Robust End-to-End Malware Detection through Byte Masking. CoRR Daniel Gibert, Felip Manyà
2025	J	`jnl`	Complete tableau calculi for Regular MaxSAT and Regular MinSAT. Cogn. Syst. Res. Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin
2025	J	`jnl`	DeepTrust: Multi-Step Classification through Dissimilar Adversarial Representations for Robust Android Malware Detection. CoRR Daniel Pulido-Cortázar, Daniel Gibert, Felip Manyà
2025	A*	`conf`	Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. AAAI Shuolin Li, Chu-Min Li, Jordi Coll, Djamal Habet, Felip Manyà
2025	J	`jnl`	Integrating multi-armed bandit with local search for MaxSAT. Artif. Intell. Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
2025	J	`jnl`	Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. Comput. Oper. Res. Jordi Coll, Chu Min Li, Shuolin Li, Djamal Habet, Felip Manyà
2024	—	`conf`	A Complete Tableau Calculus for Non-Clausal Regular MinSAT. CCIA Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin
2024	—	`conf`	A Tableau Calculus for Non-Clausal Regular MaxSAT. ISMVL Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin
2023	—	`conf`	A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
2023	A*	`conf`	A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà
2023	—	`conf`	A Tableau Calculus for Signed Maximum Satisfiability. ISMVL Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, Felip Manyà
2023	—	`conf`	Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks. ISMVL Sandro Preto, Felip Manyà, Marcelo Finger
2023	—	`conf`	Linking Łukasiewicz Logic and Boolean Maximum Satisfiability. ISMVL Sandro Preto, Felip Manyà, Marcelo Finger
2023	J	`jnl`	MaxSAT resolution for regular propositional logic. Int. J. Approx. Reason. Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
2023	J	`jnl`	Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li, Felip Manyà, Zhang-Hua Fu
2023	B	`conf`	The MaxSAT Problem in the Real-Valued MV-Algebra. TABLEAUX Zuzana Haniková, Felip Manyà, Amanda Vidal
2022	—	`conf`	A Tableau Calculus for MaxSAT Based on Resolution. CCIA Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà
2022	A*	`conf`	BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
2022	J	`jnl`	BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà
2022	J	`jnl`	Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun. Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
2022	J	`jnl`	Clausal Forms in MaxSAT and MinSAT. Int. J. Comput. Intell. Syst. Chu Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal
2022	A*	`conf`	Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). IJCAI Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
2022	J	`jnl`	Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
2022	J	`jnl`	Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
2022	—	`conf`	Inference in MaxSAT and MinSAT. The Logic of Software. A Tasting Menu of Formal Methods Chu Min Li, Felip Manyà
2022	J	`jnl`	Negative Learning Ant Colony Optimization for MaxSAT. Int. J. Comput. Intell. Syst. Teddy Nurcahyadi, Christian Blum, Felip Manyà
2021	J	`jnl`	A resolution calculus for MinSAT. Log. J. IGPL Chu-Min Li, Fan Xiao, Felip Manyà
2021	J	`jnl`	Clause tableaux for maximum and minimum satisfiability. Log. J. IGPL Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler
2021	A	`conf`	Combining Clause Learning and Branch and Bound for MaxSAT. CP Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
2021	—	`conf`	From Non-Clausal to Clausal MinSAT. CCIA Chu-Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal
2021	J	`jnl`	Incomplete MaxSAT Approaches for Combinatorial Testing. CoRR Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
2021	—	`ch.`	MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability Chu Min Li, Felip Manyà
2021	J	`jnl`	Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
2021	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings SAT Chu-Min Li, Felip Manyà
2020	J	`jnl`	Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
2020	J	`jnl`	Solving the Team Composition Problem in a Classroom. Fundam. Informaticae Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler
2020	—	`conf`	Tableaux for Maximum Satisfiability in Łukasiewicz Logic. ISMVL Chu Min Li, Felip Manyà, Amanda Vidal
2019	B	`conf`	A Tableau Calculus for Non-clausal Maximum Satisfiability. TABLEAUX Chu Min Li, Felip Manyà, Joan Ramon Soler
2019	J	`jnl`	A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. Fan Xiao, Chu-Min Li, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
2019	—	`conf`	Clausal Form Transformation in MaxSAT. ISMVL Chu Min Li, Felip Manyà, Joan Ramon Soler
2019	J	`jnl`	New complexity results for Łukasiewicz logic. Soft Comput. Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2018	A*	`conf`	A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà
2018	J	`jnl`	A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, Yu Li
2018	—	`conf`	Clause Branching in MaxSAT and MinSAT. CCIA Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler
2018	J	`jnl`	Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
2017	—	`conf`	A MaxSAT-Based Approach to the Team Composition Problem in a Classroom. AAMAS Workshops (Visionary Papers) Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler
2017	A*	`conf`	An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü
2017	A*	`conf`	An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. AAAI Hua Jiang, Chu-Min Li, Felip Manyà
2017	—	`conf`	Exploiting Many-Valued Variables in MaxSAT. ISMVL Josep Argelich, Chu Min Li, Felip Manyà
2017	J	`jnl`	On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. Chu-Min Li, Hua Jiang, Felip Manyà
2017	—	`conf`	Solving MaxSAT with Natural Deduction. CCIA Joan Casas-Roma, Antonia Huertas, Felip Manyà
2016	—	`conf`	A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics. ISMVL Joan Ramon Soler, Felip Manyà
2016	A*	`conf`	A Clause Tableau Calculus for MaxSAT. IJCAI Chu Min Li, Felip Manyà, Joan Ramon Soler
2016	—	`conf`	A Clause Tableau Calculus for MinSAT. CCIA Chu Min Li, Felip Manyà, Joan Ramon Soler
2016	J	`jnl`	Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2016	A	`conf`	Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. ECAI Hua Jiang, Chu Min Li, Felip Manyà
2015	A*	`conf`	An Exact Inference Scheme for MinSAT. IJCAI Chu Min Li, Felip Manyà
2015	J	`jnl`	Approximate dynamic programming for automated vacuum waste collection systems. Environ. Model. Softw. Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
2015	—	`conf`	Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2015	J	`jnl`	SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2015	B	`conf`	The Complexity of 3-Valued Łukasiewicz Rules. MDAI Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2014	—	`conf`	Many-Valued MinSAT Solving. ISMVL Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu
2014	J	`jnl`	Modeling energy consumption in automated vacuum waste collection systems. Environ. Model. Softw. Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
2013	—	`conf`	A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. CCIA Carlos Ansótegui, Idelfonso Izquierdo, Felip Manyà, José Torres-Jiménez
2013	A	`conf`	MinSAT versus MaxSAT for Optimization Problems. CP Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu
2013	J	`jnl`	Resolution procedures for multiple-valued optimization. Inf. Sci. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2012	A	`conf`	A New Encoding from MinSAT into MaxSAT. CP Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich
2012	—	`conf`	A SAT-Based Approach to MinSAT. CCIA Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu
2012	—	`conf`	Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2012	J	`jnl`	Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. J. Multiple Valued Log. Soft Comput. Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2012	J	`jnl`	Foreward. J. Multiple Valued Log. Soft Comput. Francesc Esteva, Joan Gispert, Felip Manyà
2012	J	`jnl`	Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic. J. Multiple Valued Log. Soft Comput. Francesc Esteva, Joan Gispert, Felip Manyà
2012	B	`conf`	Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
2012	J	`jnl`	Optimizing with minimum satisfiability. Artif. Intell. Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon
2012	A*	`conf`	The Automated Vacuum Waste Collection Optimization Problem. AAAI Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal
2011	A	`conf`	Analyzing the Instances of the MaxSAT Evaluation. SAT Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
2011	—	`ed.`	Artificial Intelligence Research and Development - Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, Lleida, Catalonia, Spain, October 26-28, 2011 CCIA Cèsar Fernández, Hector Geffner, Felip Manyà
2011	—	`conf`	Experimenting with the Instances of the MaxSAT Evaluation. CCIA Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
2011	—	`conf`	Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2011	A*	`conf`	Minimum Satisfiability and Its Applications. IJCAI Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon
2011	J	`jnl`	New Inference Rules for Max-SAT CoRR Chu Min Li, Felip Manyà, Jordi Planes
2010	A	`conf`	Exact MinSAT Solving. SAT Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu
2010	—	`conf`	New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2010	J	`jnl`	Resolution-based lower bounds in MaxSAT. Constraints An Int. J. Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
2009	A	`conf`	Exploiting Cycle Structures in Max-SAT. SAT Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
2009	—	`conf`	Generating Hard Instances for MaxSAT. ISMVL Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes
2009	—	`ch.`	MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability Chu Min Li, Felip Manyà
2009	—	`conf`	Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2009	A	`conf`	Sequential Encodings from Max-CSP into Partial Max-SAT. SAT Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2008	A	`conf`	A Preprocessor for Max-SAT Solvers. SAT Josep Argelich, Chu Min Li, Felip Manyà
2008	J	`jnl`	An efficient solver for weighted Max-SAT. J. Glob. Optim. Teresa Alsinet, Felip Manyà, Jordi Planes
2008	—	`conf`	Encoding Max-CSP into Partial Max-SAT. ISMVL Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2008	A*	`conf`	Measuring the Hardness of SAT Instances. AAAI Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2008	A	`conf`	Modelling Max-CSP as Partial Max-SAT. SAT Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
2008	J	`jnl`	The First and Second Max-SAT Evaluations. J. Satisf. Boolean Model. Comput. Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes
2008	A	`conf`	Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
2007	—	`conf`	A Complete Resolution Calculus for Signed Max-SAT. ISMVL Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007	J	`jnl`	Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà
2007	A*	`conf`	Inference Rules for High-Order Consistency in Weighted CSP. AAAI Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007	A	`conf`	Mapping CSP into Many-Valued SAT. SAT Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007	J	`jnl`	New Inference Rules for Max-SAT. J. Artif. Intell. Res. Chu Min Li, Felip Manyà, Jordi Planes
2007	A	`conf`	Partial Max-SAT Solvers with Clause Learning. SAT Josep Argelich, Felip Manyà
2007	J	`jnl`	Regular-SAT: A many-valued approach to solving combinatorial problems. Discret. Appl. Math. Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes
2007	J	`jnl`	Resolution for Max-SAT. Artif. Intell. Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007	A*	`conf`	The Logic Behind Weighted CSP. IJCAI Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2007	—	`conf`	What Is a Real-World SAT Instance? CCIA Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
2006	A	`conf`	A Complete Calculus for Max-SAT. SAT Maria Luisa Bonet, Jordi Levy, Felip Manyà
2006	A*	`conf`	Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI Chu Min Li, Felip Manyà, Jordi Planes
2006	J	`jnl`	Exact Max-SAT solvers for over-constrained problems. J. Heuristics Josep Argelich, Felip Manyà
2006	—	`conf`	Towards Solving Many-Valued MaxSAT. ISMVL Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes
2005	A	`conf`	Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP Chu Min Li, Felip Manyà, Jordi Planes
2005	A	`conf`	Improved Exact Solvers for Weighted Max-SAT. SAT Teresa Alsinet, Felip Manyà, Jordi Planes
2005	—	`conf`	Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL Carlos Ansótegui, Felip Manyà
2005	A	`conf`	Solving Over-Constrained Problems with SAT Technology. SAT Josep Argelich, Felip Manyà
2005	A	`conf`	Solving Over-Constrained Problems with SAT. CP Josep Argelich, Felip Manyà
2004	—	`conf`	A Max-SAT Solver with Lazy Data Structures. IBERAMIA Teresa Alsinet, Felip Manyà, Jordi Planes
2004	A	`conf`	Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT Carlos Ansótegui, Felip Manyà
2004	—	`conf`	Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers Carlos Ansótegui, Felip Manyà
2004	A*	`conf`	Modeling Choices in Quasigroup Completion: SAT vs. CSP. AAAI Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà
2004	—	`conf`	The Interface between P and NP in Signed CNF Formulas. ISMVL Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà
2003	J	`jnl`	Automated monitoring of medical protocols: a secure and distributed architecture. Artif. Intell. Medicine Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà
2003	A	`conf`	Boosting Chaff's Performance by Incorporating CSP Heuristics. CP Carlos Ansótegui, Jose Larrubia, Felip Manyà
2003	—	`conf`	Exact Algorithms for MAX-SAT. FTP Hantao Zhang, Haiou Shen, Felip Manyà
2003	—	`conf`	New Logical and Complexity Results for Signed-SAT. ISMVL Carlos Ansótegui, Felip Manyà
2003	J	`jnl`	Técnicas de resolución de problemas de satisfacción de restricciones. Inteligencia Artif. Felip Manyà, Carla P. Gomes
2003	J	`jnl`	Una introducción a los algoritmos de satisfactibilidad. Inteligencia Artif. Carlos Ansótegui, Felip Manyà
2002	A	`conf`	Bridging the Gap between SAT and CSP. CP Carlos Ansótegui, Felip Manyà
2002	—	`conf`	Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. CCIA Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà
2001	—	`conf`	A Modular Reduction of Regular Logic to Classical Logic. ISMVL Ramón Béjar, Reiner Hähnle, Felip Manyà
2001	A	`conf`	Capturing Structure with Satisfiability. CP Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes
2001	J	`jnl`	Extending the Reach of SAT with Many-Valued Logics. Electron. Notes Discret. Math. Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes
2000	—	`conf`	A Multi-agent system architecture for monitoring medical protocols. Agents Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà
2000	—	`conf`	Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI Ramón Béjar, Felip Manyà
2000	—	`conf`	The 2-SAT Problem of Regular Signed CNF Formulas. ISMVL Bernhard Beckert, Reiner Hähnle, Felip Manyà
1999	—	`conf`	A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU Ramón Béjar, Felip Manyà
1999	C	`conf`	Phase Transitions in the Regular Random 3-SAT Problem. ISMIS Ramón Béjar, Felip Manyà
1999	B	`conf`	Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR Ramón Béjar, Felip Manyà
1999	—	`conf`	Transformations between Signed and Classical Clause Logic. ISMVL Bernhard Beckert, Reiner Hähnle, Felip Manyà
1998	J	`jnl`	The satisfiability problem in regular CNF-formulas. Soft Comput. Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz
1994	C	`conf`	Efficient Interpretation of Propositional Multiple-valued Logic Programs. IPMU Gonzalo Escalada-Imaz, Felip Manyà
1994	—	`conf`	The Satisfiability Problem in Multiple-Valued Horn Formulae. ISMVL Gonzalo Escalada-Imaz, Felip Manyà