1071 search results - page 96 / 215 » Programming with enumerable sets of structures |
108
Voted
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
126
Voted
AGP
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
109
Voted
ICCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. BSML is a library for parallel programming with the functional language Objective Caml. It is based on an extension of the λcalculus by parallel operations on a parallel...
128
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
132
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...