子集模型作为约束规划的多种形式

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence Pub Date : 1996-11-16 DOI:10.1109/TAI.1996.560446

V. Telerman, Dmitry Ushakov

{"title":"子集模型作为约束规划的多种形式","authors":"V. Telerman, Dmitry Ushakov","doi":"10.1109/TAI.1996.560446","DOIUrl":null,"url":null,"abstract":"This paper describes subdefinite models as a variety of constraint satisfaction problems. The use of the method of subdefinite calculations makes it possible to solve overdetermined and underdetermined problems, as well as problems with uncertain, imprecise and incomplete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples are given to show the capabilities of this approach for solving a wide class of problems.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Subdefinite models as a variety of constraint programming\",\"authors\":\"V. Telerman, Dmitry Ushakov\",\"doi\":\"10.1109/TAI.1996.560446\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes subdefinite models as a variety of constraint satisfaction problems. The use of the method of subdefinite calculations makes it possible to solve overdetermined and underdetermined problems, as well as problems with uncertain, imprecise and incomplete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples are given to show the capabilities of this approach for solving a wide class of problems.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"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.560446\",\"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 Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

本文将亚确定模型描述为各种约束满足问题。利用亚定计算方法，可以解决超定和欠定问题，以及不确定、不精确和数据不完整的问题。所有这些问题的约束传播都由单一的数据驱动推理算法支持。给出了几个例子来展示这种方法在解决广泛问题方面的能力。

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

查看原文本刊更多论文

Subdefinite models as a variety of constraint programming

This paper describes subdefinite models as a variety of constraint satisfaction problems. The use of the method of subdefinite calculations makes it possible to solve overdetermined and underdetermined problems, as well as problems with uncertain, imprecise and incomplete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples are given to show the capabilities of this approach for solving a wide class of problems.

求助全文

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

来源期刊

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量