Sciweavers

1274 search results - page 28 / 255
» Graph lambda theories
Sort
View
JCSC
1998
227views more  JCSC 1998»
15 years 1 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
RSA
2011
102views more  RSA 2011»
14 years 8 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
CLA
2007
15 years 2 months ago
Concept Graphs as Semantic Structures for Contextual Judgment Logic
Abstract. This paper presents a mathematization of the philosophical doctrine of judgments as an extension of the mathematization of the philosophical doctrine of concepts develope...
Rudolf Wille
JAPLL
2006
114views more  JAPLL 2006»
15 years 1 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
ICFP
2008
ACM
16 years 1 months ago
Functional netlists
In efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description la...
Sungwoo Park, Jinha Kim, Hyeonseung Im