{"title":"逻辑程序的自顶向下缩放诊断","authors":"Machi Ueno, T. Kanamori","doi":"10.1142/9789814360128_0006","DOIUrl":null,"url":null,"abstract":"This paper presents a new diagnosis algorithm for Prolog proglams. Bugs are located by tracing either proof trees or search trees in a top-down Human programmers just need to answer “Yes” or “No” for queries issued durin the to -d queries about atoms with the same pIedicates are issued contirrually so that not onl $g$ $e$ op- own tracing. Moreover, containing bugs ar identified more quickly but also queries are easier for hu no on $y$ segments to answer. An outline of an implementation of the diagnosis algorithm is shown as $we \\mathbb{I}$ .","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"182 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Top-down Zooming Diagnosis of Logic Programs\",\"authors\":\"Machi Ueno, T. Kanamori\",\"doi\":\"10.1142/9789814360128_0006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new diagnosis algorithm for Prolog proglams. Bugs are located by tracing either proof trees or search trees in a top-down Human programmers just need to answer “Yes” or “No” for queries issued durin the to -d queries about atoms with the same pIedicates are issued contirrually so that not onl $g$ $e$ op- own tracing. Moreover, containing bugs ar identified more quickly but also queries are easier for hu no on $y$ segments to answer. An outline of an implementation of the diagnosis algorithm is shown as $we \\\\mathbb{I}$ .\",\"PeriodicalId\":313959,\"journal\":{\"name\":\"Software Science and Engineering\",\"volume\":\"182 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Software Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789814360128_0006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Software Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789814360128_0006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a new diagnosis algorithm for Prolog proglams. Bugs are located by tracing either proof trees or search trees in a top-down Human programmers just need to answer “Yes” or “No” for queries issued durin the to -d queries about atoms with the same pIedicates are issued contirrually so that not onl $g$ $e$ op- own tracing. Moreover, containing bugs ar identified more quickly but also queries are easier for hu no on $y$ segments to answer. An outline of an implementation of the diagnosis algorithm is shown as $we \mathbb{I}$ .