{"title":"Termination of well-moded programs","authors":"S. Etalle , A. Bossi , N. Cocco","doi":"10.1016/S0743-1066(98)10025-0","DOIUrl":null,"url":null,"abstract":"<div><p>We study the termination properties of <em>well-moded</em> programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization-in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150–176-of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"38 2","pages":"Pages 243-257"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(98)10025-0","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Logic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0743106698100250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39
Abstract
We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization-in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150–176-of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check.