Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Material
Consortium
Language
  • 1
    UID:
    (DE-605)HT004471395
    Format: 200 S. : graph. Darst.
    Note: Zsfassung in niederländ. Sprache , Amsterdam, Univ., Diss., 1991
    Language: Undetermined
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    (DE-604)BV005424780
    Format: 201 S.
    Note: Univ. van Amsterdam, Diss., 1991
    Language: English
    Keywords: Logische Programmierung ; Schleifentest ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    (DE-627)019567677
    Format: 201 S , graph. Darst
    Note: Amsterdam, Univ., Diss. : 1991
    Language: English
    Keywords: Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Amsterdam : CWI
    UID:
    (DE-627)018466001
    Format: 34 Seiten
    Series Statement: Report CS / Centrum voor Wiskunde en Informatica, Department of Computer Science 9134
    Language: English
    Keywords: Bericht
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Amsterdam
    UID:
    (DE-604)BV011028564
    Format: 198 S.
    ISBN: 9061964563
    Series Statement: Centrum voor Wiskunde en Informatica 〈Amsterdam〉: CWI Tract 112
    Note: Zugl.: Amsterdam, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Logische Programmierung ; Schleifentest ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Book
    Book
    Amsterdam
    UID:
    (DE-604)BV008974423
    Format: 32 S.
    Series Statement: Centrum voor Wiskunde en Informatica 〈Amsterdam〉/ Department of Computer Science: Report CS 90,75
    Content: Abstract: "In this article we extend the concept of loop checking from positive programs (as described in [ABK]) to locally stratified programs. Such an extension is not straightforward: the introduction of negation requires a (re)consideration of the choice of semantics, the description of a related search space and new soundness and completeness results handling floundering in a satisfactory way. Nevertheless an extension is achieved that allows us to generalize the loop checking mechanisms from positive programs to locally stratified programs, while preserving most soundness and completeness results. The conclusion is that negative literals cannot give rise to loops, and must be simply ignored."
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Amsterdam : CWI
    UID:
    (DE-627)018377157
    Format: 18 S
    Series Statement: Report CS / Centrum voor Wiskunde en Informatica, Department of Computer Science 9026
    Language: English
    Keywords: Bericht
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Book
    Book
    Amsterdam
    UID:
    (DE-604)BV008950525
    Format: 18 S.
    Series Statement: Centrum voor Wiskunde en Informatica 〈Amsterdam〉 / Department of Computer Science: Report CS 90,26
    Content: Abstract: "Loop checking is a mechanism for pruning infinite SLD-derivations. Most loop checks essentially compare the goals in a derivation: a derivation is pruned if 'sufficiently similar' goals are detected. In theory a goal is usually compared with every previous goal in the derivation, but in practice such loop checks are too expensive. Here we investigate how to alter such loop checks to obtain less expensive ones (notably such that the number of comparisons performed is linear in the number of goals generated) while retaining the soundness and completeness results of the original loop check
    Content: To this end we modify Van Gelder's [vG] 'tortoise-and-hare' technique and study in detail the number of comparisons performed by a loop check whose checkpoints are placed in accordance with the triangular numbers.
    Additional Edition: Erscheint auch als Online-Ausgabe
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    (DE-604)BV008950526
    Format: 29 S.
    Series Statement: Centrum voor Wiskunde en Informatica 〈Amsterdam〉 / Department of Computer Science: Report CS 90,25
    Content: Abstract: "Loop checking is a mechanism for pruning infinite SLD-derivations. In [BAK], simple loop checks were introduced and their soundness, completeness and relative strength was studied. Since no sound and complete simple loop check exists even in the absence of function symbols, subclasses of programs were determined for which the (sound) loop checks introduced in [BAK] are complete. In this paper, the Generalization Theorem is proven. This theorem presents a method to extend (under certain conditions) a class of programs for which a given loop check is complete to a larger class, for which the loop check is still complete. Then this theorem is applied to the results of [BAK], giving rise to stronger completeness theorems
    Content: It appears that unnecessary complications in the proof of the theorem can be avoided by introducing a normal form for SLD-derivations, allowing only certain most general unifiers. This normal form might have other applications than those in the area of loop checking.
    Additional Edition: Erscheint auch als Online-Ausgabe
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    (DE-602)b3kat_BV005424780
    Format: 201 S.
    Note: Univ. van Amsterdam, Diss., 1991
    Language: English
    Keywords: Logische Programmierung ; Schleifentest ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages