A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
Abdesslem Layeb
International Journal of Operational Research, 2013, vol. 17, issue 4, 509-525
Abstract:
The maximum satisfiability problem (Max-Sat) is one of the most known variant of satisfiability problems. The objective is to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-complete if the number of variable per clause is higher than 3. In this paper, a new incomplete algorithm based on a greedy randomised adaptive search procedure (GRASP) is presented to deal with Max 3-Sat problem. The first GRASP's phase is a new greedy algorithm based on iterative application of a new version of pure literal elimination technique called weighted literal elimination. In the next stage of the GRASP algorithm, a modified version of the Walksat procedure is applied using, as initial solutions, the solutions found by the greedy procedure of the GRASP algorithm. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed approach.
Keywords: maximum satisfiability; local search; GRASP unit propagation; greedy randomised adaptive search procedure. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=54970 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:17:y:2013:i:4:p:509-525
Access Statistics for this article
More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().