DeltaStar:一种用于约束层次的增量满足的通用算法

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200605

B. Freeman-Benson, M. Wilson, A. Borning

{"title":"DeltaStar:一种用于约束层次的增量满足的通用算法","authors":"B. Freeman-Benson, M. Wilson, A. Borning","doi":"10.1109/PCCC.1992.200605","DOIUrl":null,"url":null,"abstract":"The DeltaStar incremental algorithm for solving constraint hierarchies, which was developed as part of a continuing investigation on the design and implementation of constraint programming languages, is described. DeltaStar is a framework for incremental solvers built above an existing flat solver that provides the constraint solving techniques. By plugging different flat solvers into DeltaStar, different hierarchical solvers can quickly be produced and experimented with. Two implementations of DeltaStar, as well as previous algorithms that can be viewed as instances of DeltaStar, are discussed.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"DeltaStar: a general algorithm for incremental satisfaction of constraint hierarchies\",\"authors\":\"B. Freeman-Benson, M. Wilson, A. Borning\",\"doi\":\"10.1109/PCCC.1992.200605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The DeltaStar incremental algorithm for solving constraint hierarchies, which was developed as part of a continuing investigation on the design and implementation of constraint programming languages, is described. DeltaStar is a framework for incremental solvers built above an existing flat solver that provides the constraint solving techniques. By plugging different flat solvers into DeltaStar, different hierarchical solvers can quickly be produced and experimented with. Two implementations of DeltaStar, as well as previous algorithms that can be viewed as instances of DeltaStar, are discussed.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

本文描述了用于求解约束层次的DeltaStar增量算法，该算法是对约束编程语言的设计和实现的持续研究的一部分。DeltaStar是一个增量求解器框架，建立在现有的平面求解器之上，提供约束求解技术。通过将不同的平面求解器插入DeltaStar，可以快速生成不同的分层求解器并进行实验。讨论了DeltaStar的两种实现，以及可以视为DeltaStar实例的先前算法。

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

查看原文本刊更多论文

DeltaStar: a general algorithm for incremental satisfaction of constraint hierarchies

The DeltaStar incremental algorithm for solving constraint hierarchies, which was developed as part of a continuing investigation on the design and implementation of constraint programming languages, is described. DeltaStar is a framework for incremental solvers built above an existing flat solver that provides the constraint solving techniques. By plugging different flat solvers into DeltaStar, different hierarchical solvers can quickly be produced and experimented with. Two implementations of DeltaStar, as well as previous algorithms that can be viewed as instances of DeltaStar, are discussed.<>

求助全文

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

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量