Semantics of partial-order programs

Partial-order programming is introduced in [JOM95] where it is shown how partial-order clauses help render clear and concise formulations to a different kind of problems, in particular optimization problems. In this paper we present some more examples that we can model using partial-order clauses and we also introduce its Fix-Point semantics. We show that this paradigm and standard logic programming can be naturally integrated in one paradigm. We also discuss WFSCOMP, a new semantics for normal programs, that can be used to give the meaning of general normal + partial - order programs via a translation.