The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Automatic finite unfolding using 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?
Plugging in a depth-bound-free local control strategy yields a fully automatic, concrete partial-deduction method that always terminates and produces precise and reasonable polyvariance, without resorting to ad hoc techniques.
“Plugging in a depth-bound-free local control strategy (see Bruynooghe et al. [1992] and Martens and De Schreye [1996]), we thus obtain a fully automatic, concrete partial-deduction method that always terminates and produces precise and reasonable polyvariance, without resorting to any ad hoc techniques.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Martens and De Schreye [1996]
Partial evaluation of ITE-Prolog can be situated somewhere between partial deduction of pure logic programs and partial evaluation of full Prolog.
“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 [68]
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
A self-applicable partial evaluator and its use in incremental compilation
Fujita, H., & Furukawa, K. (1988) · New Generation Computing · doi:10.1007/bf03037133 · Cited by 35
Flagged first, then by citations
Research works printed but not linked: 21
- Bol, 1993, Loop Checking in Partial Deduction, J. Logic Programming, 16, 25, 10.1016/0743-1066(93)90022-9 · DOI
- Bol, 1991, An Analysis of Loop Checking Mechanisms for Logic Programs, Theoretical Comput. Sci., 86, 35, 10.1016/0304-3975(91)90004-L · DOI
- Bruynooghe, 1989, Compiling Control, J. Logic Programming, 6, 135, 10.1016/0743-1066(89)90033-2 · DOI
- Bruynooghe, 1992, A General Criterion for Avoiding Infinite Unfolding During Partial Deduction, New Generation Computing, 11, 47, 10.1007/BF03037527 · DOI · Paper page
- Cousot, 1992, Abstract Interpretation and Application to Logic Programs, J. Logic Programming, 13, 103, 10.1016/0743-1066(92)90030-7 · DOI · Paper page
- De Schreye, 1993, Termination of Logic Programs: The Never-Ending Story, 10.1016/0743-1066(94)90027-2 · DOI
- Dershowitz, 1987, Termination of Rewriting, J. Symbolic Computation, 3, 69, 10.1016/S0747-7171(87)80022-6 · DOI
- 1987, Corrigendum in, 4, 409
- Floyd, 1967, Assigning Meaning to Programs, 19, 10.1090/psapm/019/0235771 · DOI
- Fuller, 1988, Mixed Computation of Prolog Programs, New Generation Computing, 6, 119, 10.1007/BF03037134 · DOI
- 1990, Revised version in New Generation Computing, 9, 305
- Komorowski, 1993, Guest Editor's Introduction, J. Logic Programming, 16, 1, 10.1016/0743-1066(93)90020-H · DOI
- Levi, 1988, Partial Evaluation of Metaprograms in a Multiple Worlds Logic Language, New Generation Computing, 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
- Martens, 1994, Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures, Theoretical Comput. Sc., 122, 97, 10.1016/0304-3975(94)90203-8 · DOI · Paper page
- Mogensen, 1992, Logimix: A Self-Applicable Partial Evaluator for Prolog, 10.1007/978-1-4471-3560-9_15 · DOI
- Proietti, 1993, The Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction, J. Logic Programming, 16, 123, 10.1016/0743-1066(93)90025-C · DOI
- Sahlin, 1991, An Automatic Partial Evaluator for Full Prolog, 10.1007/BF03038271 · DOI · Paper page
- Sahlin, 1993, Mixtus: An Automatic Partial Evaluator for Full Prolog, New Generation Computing, 12, 7, 10.1007/BF03038271 · DOI · Paper page
- Sterling, 1989, Meta Interpreters for Expert System Construction, J. 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 Computing, 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
Efficiently 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
Metadata
- Authors
- Martens, B., & De Schreye, D.
- Affiliations
- KU Leuven (BE)
- Corresponding author
- Martens, Bern
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1996-08
- Volume
- 28
- Issue
- 2
- Pages
- 89-146
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2008251703
- Cited by
- 37
- References
- 1
- Citations by year
- 2013: 1
- FWCI
- 9.08
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Lirias (KU Leuven) (acceptedVersion, other-oa)
- 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 › Information Systems › Advanced Database Systems and Queries
- Keywords
- partial deduction, logic programs, well-founded orderings, argument position, Datalog
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
