Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...