{"title":"Preventing infinite looping in Prolog","authors":"J. Han","doi":"10.1109/TAI.1991.167044","DOIUrl":null,"url":null,"abstract":"A method is proposed to modify Prolog compilers so that infinite looping can often be avoided in recursive Prolog programs. The study is carried out in the context of deductive databases. Termination of recursive query processing here is related to boundedness: uniform boundedness and extensional boundedness. Limitations of this method are briefly discussed.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A method is proposed to modify Prolog compilers so that infinite looping can often be avoided in recursive Prolog programs. The study is carried out in the context of deductive databases. Termination of recursive query processing here is related to boundedness: uniform boundedness and extensional boundedness. Limitations of this method are briefly discussed.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
