Name
Abstract | ||
|---|---|---|
The simplest nontrivial program pattern in logic programming is the following where fact, goal, left, and right are arbitrary terms. Because the well-known append program matches this pattern, we will denote such programs “append-like.” |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0743-1066(95)00122-0 | The Journal of Logic Programming |
Keywords | DocType | Volume |
turing machine,satisfiability,correspondence problem,number theory | Journal | 27 |
Issue | ISSN | Citations |
3 | 0743-1066 | 5 |
PageRank | References | Authors |
0.57 | 18 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Devienne | 1 | 131 | 19.93 |
| P Lebègue | 2 | 5 | 0.57 |
| A Parrain | 3 | 5 | 0.57 |
| J.C Routier | 4 | 5 | 0.57 |
| J Würtz | 5 | 5 | 0.57 |