Sciweavers

118 search results - page 12 / 24
» Team Logic and Second-Order Logic
Sort
View
DLT
2004
13 years 8 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
ADHOC
2004
134views more  ADHOC 2004»
13 years 7 months ago
Scalable team multicast in wireless ad hoc networks exploiting coordinated motion
In this paper, we study a new multicast paradigm for large scale mobile ad hoc networks, namely team multicast. In team multicast the multicast group does not consist of individua...
Yunjung Yi, Mario Gerla, Katia Obraczka
BIRTHDAY
2010
Springer
13 years 8 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
CSL
2000
Springer
13 years 11 months ago
Disjunctive Tautologies as Synchronisation Schemes
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be r...
Vincent Danos, Jean-Louis Krivine
MST
2008
141views more  MST 2008»
13 years 7 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky