Declarative modeling of the operational behavior of logic languages

DOI10.1016/0304-3975(89)90070-4zbMATH Open0699.68113OpenAlexW2089111669WikidataQ126310992 ScholiaQ126310992MaRDI QIDQ913530FDOQ913530

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

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90070-4

Recommendations

• A closer look at declarative interpretations
• Towards a logical semantics for pure Prolog
• A model-theoretic reconstruction of the operational semantics of logic programs
• scientific article; zbMATH DE number 823595
• On the declarative and procedural semantics of logic programs

zbMATH Keywords

fixpoint semanticsminimal modelslogic programsSLD-resolutiondeclarative semanticsHerbrand model semantics

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Unit Refutations and Horn Sets
• Contributions to the Theory of Logic Programming
• Title not available (Why is that?)
• Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
• Toward a declarative semantics for infinite objects in logic programming
• A fixpoint semantics of Horn sentences based on substitution sets
• Title not available (Why is that?)

Cited In (49)

• Algebraic methods in the compositional analysis of logic programs
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Fast offline partial evaluation of logic programs
• A declarative approach for first-order built-in's of Prolog
• Logic Foundations of the OCL Modelling Language
• Efficient bottom-up execution of logic programs using abstract interpretation
• Transforming constraint logic programs
• A new framework for declarative programming
• Institutions for logic programming
• Semantic models for concurrent logic languages
• On computability by logic programs
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• Description, implementation, and evaluation of a generic design for tabled CLP
• Title not available (Why is that?)
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• Constrained dependencies
• The powerset operator on abstract interpretations
• Title not available (Why is that?)
• The reduced relative power operation on abstract domains
• A compositional semantics for logic programs
• A new generic scheme for functional logic programming with constraints
• An integrated framework for the diagnosis and correction of rule-based programs
• On Correctness and Completeness of an n Queens Program
• S-semantics -- an example
• Coalgebraic semantics for parallel derivation strategies in logic programming
• A compact fixpoint semantics for term rewriting systems
• A denotational semantics and dataflow construction for logic programs
• A theory of observables for logic programs
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
• S-semantics for logic programming: a retrospective look
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Compositionality properties of SLD-derivations
• A model-theoretic reconstruction of the operational semantics of logic programs
• A declarative semantics of flat guarded Horn clauses for programs with perpetual processes
• Finite failures and partial computations in concurrent logic languages
• Nondeterminism and infinite computations in constraint programming
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
• Title not available (Why is that?)
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Abstract interpretation of resolution-based semantics
• Comparative semantics for flow of control in logic programming without logic
• Is there an axiomatic semantics for standard pure Prolog?
• A debugging scheme for functional logic programs
• Type dependencies for logic programs using ACI-unification
• Declarative debugging of functional logic programs
• Bottom-up abstract interpretation of logic programs
• Fully abstract compositional semantics for an algebra of logic programs

This page was built for publication: Declarative modeling of the operational behavior of logic languages

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