测量基于OPS5规则的程序的结构复杂性

A. Cheng
{"title":"测量基于OPS5规则的程序的结构复杂性","authors":"A. Cheng","doi":"10.1109/CMPSAC.1996.544623","DOIUrl":null,"url":null,"abstract":"Complexity metrics, such as McCabe's cyclomatic number of a program control graph and Halstead's number of operator/operand occurrences have been used extensively to measure the structural complexity of procedural programs. However, few suitable complexity metrics have been developed for rule-based programs written in OPS5 and OPS5-like rule-based languages. With the increasingly common use of rule-based languages in knowledge-based systems, this paper describes new complexity metrics to more accurately measure the complexity of OPS5 rule-based programs. The practicality of these metrics is empirically demonstrated by applying them to measure the complexity of a suite of benchmark: OPS5 expert systems.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Measuring the structural complexity of OPS5 rule-based programs\",\"authors\":\"A. Cheng\",\"doi\":\"10.1109/CMPSAC.1996.544623\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Complexity metrics, such as McCabe's cyclomatic number of a program control graph and Halstead's number of operator/operand occurrences have been used extensively to measure the structural complexity of procedural programs. However, few suitable complexity metrics have been developed for rule-based programs written in OPS5 and OPS5-like rule-based languages. With the increasingly common use of rule-based languages in knowledge-based systems, this paper describes new complexity metrics to more accurately measure the complexity of OPS5 rule-based programs. The practicality of these metrics is empirically demonstrated by applying them to measure the complexity of a suite of benchmark: OPS5 expert systems.\",\"PeriodicalId\":306601,\"journal\":{\"name\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1996.544623\",\"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 of 20th International Computer Software and Applications Conference: COMPSAC '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1996.544623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

复杂性度量,如McCabe的程序控制图的圈数和Halstead的运算符/操作数出现的数量,已被广泛用于测量程序程序的结构复杂性。然而,对于用OPS5和类似OPS5的基于规则的语言编写的基于规则的程序,很少有合适的复杂性度量。随着基于规则的语言在基于知识的系统中越来越普遍的使用,本文描述了新的复杂性度量来更准确地度量基于规则的OPS5程序的复杂性。通过将这些指标应用于测量一套基准:OPS5专家系统的复杂性,这些指标的实用性得到了经验证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Measuring the structural complexity of OPS5 rule-based programs
Complexity metrics, such as McCabe's cyclomatic number of a program control graph and Halstead's number of operator/operand occurrences have been used extensively to measure the structural complexity of procedural programs. However, few suitable complexity metrics have been developed for rule-based programs written in OPS5 and OPS5-like rule-based languages. With the increasingly common use of rule-based languages in knowledge-based systems, this paper describes new complexity metrics to more accurately measure the complexity of OPS5 rule-based programs. The practicality of these metrics is empirically demonstrated by applying them to measure the complexity of a suite of benchmark: OPS5 expert systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Would Internet Meet Global Acceptance? - From application perspective - Use case driven structured analysis OOHS: an object-oriented hypermedia system A popularity-based data allocation scheme for a VOD server A presentation scheduling scheme for multimedia databases
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1