Sciweavers

PLILP
1993
Springer
14 years 3 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
PLILP
1993
Springer
14 years 3 months ago
An OR Parallel Prolog Model for Distributed Memory Systems
This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distr...
Vicente Benjumea, José M. Troya
PLILP
1993
Springer
14 years 3 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
LPAR
1994
Springer
14 years 3 months ago
A Generic Declarative Diagnoser for Normal Logic Programs
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
Lunjin Lu
LPAR
1994
Springer
14 years 3 months ago
Projection in Temporal Logic Programming
Zhenhua Duan, Maciej Koutny, Chris Holt
LPAR
1994
Springer
14 years 3 months ago
On Anti-Links
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
Bernard Becker, Reiner Hähnle, Anavai Ramesh,...
LOPSTR
1994
Springer
14 years 3 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
LOPSTR
1994
Springer
14 years 3 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
LOPSTR
1994
Springer
14 years 3 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe
KR
1994
Springer
14 years 3 months ago
Making the Difference: A Subtraction Operation for Description Logics
We define a new operation in description logics, the difference operation or subtraction operation. This operation allows to remove from a description as much as possible of the i...
Gunnar Teege