Search

Your search keyword '"Manyà, Felip"' showing total 302 results
Start Over Author "Manyà, Felip"

Refine your results

more »

more »

more »

more »
302 results on '"Manyà, Felip"'

1. Incorporating Multi-armed Bandit with Local Search for MaxSAT

Author

Zheng, Jiongzhi, He, Kun, Zhou, Jianrong, Jin, Yan, Li, Chu-Min, and Manyà, Felip

Subjects
Computer Science - Artificial Intelligence
Abstract

Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called BandHS, which applies two multi-armed bandits to guide the search directions when escaping local optima. One bandit is combined with all the soft clauses to help the algorithm select to satisfy appropriate soft clauses, and the other bandit with all the literals in hard clauses to help the algorithm select appropriate literals to satisfy the hard clauses. These two bandits can improve the algorithm's search ability in both feasible and infeasible solution spaces. We further propose an initialization method for (W)PMS that prioritizes both unit and binary clauses when producing the initial solutions. Extensive experiments demonstrate the excellent performance and generalization capability of our proposed methods, that greatly boost the state-of-the-art local search algorithm, SATLike3.0, and the state-of-the-art SAT-based incomplete solver, NuWLS-c., Comment: arXiv admin note: substantial text overlap with arXiv:2201.05544

Published
2022

2. BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit

Author

Zheng, Jiongzhi, He, Kun, Zhou, Jianrong, Jin, Yan, Li, Chu-Min, and Manya, Felip

Subjects
Computer Science - Artificial Intelligence
Abstract

We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMaxSAT, that applies a multi-armed bandit model to guide the search direction. The bandit in our method is associated with all the soft clauses in the input (W)PMS instance. Each arm corresponds to a soft clause. The bandit model can help BandMaxSAT to select a good direction to escape from local optima by selecting a soft clause to be satisfied in the current step, that is, selecting an arm to be pulled. We further propose an initialization method for (W)PMS that prioritizes both unit and binary clauses when producing the initial solutions. Extensive experiments demonstrate that BandMaxSAT significantly outperforms the state-of-the-art (W)PMS local search algorithm SATLike3.0. Specifically, the number of instances in which BandMaxSAT obtains better results is about twice that obtained by SATLike3.0. Moreover, we combine BandMaxSAT with the complete solver TT-Open-WBO-Inc. The resulting solver BandMaxSAT-c also outperforms some of the best state-of-the-art complete (W)PMS solvers, including SATLike-c, Loandra and TT-Open-WBO-Inc., Comment: Accepted by IJCAI 2022

Published
2022

5. Incomplete MaxSAT Approaches for Combinatorial Testing

Author

Ansótegui, Carlos, Manyà, Felip, Ojeda, Jesus, Salvia, Josep M., and Torres, Eduard

Subjects
Computer Science - Artificial Intelligence
Abstract

We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum Satisfiability (MaxSAT) technology by describing efficient encodings for different classes of complete and incomplete MaxSAT solvers to compute optimal and suboptimal solutions, respectively. Similarly, we show how to solve through MaxSAT technology a closely related problem, the Tuple Number problem, which we extend to incorporate constraints. For this problem, we additionally provide a new MaxSAT-based incomplete algorithm. The extensive experimental evaluation we carry out on the available Mixed Covering Arrays with Constraints benchmarks and the comparison with state-of-the-art tools confirm the good performance of our approaches.

Published
2021

6. The MaxSAT Problem in the Real-Valued MV-Algebra

Author

Haniková, Zuzana, Manyà, Felip, Vidal, Amanda, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ramanayake, Revantha, editor, and Urban, Josef, editor

Published
2023
Full Text
View/download PDF

9. Inference in MaxSAT and MinSAT

Author

Li, Chu Min, Manyà, Felip, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ahrendt, Wolfgang, editor, Beckert, Bernhard, editor, Bubel, Richard, editor, and Johnsen, Einar Broch, editor

Published
2022
Full Text
View/download PDF

10. Clause Vivification by Unit Propagation in CDCL SAT Solvers

Author

