2473 search results - page 29 / 495 » The Logic of Communication Graphs |
INFOCOM
2002
IEEE
14 years 16 days ago
2002
IEEE
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
TCS
2008
13 years 7 months ago
2008
We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
CADE
2006
Springer
14 years 8 months ago
2006
Springer
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...