SPECIFICATION AND COMPUTATION OF OPTIMIZATION PROBLEMS

In [JOM95] we introduced a specification language, that we call partia l-order programming, where we showed that partial-order clauses help r ender clear and concise formulations to a different kind of problems, in particular optimization problems. We also presented a formal semant ics to this language as well as a top-down-procedure to compute the se mantics of a large class of programs that we call monotonic. In [OJ97] we gave a definition of a semantics for partial-order programs that d o not have to be monotonic, and we showed that this semantics is well- behaved [Dix95]. In this paper we discuss some more typical problems t hat have a simple specification in our language. We briefly compare bo th approaches. (C) 1997 Published by Elsevier Science Ltd.