Sciweavers

343 search results - page 5 / 69
» Purely Relational FLWORs
Sort
View
ENTCS
2002
129views more  ENTCS 2002»
13 years 7 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
LISP
1998
57views more  LISP 1998»
13 years 7 months ago
A Generalization of Jumps and Labels
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
Peter J. Landin
DLT
2009
13 years 5 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
IPL
2010
139views more  IPL 2010»
13 years 4 months ago
A note on competitive diffusion through social networks
We introduce a game-theoretic model of diffusion of technologies, advertisements, or influence through a social network. The novelty in our model is that the players are intereste...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 4 months ago
Analysing the behaviour of robot teams through relational sequential pattern mining
This report outlines the use of a relational representation in a Multi-Agent domain to model the behaviour of the whole system. A desired property in this systems is the ability of...
Grazia Bombini, Raquel Ros, Stefano Ferilli, Ramon...