Add to ORKGA simple addition to findall/3 achieves sharing between answers in the solution list and the input to findall/3. This reduces the time and space complexity of some queries. Its overhead is extremely small. It can be integrated in any WAM-like Prolog implementation.nrpages: 13status: publishe
Abstract. In this paper, we present a new system for proof-search in propositional intuitionistic lo...
Optimization of join queries based on average selectivities is suboptimal in highly correlated datab...
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approxima...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
Sharing information between logical variables is crucial for a lot of analyses of logic programs, e....
This paper rst gives an overview of standard PROLOG indexing and then shows in a stepbystep manner ...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs,...
Abstract. Tabling is an evaluation strategy for Prolog programs that works by storing answers in a t...
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single dat...
This work describes an implementation of some essential side-effects of Prolog: cut, fin...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Abstract. Answer set programming (ASP) is a declarative programming paradigm stemming from logic pro...
Date du colloque : 13/12/2008International audienceAnswer Set Programming (ASP) is a very conve...
This paper illustrates how a Prolog program, using chronological backtracking to find a solution in ...
Information overload has led to a situation where users are swamped with too much information, resul...
Abstract. In this paper, we present a new system for proof-search in propositional intuitionistic lo...
Optimization of join queries based on average selectivities is suboptimal in highly correlated datab...
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approxima...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
Sharing information between logical variables is crucial for a lot of analyses of logic programs, e....
This paper rst gives an overview of standard PROLOG indexing and then shows in a stepbystep manner ...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs,...
Abstract. Tabling is an evaluation strategy for Prolog programs that works by storing answers in a t...
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single dat...
This work describes an implementation of some essential side-effects of Prolog: cut, fin...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Abstract. Answer set programming (ASP) is a declarative programming paradigm stemming from logic pro...
Date du colloque : 13/12/2008International audienceAnswer Set Programming (ASP) is a very conve...
This paper illustrates how a Prolog program, using chronological backtracking to find a solution in ...
Information overload has led to a situation where users are swamped with too much information, resul...
Abstract. In this paper, we present a new system for proof-search in propositional intuitionistic lo...
Optimization of join queries based on average selectivities is suboptimal in highly correlated datab...
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approxima...