Sciweavers

947 search results - page 78 / 190
» Declarative Programming in Prolog
Sort
View
137
Voted
ENTCS
2007
120views more  ENTCS 2007»
15 years 2 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel
120
Voted
PEPM
1993
ACM
15 years 6 months ago
Tutorial on Specialisation of Logic Programs
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
John P. Gallagher
122
Voted
SIGMOD
2011
ACM
204views Database» more  SIGMOD 2011»
14 years 5 months ago
Datalog and emerging applications: an interactive tutorial
We are witnessing an exciting revival of interest in recursive Datalog queries in a variety of emerging application domains such as data integration, information extraction, netwo...
Shan Shan Huang, Todd Jeffrey Green, Boon Thau Loo
145
Voted
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 5 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
111
Voted
ICLP
2005
Springer
15 years 8 months ago
Guard and Continuation Optimization for Occurrence Representations of CHR
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...
Jon Sneyers, Tom Schrijvers, Bart Demoen