CoChat
Sign Up
Cited by 33Logic, programming, and type systemsAdvanced Algebra and LogicComputability, Logic, AI Algorithms

The DOI matches its Crossref record; 24 of the 26 references it cites were found in a registry or an index.

Preserving universal termination through unfold/fold

Bossi, Annalisa, Cocco, Nicoletta·1994·Lecture Notes in Computer Science
DOI 10.1007/3-540-58431-5_19
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/3-540-58431-5_19

Cites

24 of 24 references verified0 citation errors · 0 not checkable

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?

  • Termination under Prolog will be preserved by these unfolding rules.

    “Also, termination under Prolog will be preserved by these unfolding rules (termination behavior might however be improved, as for example ← loop, fail can be transformed into ← fail ).”

    From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Bossi and Cocco 1994

Citations

Cites

Flagged first, then by citations

2 of the 26 references couldn’t be matched to a known paper.

Research works printed but not linked: 4

  1. A. Bossi and N. Cocco. Preserving universal termination through unfold/fold. Technical Report 16, Dip. Matematica Pura e Applicata, Università di Padova, Italy, June 1994.
  2. T. Kawamura and T. Kanamori. Preservation of Stronger Equivalence in Unfold/Fold Logic Programming Transformation. In Proc. Int'l Conf. on Fifth Generation Computer Systems, pages 413–422. Institute for New Generation Computer Technology, Tokyo, 1988.
  3. H. Tamaki and T. Sato. Unfold/Fold Transformations of Logic Programs. In StenÅke Tärnlund, editor, Proc. Second Int'l Conf. on Logic Programming, pages 127–139, 1984.
  4. T. Vasak and J. Potter. Characterization of Terminating Logic Programs. In Proc. Third IEEE Int'l Symp. on Logic Programming, pages 140–147. IEEE Comp. Soc. Press, 1986.

Cited by

Sorted by citations

Related

Metadata

Authors
Bossi, A., & Cocco, N.
Affiliations
  • University of Padua (IT)
  • Ca' Foscari University of Venice (IT)
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
1994
Pages
269-286
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/3-540-58431-5_19
OpenAlex
W1510115975
Cited by
33
References
26
Citations by year
2012: 1
FWCI
3.21
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • OpenGrey (Institut de l'Information Scientifique et Technique) (submittedVersion)
  • ARCA (Università Ca' Foscari Venezia) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
Keywords
unfold/fold transformations, definite programs, program transformation, logic programming

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