Filters








12 Hits in 3.1 sec

MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

Zhao Xing, Weixiong Zhang
2005 Artificial Intelligence  
Based on the analysis of these strategies, we develop an exact solver for both max-SAT and weighted max-SAT.  ...  A branch and bound algorithm based on the Davis-Putnam-Logemann-Loveland procedure (DPLL) is one of the most competitive exact algorithms for solving max-SAT.  ...  Acknowledgements Many thanks to Zhongsheng Guo for an early implementation of the DPLL algorithm, to Fadi Aloul, Javier Larrosa, Haiou Shen, and Jordi Plane for making their programs available to us for  ... 
doi:10.1016/j.artint.2005.01.004 fatcat:fgkgu3q2tbeo3kgsoicdh4gs7q

An Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting

Zhao Xing
2004
As unit propaga-tion is a very efficient strategy for SAT, we show that it can be extended to max-SAT, and can greatly improve the performance of an extended DPLL-based algorithm.  ...  As unit propaga-tion is a very efficient strategy for SAT, we show that it can be extended to max-SAT, and can greatly improve the performance of an extended DPLL-based algorithm.  ...  We would like to thank Zhongsheng Guo for an early implementation of the DPLL algorithm.  ... 
doi:10.7936/k7bk19qq fatcat:fj3sif5tbndt7ilhgyhds2foae

An efficient solver for weighted Max-SAT

Teresa Alsinet, Felip Manyà, Jordi Planes
2007 Journal of Global Optimization  
We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality.  ...  We provide experimental evidence that our solver is very competi-3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide range of instances. 5  ...  Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36, Pretolani, D.: Efficiency and stability of hypergraph SAT algorithms.  ... 
doi:10.1007/s10898-007-9166-9 fatcat:lk6fbxowgbgkdcrdexiqn5wkku

The Power of Semidefinite Programming Relaxations for MAX-SAT [chapter]

Carla P. Gomes, Willem-Jan van Hoeve, Lucian Leahu
2006 Lecture Notes in Computer Science  
SDP relaxations can also be computed very efficiently, thus quickly providing tight lower and upper bounds on the optimal solution.  ...  We compare Semidefinite Programming (SDP) based relaxations with LP relaxations for MAX-2-SAT.  ...  Xing and Zhang developed MaxSolver ( [3] ), an efficient exact algorithm for (weighted) MAX-SAT.  ... 
doi:10.1007/11757375_10 fatcat:zf7a7cushnfajpqr5kfawpvm3u

A Logical Approach to Efficient Max-SAT solving [article]

Javier Larrosa, Federico Heras, Simon de Givry
2006 arXiv   pre-print
Besides, we introduce an original search algorithm that performs a restricted amount of weighted resolution at each visited node.  ...  Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques.  ...  In recent years, there has been a considerable effort in finding efficient exact algorithms. These works can be divided into theoretical [8, 9, 10] and empirical [11, 12, 13, 14] .  ... 
arXiv:cs/0611025v1 fatcat:qcyhq5zgdbandhc3wygqre7noi

A logical approach to efficient Max-SAT solving

Javier Larrosa, Federico Heras, Simon de Givry
2008 Artificial Intelligence  
We also introduce an original search algorithm that performs a restricted amount of weighted resolution at each visited node.  ...  Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques.  ...  In recent years, there has been a considerable effort in finding efficient exact algorithms. These works can be divided into theoretical [8] [9] [10] and empirical [11] [12] [13] [14] [15] .  ... 
doi:10.1016/j.artint.2007.05.006 fatcat:5f7cdt55xbfzthcccr2zdpywmm

New Inference Rules for Max-SAT

C. M. Li, F. Manya, J. Planes
2007 The Journal of Artificial Intelligence Research  
Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent  ...  to solving it for the original formula.  ...  Finally, we would like to thank the referees for their detailed comments and suggestions.  ... 
doi:10.1613/jair.2215 fatcat:a4cjpscihbb3thzdmsfcm7a6ny

Quartet-Based Phylogeny Reconstruction with Answer Set Programming

Gang Wu, Jia-huai You, Guohui Lin
2007 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
In this paper, a new representation is presented for the Maximum Quartet Consistency (MQC) problem, where solving the MQC problem becomes searching for an ultrametric matrix that satisfies a maximum number  ...  A number of structural properties of the MQC problem in this new representation are characterized, through formulating into answer set programming, a recent powerful logic programming tool for modeling  ...  Figure 8 : 8 The running times of three exact algorithms for the MQC problem.  ... 
doi:10.1109/tcbb.2007.1008 pmid:17277421 fatcat:3z7wrpy5aresbgrlvftwechzdq

Semidefinite Programming and Constraint Programming [chapter]

Willem-Jan van Hoeve
2011 International Series in Operations Research and Management Science  
I would like to thank Stefano Gualandi for helpful comments on an earlier draft of the chapter.  ...  The maximum weighted stable set problem asks to find a subset of vertices with maximum total weight, such that no two vertices in this subset share an edge.  ...  In Figure 5 .a, 84% of the variables are fixed according to the heuristic, and the exact solver Maxsolver is used to compute an optimal solution, completing the partial assignment.  ... 
doi:10.1007/978-1-4614-0769-0_22 fatcat:y6v2du6qyfeu7dms2lbvrohlaa

Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes

Laurence Smith, John Chinneck, Victor Aitken
2013 Optimization Methods and Software  
A new inter-point distance frequency distribution technique is used to determine the critical distance for the single linkage clustering algorithm, which in turn determines the estimated number of disjoint  ...  The effectiveness of multistart global optimization is increased due to better exploration of the variable space, and efficiency is also increased because the expensive local solver is launched just once  ...  An Efficient Algorithm for Choosing Multi-Start Local Solver Launch Points The main steps in the algorithm for selecting local solver launch points are: (1) Initial Sample (Fig. 2a) .  ... 
doi:10.1080/10556788.2011.647818 fatcat:5izkjbwywjhmhadgzypk4gdcje

Quartet based phylogeny reconstruction with answer set programming

G. Wu, Guohui Lin, Jia-Huai You
16th IEEE International Conference on Tools with Artificial Intelligence  
In this paper, a new representation is presented for the Maximum Quartet Consistency (MQC) problem, where solving the MQC problem becomes searching for an ultrametric matrix that satisfies a maximum number  ...  A number of structural properties of the MQC problem in this new representation are characterized, through formulating into answer set programming, a recent powerful logic programming tool for modeling  ...  Figure 8 : 8 The running times of three exact algorithms for the MQC problem.  ... 
doi:10.1109/ictai.2004.103 dblp:conf/ictai/WuLY04 fatcat:weyhkuat5ngwdhe3c2staro7ga

New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences

Gabriel Tavares
2008
First, there is an algorithmic aspect that tells how to preprocess the problem, how to find heuristics, how to get improved bounds and how to solve the problem with all the above ingredients.Second, there  ...  in polynomial time by a maximum flow followed by the computation of the strong components of a network that has 2n+2 nodes, where n is the number of variables.  ...  Benchmark families Borchers and Furman [47] proposed an exact algorithm for (weighted) MAX-SAT, and tested this solver in a set of random (weighted) MAX-2-SAT problems.  ... 
doi:10.7282/t3xk8fs2 fatcat:q4wvuff66bgidcykqks3o477pq