Sciweavers

1000 search results - page 95 / 200
» Nominal rewriting systems
Sort
View
FSTTCS
2010
Springer
13 years 8 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
14 years 10 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
ENTCS
2006
146views more  ENTCS 2006»
13 years 10 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
ENTCS
2008
98views more  ENTCS 2008»
13 years 10 months ago
An Intermediate Language for the Simulation of Biological Systems
We propose String MultiSet Rewriting (SMSR) as an intermediate language for simulation of biomolecular systems. Higher level formalisms for biological systems description can be t...
Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo...