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

DOI10.1007/s10852-012-9202-8zbMath1311.90078OpenAlexW2050768939MaRDI QIDQ367248

Alexander A. Kolokolov, Darya Yagofarova, Alexander Adelshin

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

satisfiability probleminteger linear programming\(L\)-class enumeration\(L\)-partition approach

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH ⋮ ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM

Cites Work

• Algorithms for the maximum satisfiability problem
• Discrete optimization with logical constraints for design of complex products
• Learning action models from plan examples using weighted MAX-SAT
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item