Satisfiability Checking满足能力的检验

Satisfiability Checking满足能力的检验

ID:39066158

大小:518.06 KB

页数:16页

时间:2019-06-24

Satisfiability Checking满足能力的检验_第1页
Satisfiability Checking满足能力的检验_第2页
Satisfiability Checking满足能力的检验_第3页
Satisfiability Checking满足能力的检验_第4页
Satisfiability Checking满足能力的检验_第5页
资源描述:

《Satisfiability Checking满足能力的检验》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、SatisfiabilityChecking:TheoryandApplicationsErikaAbrah´´am(B)andGereonKremerRWTHAachenUniversity,Aachen,Germanyabraham@cs.rwth-aachen.deAbstract.Satisfiabilitycheckingaimstodevelopalgorithmsandtoolsforcheckingthesatisfiabilityofexistentiallyquantifiedlogicalformu-las.

2、BesidespowerfulSATsolversforsolvingpropositionallogicformu-las,sophisticatedSAT-modulo-theories(SMT)solversareavailableforawiderangeoftheories,andareappliedasblack-boxenginesformanytechniquesindifferentareas.Inthispaperwegiveashortintroductiontothetheoreticalfounda

3、tionsofsatisfiabilitychecking,mentionsomeofthemostpopulartools,anddiscussthesuccessfulembeddingofSMTsolversindifferenttechnologies.1IntroductionFirst-order-logicisapowerfulmodellingformalismfrequentlyusedtospecifyproblemsindifferentareaslikeverification,terminationana

4、lysis,testcasegen-eration,controllersynthesis,equivalencechecking,combinatorialtasks,schedul-ing,planning,andproductdesignautomationandoptimisation,justtomentionafewwell-knownexamples.Oncetheproblemisformalised,algorithmsandtheirimplementationsareneededtocheckthev

5、alidityorsatisfiabilityoftheformulas,andincasetheyaresatisfiable,toidentifysatisfyingsolutions.Algorithmstosolvethisproblemarecalleddecisionprocedures.Inmathematicallogic,intheearly20thcenturysomenoveldecisionpro-ceduresweredevelopedforarithmetictheories.Withtheadve

6、ntofcomputersystems,bigeffortsweremadetoprovideautomatedsolutionsinformofprac-ticallyfeasibleimplementationsofdecisionprocedures.Intheareaofsymboliccomputation,thisdevelopmentledtocomputeralgebrasystemssupportingallkindsofscientificcomputations.Anotherlineofresearch

7、,satisfiabilitychecking[10],startedtofocusonthemorespecificaimofcheckingthesatisfiabilityofexistentiallyquantifiedlogicalformulas.ForBooleanpropositionallogic,whichisknowntobeNP-complete,inthelate’90simpressiveprogresswasmadeintheareaofsatisfiabilitychecking,resultingi

8、npowerfulSATsolvers.Thefirstideausedresolutionforquanti-fierelimination[30],butithadseriousproblemswiththeexplosionofthememoryrequirementswithincreasingpr

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。