Semantics of infinite tree logic programming
Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Toward a declarative semantics for infinite objects in logic programming
Journal of Logic Programming
Contributions to the semantics of logic perpetual processes
Acta Informatica
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
A uniform approach to type theory
Logical foundations of functional programming
Logic programming, functional programming, and inductive definitions
Proceedings of the international workshop on Extensions of logic programming
Completions of perpetual logic programs
Theoretical Computer Science
Computation as logic
A grammatical view of logic programming
A grammatical view of logic programming
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
Journal of Automated Reasoning
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
On the Interpretation of Infinite Computations in Logic Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
This paper aims to define a complete semantics for a class of non-terminating logic programs. Standard approaches to deal with this problem consist in concentrating on programs where infinite derivations can be seen as computing, in the limit, some "infinite object". This is usually done by extending the domain of computation with infinite elements and then defining the meaning of programs in terms of greatest fixpoints. The main drawback of these approaches is that the semantics defined is not complete. The approach considered here is exactly the opposite. We concentrate on the infinite derivations that do not compute an infinite term: this paper studies the operational counterpart of the greatest fixpoint of the one-step-inference operator for the C-semantics. The main result is that such fixpoint corresponds to the set of atoms that have a non-failing fair derivation with the additional property that complete information over a variable is obtained after finitely many steps.