A theory of observables for logic programs

DOI10.1006/inco.2000.3024zbMath1007.68020OpenAlexW2068328548MaRDI QIDQ1854446

Giorgio Levi, Marco Comini, Maria Chiara Meo

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.2000.3024

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (11)

Exploiting parallelism in coalgebraic logic programming ⋮ On collecting semantics for program analysis ⋮ Declarative Compilation for Constraint Logic Programming ⋮ A new framework for declarative programming ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ Logic programming: laxness and saturation ⋮ Correct Answers for First Order Logic ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ On the algebraic structure of declarative programming languages ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Declarative modeling of the operational behavior of logic languages
• Finite failures and partial computations in concurrent logic languages
• Properties of substitutions and unifications
• Compositionality properties of SLD-derivations
• A compositional semantics for logic programs
• Bottom-up abstract interpretation of logic programs
• Logical optimality of groundness analysis
• Observable behaviors and equivalences of logic programs
• Generalized semantics and abstract interpretation for constraint logic programs
• Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
• The s-semantics approach: Theory and applications
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Abstract diagnosis
• Resultant semantics for prolog
• Operational and goal-independent denotational semantics for Prolog with cut
• Systematic design of program transformation frameworks by abstract interpretation
• Making abstract interpretations complete
• A practical framework for theabstract interpretation of logic programs

This page was built for publication: A theory of observables for logic programs