40 search results - page 1 / 8 » On Deterministic Computations in the Extended Andorra Model |
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
PADL
2001
Springer
13 years 9 months ago
2001
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
PADL
2004
Springer
13 years 10 months ago
2004
Springer
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
DMTCS
2010
13 years 2 months ago
2010
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...