Complementing logic program semantics

DOI10.1007/3-540-61735-3_16MaRDI QIDQ2956725zbMATH OpenOpenAlexFDO

Authors Roberto Giacobazzi, Francesco Ranzato

Publication date 19 January 2017

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61735-3_16

Mathematics Subject Classification ID

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

Recommendations

• Fully abstract compositional semantics for an algebra of logic programs
• Institutions for logic programming
• Compositional Semantics for the Procedural Interpretation of Logic
• A compositional semantics for logic programs
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics

Cited in

(14)

• Abstract interpretation of resolution-based semantics
• Compositional model-theoretic semantics for logic programs
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• The reduced relative power operation on abstract domains
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• The powerset operator on abstract interpretations
• A semantic approach to illative combinatory logic
• A structured alternative to Prolog with simple compositional semantics
• Decomposing non-redundant sharing by complementation
• An interactive semantics of logic programming
• scientific article; zbMATH DE number 1487850 (Why is no real title available?)
• Compositional Semantics for the Procedural Interpretation of Logic
• Transforming semantics by abstract interpretation
• A sound and complete semantics for a similarity-based logic programming language

This page was built for publication: Complementing logic program semantics

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