Li, Chu-Min, Xiao, Fan, Luo, Mao, Manyà, Felip, Lü, Zhipeng, and Li, Yu

Subjects
Computer Science - Artificial Intelligence, Computer Science - Logic in Computer Science
Abstract

Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses. To overcome this drawback, we propose a clause vivification approach that eliminates redundant literals by applying unit propagation. The proposed clause vivification is activated before the SAT solver triggers some selected restarts, and only affects a subset of original and learnt clauses, which are considered to be more relevant according to metrics like the literal block distance (LBD). Moreover, we conducted an empirical investigation with instances coming from the hard combinatorial and application categories of recent SAT competitions. The results show that a remarkable number of additional instances are solved when the proposed approach is incorporated into five of the best performing CDCL SAT solvers (Glucose, TC_Glucose, COMiniSatPS, MapleCOMSPS and MapleCOMSPS_LRB). More importantly, the empirical investigation includes an in-depth analysis of the effectiveness of clause vivification. It is worth mentioning that one of the SAT solvers described here was ranked first in the main track of SAT Competition 2017 thanks to the incorporation of the proposed clause vivification. That solver was further improved in this paper and won the bronze medal in the main track of SAT Competition 2018.

Published
2018

17. A Tableau Calculus for Non-clausal Maximum Satisfiability

Author

Li, Chu Min, Manyà, Felip, Soler, Joan Ramon, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Cerrito, Serenella, editor, and Popescu, Andrei, editor

Published
2019
Full Text
View/download PDF

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

Author

Manyà, Felip, Negrete, Santiago, Roig, Carme, Soler, Joan Ramon, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sukthankar, Gita, editor, and Rodriguez-Aguilar, Juan A., editor

Published
2017
Full Text
View/download PDF

23. A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers

Author

Li, Shuolin, Li, Chu-Min, Luo, Mao, Coll, Jordi, Habet, Djamal, Manyà, Felip, Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), and Université de Picardie Jules Verne (UPJV)

Subjects
[INFO]Computer Science [cs]
Abstract

International audience; Bounded Variable Elimination (BVE) is an important Boolean formula simplification technique in which the variable ordering is crucial. We define a new variable ordering based on variable activity, called ESA (variable Elimination Scheduled by Activity), for in-processing BVE in Conflict-Driven Clause Learning (CDCL) SAT solvers, and incorporate it into several state-of-the-art CDCL SAT solvers. Experimental results show that the new ESA ordering consistently makes these solvers solve more instances on the benchmark set including all the 5675 instances used in the Crafted, Application and Main tracks of all SAT Competitions up to 2022. In particular, one of these solvers with ESA, Kissat MAB ESA, won the Anniversary track of the SAT Competition 2022. The behaviour of ESA and the reason of its effectiveness are also analyzed.

Published
2023

26. Negative Learning Ant Colony Optimization for MaxSAT

Author

Ministerio de Ciencia e Innovación (España), Blum, Christian [0000-0002-1736-3559], Manyà, Felip [0000-0002-8366-1458], Teddy Nurcahyadi, Blum, Christian, Manyà, Felip, Ministerio de Ciencia e Innovación (España), Blum, Christian [0000-0002-1736-3559], Manyà, Felip [0000-0002-8366-1458], Teddy Nurcahyadi, Blum, Christian, and Manyà, Felip

Abstract

Recently, a new negative learning variant of ant colony optimization (ACO) has been used to successfully tackle a range of combinatorial optimization problems. For providing stronger evidence of the general applicability of negative learning ACO, we investigate how it can be adapted to solve the Maximum Satisfability problem (MaxSAT). The structure of MaxSAT is diferent from the problems considered to date and there exists only a few ACO approaches for MaxSAT. In this paper, we describe three negative learning ACO variants. They difer in the way in which sub-instances are solved at each algorithm iteration to provide negative feedback to the main ACO algorithm. In addition to using IBM ILOG CPLEX, two of these variants use existing MaxSAT solvers for this purpose. The experimental results show that the proposed negative learning ACO variants signifcantly outperform the baseline ACO as well as IBM ILOG CPLEX and the two MaxSAT solvers. This result is of special interest because it shows that negative learning ACO can be used to improve over the results of existing solvers by internally using them to solve smaller sub-instances

