7167 search results - page 561 / 1434 » Answer Set Programming |
138
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
166
click to vote
SP
2008
IEEE
15 years 11 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
138
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
153
Voted
ICSM
1994
IEEE
15 years 9 months ago
1994
IEEE
In order to improve software maintenance processes, we need to be able to first characterize and assess them. This task needs to be performed in depth and with objectivity since t...
129
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...