Compositionality properties of SLD-derivations

DOI10.1016/S0304-3975(97)00174-6MaRDI QIDQ1274454zbMATH OpenOpenAlexFDO

Authors Marco Comini, Maria Chiara Meo

Publication date 12 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00174-6

zbMATH Keywords

semanticscompositionalitylogic programmingSLD-derivations

Mathematics Subject Classification ID

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

Recommendations

• A theory of observables for logic programs
• Program Development in Computational Logic
• Theoretical Foundations and Semantics of Logic Programming
• A compositional semantics for logic programs

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• Declarative modeling of the operational behavior of logic languages
• Denotational and operational semantics for prolog
• Properties of substitutions and unifications
• Resultant semantics for prolog
• The s-semantics approach: Theory and applications

Cited in

(6)

• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• A framework for computing finite SLD trees
• A theory of observables for logic programs
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Abstract interpretation of resolution-based semantics
• On the verification of finite failure

This page was built for publication: Compositionality properties of SLD-derivations

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