Filters








668 Hits in 4.0 sec

Algorithms for Weighted Boolean Optimization [article]

Vasco Manquinho and Joao Marques-Silva and Jordi Planes
2009 arXiv   pre-print
In addition, the paper proposes a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiability-based algorithms for MaxSAT.  ...  This papers proposes Weighted Boolean Optimization (WBO), a new unified framework that aggregates and extends PBO and MaxSAT.  ...  This work is partially supported by EU grant ICT/217069 and FCT grant PTDC/EIA/76572/2006.  ... 
arXiv:0903.0843v2 fatcat:gw46xr45nfhrholhb3wl5sfs6q

Algorithms for Weighted Boolean Optimization [chapter]

Vasco Manquinho, Joao Marques-Silva, Jordi Planes
2009 Lecture Notes in Computer Science  
In addition, the paper proposes a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiability-based algorithms for MaxSAT.  ...  This papers proposes Weighted Boolean Optimization (WBO), a new unified framework that aggregates and extends PBO and MaxSAT.  ...  Conclusions and Future Work This paper proposes a new algorithm for (Partial) Weighted MaxSAT, based on unsatisfiable sub-formula identification.  ... 
doi:10.1007/978-3-642-02777-2_45 fatcat:w6t7iducw5ecxdj35oa7ho67xu

MSCG: Robust Core-Guided MaxSAT Solving

Antonio Morgado, Alexey Ignatiev, Joao Marques-Silva
2015 Journal on Satisfiability, Boolean Modeling and Computation  
Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT) that finds a wide range of practical applications.  ...  This work describes and evaluates the Maximum Satisfiability using the Core-Guided approach solver (MSCG), which is a robust MaxSAT solver that participated in the MaxSAT Evaluation 2014.  ...  MSCG Figure 2 . 2 Results for Industrial MaxSAT benchmarks from MaxSAT Evaluation 2014 (a) Plain MaxSAT benchmarks (b) Partial MaxSAT benchmarks (c) Weighted Partial MaxSAT benchmarks solves the instance  ... 
doi:10.3233/sat190105 fatcat:qknmu5fs2fhypjamqinn4sb6nq

Improving SAT-Based Weighted MaxSAT Solvers [chapter]

Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy
2012 Lecture Notes in Computer Science  
In the last few years, there has been a significant effort in designing and developing efficient Weighted MaxSAT solvers.  ...  We present an extensive experimental investigation comparing the new algorithm with state-of-the-art solvers showing that our approach makes WPM1 much more competitive.  ...  weight strictly smaller than w max , Algorithm 4 is a correct algorithm for Weighted Partial MaxSAT.  ... 
doi:10.1007/978-3-642-33558-7_9 fatcat:uc6ctcx5m5btzpgo6rog2jmoyq

Community-Based Partitioning for MaxSAT Solving [chapter]

Ruben Martins, Vasco Manquinho, Inês Lynce
2013 Lecture Notes in Computer Science  
In this paper a new technique is proposed to partition the MaxSAT formula in order to identify smaller unsatisfiable subformulas at each call of the SAT solver.  ...  This technique is shown to significantly improve the unsatisfiability-based algorithm for different benchmark sets.  ...  As future work, we propose to extend our modularity-based partitioning for weighted MaxSAT.  ... 
doi:10.1007/978-3-642-39071-5_14 fatcat:bn2hpkewtvgljlrolynqsuesdy

MaxSAT by Improved Instance-Specific Algorithm Configuration

Carlos Ansotegui, Yuri Malitsky, Meinolf Sellmann
2014 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We then apply the new methodology toa number of MaxSAT problem domains and show that the resulting solversconsistently outperform the best existing solvers on the respectiveproblem families.  ...  Experimental results on SAT show that thiscombination marks a significant step forward in our ability to tunealgorithms instance-specifically.  ...  The Weighted Partial MaxSAT problem for a Weighted Partial MaxSAT formula ϕ is the problem of finding an optimal assignment.  ... 
doi:10.1609/aaai.v28i1.9128 fatcat:6jt73h56onfz3l7yytyedbyotu

Symmetry Breaking for Maximum Satisfiability [article]

Joao Marques-Silva, Ines Lynce, Vasco Manquinho
2008 arXiv   pre-print
, weighted MaxSAT and weighted partial MaxSAT.  ...  As with SAT and PB, symmetry breaking predicates for MaxSAT and variants are shown to be effective for a representative number of problem domains, allowing solving problem instances that current state  ...  The interest in MaxSAT and variants motivated the development of a new generation of MaxSAT algorithms, remarkably more efficient than early MaxSAT algorithms [19, 4] .  ... 
arXiv:0804.0599v1 fatcat:ztpiet5xkvcddmx55lpwbd7zha

Solving (Weighted) Partial MaxSAT through Satisfiability Testing [chapter]

