Compositionality properties of SLD-derivations

DOI10.1016/S0304-3975(97)00174-6zbMath0912.68124OpenAlexW2042211420MaRDI QIDQ1274454

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

compositionalitysemanticslogic programmingSLD-derivations

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Declarative modeling of the operational behavior of logic languages
• Properties of substitutions and unifications
• Denotational and operational semantics for prolog
• The s-semantics approach: Theory and applications
• Resultant semantics for prolog

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