NDLI: Local Max-Resolution in Branch and Bound Solvers for Max-SAT

Content Provider	IEEE Xplore Digital Library
Author	Abrame, A. Habet, D.
Copyright Year	2014
Description	Author affiliation: LSIS, Aix-Marseille Univ., Marseille, France (Abrame, A.; Habet, D.)
Abstract	One of the most critical components of Branch & Bound (BnB) solvers for Max-SAT is the estimation of the lower bound. At each node of the search tree, they detect inconsistent subsets (IS) of the formula by unit propagation based methods and apply a treatment on them. Depending on the structure of the IS, current best performing BnB solvers transform them by several max-resolution steps and keep the changes in the sub-part of the sub tree or simply remove the clauses of these subsets from the formula and restore them before the next decision. The formula obtained after this last treatment is not equivalent to the original one and the number of detectable remaining inconsistencies may be reduced. In this paper, instead of applying such a removal, we propose to fully exploit all the inconsistent subsets by applying the well-known max-resolution inference rule to transform them locally in the current node of the search tree. The expected benefits of this transformation are an accurate lower bound estimation and the reduction of the number of decisions needed to solve an instance. We show experimentally the interest of our approach on weighted and unweighted Max-SAT instances and discuss the obtained results.
Starting Page	336
Ending Page	343
File Size	963884
Page Count	8
File Format	PDF
ISBN	9781479965724
ISSN	10823409
DOI	10.1109/ICTAI.2014.58
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-11-10
Publisher Place	Cyprus
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Estimation Pattern matching Transforms Conferences Artificial intelligence Large scale integration Search problems Max-resolution Max-SAT Branch and Bound Lower Bound
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Inference Rules in Local Search for Max-SAT

The impact of max-sat resolution-based preprocessors on local search solvers.

Study of lower bound functions for max-2-sat.

Learning in Local Search

Enhancing the Robustness/Efficiency of Local Search Algorithms for SAT

Study of lower bound functions for max-2-sat (2004)

Within-problem learning for efficient lower bound computation in max-sat solving (2008).

Local Search with Configuration Checking for SAT

A Two Level Local Search for MAX-SAT Problems With Hard and Soft Constraints (2002)

Local Max-Resolution in Branch and Bound Solvers for Max-SAT

Similar Documents

Inference Rules in Local Search for Max-SAT

The impact of max-sat resolution-based preprocessors on local search solvers.

Study of lower bound functions for max-2-sat.

Learning in Local Search

Enhancing the Robustness/Efficiency of Local Search Algorithms for SAT

Study of lower bound functions for max-2-sat (2004)

Within-problem learning for efficient lower bound computation in max-sat solving (2008).

Local Search with Configuration Checking for SAT

A Two Level Local Search for MAX-SAT Problems With Hard and Soft Constraints (2002)

Local Max-Resolution in Branch and Bound Solvers for Max-SAT