Published
2022

27. Boosting branch-and-bound MaxSAT solvers with clause learning

Author

Manyà, Felip [0000-0002-8366-1458], Li, Chu Min, Xu, Zhenxing, Coll, Jordi, Manyà, Felip, Habet, Djamal, He, Kun, Manyà, Felip [0000-0002-8366-1458], Li, Chu Min, Xu, Zhenxing, Coll, Jordi, Manyà, Felip, Habet, Djamal, and He, Kun

Abstract

The Maximum Satisfiability Problem, or MaxSAT, offers a suitable problem solving formalism for combinatorial optimization problems. Nevertheless, MaxSAT solvers implementing the Branch-and-Bound (BnB) scheme have not succeeded in solving challenging real-world optimization problems. It is widely believed that BnB MaxSAT solvers are only superior on random and some specific crafted instances. At the same time, SAT-based MaxSAT solvers perform particularly well on real-world instances. To overcome this shortcoming of BnB MaxSAT solvers, this paper proposes a new BnB MaxSAT solver called MaxCDCL. The main feature of MaxCDCL is the combination of clause learning of soft conflicts and an efficient bounding procedure. Moreover, the paper reports on an experimental investigation showing that MaxCDCL is competitive when compared with the best performing solvers of the 2020 MaxSAT Evaluation. MaxCDCL performs very well on real-world instances, and solves a number of instances that other solvers cannot solve. Furthermore, MaxCDCL, when combined with the best performing MaxSAT solvers, solves the highest number of instances of a collection from all the MaxSAT evaluations held so far.

Published
2022

28. The Complexity of 3-Valued Łukasiewicz Rules

Author

Bofill, Miquel, Manyà, Felip, Vidal, Amanda, Villaret, Mateu, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Torra, Vicenc, editor, and Narukawa, Torra, editor

Published
2015
Full Text
View/download PDF

30. Boosting branch-and-bound MaxSAT solvers with clause learning

Author

Li, Chu Min, Xu, Zhenxing, Coll, Jordi, Manyà, Felip, Habet, Djamal, He, Kun, COntraintes, ALgorithmes et Applications (COALA), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), Université de Picardie Jules Verne (UPJV), Manyà, Felip [0000-0002-8366-1458], and Manyà, Felip

Subjects
branch & bound | CDCL | MaxSAT, Artificial Intelligence, MathematicsofComputing_NUMERICALANALYSIS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

The Maximum Satisfiability Problem, or MaxSAT, offers a suitable problem solving formalism for combinatorial optimization problems. Nevertheless, MaxSAT solvers implementing the Branch-and-Bound (BnB) scheme have not succeeded in solving challenging real-world optimization problems. It is widely believed that BnB MaxSAT solvers are only superior on random and some specific crafted instances. At the same time, SAT-based MaxSAT solvers perform particularly well on real-world instances. To overcome this shortcoming of BnB MaxSAT solvers, this paper proposes a new BnB MaxSAT solver called MaxCDCL. The main feature of MaxCDCL is the combination of clause learning of soft conflicts and an efficient bounding procedure. Moreover, the paper reports on an experimental investigation showing that MaxCDCL is competitive when compared with the best performing solvers of the 2020 MaxSAT Evaluation. MaxCDCL performs very well on real-world instances, and solves a number of instances that other solvers cannot solve. Furthermore, MaxCDCL, when combined with the best performing MaxSAT solvers, solves the highest number of instances of a collection from all the MaxSAT evaluations held so far.

Published
2021

33. MinSAT versus MaxSAT for Optimization Problems

Author

Argelich, Josep, Li, Chu-Min, Manyà, Felip, Zhu, Zhu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Schulte, Christian, editor

Published
2013
Full Text
View/download PDF

34. A New Encoding from MinSAT into MaxSAT

Author

Zhu, Zhu, Li, Chu-Min, Manyà, Felip, Argelich, Josep, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Milano, Michela, editor

Published
2012
Full Text
View/download PDF

35. Exact MinSAT Solving

Author

