Commit 3e6742db authored by Markus Klinik's avatar Markus Klinik
Browse files

cite Plasmeijer2002

parent 1b6db0bf
Subproject commit df02f1da6ca87dcbc86ae9ea9f2dd5374b2f680d
Subproject commit 47824920b9aa1fc842f66c497b65bf32abf1535c
......@@ -70,9 +70,11 @@ For the planner, we are for now content with a more modest goal.
An order constraint between two tasks should express that the tasks are not commutative and not parallelizable.
Unconstrained tasks should be commutative and parallelizable.
In classical partial-order planning, unconstrained tasks are commutative, but not necessarily parallelizable.
In other words, tasks that partial-order planning considers unconstrained might not be parallelizable.
That is the reason why we developed the method described in the next section.
Our method relaxes constraints only when tasks are parallelizable.
\subsection{Plan Synthesis Using Generic Programming}
\citet{KoopmanP2009} use the generic programming facilities of the Clean \cite{Plasmeijer2002} programming language to synthesize functions that fulfil a given specification.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment