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.
CITATION STYLE
Osorio, M. (1998). Semantics of partial-order programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1489, pp. 47–62). Springer Verlag. https://doi.org/10.1007/3-540-49545-2_4
Mendeley helps you to discover research relevant for your work.