Declarative modeling of the operational behavior of logic languages

DOI10.1016/0304-3975(89)90070-4zbMath0699.68113OpenAlexW2089111669WikidataQ126310992 ScholiaQ126310992MaRDI QIDQ913530

Catuscia Palamidessi, Moreno Falaschi, Giorgio Levi, Maurizio 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

zbMATH Keywords

minimal modelslogic programsSLD-resolutionfixpoint semanticsdeclarative semanticsHerbrand model semantics

Mathematics Subject Classification ID

Related Items (44)

A declarative approach for first-order built-in's of Prolog ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Constraint logic programming with dynamic scheduling: A semantics based on closure operators ⋮ A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ A new generic scheme for functional logic programming with constraints ⋮ On computability by logic programs ⋮ Algebraic methods in the compositional analysis of logic programs ⋮ Institutions for logic programming ⋮ Constrained dependencies ⋮ On Correctness and Completeness of an n Queens Program ⋮ S-semantics -- an example ⋮ A new framework for declarative programming ⋮ Fast offline partial evaluation of logic programs ⋮ Finite failures and partial computations in concurrent logic languages ⋮ A declarative semantics of flat guarded Horn clauses for programs with perpetual processes ⋮ The powerset operator on abstract interpretations ⋮ Semantic models for concurrent logic languages ⋮ Nondeterminism and infinite computations in constraint programming ⋮ Fully abstract compositional semantics for an algebra of logic programs ⋮ From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Efficient bottom-up execution of logic programs using abstract interpretation ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Compositionality properties of SLD-derivations ⋮ Transforming constraint logic programs ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ S-semantics for logic programming: a retrospective look ⋮ Abstract interpretation of resolution-based semantics ⋮ The reduced relative power operation on abstract domains ⋮ Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424. ⋮ 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. ⋮ A theory of observables for logic programs ⋮ A compositional semantics for logic programs ⋮ Is there an axiomatic semantics for standard pure Prolog? ⋮ Comparative semantics for flow of control in logic programming without logic ⋮ A denotational semantics and dataflow construction for logic programs ⋮ Bottom-up abstract interpretation of logic programs ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Cites Work

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

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