211 search results - page 28 / 43 » The Representation of Program Synthesis in Higher Order Logi... |
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
119
click to vote
ACL
1997
15 years 1 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
CSL
2008
Springer
15 years 1 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
SCCC
1998
IEEE
15 years 4 months ago
1998
IEEE
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
92
Voted
EUROGP
2004
Springer
15 years 5 months ago
2004
Springer
Internet based parallel genetic programming (GP) creates fractal patterns like Koch’s snow flake. Pfeiffer, http://www.cs.ucl.ac.uk /staff/W.Langdon/pfeiffer.html, by analogy w...