Theory and Applications of Satisfiability Testing

DOI10.1007/B137280MaRDI QIDQ5713725zbMATH OpenOpenAlexFDO

Authors Teresa Alsinet, Felip Manya, Jordi Planes

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An efficient solver for weighted Max-SAT
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Improved exact algorithms for MAX-SAT
• scientific article; zbMATH DE number 2086240
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Minimaxsat: an efficient weighted Max-SAT solver
• Improved exact algorithms for mildly sparse instances of MAX SAT
• Improved exact algorithms for mildly sparse instances of MAX SAT

Cited in

(14)

• Resolution for Max-SAT
• Dynamic polynomial watchdog encoding for solving weighted MaxSAT
• A logical approach to efficient Max-SAT solving
• Solving the weighted MAX-SAT problem using the dynamic convexized method
• Exact Max-SAT solvers for over-constrained problems
• scientific article; zbMATH DE number 1629855 (Why is no real title available?)
• Modelling Max-CSP as Partial Max-SAT
• A Preprocessor for Max-SAT Solvers
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
• Exact algorithms for MAX-SAT
• Boosting branch-and-bound MaxSAT solvers with clause learning
• Improving exact algorithms for MAX-2-SAT

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713725)