Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements

DOI10.1006/inco.1998.2724zbMath0921.68057OpenAlexW2055211179MaRDI QIDQ1275821

Francesco Ranzato, Roberto Giacobazzi

Publication date: 13 January 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4232f7c6524e30e3c33e16f6fa5f1cdeb8ebfd71

zbMATH Keywords

declarative semantics\(s\)-semantics of logic programming

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (6)

Transforming Abstract Interpretations by Abstract Interpretation ⋮ Maximal incompleteness as obfuscation potency ⋮ Making abstract models complete ⋮ Weakening additivity in adjoining closures ⋮ Abstract interpretation of resolution-based semantics ⋮ Closures on CPOs form complete lattices

Cites Work

• Closures and fairness in the semantics of programming logic
• Declarative modeling of the operational behavior of logic languages
• Equational closure operator and forbidden semidistributive lattices
• Weak relative pseudo-complements of closure operators
• Compositionality properties of SLD-derivations
• A compositional semantics for logic programs
• Bottom-up abstract interpretation of logic programs
• A model-theoretic reconstruction of the operational semantics of logic programs
• Optimal domains for disjunctive abstract interpretation
• The powerset operator on abstract interpretations
• The closure operators of a lattice
• A hierarchy of semantics for normal constraint logic programs
• Complementing logic program semantics
• Grammar Analysis and Parsing by Abstract Interpretation
• Laws of programming
• Abstract interpretation and application to logic programs
• The Semantics of Predicate Logic as a Programming Language
• The s-semantics approach: Theory and applications
• The meaning of negative premises in transition system specifications
• Refining and compressing abstract domains
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements