Felip Manyà

发表

The interface between P and NP in signed CNF formulas

Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, 2004, Proceedings. 34th International Symposium on Multiple-Valued Logic.

Analyzing the Instances of the MaxSAT Evaluation

Josep Argelich, Felip Manyà, Chu Min Li, 2011, SAT.

Solving Over-Constrained Problems with SAT Technology

Josep Argelich, Felip Manyà, 2005, SAT.

A Tableau Calculus for Non-clausal Maximum Satisfiability

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2019, TABLEAUX.

Sequential Encodings from Max-CSP into Partial Max-SAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2009, SAT.

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

Carlos Ansótegui, Felip Manyà, Mateu Villaret, 2016, Fuzzy Sets Syst..

Solving the Team Composition Problem in a Classroom

Felip Manyà, Joan Ramon Soler, Santiago Negrete, 2020, Fundam. Informaticae.

Capturing Structure with Satisfiability

Ramón Béjar, Cèsar Fernández, Alba Cabiscol, 2001, CP.

A SAT-Based Approach to MinSAT

Zhu Zhu, Carlos Ansótegui, Felip Manyà, 2012, CCIA.

A Clause Tableau Calculus for MinSAT

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2016, CCIA.

Exploiting Many-Valued Variables in MaxSAT

Josep Argelich, Felip Manyà, Chu Min Li, 2017, 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL).

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs

Hua Jiang, Felip Manyà, Chu Min Li, 2017, AAAI.

Exploiting Cycle Structures in Max-SAT

Felip Manyà, Chu Min Li, Jordi Planes, 2009, SAT.

Optimizing with minimum satisfiability

Zhu Zhu, Felip Manyà, Chu Min Li, 2012, Artif. Intell..

A New Encoding from MinSAT into MaxSAT

Josep Argelich, Zhu Zhu, Felip Manyà, 2012, CP.

A new upper bound for the maximum weight clique problem

Yu Li, Hua Jiang, Felip Manyà, 2018, Eur. J. Oper. Res..

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers

Carlos Ansótegui, Felip Manyà, Mateu Villaret, 2012, 2012 IEEE 42nd International Symposium on Multiple-Valued Logic.

SAT and SMT Technology for Many-Valued Logics

Carlos Ansótegui, Felip Manyà, Mateu Villaret, 2015, J. Multiple Valued Log. Soft Comput..

Solution Techniques for Constraint Satisfaction Problems

Felip Manyà, Carla P. Gomes, C. Gomes, 2003 .

Generating Hard Instances for MaxSAT

Ramón Béjar, Alba Cabiscol, Felip Manyà, 2009, 2009 39th International Symposium on Multiple-Valued Logic.

A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics

Felip Manyà, Joan Ramon Soler, 2016, 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL).

A resolution calculus for MinSAT

Felip Manyà, Chu Min Li, Fan Xiao, 2019 .

Resolution-based lower bounds in MaxSAT

Felip Manyà, Chu Min Li, Jordi Planes, 2010, Constraints.

Encoding Max-CSP into Partial Max-SAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

Una introducción a los algoritmos de satisfactibilidad

Carlos Ansótegui, Felip Manyà, Felipe Manya, 2003, Inteligencia Artif..

A Max-SAT Solver with Lazy Data Structures

Teresa Alsinet, Felip Manyà, Jordi Planes, 2004, IBERAMIA.

Minimum Satisfiability and Its Applications

Zhu Zhu, Felip Manyà, Chu Min Li, 2011, IJCAI.

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

Felip Manyà, Chu Min Li, Jordi Planes, 2005, CP.

Partial Max-SAT Solvers with Clause Learning

Josep Argelich, Felip Manyà, 2007, SAT.

Preface: Artificial intelligence research and development

Cèsar Fernández, Felip Manyà, Hector Geffner, 2011 .

A Multi-agent system architecture for monitoring medical protocols

Teresa Alsinet, Ramón Béjar, Cèsar Fernández, 2000, AGENTS '00.

Técnicas de resolución de problemas de satisfacción de restricciones

Felip Manyà, Carla P. Gomes, Felipe Manya, 2003, Inteligencia Artif..

Transformations between signed and classical clause logic

Bernhard Beckert, Reiner Hähnle, Felip Manyà, 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem

Teresa Alsinet, Ramón Béjar, Cèsar Fernández, 2002, CCIA.

Phase Transitions in the Regular Random 3-SAT Problem

Ramón Béjar, Felip Manyà, 1999, ISMIS.

New Insights into Encodings from MaxCSP into Partial MaxSAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2010, 2010 40th IEEE International Symposium on Multiple-Valued Logic.

Regular-SAT: A many-valued approach to solving combinatorial problems

Ramón Béjar, Cèsar Fernández, Alba Cabiscol, 2007, Discret. Appl. Math..

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation

