带约束的定性时间推理的遗传方法

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300) Pub Date : 1999-09-23 DOI:10.1109/ICCIMA.1999.798508

A. Fin

{"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}

引用次数: 4

摘要

时间推理是人工智能的一个领域，对许多应用都非常重要。一个主要用于描述定性时间信息的结构是Allen的基于区间的演算。全微积分中的推理是np困难的，因此需要一些启发式技术来解决这个问题。提出了一种求解时间约束网络硬实例的低计算时间开销遗传算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)

自引率

0.00%

发文量