3513 search results - page 212 / 703 » Super Logic Programs |
144
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
239
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
122
click to vote
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
139
Voted
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
176
Voted
GEOINFORMATICA
2011
14 years 10 months ago
2011
Discovery of suitable web services is a crucial task in Spatial Data Infrastructures (SDI). In this work, we develop a novel approach to the discovery of geoprocessing services (WP...