Sciweavers

125 search results - page 10 / 25
» Combining Theories with Shared Set Operations
Sort
View
ICLP
2003
Springer
15 years 4 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
FUN
2007
Springer
87views Algorithms» more  FUN 2007»
15 years 5 months ago
Knitting for Fun: A Recursive Sweater
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
Anna Bernasconi, Chiara Bodei, Linda Pagli
138
Voted
JSAI
2007
Springer
15 years 5 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
FOSSACS
2004
Springer
15 years 5 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...
SIROCCO
1998
15 years 1 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer