3693 search results - page 272 / 739 » Splitting a Logic Program |
126
click to vote
CIE
2007
Springer
15 years 11 months 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...
123
click to vote
SE
2008
15 years 6 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...
136
Voted
PPDP
2010
Springer
15 years 2 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...
198
click to vote
GECCO
2011
Springer
14 years 8 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 ...
141
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...