scientific article
From MaRDI portal
Publication:3624095
zbMath1182.68254arXiv1111.0040MaRDI QIDQ3624095
Felip Manyà, Jordi Planes, Chu-Min Li
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1111.0040
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A novel algorithm for Max Sat calling MOCE to order, New local search methods for partial MaxSAT, A logical approach to efficient Max-SAT solving, Model-lite planning: case-based vs. model-based approaches, Solving satisfiability problems with preferences, Resolution-based lower bounds in MaxSAT, A new upper bound for Max-2-SAT: A graph-theoretic approach, MaxSAT resolution for regular propositional logic, Boosting branch-and-bound MaxSAT solvers with clause learning, Boolean lexicographic optimization: algorithms \& applications, CHAMP: a multipass algorithm for Max Sat based on saver variables, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Go-MOCE: greedy order method of conditional expectations for Max Sat, Incomplete inference for graph problems, On Inconsistent Clause-Subsets for Max-SAT Solving, An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem, Learning hierarchical task network domains from partially observed plan traces, Breaking Cycle Structure to Improve Lower Bound for Max-SAT, Resizing cardinality constraints for MaxSAT, On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes, About some UP-based polynomial fragments of SAT, Exploiting subproblem optimization in SAT-based maxsat algorithms, Iterated local search with Trellis-neighborhood for the partial Latin square extension problem, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Optimizing with minimum satisfiability, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, Understanding the power of Max-SAT resolution through up-resilience, Solving (Weighted) Partial MaxSAT through Satisfiability Testing, Exploiting Cycle Structures in Max-SAT, Algorithms for Weighted Boolean Optimization, Using the method of conditional expectations to supply an improved starting point for CCLS, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver, Iterative and core-guided maxsat solving: a survey and assessment, Proofs and Certificates for Max-SAT, A proof builder for Max-SAT, A refined branching algorithm for the maximum satisfiability problem
