183 search results - page 7 / 37 » A Prolog Implementation of Kem |
ICLP
1999
Springer
13 years 11 months ago
1999
Springer
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
PLILP
1993
Springer
13 years 11 months ago
1993
Springer
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...
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
ILP
1998
Springer
13 years 11 months ago
1998
Springer
Cohen's [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem ...