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

DOI10.1007/S10852-012-9202-8zbMATH Open1311.90078OpenAlexW2050768939MaRDI QIDQ367248FDOQ367248

A. 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

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of theorem-proving procedures
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Discrete optimization with logical constraints for design of complex products
• Learning action models from plan examples using weighted MAX-SAT
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• The set covering problem: Complexity, algorithms, experiments
• Algorithms for the maximum satisfiability problem

Cited In (6)

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

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)