58 search results - page 5 / 12 » A Logic Programming View of Relational Morphology |
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
104
click to vote
AGP
1994
IEEE
15 years 3 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
120
click to vote
ILP
2007
Springer
15 years 5 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
106
click to vote
LOPSTR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...