Towards creating specialised integrity checks through partial evaluation of meta-interpreters
Open accessAbstract
In [23] we presented a partial evaluation scheme for a "real tomatically generating highly specialised update procedures for deductive databases.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The method for partial deduction described in Section 3, using the framework of Section 3, guarantees preservation of characteristic trees.
“The method for partial deduction as described in this section, using the framework of Section 3, has been called ecological partial deduction by Leuschel [1995] because it guarantees the preservation of characteristic trees.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Leuschel [1995]
The copy discusses partial evaluation of a meta-interpreter for integrity checking, including unfolding it in Section 4, but does not address preservation of characteristic trees. Searches for “ecological partial deduction” and “characteristic trees” found no passage stating the claimed name or guarantee. The indexed passages provide no page numbers. (LLM, conf=0.76)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Schreye, D., & Martens, B. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-56282-6_13 · Cited by 10 · see citing works
Self-citation
Flagged first, then by citations
Research works printed but not linked: 2
- K. R. Apt. pTOCfXdhtfJ8 Meta '92, Lecture Notes in Computer Science 649, pages 192-204. Springer Verlag, 1992.
- A Let J. W. Lloyd, E. A. Sonenberg, and R. W. Topor. In- tegrit y checking in stratified databases. Journal of Logic ProgTarnming, 4(4):331-343, 1987.
Cited by
Sorted by citations
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88 · see citing works
Self-citationCreating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29 · see citing works
Self-citationEfficiently generating efficient generating extensions in prolog
Jørgensen, J., & Leuschel, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61580-6_12 · Cited by 26 · see citing works
Self-citation
- Authors
- Leuschel, M., & De Schreye, D.
- Venue
- Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 253-263
- OpenAlex
- W2121947494
- Cited by
- 16
- References
- 1
- FWCI
- 3.67
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) (publishedVersion)
- Lirias (acceptedVersion, other-oa)
- ePrints Soton (University of Southampton) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Keywords
- partial evaluation, meta-interpreter, integrity verification, deductive databases, automatic code generation
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
