3 citations · 4 across the 2 of their papers we have counts for
8 papers
Enhancing a Search Algorithm to Perform Intelligent Backtracking
Maurice Bruynooghe
This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perform intelligent backtracking. The enha…
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning
Ofer Arieli, Marc Denecker, Bert Van Nuffelen +1
In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to `rep…
Practical Aspects for a Working Compile Time Garbage Collection System for Mercury
Nancy Mazur, Peter Ross, Gerda Janssens +1
Compile-time garbage collection (CTGC) is still a very uncommon feature within compilers. In previous work we have developed a compile-time structure reuse system for Mercury, a lo…
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
Nikolay Pelov, Maurice Bruynooghe
Proving failure of queries for definite logic programs can be done by constructing a finite model of the program in which the query is false. A general purpose model generator for…
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Maurice Bruynooghe, Michael Leuschel, Konstantinos Sagonas
We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. Using abstract interp…
Detecting Unsolvable Queries for Definite Logic Programs
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal +1
In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachab…