247 search results - page 25 / 50 » A Computational Structure for the Propositional Calculus |
CL
2004
Springer
14 years 9 months ago
2004
Springer
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
DBPL
1991
Springer
15 years 1 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
IANDC
2006
14 years 10 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...