Felip Manyà

From MaRDI portal
Person:606911

Available identifiers

zbMath Open manya.felipMaRDI QIDQ606911

List of research outcomes

PublicationDate of PublicationType
MaxSAT resolution for regular propositional logic2023-11-16Paper
Boosting branch-and-bound MaxSAT solvers with clause learning2022-09-16Paper
Clause tableaux for maximum and minimum satisfiability2021-12-22Paper
A resolution calculus for MinSAT2021-12-22Paper
Solving longest common subsequence problems via a transformation to the maximum clique problem2021-04-20Paper
Solving the Team Composition Problem in a Classroom2020-11-16Paper
A tableau calculus for non-clausal maximum satisfiability2020-05-14Paper
Clause vivification by unit propagation in CDCL SAT solvers2020-01-20Paper
New complexity results for Łukasiewicz logic2019-08-12Paper
https://portal.mardi4nfdi.de/entity/Q45836772018-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45837982018-09-03Paper
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem2018-07-11Paper
A new upper bound for the maximum weight clique problem2018-05-31Paper
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers2018-02-19Paper
The Complexity of 3-Valued Łukasiewicz Rules2017-06-20Paper
Resolution procedures for multiple-valued optimization2014-08-01Paper
Exact Algorithms for MAX-SAT2013-04-19Paper
Optimizing with minimum satisfiability2012-11-15Paper
Resolution-based lower bounds in MaxSAT2010-11-19Paper
Exact MinSAT Solving2010-09-29Paper
Resolution for Max-SAT2009-07-09Paper
Sequential Encodings from Max-CSP into Partial Max-SAT2009-07-07Paper
Exploiting Cycle Structures in Max-SAT2009-07-07Paper
https://portal.mardi4nfdi.de/entity/Q36240952009-04-28Paper
Mapping CSP into Many-Valued SAT2009-03-10Paper
https://portal.mardi4nfdi.de/entity/Q36040102009-02-24Paper
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers2008-09-09Paper
An efficient solver for weighted Max-SAT2008-07-25Paper
Modelling Max-CSP as Partial Max-SAT2008-05-27Paper
A Preprocessor for Max-SAT Solvers2008-05-27Paper
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers2007-10-12Paper
A Complete Calculus for Max-SAT2007-09-04Paper
Regular-SAT: A many-valued approach to solving combinatorial problems2007-08-23Paper
Exact Max-SAT solvers for over-constrained problems2006-09-28Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44756272004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44388272003-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45426112002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27415412001-09-24Paper
https://portal.mardi4nfdi.de/entity/Q27019802001-07-05Paper
https://portal.mardi4nfdi.de/entity/Q49384152000-09-26Paper
https://portal.mardi4nfdi.de/entity/Q42629971999-09-22Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Felip Manyà