.png){kind=icon}
返回
Specification and computation of optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(97)00040-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In [JOM95] we introduced a specification language, that we call partial-order programming, where we showed that partial-order clauses help render clear and concise formulations to a different kind of problems, in particular optimization problems. We also presented a formal semantics to this language as well as a top-down-procedure to compute the semantics of a large class of programs that we call monotonic. In [OJ97] we gave a definition of a semantics for partial-order programs that do not have to be monotonic, and we showed that this semantics is well-behaved [Dix95]. In this paper we discuss some more typical problems that have a simple specification in our language. We briefly compare both approaches. (C) 1997 Published by Elsevier Science Ltd.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
.png){kind=icon}
