62 search results - page 3 / 13 » On the logical definability of certain graph and poset langu... |
DIAGRAMS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
ATAL
2007
Springer
13 years 10 months ago
2007
Springer
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...
AML
2005
13 years 5 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
CSJM
2008
13 years 6 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
CIE
2008
Springer
13 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...