Sciweavers

64 search results - page 4 / 13
» Normal Forms for Inductive Logic Programming
Sort
View
ASP
2005
Springer
13 years 11 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
EVOW
1994
Springer
13 years 9 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
PADL
2007
Springer
13 years 12 months ago
Aspect-Oriented Programming in Higher-Order and Linear Logic
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
Chuck C. Liang
CATS
2007
13 years 7 months ago
Constructing Strictly Positive Families
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
Peter Morris, Thorsten Altenkirch, Neil Ghani
POPL
2004
ACM
14 years 6 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore