{"title":"TASK: from the specification to the implementation","authors":"Xavier Talon, C. Golbreich","doi":"10.1109/TAI.1996.560404","DOIUrl":null,"url":null,"abstract":"The paper presents the TASK framework which is intended to cover the life cycle of a knowledge based system. TASK provides: (i) a conceptual language which enables an informal specification at the knowledge level; (ii) a formal language TFL which permits an unambiguous specification; and (iii) an operational shell TASK/sup +/ which allows an efficient execution even for badly structured problems. The paper presents the different languages, the links between them and emphasizes the implementation stage. We show how TASK proposes a nice compromise solution between efficiency and expressivity.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
The paper presents the TASK framework which is intended to cover the life cycle of a knowledge based system. TASK provides: (i) a conceptual language which enables an informal specification at the knowledge level; (ii) a formal language TFL which permits an unambiguous specification; and (iii) an operational shell TASK/sup +/ which allows an efficient execution even for badly structured problems. The paper presents the different languages, the links between them and emphasizes the implementation stage. We show how TASK proposes a nice compromise solution between efficiency and expressivity.