Complexity Classifications for复杂度分类

Complexity Classifications for复杂度分类

ID:39065560

大小:466.93 KB

页数:26页

时间:2019-06-24

Complexity Classifications for复杂度分类_第1页
Complexity Classifications for复杂度分类_第2页
Complexity Classifications for复杂度分类_第3页
Complexity Classifications for复杂度分类_第4页
Complexity Classifications for复杂度分类_第5页
资源描述:

《Complexity Classifications for复杂度分类》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、ComplexityClassificationsforPropositionalAbductioninPost’sFramework∗NadiaCreignou1,JohannesSchmidt1,MichaelThomas21LIF,UMRCNRS6166,Aix-MarseilleUniversit´e163,AvenuedeLuminy,13288MarseilleCedex9,Francecreignou@lif.univ-mrs.frjohannes.schmidt@lif.univ-mrs.fr2Institutf¨urTheoretischeInformat

2、ik,GottfriedWilhelmLeibnizUniversit¨atAppelstr.4,30167Hannover,Germanythomas@thi.uni-hannover.deAbstract.Inthispaperweinvestigatethecomplexityofabduction,afundamentalandimportantformofnon-monotonicreasoning.Givenaknowledgebaseexplainingtheworld’sbehavioritaimsatfindinganexplanationforsomeo

3、bservedmanifestation.Inthispaperweconsiderpropositionalabduction,wheretheknowledgebaseandthemanifesta-tionarerepresentedbypropositionalformulae.TheproblemofdecidingpwhetherthereexistsanexplanationhasbeenshowntobeΣ2-completeingeneral.Wefocusonformulaeinwhichtheallowedconnectivesaretakenfro

4、mcertainsetsofBooleanfunctions.Weconsiderdifferentvari-antsoftheabductionprobleminrestrictingboththemanifestationsandthehypotheses.Forallthesevariantsweobtainacomplexityclassifica-tionforallpossiblesetsofBooleanfunctions.Inthisway,weidentifyeasiercases,namelyNP-complete,coNP-completeandpoly

5、nomialcases.Thus,wegetadetailedpictureofthecomplexityofthepropositionalabductionproblem,hencehighlightingsourcesofintractability.Further,weaddresstheproblemofcountingtheexplanationsanddrawacom-pletepictureforthecountingcomplexity.Keywords:abduction,computationalcomplexity,Post’slattice,pr

6、opo-sitionallogic,booleanconnectivearXiv:1006.4923v1[cs.CC]25Jun2010∗SupportedbyANRAlgorithmsandcomplexity07-BLAN-0327-04andDFGgrantVO630/6-1.AnearlierversionappearedintheProc.of12thInternationalConferenceonthePrinciplesofKnowledgeRepresentationandReasoning,KR’2010,Toronto,Canada.1Introdu

7、ctionThispaperisdedicatedtothecomputationalcomplexityofabduction,afunda-mentalandimportantformofnon-monotonicreasoning.Givenacertainconsis-tentknowledgeabouttheworld,abductivereasoningisusedtogenerateexplana-tions(oratleasttellingifthereisone)forobservedmanifestatio

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

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

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