7456 search results - page 426 / 1492 » Parallelism in Logic Programming |
166
Voted
CIE
2007
Springer
16 years 29 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
163
click to vote
SE
2008
15 years 8 months ago
2008
: In many of today's application programs, security functionality is inseparably intertwined with the actual mission-purpose logic. As a result, the trusted code base is unnec...
175
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
255
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...
175
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...