Extending Horn clause theories by reflection principles.pdfVIP

下载本文档

0
0
约3.53万字
约 17页
2017-04-13 发布于江苏
举报
版权申诉

Extending Horn clause theories by reflection principles.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Extending Horn clause theories by reflection principles

UPMAIL Technical Report No. 9520 January, 1995 Extending Horn Clause Theoriesby Re ection PrinciplesStefania Costantini, Pierangelo DellAcquaand Gaetano A. LanzaroneUppsala UniversityComputing Science DepartmentBox 311, S-751 05 Uppsala, SwedenPhone: +481818 25 00Fax: +461851 19 25AbstractIn this paper, we introduce logical re ection as a principled way toempower the representation and reasoning capabilities of logic pro-gramming systems. In particular, re ection principles take the role ofaxiom schemata of a particular form that, once added to a given logicprogram (the basic theory, or the initial axioms), enlarge the set ofconsequences sanctioned by those initial axioms. The main advantageof this approach is that it is much easier to write a basic theory andthen to augment it with condensed axiom schemata, than it is to writea corresponding large (or even in nite) set of axioms in the rst place.Moreover, the well-established semantic properties of Horn clauses,carry over to Horn clauses with re ection. In fact, the semantics ofRe ective SLD Resolution and the semantics of the Re ective LeastHerbrand Model are obtained by making slight variations to, respec-tively, the procedural and the declarative semantics classically de nedfor Horn clauses. We present a complete formalization of this conceptof re ection, that should constitute a simple way of understanding re- ective programs; and a description of how re ection allows one totreat uniformly dierent application areas. To support this claim, thefollowing three case studies will be discussed: metalevel reasoning; rea-soning with multiple communicating theories (agents); and analogicalreasoning. For each of these areas, the choice of a suitable re ectionprinciple is shown, which tries to capture the speci city of the problemdomain.Dipartimento di Scienze dellInformazione, Universita degli Studi di Milano 1 IntroductionLogic programming languages have proved to be powerful means for knowl-edge representatio