967 search results - page 62 / 194 » Probabilistic Predicative Programming |
105
Voted
ESOP
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
139
click to vote
FOIKS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
142
click to vote
WFLP
2000
Springer
15 years 6 months ago
2000
Springer
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
113
Voted
KI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
130
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...