Analysis and solving SAT and MAX-SAT problems using an L-partition approach

DOI10.1007/S10852-012-9202-8MaRDI QIDQ367248zbMATHOpenAlexFDO

Authors A. A. Kolokolov, Alexander Adelshin, Darya Yagofarova

Publication date 26 September 2013

Published in Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-012-9202-8

zbMATH Keywords

integer linear programming\(L\)-class enumeration\(L\)-partition approachsatisfiability problem

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• On Solving the Partial MAX-SAT Problem
• Exploiting resolution-based representations for MaxSAT solving
• Linear programs for constraint satisfaction problems
• Publication:5150565

Cites work

• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 1840376 (Why is no real title available?)
• scientific article; zbMATH DE number 956857 (Why is no real title available?)
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Algorithms for the maximum satisfiability problem
• Discrete optimization with logical constraints for design of complex products
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• Learning action models from plan examples using weighted MAX-SAT
• The complexity of theorem-proving procedures
• The set covering problem: Complexity, algorithms, experiments

Cited in

(6)

• Community-Based Partitioning for MaxSAT Solving
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
• ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
• Solving #SAT and MAXSAT by Dynamic Programming
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition

This page was built for publication: Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach

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