150 search results - page 8 / 30 » Understanding Promise Theory Using Rewriting Logic |
LICS
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
FORTE
2010
14 years 11 months ago
2010
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
GG
2004
Springer
15 years 2 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...