Felip Manyà, Chu Min Li, Jordi Planes, 2008, CP.

Solving longest common subsequence problems via a transformation to the maximum clique problem

Alberto Santini, Felip Manyà, Chu Min Li, 2020, Comput. Oper. Res..

A Preprocessor for Max-SAT Solvers

Josep Argelich, Felip Manyà, Chu Min Li, 2008, SAT.

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables

Carlos Ansótegui, Felip Manyà, F. Manyà, 2004, SAT.

Experimenting with the Instances of the MaxSAT Evaluation

Josep Argelich, Felip Manyà, Chu Min Li, 2011, CCIA.

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem

Hua Jiang, Yanli Liu, Felip Manyà, 2018, AAAI.

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic

Carlos Ansótegui, Felip Manyà, Mateu Villaret, 2011, 2011 41st IEEE International Symposium on Multiple-Valued Logic.

What Is a Real-World SAT Instance?

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2007, CCIA.

Mapping CSP into Many-Valued SAT

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2007, SAT.

Foreward

Felip Manyà, Francesc Esteva, Joan Gispert, 2002, Biological Psychiatry.

Resolution procedures for multiple-valued optimization

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2013, Inf. Sci..

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Hua Jiang, Felip Manyà, Chu Min Li, 2017, Comput. Oper. Res..

Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic

Felip Manyà, Francesc Esteva, Joan Gispert, 2012, J. Multiple Valued Log. Soft Comput..

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2012, J. Multiple Valued Log. Soft Comput..

A MaxSAT-Based Approach to the Team Composition Problem in a Classroom

Felip Manyà, Joan Ramon Soler, Santiago Negrete, 2017, AAMAS Workshops.

Modeling energy consumption in automated vacuum waste collection systems

Cèsar Fernández, Felip Manyà, Carles Mateu, 2014, Environ. Model. Softw..

The Automated Vacuum Waste Collection Optimization Problem

David Vidal, Ramón Béjar, Felip Manyà, 2012, AAAI.

A Complete Calculus for Max-SAT

Maria Luisa Bonet, Jordi Levy, Felip Manyà, 2006, SAT.

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas

Ramón Béjar, Felip Manyà, 1999, ESCQARU.

The First and Second Max-SAT Evaluations

Josep Argelich, Felip Manyà, Chu Min Li, 2008, J. Satisf. Boolean Model. Comput..

New Inference Rules for Max-SAT pdf

Felip Manyà, Chu Min Li, Jordi Planes, 2007, J. Artif. Intell. Res..

Solving the Round Robin Problem Using Propositional Logic

Ramón Béjar, Felip Manyà, R. Béjar, 2000, AAAI/IAAI.

The 2-SAT problem of regular signed CNF formulas

Bernhard Beckert, Reiner Hähnle, Felip Manyà, 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

MinSAT versus MaxSAT for Optimization Problems

Josep Argelich, Zhu Zhu, Felip Manyà, 2013, CP.

Modeling Choices in Quasigroup Completion: SAT vs. CSP

Carlos Ansótegui, Cèsar Fernández, Felip Manyà, 2004, AAAI.

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Felip Manyà, Chu Min Li, Amanda Vidal, 2020, 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL).

An Introduction to Satisfiability Algorithms

Carlos Ansótegui, Felip Manyà, F. Manyà, 2003 .

Inference Rules for High-Order Consistency in Weighted CSP

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2007, AAAI.

A modular reduction of regular logic to classical logic

Reiner Hähnle, Ramón Béjar, Felip Manyà, 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

Regular Encodings from Max-CSP into Partial Max-SAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2009, 2009 39th International Symposium on Multiple-Valued Logic.

Improved Exact Solvers for Weighted Max-SAT

Teresa Alsinet, Felip Manyà, Jordi Planes, 2005, SAT.

The Complexity of 3-Valued Łukasiewicz Rules

Felip Manyà, Mateu Villaret, Miquel Bofill, 2015, MDAI.

Boosting Chaff's Performance by Incorporating CSP Heuristics

Carlos Ansótegui, Felip Manyà, Jose Larrubia, 2003, CP.

Clause Vivification by Unit Propagation in CDCL SAT Solvers

Fan Xiao, Yu Li, Zhipeng Lü, 2020, Artif. Intell..

Extending the Reach of SAT with Many-Valued Logics

Ramón Béjar, Cèsar Fernández, Alba Cabiscol, 2001, Electron. Notes Discret. Math..

MaxSAT, Hard and Soft Constraints

Felip Manyà, Chu Min Li, Chu Min Li, 2021, Handbook of Satisfiability.

Efficient Interpretation of Propositional Multiple-valued Logic Programs

Felip Manyà, Gonzalo Escalada-Imaz, F. Manyà, 1994, IPMU.

