The DOI matches its Crossref record.
Sound and complete partial deduction with unfolding based on well-founded measures
Open accessOverview
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
Verification
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 cited source says what the claim attributes to it.
In the citing paper
“In summary, partial evaluation of ITE-Prolog, can be situated somewhere between partial deduction of pure logic programs (see [60,31,10,69,68] and systems like sP [30,29], sAGE [34,33] or more recently ECCE [50,51,57]) and partial evaluation of full Prolog (e.g. MIXTUs [83,82] or PADDY [76–78]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [69]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 10
- Aravindan, 1992, Partial deduction of logic programs w.r.t. well-founded semantics, Vol. 632, 384
- Barbuti, 1990, A transformational approach to negation in logic programming, J. Logic Programming, 8, 201, 10.1016/0743-1066(90)90023-X · DOI
- Bruynooghe, 1992, A general criterion for avoiding infinite unfolding during partial deduction, New Generation Comput., 11, 47, 10.1007/BF03037527 · DOI · Paper page
- Gallagher, 1986, Transforming logic programs by specialising interpreters, Proc. ECAI '86, 109
- Levi, 1988, Partial evaluation of metaprograms in a multiple worlds logic language, New Generation Comput., 6, 227, 10.1007/BF03037139 · DOI
- Lloyd, 1991, Partial evaluation in logic programming, J. Logic Programming, 11, 217, 10.1016/0743-1066(91)90027-M · DOI · Paper page
- Plotkin, 1970, A note on inductive generalization, Vol. 5, 153
- Reynolds, 1970, Transformational systems and the algebraic structure of atomic formulas, Vol. 5, 135
- Sterling, 1989, Metainterpreters for expert system construction, J. of Logic Programming, 6, 163, 10.1016/0743-1066(89)90034-4 · DOI
- Venken, 1988, A partial evaluation system for Prolog: some practical considerations, New Generation Comput., 6, 279, 10.1007/BF03037142 · DOI
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
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
Metadata
- Authors
- Martens, B., De Schreye, D., & Horváth, T.
- Affiliations
- KU Leuven (BE)
- Corresponding author
- Martens, Bern
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1994-01
- Volume
- 122
- Issue
- 1-2
- Pages
- 97-117
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W1512183835
- Cited by
- 32
- References
- 0
- Citations by year
- 2018: 1 · 2016: 1 · 2015: 1 · 2012: 1
- FWCI
- 4.63
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Theoretical Computer Science (publishedVersion)
- Lirias (acceptedVersion, other-oa)
- Lirias (submittedVersion, other-oa)
- Future Generation Computer Systems
- Funders
- Fonds De La Recherche Scientifique - FNRS
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
- Keywords
- partial deduction, logic programs, unfolding, termination, soundness, completeness, definite programs, program specialization
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
