Closures and fairness in the semantics of programming logic

DOI10.1016/0304-3975(84)90017-3MaRDI QIDQ799098zbMATH OpenOpenAlexWikidataFDO

Authors Jean-Louis Lassez, Michael J. Maher

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0304-3975(84)90017-3

zbMATH Keywords

fixed point theoremsdenotational semanticslogic programsSLD resolution

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 1405454
• A kripke-kleene semantics for logic programs*
• scientific article; zbMATH DE number 3872640
• Top-down semantics of fair computations of logic programs
• A fixed point semantics for logic programs extended with cuts

Cites work

• scientific article; zbMATH DE number 3817067 (Why is no real title available?)
• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• scientific article; zbMATH DE number 3725663 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A lattice-theoretical fixpoint theorem and its applications
• Closures and fairness in the semantics of programming logic
• Constructive versions of Tarski's fixed point theorems
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language

Cited in

(28)

• Closures and fairness in the semantics of programming logic
• Semantics of infinite tree logic programming
• Unfold/fold transformation of stratified programs
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Why a single parallelization strategy is not enough in knowledge bases
• Optimal fixedpoints of logic programs
• Contributions to the semantics of logic perpetual processes
• Semantics of distributed definite clause programs
• Weak generalized closed world assumption
• Paraconsistent logic programming
• A semantics for modular general logic programs
• -Universal termination of logic programs
• The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
• A compositional semantics for logic programs
• scientific article; zbMATH DE number 1405454 (Why is no real title available?)
• Sémantique logique et dénotationnelle des interpréteurs PROLOG
• S-semantics for logic programming: a retrospective look
• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• Efficient analysis of concurrent constraint logic programs
• Negation in rule-based database languages: A survey
• Conditional equational theories and complete sets of transformations
• Recursion equation sets computing logic programs
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Definite clause programs are canonical (over a suitable domain)
• Is there an axiomatic semantics for standard pure Prolog?
• Maximal unifiable subsets and minimal non-unifiable subsets
• Complete extension of general logic programs
• Fully abstract compositional semantics for an algebra of logic programs

This page was built for publication: Closures and fairness in the semantics of programming logic

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