Loop checking in SLD-derivations by well-quasi-ordering of goals
type: Item
instance of: scholarly article
title: Loop checking in SLD-derivations by well-quasi-ordering of goals
zbMATH Open document ID: 0944.68013
DOI: 10.1016/S0304-3975(98)00167-4
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1493199
zbMATH Keywords: logic programming
zbMATH Keywords: termination
zbMATH Keywords: loop checking
zbMATH Keywords: well-quasi-ordering
author: Giuliano Pacini
author: Maria I. Sessa
MaRDI profile type: Publication
cites work: Q4385536
cites work: Reasoning about termination of pure Prolog programs
cites work: Magic sets with full sharing
cites work: On the power of magic
cites work: Strong termination of logic programs
cites work: An analysis of loop checking mechanisms for logic programs
cites work: Generalizing completeness results for loop checks in logic programming
cites work: Loop checking in partial deduction
cites work: Norms on terms and their use in proving universal termination of a logic program
cites work: Q4385532
cites work: Redundancy elimination and loop checks for logic programs
cites work: Efficient loop detection in prolog using the tortoise-and-hare technique
cites work: Q3348436
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Resolution Strategies as Decision Procedures
cites work: Q3339245
cites work: Partial evaluation in logic programming
cites work: Deleting Repeated Goals in the Problem Reduction Format
cites work: On termination of general logic programs w.R.T. constructive negation
cites work: Q5337204
cites work: Magic templates: a spellbinding approach to logic programs
cites work: The Alexander Method - a technique for the processing of recursive axioms in deductive databases
cites work: Q3746920
cites work: Recursive query processing: The power of logic
cites work: Q4035671
Wikidata QID: Q127872537
description: scientific article; zbMATH DE number 1493199