{"title":"通用调度开发环境","authors":"W. Fabens, L. Sterling","doi":"10.1109/TAI.1991.167050","DOIUrl":null,"url":null,"abstract":"A generalized scheduling development environment allows a person who composes schedules to specify both an application and a methodology, in developing a scheduling program. The authors have designed such a system and have built a proof-of-concept prototype. The prototype has been tested on two fairly different application examples. It demonstrates the expressive capability of logic programming in representing the diversity of the two examples, and it exemplifies a method of achieving generality in the domain of scheduling.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Generalized scheduling development environment\",\"authors\":\"W. Fabens, L. Sterling\",\"doi\":\"10.1109/TAI.1991.167050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A generalized scheduling development environment allows a person who composes schedules to specify both an application and a methodology, in developing a scheduling program. The authors have designed such a system and have built a proof-of-concept prototype. The prototype has been tested on two fairly different application examples. It demonstrates the expressive capability of logic programming in representing the diversity of the two examples, and it exemplifies a method of achieving generality in the domain of scheduling.<<ETX>>\",\"PeriodicalId\":371778,\"journal\":{\"name\":\"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.167050\",\"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.167050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A generalized scheduling development environment allows a person who composes schedules to specify both an application and a methodology, in developing a scheduling program. The authors have designed such a system and have built a proof-of-concept prototype. The prototype has been tested on two fairly different application examples. It demonstrates the expressive capability of logic programming in representing the diversity of the two examples, and it exemplifies a method of achieving generality in the domain of scheduling.<>