scientific article

zbMATH Open0776.68079MaRDI QIDQ4035697FDOQ4035697

Jean-Paul Delahaye, François Denis

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

semantics of logic programsunfolding semantics

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (17)

• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Transforming constraint logic programs
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• Title not available (Why is that?)
• The reduced relative power operation on abstract domains
• A compositional semantics for logic programs
• Guided unfoldings for finding loops in standard term rewriting
• Towards a Semantics of Unsatisfiability Proofs with Inprocessing
• S-semantics for logic programming: a retrospective look
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Programs, Recursion and Unbounded Choice
• Title not available (Why is that?)
• Abstract interpretation of resolution-based semantics
• Is there an axiomatic semantics for standard pure Prolog?
• Fixpoint semantics for logic programming a survey
• Title not available (Why is that?)

   Recommendations

• Unfolding and fixpoint semantics of concurrent constraint logic programs 👍 👎
• Title not available (Why is that?) 👍 👎
• Unfolding and fixpoint semantics of concurrent constraint logic programs 👍 👎
• Unfold/fold transformations of logic programs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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