计算机科学中的逻辑

计算机科学中的逻辑

ID:34122227

大小:719.87 KB

页数:41页

时间:2019-03-03

计算机科学中的逻辑_第1页
计算机科学中的逻辑_第2页
计算机科学中的逻辑_第3页
计算机科学中的逻辑_第4页
计算机科学中的逻辑_第5页
资源描述:

《计算机科学中的逻辑》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、LogicinComputerScienceYongmeiLiuymliu@mail.sysu.edu.cnDept.ofComputerScienceSunYat-senUniversityDecember14,2009Y.LiuLogicinComputerScience1/41IntroductionandoutlineFocusonapplicationsoflogicincomputerScience1SATsolversandapplications2Programveri cation3Modelchecking4CognitiveroboticsY.LiuLogicin

2、ComputerScience2/41AmotivatingexampleWewouldliketoselectpeoplefromAnn,Bob,CarolandDanforacertainjob.Thefollowingconstraintsmustbesatis ed:BoborCarolshouldbeselectedAnnandDancannotbebothselectedIfBobisselected,DanshouldalsobeselectedHowshouldweselectthepeople?(b_c)^(:a_:d)^(:b_d)fB;DgWhatifwehave

3、manypeopleandmanyconstraints?Y.LiuLogicinComputerScience3/41WhatisSAT?AliteralisanatomorthenegationofanatomAclauseisadisjunctionofliteralsAformulaisinConjunctiveNormalForm(CNF)ifitisaconjunctionofclausesExample:(b_c)^(:a_:d)^(:b_d)SAT:GivenapropositionalformulainCNF,decideifthereexistsatruthassi

4、gnmentthatsatis estheformulaY.LiuLogicinComputerScience4/41TimecomplexityofalgorithmsExpressedintermsofthenumberofoperationsusedDecideifatruthassignmentsatis esaCNFformula:O(m)NaivealgorithmtosolveSAT:O(2nm)n{thenumberofatoms,m{thelengthoftheformulaThecomputertimeusedbyalgorithms*:morethan10100y

5、earsY.LiuLogicinComputerScience5/41Pvs.NPP:theclassofproblemsforwhichthereexistsaprocedurethatrunsinpolynomialtimeO(nb)Example:decideifatruthassignmentsatis esaformulaNP:theclassofproblemswherewearesearchingforaniteminalargespaceofpossibilities,butwherewecantestifacandidateitemisasolutioninpolyn

6、omialtimeExample:decideifapropositionalformulaissatis ableP=NP?OneofthesevenMillenniumPrizeProblemsselectedbytheClayMathematicsInstitutetocarryaUS$1,000,000prizeforthe rstcorrectsolution.ItisgenerallyacceptedthatP6=NPY.LiuLogicinComputerScience6/41NPCompletenessAproblemisNP-completeifitisinNPand

7、anyprobleminNPcanbereducedtoitinpolynomialtimeifanyNP-completeproblemisinP,thenP=NPSATisaclassicalNP-completeproblem,soanyprobleminNPcanbereducedtoSATinpolytimeTherearethousandsofcomputationalproblemsofeconomicsigni cancetha

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

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

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