{"title":"用于调试基于规则的系统的历史远程网络","authors":"Sharon M. Tuttle, C. Eick","doi":"10.1109/TAI.1991.167127","DOIUrl":null,"url":null,"abstract":"To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run's 'historical' details in its Rete inference network, used to match rule conditions to working memory, without seriously affecting the network's run-time performance. This proposed modified Rete network is called a historical Rete network. Various algorithms for maintaining this network are discussed, along with how it can be used to analyze what happened during a program run.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Historical Rete networks for debugging rule-based systems\",\"authors\":\"Sharon M. Tuttle, C. Eick\",\"doi\":\"10.1109/TAI.1991.167127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run's 'historical' details in its Rete inference network, used to match rule conditions to working memory, without seriously affecting the network's run-time performance. This proposed modified Rete network is called a historical Rete network. Various algorithms for maintaining this network are discussed, along with how it can be used to analyze what happened during a program run.<<ETX>>\",\"PeriodicalId\":371778,\"journal\":{\"name\":\"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"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.167127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.167127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Historical Rete networks for debugging rule-based systems
To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run's 'historical' details in its Rete inference network, used to match rule conditions to working memory, without seriously affecting the network's run-time performance. This proposed modified Rete network is called a historical Rete network. Various algorithms for maintaining this network are discussed, along with how it can be used to analyze what happened during a program run.<>