Loop checking in partial deduction

DOI10.1016/0743-1066(93)90022-9zbMATH Open0780.68012OpenAlexW2135124683WikidataQ127647087 ScholiaQ127647087MaRDI QIDQ5286916FDOQ5286916

Authors: Roland N. Bol 

Publication date: 6 February 1994

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/5549

Recommendations

• An analysis of loop checking mechanisms for logic programs
• scientific article; zbMATH DE number 813263
• Sound and complete partial deduction with unfolding based on well-founded measures
• scientific article; zbMATH DE number 970704

zbMATH Keywords

partial deductionprogram transformationstermination

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (14)

• Title not available (Why is that?)
• The narrowing-driven approach to functional logic program specialization
• Deciding the bisimilarity relation between Datalog goals
• A general criterion for avoiding infinite unfolding during partial deduction
• A partial evaluation framework for order-sorted equational programs modulo axioms
• Title not available (Why is that?)
• Making assumptions in the automated derivation
• Loop checks for logic programs with functions
• Explanations as programs in probabilistic logic programming
• Rules + strategies for transforming lazy functional logic programs
• Knowledge base dynamics, abduction, and database updates
• The next 700 program transformers
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• Type-based homeomorphic embedding for online termination

This page was built for publication: Loop checking in partial deduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286916)