Modelling Max-CSP as Partial Max-SAT

Josep Argelich, Inês Lynce, Alba Cabiscol, 2008, SAT.

A branching heuristic for SAT solvers based on complete implication graphs

Fan Xiao, Yu Li, Zhipeng Lü, 2019, Science China Information Sciences.

New logical and complexity results for Signed-SAT

Carlos Ansótegui, Felip Manyà, F. Manyà, 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008)

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2022 .

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT

Felip Manyà, Chu Min Li, Jordi Planes, 2006, AAAI.

Exact Algorithms for MAX-SAT

Felip Manyà, Hantao Zhang, Haiou Shen, 2003, FTP.

A Complete Resolution Calculus for Signed Max-SAT

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

Bridging the Gap between SAT and CSP

Carlos Ansótegui, Felip Manyà, 2002, CP.

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays

José Torres-Jiménez, Idelfonso Izquierdo, Carlos Ansótegui, 2013, CCIA.

Finding Hard Instances of Satisfiability in Lukasiewicz Logics

Felip Manyà, Mateu Villaret, Miquel Bofill, 2015, 2015 IEEE International Symposium on Multiple-Valued Logic.

Solving Over-Constrained Problems with SAT

Josep Argelich, Felip Manyà, 2005, CP.

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers

Fan Xiao, Zhipeng Lü, Felip Manyà, 2017, IJCAI.

Clausal Form Transformation in MaxSAT

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2019, 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL).

Towards Solving Many-Valued MaxSAT

Xavier Domingo, Josep Argelich, Felip Manyà, 2006, 36th International Symposium on Multiple-Valued Logic (ISMVL'06).

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems

Ramón Béjar, Felip Manyà, Carles Mateu, 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

An efficient solver for weighted Max-SAT

Teresa Alsinet, Felip Manyà, Jordi Planes, 2008, J. Glob. Optim..

Many-Valued MinSAT Solving

Josep Argelich, Zhu Zhu, Felip Manyà, 2014, 2014 IEEE 44th International Symposium on Multiple-Valued Logic.

Clause Branching in MaxSAT and MinSAT

Josep Argelich, Felip Manyà, Chu Min Li, 2018, CCIA.

An Exact Inference Scheme for MinSAT

Felip Manyà, Chu Min Li, Chu Min Li, 2015, IJCAI.

Resolution for Max-SAT

Maria Luisa Bonet, Jordi Levy, Felip Manyà, 2007, Artif. Intell..

Exact Max-SAT solvers for over-constrained problems

Josep Argelich, Felip Manyà, 2006, J. Heuristics.

Solving MaxSAT with Natural Deduction

Felip Manyà, Antonia Huertas, Joan Casas-Roma, 2017, CCIA.

Exact MinSAT Solving

Zhu Zhu, Felip Manyà, Chu Min Li, 2010, SAT.

Solving Combinatorial Problems with Regular Local Search Algorithms

Ramón Béjar, Felip Manyà, R. Béjar, 1999, LPAR.

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs

Hua Jiang, Felip Manyà, Chu Min Li, 2016, ECAI.

Clause tableaux for maximum and minimum satisfiability

Josep Argelich, Felip Manyà, Chu Min Li, 2019 .

Mapping many-valued CNF formulas to Boolean CNF formulas

Carlos Ansótegui, Felip Manyà, 2005, 35th International Symposium on Multiple-Valued Logic (ISMVL'05).

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers

Carlos Ansótegui, Felip Manyà, Chu Min Li, 2007, Annals of Mathematics and Artificial Intelligence.

White Paper on Artificial Intelligence, Robotics and Data Science

Nardine Osman, Guillem Alenyà, Carles Sierra, 2020 .

The Logic Behind Weighted CSP

Maria Luisa Bonet, Carlos Ansótegui, Jordi Levy, 2007, IJCAI.

New complexity results for Łukasiewicz logic

Felip Manyà, Mateu Villaret, Miquel Bofill, 2018, Soft Comput..

Approximate dynamic programming for automated vacuum waste collection systems

Felip Manyà, Carles Mateu, Francina Sole-Mauri, 2015, Environ. Model. Softw..

Combining Clause Learning and Branch and Bound for MaxSAT

Djamal Habet, Felip Manyà, Chu Min Li, 2022, CP.

From Non-Clausal to Clausal MinSAT

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2021, CCIA.

Chapter 23. MaxSAT, Hard and Soft Constraints

Felip Manyà, Chu Min Li, 2021 .

A clause tableau calculus for MaxSAT

Felip Manyà, Chu Min Li, Joan Ramon Soler, 2016, IJCAI 2016.

Learning Hard Constraints in Max-SAT ⋆

Josep Argelich, Felip Manyà, 2006 .