The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
Kit-ying Hui, Peter M. D. Gray, Graham J. L. Kemp,...
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precis...
Sven Schade, Arnd Sahlmann, Michael Lutz, Florian ...
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...