Theory and Applications of Satisfiability Testing

DOI10.1007/b137280zbMath1124.68429OpenAlexW2497844642MaRDI QIDQ5713725

Felip Manyà, Teresa Alsinet, 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

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

Related Items (11)

A logical approach to efficient Max-SAT solving ⋮ Modelling Max-CSP as Partial Max-SAT ⋮ A Preprocessor for Max-SAT Solvers ⋮ A Max-SAT Inference-Based Pre-processing for Max-Clique ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ On Inconsistent Clause-Subsets for Max-SAT Solving ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ Exact Algorithms for MAX-SAT ⋮ Exact Max-SAT solvers for over-constrained problems ⋮ Resolution for Max-SAT ⋮ Improving exact algorithms for MAX-2-SAT

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