{"title":"带约束的定性时间推理的遗传方法","authors":"A. Fin","doi":"10.1109/ICCIMA.1999.798508","DOIUrl":null,"url":null,"abstract":"Temporal reasoning is an area of artificial intelligence, very important to many applications. A structure largely used to describe the qualitative temporal information is Allen's interval-based calculus. Inference in the full calculus is NP-hard, therefore some heuristic techniques are needed to solve this problem. A genetic algorithm that achieves a low computational time cost for hard instances of temporal constraint networks is presented.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A genetic approach to qualitative temporal reasoning with constraints\",\"authors\":\"A. Fin\",\"doi\":\"10.1109/ICCIMA.1999.798508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Temporal reasoning is an area of artificial intelligence, very important to many applications. A structure largely used to describe the qualitative temporal information is Allen's interval-based calculus. Inference in the full calculus is NP-hard, therefore some heuristic techniques are needed to solve this problem. A genetic algorithm that achieves a low computational time cost for hard instances of temporal constraint networks is presented.\",\"PeriodicalId\":110736,\"journal\":{\"name\":\"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIMA.1999.798508\",\"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 Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.1999.798508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A genetic approach to qualitative temporal reasoning with constraints
Temporal reasoning is an area of artificial intelligence, very important to many applications. A structure largely used to describe the qualitative temporal information is Allen's interval-based calculus. Inference in the full calculus is NP-hard, therefore some heuristic techniques are needed to solve this problem. A genetic algorithm that achieves a low computational time cost for hard instances of temporal constraint networks is presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
