A model-theoretic reconstruction of the operational semantics of logic programs

DOI10.1006/INCO.1993.1015MaRDI QIDQ1803658zbMATH OpenOpenAlexFDO

Authors M. Falaschi, Giorgio Levi, M. Martelli, Catuscia Palamidessi

Publication date 29 June 1993

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

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

zbMATH Keywords

logic programmingoperational semantics

Mathematics Subject Classification ID

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

Review text

This paper shows the relations between various models for logic programming, and compare their relative capability to capture features of the operational semantics. The main novelty consists of considering Herbrand interpretations with variables, based on which a new notion of truth is defined, which extends the classical one. The model thus defined is shown to characterize the set of the computed answer substitutions, and it is ``the most informative in this framework. Other models, corresponding to the ground success set, and to the atomic consequences set, are shown to be derivable from the former. The relation of ``containing more information is captured by an appropriate ordering on sets of atoms (interpretations). All these models are shown to be the fixpoints of suitable one-step consequence operators.

Recommendations

• scientific article; zbMATH DE number 25193
• Declarative modeling of the operational behavior of logic languages
• A closer look at declarative interpretations
• Compositional model-theoretic semantics for logic programs

Cited in

(22)

• S-semantics for logic programming: a retrospective look
• Abstract interpretation of resolution-based semantics
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• A new framework for declarative programming
• Type dependencies for logic programs using ACI-unification
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Model reconciliation in logic programs
• scientific article; zbMATH DE number 1678380 (Why is no real title available?)
• Declarative debugging of functional logic programs
• A debugging scheme for functional logic programs
• A declarative debugging system for lazy functional logic programs
• Structural operational semantics and modal logic, revisited
• Enumeration operators and modular logic programming
• scientific article; zbMATH DE number 4039258 (Why is no real title available?)
• scientific article; zbMATH DE number 176721 (Why is no real title available?)
• scientific article; zbMATH DE number 1332638 (Why is no real title available?)
• scientific article; zbMATH DE number 4114113 (Why is no real title available?)
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Relating models of backtracking
• An integrated framework for the diagnosis and correction of rule-based programs
• A new generic scheme for functional logic programming with constraints
• Declarative modeling of the operational behavior of logic languages

This page was built for publication: A model-theoretic reconstruction of the operational semantics of logic programs

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