1320 search results - page 108 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
132
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
102
click to vote
ECEASST
2006
15 years 3 months ago
2006
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
136
Voted
RISE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
139
click to vote
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes th...
142
click to vote
SAC
1994
ACM
15 years 8 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...