{"title":"Integration of rule-based and procedural code to obtain flexible engineering software","authors":"W.J.T. Daniel","doi":"10.1016/0141-1195(88)90002-2","DOIUrl":null,"url":null,"abstract":"<div><p>The application of rule-based programming, commonly associated with expert systems, to programming tasks normally associated with procedural software is considered. To illustrate the ideas, a toy finite element package has been developed, consisting of a set of processors which are configured at run time by interpreting a set of rules. A typical rule relates the immediate prerequisites for a particular processor to its output. The algorithm used to interpret the rules and produce a linearised graph listing the order of execution of processors, is described. The potential of the methodology is to achieve a package that can reconfigure itself to meet a user's request. It would avoid redundant computation and be easy to modify. Issues in data management that arise from adoption of the methodology are briefly discussed, including the design of a suitable database.</p></div>","PeriodicalId":100043,"journal":{"name":"Advances in Engineering Software (1978)","volume":"10 2","pages":"Pages 72-76"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0141-1195(88)90002-2","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Engineering Software (1978)","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0141119588900022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The application of rule-based programming, commonly associated with expert systems, to programming tasks normally associated with procedural software is considered. To illustrate the ideas, a toy finite element package has been developed, consisting of a set of processors which are configured at run time by interpreting a set of rules. A typical rule relates the immediate prerequisites for a particular processor to its output. The algorithm used to interpret the rules and produce a linearised graph listing the order of execution of processors, is described. The potential of the methodology is to achieve a package that can reconfigure itself to meet a user's request. It would avoid redundant computation and be easy to modify. Issues in data management that arise from adoption of the methodology are briefly discussed, including the design of a suitable database.