Sciweavers

347 search results - page 42 / 70
» Schaefer's theorem for graphs
Sort
View
AI
2008
Springer
14 years 9 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
LION
2007
Springer
138views Optimization» more  LION 2007»
15 years 3 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
VSTTE
2010
Springer
14 years 7 months ago
To Goto Where No Statement Has Gone Before
Abstract. This paper presents a method for deriving an expression from the lowlevel code compiled from an expression in a high-level language. The input is a low-level control flo...
Michael Barnett, K. Rustan M. Leino
DALT
2008
Springer
14 years 11 months ago
Iterated Belief Revision in the Face of Uncertain Communication
Abstract. This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we co...
Yoshitaka Suzuki, Satoshi Tojo, Stijn De Saeger