Sciweavers

947 search results - page 5 / 190
» Declarative Programming in Prolog
Sort
View
JMLR
2006
112views more  JMLR 2006»
14 years 9 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
ICLP
2010
Springer
15 years 1 months ago
From Relational Specifications to Logic Programs
This paper presents a compiler from expressive, relational specifications to logic programs. Specifically, the compiler translates the Imperative Alloy specification language to...
Joseph P. Near
IWFM
1998
14 years 11 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
ESOP
2001
Springer
15 years 2 months ago
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-G...
CORR
2002
Springer
114views Education» more  CORR 2002»
14 years 9 months ago
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
Michael Leuschel, Jesper Jørgensen, Wim Van...