Learn More
D A transformation technique is introduced which, given the Horn-clause definitions of a set of predicates p,, synthesizes the definitions of new predicates pi which can be used, under a suitable refutation procedure, to compute the finite failure set of pi. This technique exhibits some computational advantages, such as the possibility of computing(More)
Detecting stable properties of networks in concurrent logic programming languages. Lever 91] J. M. Lever. Proving program properties by means of SLS-resolution. In Furukawa Furukawa 91], pages 614{628. The semantics of predicate logic as a programming language. A model-theoretic reconstruction of the operational semantics of logic programs. A general(More)
The Calculus of Looping Sequences (CLS) enables the description of biological systems and of their evolution. This paper presents the Spatial CLS, an extension of CLS that allows the description of the position of biological elements, and of the space they take up in a 2D/3D space. The elements may move autonomously during the passage of time, and may(More)
In previous papers we introduced a formalism, called Calculus of Looping Sequences (CLS), for describing biological systems and their evolution. CLS is based on term rewriting. Terms can be constructed by composing symbols of a given alphabet in sequences, which could be closed (looping) and contain other terms. In this paper we extend CLS to represent(More)
We introduce a probabilistic algorithm for the simulation of chemical reactions, which can be used as an alternative to the well-established stochastic algorithm proposed by D.T. Gillespie in the '70s. We show that the probabilistic evolution of systems derived by means of our algorithm can be compared to the stochastic time evolution of chemical reactive(More)