The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenb...
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...
A top-down approach for workflow design is proposed in the framework of Petri net theory. Simple but powerful refinement rules are proposed that guarantee soundness of the resultin...
Piotr Chrzastowski-Wachtel, Boualem Benatallah, Ra...
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...