Felip Manyà

According to our database1, Felip Manyà authored at least 103 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Solving the Team Composition Problem in a Classroom.
Fundam. Informaticae, 2020

Clause vivification by unit propagation in CDCL SAT solvers.
Artif. Intell., 2020

2019
New complexity results for Łukasiewicz logic.
Soft Comput., 2019

A branching heuristic for SAT solvers based on complete implication graphs.
Sci. China Inf. Sci., 2019

A Tableau Calculus for Non-clausal Maximum Satisfiability.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Clausal Form Transformation in MaxSAT.
Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019

2018
A new upper bound for the maximum weight clique problem.
Eur. J. Oper. Res., 2018

Clause Branching in MaxSAT and MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2018

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.
Comput. Oper. Res., 2017

Exploiting Many-Valued Variables in MaxSAT.
Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Solving MaxSAT with Natural Deduction.
Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017

A MaxSAT-Based Approach to the Team Composition Problem in a Classroom.
Proceedings of the Autonomous Agents and Multiagent Systems, 2017

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers.
Fuzzy Sets Syst., 2016

A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics.
Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

A Clause Tableau Calculus for MaxSAT.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Clause Tableau Calculus for MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2016

2015
SAT and SMT Technology for Many-Valued Logics.
J. Multiple Valued Log. Soft Comput., 2015

Approximate dynamic programming for automated vacuum waste collection systems.
Environ. Model. Softw., 2015

The Complexity of 3-Valued Łukasiewicz Rules.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2015

Finding Hard Instances of Satisfiability in Lukasiewicz Logics.
Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

An Exact Inference Scheme for MinSAT.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Modeling energy consumption in automated vacuum waste collection systems.
Environ. Model. Softw., 2014

Many-Valued MinSAT Solving.
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

2013
Resolution procedures for multiple-valued optimization.
Inf. Sci., 2013

MinSAT versus MaxSAT for Optimization Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2013

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.
Proceedings of the Artificial Intelligence Research and Development, 2013

2012
Foreward.
J. Multiple Valued Log. Soft Comput., 2012

Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic.
J. Multiple Valued Log. Soft Comput., 2012

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.
J. Multiple Valued Log. Soft Comput., 2012

Optimizing with minimum satisfiability.
Artif. Intell., 2012

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.
Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

A New Encoding from MinSAT into MaxSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2012

A SAT-Based Approach to MinSAT.
Proceedings of the Artificial Intelligence Research and Development, 2012

The Automated Vacuum Waste Collection Optimization Problem.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Analyzing the Instances of the MaxSAT Evaluation.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

Minimum Satisfiability and Its Applications.
Proceedings of the IJCAI 2011, 2011

Experimenting with the Instances of the MaxSAT Evaluation.
Proceedings of the Artificial Intelligence Research and Development, 2011

2010
Resolution-based lower bounds in MaxSAT.
Constraints An Int. J., 2010

Exact MinSAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

New Insights into Encodings from MaxCSP into Partial MaxSAT.
Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

2009
MaxSAT, Hard and Soft Constraints.
Proceedings of the Handbook of Satisfiability, 2009

Exploiting Cycle Structures in Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Sequential Encodings from Max-CSP into Partial Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Generating Hard Instances for MaxSAT.
Proceedings of the ISMVL 2009, 2009

Regular Encodings from Max-CSP into Partial Max-SAT.
Proceedings of the ISMVL 2009, 2009

2008
The First and Second Max-SAT Evaluations.
J. Satisf. Boolean Model. Comput., 2008

An efficient solver for weighted Max-SAT.
J. Glob. Optim., 2008

A Preprocessor for Max-SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Modelling Max-CSP as Partial Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Encoding Max-CSP into Partial Max-SAT.
Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Measuring the Hardness of SAT Instances.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
New Inference Rules for Max-SAT.
J. Artif. Intell. Res., 2007

Regular-SAT: A many-valued approach to solving combinatorial problems.
Discret. Appl. Math., 2007

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers.
Ann. Math. Artif. Intell., 2007

Resolution for Max-SAT.
Artif. Intell., 2007

Partial Max-SAT Solvers with Clause Learning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Mapping CSP into Many-Valued SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

A Complete Resolution Calculus for Signed Max-SAT.
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

The Logic Behind Weighted CSP.
Proceedings of the IJCAI 2007, 2007

What Is a Real-World SAT Instance?
Proceedings of the Artificial Intelligence Research and Development, 2007

Inference Rules for High-Order Consistency in Weighted CSP.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Exact Max-SAT solvers for over-constrained problems.
J. Heuristics, 2006

A Complete Calculus for Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Towards Solving Many-Valued MaxSAT.
Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.
Proceedings of the Proceedings, 2006

2005
Solving Over-Constrained Problems with SAT Technology.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Improved Exact Solvers for Weighted Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Mapping Many-Valued CNF Formulas to Boolean CNF Formulas.
Proceedings of the 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 2005

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Solving Over-Constrained Problems with SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.
Proceedings of the SAT 2004, 2004

The Interface between P and NP in Signed CNF Formulas.
Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

A Max-SAT Solver with Lazy Data Structures.
Proceedings of the Advances in Artificial Intelligence, 2004

Modeling Choices in Quasigroup Completion: SAT vs. CSP.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Exact Algorithms for MAX-SAT.
Electron. Notes Theor. Comput. Sci., 2003

Automated monitoring of medical protocols: a secure and distributed architecture.
Artif. Intell. Medicine, 2003

Técnicas de resolución de problemas de satisfacción de restricciones.
Inteligencia Artif., 2003

Una introducción a los algoritmos de satisfactibilidad.
Inteligencia Artif., 2003

New Logical and Complexity Results for Signed-SAT.
Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

Boosting Chaff's Performance by Incorporating CSP Heuristics.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Bridging the Gap between SAT and CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

2001
Extending the Reach of SAT with Many-Valued Logics.
Electron. Notes Discret. Math., 2001

A Modular Reduction of Regular Logic to Classical Logic.
Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Capturing Structure with Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
The 2-SAT Problem of Regular Signed CNF Formulas.
Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic, 2000

A Multi-agent system architecture for monitoring medical protocols.
Proceedings of the Fourth International Conference on Autonomous Agents, 2000

Solving the Round Robin Problem Using Propositional Logic.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Solving Combinatorial Problems with Regular Local Search Algorithms.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Transformations between Signed and Classical Clause Logic.
Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic, 1999

Phase Transitions in the Regular Random 3-SAT Problem.
Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, 1999

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

1998
The satisfiability problem in regular CNF-formulas.
Soft Comput., 1998

1994
The Satisfiability Problem in Multiple-Valued Horn Formulae.
Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

Efficient Interpretation of Propositional Multiple-valued Logic Programs.
Proceedings of the Advances in Intelligent Computing, 1994


  Loading...