A fixpoint semantics for reasoning about finite failure
The semantic of negation in logic programming has received a considerable attention in the last few years and is still an active research area. This paper contributes to this field by considering the semantics of finite failure. The result obtained here shows that one can obtain a fixpoint characterization of the set of atoms having a fair finitely failed SLD-tree. The proof uses in a nice way abstract interpretation techniques, thus showing that these techniques can be useful also outside the area of static analysis. For the entire collection see [Zbl 0921.00037].
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- Fixpoint semantics for logic programming a survey
- What is failure? An approach to constructive negation
- scientific article; zbMATH DE number 65758
- Closures and fairness in the semantics of programming logic
- Fixpoint semantics and simulation
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- A theory of observables for logic programs
- On the verification of finite failure
- An Extended cCSP with Stable Failures Semantics
- Finite failure is and-compositional
- On the verification of finite failure
- scientific article; zbMATH DE number 2155176 (Why is no real title available?)
- A proof theoretic approach to failure in functional logic programming
- Failures semantics based on interval semiwords is a congruence for refinement
- Closures and fairness in the semantics of programming logic
This page was built for publication: A fixpoint semantics for reasoning about finite failure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938429)
