人工智能论文英文版-Integer Linear Programming Preprocessing for Maximum Satisfiability.pdfVIP

IntegerLinearProgrammingPreprocessingfor

MaximumSatisfiability

JialuZhang

LaboratoireMISUR4290,UniversitédePicardieJulesVerne,Amiens,France

Chu-MinLi

LaboratoireMISUR4290,UniversitédePicardieJulesVerne,Amiens,France

SamiCherif

LaboratoireMISUR4290,UniversitédePicardieJulesVerne,Amiens,France

ShuolinLi

AixMarseilleUniv,UniversitédeToulon,CNRS,LIS,Marseille,France

ZhifeiZheng

5LaboratoireMISUR4290,UniversitédePicardieJulesVerne,Amiens,France

2

0Abstract

2

nTheMaximumSatisfiabilityproblem(MaxSAT)isamajoroptimizationchallengewithnumerous

upracticalapplications.InrecentMaxSATevaluations,mostMaxSATsolvershaveadoptedanILP

Jsolveraspartoftheirportfolios.ThispaperinvestigatestheimpactofIntegerLinearProgramming

6(ILP)preprocessingtechniquesonMaxSATsolving.ExperimentalresultsshowthatILPprepro-

cessingtechniqueshelpWMaxCDCL-OpenWbo1200,thewinneroftheMaxSATevaluation2024

]

Iintheunweightedtrack,solve15additionalinstances.Moreover,currentstate-of-the-artMaxSAT

AsolversheavilyuseanILPsolverintheirportfolios,whileourproposedapproachreducestheneed

.tocallanILPsolverinaportfolioincludingWMaxCDCLorMaxCDCL.

s

c

[2012ACMSubjectClassificationTheoryofcomputation→Constraintandlogicprogramming

1KeywordsandphrasesMaximumSatisfiability,ILP,Preprocessing.

v

6

11Introduction

2

6

0MaximumSatisfiability(MaxSAT)isanaturaloptimizationextensionofthePropositi