Li, Chu Min, Manyà, Felip, Quan, Zhe, Zhu, Zhu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Strichman, Ofer, editor, and Szeider, Stefan, editor

Published
2010
Full Text
View/download PDF

37. Sequential Encodings from Max-CSP into Partial Max-SAT

Author

Argelich, Josep, Cabiscol, Alba, Lynce, Inês, Manyà, Felip, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Kullmann, Oliver, editor

Published
2009
Full Text
View/download PDF

38. Exploiting Cycle Structures in Max-SAT

Author

Li, Chu Min, Manyà, Felip, Mohamedou, Nouredine, Planes, Jordi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Kullmann, Oliver, editor

Published
2009
Full Text
View/download PDF

39. Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation

Author

Li, Chu Min, Manyà, Felip, Mohamedou, Nouredine Ould, Planes, Jordi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Stuckey, Peter J., editor

Published
2008
Full Text
View/download PDF

40. A Preprocessor for Max-SAT Solvers

Author

Argelich, Josep, Li, Chu Min, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kleine Büning, Hans, editor, and Zhao, Xishun, editor

Published
2008
Full Text
View/download PDF

41. Modelling Max-CSP as Partial Max-SAT

Author

Argelich, Josep, Cabiscol, Alba, Lynce, Inês, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kleine Büning, Hans, editor, and Zhao, Xishun, editor

Published
2008
Full Text
View/download PDF

43. Mapping CSP into Many-Valued SAT

Author

Ansótegui, Carlos, Bonet, María Luisa, Levy, Jordi, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Marques-Silva, João, editor, and Sakallah, Karem A., editor

Published
2007
Full Text
View/download PDF

44. Partial Max-SAT Solvers with Clause Learning

Author

Argelich, Josep, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Marques-Silva, João, editor, and Sakallah, Karem A., editor

Published
2007
Full Text
View/download PDF

45. A Complete Calculus for Max-SAT

Author

Bonet, María Luisa, Levy, Jordi, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Biere, Armin, editor, and Gomes, Carla P., editor

Published
2006
Full Text
View/download PDF

46. Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)

Author

Li, Chu-Min, Xu, Zhenxing, Coll, Jordi, Manyà, Felip, Habet, Djamal, He, Kun, Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Huazhong University of Science and Technology [Wuhan] (HUST), Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), Université de Picardie Jules Verne (UPJV), COntraintes, ALgorithmes et Applications (COALA), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Artificial Intelligence Research Institute / Spanish Scientific Research Council (IIIA / CSIC), Universitat Autònoma de Barcelona (UAB), and Coll, Jordi

Subjects
[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Abstract

International audience; Branch and Bound (BnB) has been successfully used to solve many combinatorial optimization problems. However, BnB MaxSAT solvers perform poorly when solving real-world and academic optimization problems. They are only competitive for random and some crafted instances. Thus, it is a prevailing opinion in the community that BnB is not really useful for practical MaxSAT solving. We refute this opinion by presenting a new BnB MaxSAT solver, called MaxCDCL, which combines clause learning and an efficient bounding procedure. MaxCDCL is among the top 5 out of a total of 15 exact solvers that participated in the 2020 MaxSAT Evaluation, solving several instances that other solvers cannot solve. Furthermore, MaxCDCL solves the highest number of instances from different MaxSAT Evaluations when combined with the best existing solvers.

Published
2022

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

Author

Li, Chu Min, Manyà, Felip, Planes, Jordi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and van Beek, Peter, editor

Published
2005
Full Text
View/download PDF

48. Improved Exact Solvers for Weighted Max-SAT

Author

Alsinet, Teresa, Manyà, Felip, Planes, Jordi, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bacchus, Fahiem, editor, and Walsh, Toby, editor

Published
2005
Full Text
View/download PDF

49. Solving Over-Constrained Problems with SAT Technology

Author

Argelich, Josep, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bacchus, Fahiem, editor, and Walsh, Toby, editor

Published
2005
Full Text
View/download PDF

50. Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables

Author

Ansótegui, Carlos, Manyà, Felip, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hoos, Holger H., editor, and Mitchell, David G., editor

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results