Cited by 16Logic, programming, and type systemsParallel Computing and Optimization TechniquesModel-Driven Software Engineering Techniques

The DOI matches its Crossref record.

An Unfold Rule for Full Prolog

Prestwich, Steven·1993·Workshops in Computing

Overview

Integrity signals

Registry

Crossref · 10.1007/978-1-4471-3560-9_14

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 17

  1. M.Bugliesi, F.Russo, Partial Evaluation in Prolog: Some Improvements About Cut, Proceedings of the North American Conference on Logic Programming, 1989, pp. 645–660.
  2. S.K.Debray, Towards Banishing the Cut from Prolog, Proceedings of the International Conference on Computer Languages, Miami, October 1986, pp. 2–12.
  3. S.K.Debray, D.S.Warren, Detection and Optimization of Functional Computations in Prolog, Proceedings of the International Conference on Logic Programming, 1986, pp. 490–504. · DOI
  4. J.Gallagher, M.Bruynooghe, Some Low-Level Source Transformations for Logic Programs, Proceedings of META y 90 pp. 229–244.
  5. P.M.Hill, J.W.Lloyd. J.C.Shepherdson, Properties of a Pruning Operator, Journal of Logic and Computation 1 (1), 1990, pp. 99–143. · DOI
  6. A.Lakhotia, L.Sterling, ProMiX: a Prolog Partial Evaluation System, The Practice of Prolog, ed. L.Sterling, MIT Press 1991. · DOI
  7. G.Levi, G.Sardu, Partial Evaluation of Metaprograms in a ‘Multiple Worlds“ Logic Language, New Generation Computing 6, 1988, OHSMHA LTD. and Springer-Verlag, pp.227–247. · DOI
  8. M.Meier et al, SEPIA — An Extendible Prolog System, Proceedings of the 11th World Computer Congress IFIP’89, San Francisco, August 1989, pp. 1127–1132.
  9. R.O’Keefe, On the Treatment of Cuts in Prolog Source-Level Tools, Proceedings of the Symposium on Logic Programming, IEEE 1985, pp. 68–72.
  10. R.O’Keefe, The Craft of Prolog, MIT Press 1990.
  11. S.Owen, Issues in the Partial Evaluation of Meta-Interpreters, Proceedings of the Workshop on Meta-Programming in Logic Programming, 1988, pp. 241–254.
  12. M.Proietti, A.Pettorossi, Unfolding-Definition-Folding, in this Order, for Avoiding Unnecessary Variables in Logic Programs, Symposium on Program Language Implementation and Logic Programming, 1991, pp. 347–358. · DOI
  13. P.L.Van Roy, Can Logic Programming Execute as Fast as Imperative Programming? Report no.UCB/CSD 90/600 Dec.1990, Computer Science Division (EECS), University of California, Berkeley, California 94720.
  14. D.Sahlin, The Mixtus Approach to Automatic Partial Evaluation of Full Prolog, Proceedings of the North American Conference on Logic Programming, 1990, pp.377–398»
  15. A.Taylor, High Performance Prolog Implementation, PhD thesis, Basser Department of Computer Science, University of Sidney, June 1991.
  16. R.Venken, A Prolog Meta-Interpreter for Partial Evaluation and its Application to Source to Source Transformation and Query Optimisation, ECAI’84: Advances in Artificial Intelligence, ed. T.O’Shea, Elsevier Science Publishers B.V. (North-Holland), pp.91–100.
  17. R.Venken, B.Demoen, A Partial Evaluation System for Prolog: some Practical Considerations, New Generation Computing 6 (2,3), 1988, pp. 279–290. · DOI

Cited by

Sorted by citations

See all 16

Metadata

Authors
Prestwich, S.
Corresponding author
Prestwich, Steven
Venue
Workshops in Computing
Published
1993
Pages
199-213
ISSN
1431-1682 (ISSN-L)
OpenAlex
W1535866213
Cited by
16
References
0
FWCI
1.62
Type
conference paper
Language
en
Open access
closed
Locations
Workshops in computing (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
Keywords
Prolog, partial deduction, program simplification, redundancy elimination

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review