Closures and fairness in the semantics of programming logic
From MaRDI portal
Publication:799098
DOI10.1016/0304-3975(84)90017-3zbMath0547.68034OpenAlexW2092054572WikidataQ127526099 ScholiaQ127526099MaRDI QIDQ799098
Michael J. Maher, Jean-Louis Lassez
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
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (27)
Semantics of infinite tree logic programming ⋮ Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions ⋮ Definite clause programs are canonical (over a suitable domain) ⋮ The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) ⋮ Contributions to the semantics of logic perpetual processes ⋮ Conditional equational theories and complete sets of transformations ⋮ Recursion equation sets computing logic programs ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Efficient analysis of concurrent constraint logic programs ⋮ Unfold/fold transformation of stratified programs ⋮ Fully abstract compositional semantics for an algebra of logic programs ⋮ Complete extension of general logic programs ⋮ Why a single parallelization strategy is not enough in knowledge bases ⋮ \(\exists\)-Universal termination of logic programs ⋮ Paraconsistent logic programming ⋮ Semantics of distributed definite clause programs ⋮ Negation in rule-based database languages: A survey ⋮ A semantics for modular general logic programs ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ Weak generalized closed world assumption ⋮ S-semantics for logic programming: a retrospective look ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ Closures and fairness in the semantics of programming logic ⋮ A compositional semantics for logic programs ⋮ Is there an axiomatic semantics for standard pure Prolog? ⋮ Optimal fixedpoints of logic programs ⋮ Maximal unifiable subsets and minimal non-unifiable subsets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closures and fairness in the semantics of programming logic
- Constructive versions of Tarski's fixed point theorems
- A lattice-theoretical fixpoint theorem and its applications
- Contributions to the Theory of Logic Programming
- The Semantics of Predicate Logic as a Programming Language
- A Machine-Oriented Logic Based on the Resolution Principle
This page was built for publication: Closures and fairness in the semantics of programming logic
