Sciweavers

233 search results - page 13 / 47
» An Existential Locality Theorem
Sort
View
POPL
2012
ACM
12 years 4 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
BIRTHDAY
2010
Springer
13 years 9 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
APAL
2006
66views more  APAL 2006»
13 years 8 months ago
Uncountable categoricity of local abstract elementary classes with amalgamation
BLE CATEGORICITY OF LOCAL ABSTRACT ELEMENTARY CLASSES WITH AMALGAMATION JOHN T. BALDWIN AND OLIVIER LESSMANN We give a complete and elementary proof of the following upward categor...
John T. Baldwin, Olivier Lessmann
JCT
2006
72views more  JCT 2006»
13 years 8 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein
SIGECOM
2008
ACM
131views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Truthful germs are contagious: a local to global characterization of truthfulness
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
Aaron Archer, Robert Kleinberg