Sciweavers

209 search results - page 27 / 42
» Logic and refinement for charts
Sort
View
90
Voted
LICS
2010
IEEE
14 years 7 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
JCB
2006
185views more  JCB 2006»
14 years 9 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
IANDC
2008
114views more  IANDC 2008»
14 years 9 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
NDJFL
2000
79views more  NDJFL 2000»
14 years 9 months ago
An Information-Based Theory of Conditionals
We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Sc...
Wayne Wobcke
PPDP
2000
Springer
15 years 1 months ago
Enhanced sharing analysis techniques: a comprehensive evaluation
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill