一致选择窄化——一种新的约束规划模型

[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track Pub Date : 1900-01-01 DOI:10.1109/HICSS.1988.11857

S. Danforth

{"title":"一致选择窄化——一种新的约束规划模型","authors":"S. Danforth","doi":"10.1109/HICSS.1988.11857","DOIUrl":null,"url":null,"abstract":"The reasons for the increased interest in constraint-based models of computation are discussed. A model of computation called consistent choice narrowing is introduced. It allows natural representation of useful constraint situations not easily expressed in current programming languages. In particular, unknown functions can be defined by constraint intersection, resulting in higher-order capabilities.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Consistent choice narrowing-a new model for constraint based programming\",\"authors\":\"S. Danforth\",\"doi\":\"10.1109/HICSS.1988.11857\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The reasons for the increased interest in constraint-based models of computation are discussed. A model of computation called consistent choice narrowing is introduced. It allows natural representation of useful constraint situations not easily expressed in current programming languages. In particular, unknown functions can be defined by constraint intersection, resulting in higher-order capabilities.<<ETX>>\",\"PeriodicalId\":148246,\"journal\":{\"name\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1988.11857\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1988.11857","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

讨论了人们对基于约束的计算模型越来越感兴趣的原因。介绍了一种计算模型——一致选择缩小模型。它允许对当前编程语言中不易表达的有用约束情况进行自然表示。特别是，未知函数可以通过约束交集来定义，从而产生高阶能力。

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

查看原文本刊更多论文

Consistent choice narrowing-a new model for constraint based programming

The reasons for the increased interest in constraint-based models of computation are discussed. A model of computation called consistent choice narrowing is introduced. It allows natural representation of useful constraint situations not easily expressed in current programming languages. In particular, unknown functions can be defined by constraint intersection, resulting in higher-order capabilities.<>

求助全文

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

来源期刊

[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track

自引率

0.00%

发文量