Carlos Ansótegui, María Luisa Bonet, Jordi Levy
2009 Lecture Notes in Computer Science  
We prove the correctness of our algorithm and compare our solver with other (Weighted) MaxSAT and (Weighted) Partial MaxSAT solvers.  ...  Recently, Fu and Malik described an unweighted Partial MaxSAT solver based on successive calls to a SAT solver.  ...  Acknowledgements We especially thank Armin Biere for the insightful discussions about his SAT solver picosat. We would also like to thank the organizers of the MaxSAT evaluations.  ... 
doi:10.1007/978-3-642-02777-2_39 fatcat:fxq2bghmjregzorxd3faltproe

Improving Unsatisfiability-Based Algorithms for Boolean Optimization [chapter]

Vasco Manquinho, Ruben Martins, Inês Lynce
2010 Lecture Notes in Computer Science  
Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfiability (MaxSAT) and other Boolean Optimization problems.  ...  This paper proposes the use of Pseudo-Boolean Optimization (PBO) solvers as a preprocessor for unsatisfiability-based algorithms in order to increase its robustness.  ...  As a result, our solver is now competitive with dedicated algorithms for the partial MaxSAT problem.  ... 
doi:10.1007/978-3-642-14186-7_16 fatcat:nfq3r2kzqvhi7gkce5bosqk2pa

On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving

Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce
2015 Journal on Satisfiability, Boolean Modeling and Computation  
This paper describes how to implement incremental unsatisfiability-based algorithms for MaxSAT.  ...  In recent years, unsatisfiability-based algorithms have become prevalent as state of the art for solving industrial instances of Maximum Satisfiability (MaxSAT).  ...  Acknowledgments This work is partially supported by the ERC project 280053, Fundação para a Ciência e a Tecnologia (FCT) grant POLARIS (PTDC/EIA-CCO/123051/2010), and national funds through FCT with reference  ... 
doi:10.3233/sat190102 fatcat:4dzjdjr2bvckhpn3a2wrvstmmm

Boolean lexicographic optimization: algorithms & applications

Joao Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce
2011 Annals of Mathematics and Artificial Intelligence  
The proposed algorithms build on existing algorithms for either Maximum Satisfiability (MaxSAT), Pseudo-Boolean Optimization (PBO), or Integer Linear Programming (ILP).  ...  of the art MaxSAT, PBO and ILP algorithms.  ...  Well-known variants of the MaxSAT problem include weighted MaxSAT, partial MaxSAT and weighted partial MaxSAT [36] .  ... 
doi:10.1007/s10472-011-9233-2 fatcat:2mhgwr4skbestjaktr7rwxve4y

RC2: an Efficient MaxSAT Solver

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
RC2 is the acronym for Relaxable Cardinality Constraints and extends a MaxSAT algorithm based on relaxable cardinality constraints first proposed in [19]. 2. A.  ...  Based on this fact and motivated by the ideas underlying the PySAT toolkit, this paper describes and evaluates RC2 (stands for relaxable cardinality constraints), a new core-guided MaxSAT solver written  ...  The pseudo-code of the RC2 MaxSAT algorithm is presented in Algorithm 1. The algorithm takes as input a partial MaxSAT formula F.  ... 
doi:10.3233/sat190116 fatcat:3ecpgboo6rbk7mepq7rqjetluy

Symmetry Breaking for Maximum Satisfiability [chapter]

Joao Marques-Silva, Inês Lynce, Vasco Manquinho
2008 Lecture Notes in Computer Science  
, weighted MaxSAT and weighted partial MaxSAT.  ...  As with SAT and PB, symmetry breaking predicates for MaxSAT and variants are shown to be effective for a representative number of problem domains, allowing solving problem instances that current state  ...  This work is partially supported by EPSRC grant EP/E012973/1, by EU grants IST/033709 and ICT/217069, and by FCT grants POSC/EIA/61852/2004 and PTDC/EIA/76572/2006.  ... 
doi:10.1007/978-3-540-89439-1_1 fatcat:brpw2m5bvjaujgoix566ncxh2q

Tailoring Local Search for Partial MaxSAT

Shaowei Cai, Chuan Luo, John Thornton, Kaile Su
2014 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Partial MaxSAT (PMS) is a generalization to SAT and MaxSAT. Many real world problems can be encoded into PMS in a more natural and compact way than SAT and MaxSAT.  ...  In this paper, we propose new ideas for local search for PMS, which mainly rely on the distinction between hard and soft clauses.  ...  It is natural to extend our method to weighted partial MaxSAT.  ... 
doi:10.1609/aaai.v28i1.9109 fatcat:zlgvhieqbvh43dttueccbqo6we

SAT-based MaxSAT algorithms

Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
2013 Artificial Intelligence  
In particular, our solvers won the 2009 partial MaxSAT and the 2011 weighted partial MaxSAT industrial categories of the MaxSAT evaluation. We prove the correctness of all our algorithms.  ...  We also present a complete experimental study comparing the performance of our algorithms with latest MaxSAT solvers.  ...  than w max , then Algorithm 4 is a correct algorithm for Weighted Partial MaxSAT.  ... 
doi:10.1016/j.artint.2013.01.002 fatcat:qexoazzicfadlkeyimlub3lnpq
« Previous Showing results 1 — 15 out of 668 results