Jaume Agustí-Cullell

Learn More
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ −→ as well and seek a common expression c such that a ⊆ −→ ∗ c and b ⊇ −→ ∗ c. Each component of the bi-rewriting system 〈(More)
It is commonly accepted that non-logicians have di culty in expressing themselves in rst order logic. Part of the visual language community is concerned with providing visual notations which use visual cues (\declarative diagrams") to make the structuring of logical expressions more intuitive. One of the more successful metaphors used in such diagrammatic(More)
It is commonly accepted that non-logicians have difficulty in expressing themselves in first order logic. Part of the visual language community is concerned with providing visual notations (“declarative diagrams”) which use visual cues to make the structuring of logical expressions more intuitive. One of the more successful metaphors used in such languages(More)
Abstract. Two key issues in building multi-agent systems concern their scalability and engineering open systems. We o er solutions to these potential problems by introducing a lifecycle for models of large multi-agent systems. Our proposal connects a model for the collective analysis of agent systems with an individual-based model. This approach leads on to(More)
In VL’96 we presented a visual declarative programming language based on two main graphical constructs: directed acyclic graphs representing predicate application and graphical set inclusion representing logical implication. We showed that with these simple visual constructs we can cover most of the representational demands of computational logic allowing a(More)
In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusion a b from a given set I of them, we generate from I, using a completion procedure, a bi-rewrite system hR ; R i, that is, a pair of rewrite relations ??! R and ??! R , and seek a common term c such that a ??! R(More)