Program
8:30-9:00: Independent And-Parallelism
Revisited.
M. Correia and V. Santos
Costa
9:00-9:30: About Unnecessary
Performance Differences between Prolog Implementations
B. Demoen and P-L. Nguyen
9:30-10:00: Argument Registers
or Local Stack for Parameter Passing in the WAM
B. Demoen and P-L. Nguyen
10:00-10:30: Segment Order Preserving
and Generational Garbage Collection
R. Vandeginste, K. Sagonas,
B. Demoen
10:30-11:00: Coffee Break
11:00-11:30: FaCiLe: a Functional
Constraint Library
P. Brisset, and N. Barnier
11:30-12:00: Filtering Algorithms
for Tabular Constraints
R. Bartak
12:00-12:30: A Compositional
Framework for Search
C.W. Choi, M. Henz, K.B.
Ng
12:30-14:00: Lunch Break
14:00-14:30: Precise Pair-Sharing
Analysis of Logic Programs
V. Lagoon and P. Stuckey
14:30-15:00: Trying Out
Alternatives for Type Class Support in a New Back-end for HAL
B. Demoen, M. Garcia de
la Banda, P. Stuckey
15:00-15:30: Arc-Consistency
Algorithms on a Software DSM Platform
M. Pereira, I. Dutra, M.
Setlling de Castro
15:30-16:00: Coffee Break
16:00-16:30: A Configuration Framework
to Develop and Deploy Distributed Logic Programming
J. Correas Fernandez and F. Bueno Carrillo
16:30-17:30: Invited Talk
Finite Domain Constrains in SICStus Prolog
Mats Carlsson |