Results 1  10
of
1,077
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder
Extending First Order Deforestation
, 1995
"... Intermediate data structures are widely used in functional programs. Programs which use these intermediate structures are usually much easier to understand, but they result in loss of efficiency at runtime. In order to reduce these runtime costs, a transformation algorithm called deforestation was ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
was proposed by Wadler to eliminate intermediate structures. However, the set of expressions for which this algorithm is guaranteed to terminate is only a subset of all firstorder functional expressions. In this paper, it is shown how the deforestation algorithm can be generalised so
RegionBased Memory Management
, 1997
"... This paper describes a memory management discipline for programs that perform dynamic memory allocation and deallocation. At runtime, all values are put into regions. The store consists of a stack of regions. All points of region allocation and deallocation are inferred automatically, using a type ..."
Abstract

Cited by 323 (8 self)
 Add to MetaCart
, which includes recursive datatypes, higherorder functions and updatable references (Birkedal et al. 96, Elsman and Hallenberg 95). This paper defines a regionbased dynamic semantics for a skeletal programming language extracted from Standard ML. We present the inference system which specifies where
Higher Order Deforestation
, 1995
"... Intermediate data structures are widely used in functional programs. Programs which use these intermediate structures are usually a lot easier to understand, but they result in loss of efficiency at runtime. In order to reduce these runtime costs, a transformation algorithm called deforestation w ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
was proposed by Wadler which could eliminate intermediate structures. However, this transformation algorithm was formulated only for first order functional programs. In this paper, it is shown how the original deforestation algorithm can be extended to deal with higher order functional programs. This extended
Deforestation
, 2012
"... Why do we like functional programming? Well, one of the reasons I like functional programming is that it allows me to write programs that look like the problem they’re solving. For example, say I want to: sum the squares of all numbers from 1 up to n I want to write: not: sum_of_squares:: Int> I ..."
Abstract
 Add to MetaCart
Why do we like functional programming? Well, one of the reasons I like functional programming is that it allows me to write programs that look like the problem they’re solving. For example, say I want to: sum the squares of all numbers from 1 up to n I want to write: not: sum_of_squares:: Int
FirstOrder Universality for Real Programs
"... Abstract. J.Raymundo Marcial–Romero and M.H.Escardo ́ described a functional programming language with an abstract data type Real for the real numbers and a nondeterministic operator rtest: Real → Bool. We show that this language is universal at first order, as conjectured by these authors: all com ..."
Abstract
 Add to MetaCart
Abstract. J.Raymundo Marcial–Romero and M.H.Escardo ́ described a functional programming language with an abstract data type Real for the real numbers and a nondeterministic operator rtest: Real → Bool. We show that this language is universal at first order, as conjectured by these authors: all
Firstorder Cascade ARTMAP
, 2001
"... Firstorder theory refinement using neural networks is still an open problem. Towards a solution to this problem, we define a FirstOrder extension of the Cascade _ARTMAP (FOCA) system, using Inductive Logic Programming techniques. To present such a firstorder extension of Cascade ARTMAP, we: a) ..."
Abstract
 Add to MetaCart
) modify the network structure to handle firstorder objects; b) define firstorder versions of the main functions that guide all Cascade ARTMAP dynamics, the choice and match functions; c) define a firstorder version of the propositional learning algorithm, that approximates Plotkin's least
Approximate linear programming for firstorder MDPs
 In Proc. UAI05, 509– 517
, 2005
"... We introduce a new approximate solution technique for firstorder Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of firstorder basis functions, we compute suitable weights by casting the corresponding optimization as a firstorder linear program and show h ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
We introduce a new approximate solution technique for firstorder Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of firstorder basis functions, we compute suitable weights by casting the corresponding optimization as a firstorder linear program and show
Exploiting FirstOrder Regression in Inductive Policy Selection
 Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI’04
, 2004
"... We consider the problem of computing optimal generalised policies for relational Markov decision processes. We describe an approach combining some of the benefits of purely inductive techniques with those of symbolic dynamic programming methods. The latter reason about the optimal value function usi ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
using firstorder decisiontheoretic regression and formula rewriting, while the former, when provided with a suitable hypotheses language, are capable of generalising value functions or policies for small instances. Our idea is to use reasoning and in particular classical firstorder regression
Deforestation for HigherOrder Functional Programs
, 1995
"... Functional programming languages are an ideal medium for program optimisations based on sourcetosource transformation techniques. Referential transparency affords opportunities for a wide range of correctnesspreserving transformations leading to potent optimisation strategies. This thesis builds ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
builds on deforestation, a program transformation technique due to Wadler that removes intermediate data structures from firstorder functional programs. Our contribution is to reformulate deforestation for higherorder functional programming languages, and to show that the resulting algorithm
Results 1  10
of
1,077