Closures and fairness in the semantics of programming logic
From MaRDI portal
Using the techniques of closures and chaotic iterations of P. Cousot and R. Cousot, the authors give a semantics to logic programs and then study some fixed point theorems, denotational semantics and the like. The final section is devoted to an extension of the characterization of SLD finite failure given by \textit{K. R. Apt} and \textit{M. H. van Emden} [J. Assoc. Comput. Mach. 29, 841-862 (1982; Zbl 0483.68004)].
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A Machine-Oriented Logic Based on the Resolution Principle
- Closures and fairness in the semantics of programming logic
- Constructive versions of Tarski's fixed point theorems
- Contributions to the Theory of Logic Programming
- 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?)
- The Semantics of Predicate Logic as a Programming Language
Cited in
(28)- S-semantics for logic programming: a retrospective look
- Optimal fixedpoints of logic programs
- Maximal unifiable subsets and minimal non-unifiable subsets
- Semantics of infinite tree logic programming
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
- Contributions to the semantics of logic perpetual processes
- Unfold/fold transformation of stratified programs
- Complete extension of general logic programs
- Paraconsistent logic programming
- Semantics of distributed definite clause programs
- A semantics for modular general logic programs
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- A compositional semantics for logic programs
- Definite clause programs are canonical (over a suitable domain)
- Weak generalized closed world assumption
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
- Sémantique logique et dénotationnelle des interpréteurs PROLOG
- Efficient analysis of concurrent constraint logic programs
- scientific article; zbMATH DE number 1405454 (Why is no real title available?)
- -Universal termination of logic programs
- Fully abstract compositional semantics for an algebra of logic programs
- Why a single parallelization strategy is not enough in knowledge bases
- Negation in rule-based database languages: A survey
- Closures and fairness in the semantics of programming logic
- Is there an axiomatic semantics for standard pure Prolog?
- Conditional equational theories and complete sets of transformations
- Recursion equation sets computing 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)
