We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program P. Allowing for a safe use of cuts, an interpreter based on SLDNF-resolution, as implemented for example in standard Prolog systems, is shown to be sound and complete with respect to this class of programs. Furthermore, we study connections between topological dynamics and logic programming which are suggested by our approach to the declarative seman...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
In this paper we present the class of general logic programs which has a special kind of stratificat...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
We study a powerful class of logic programs which terminate for a large class of goals. Both classes...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
In this paper, we investigate the decidability problem of logic program semantics and observables, f...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
We consider a mode of an n-ary predicate symbol with respect to a logic program, which meets the aim...
World Scientific Series in Computer Science, 31, 227--245,1991SLDNF-resolution procedure is not comp...
We consider propositional logic programs with negations. We define notions of constructive transform...
In the logic programming, it is generally undecidable, whether or not a formula is deducible from a ...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
In this paper we present the class of general logic programs which has a special kind of stratificat...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
We study a powerful class of logic programs which terminate for a large class of goals. Both classes...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
In this paper, we investigate the decidability problem of logic program semantics and observables, f...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
We consider a mode of an n-ary predicate symbol with respect to a logic program, which meets the aim...
World Scientific Series in Computer Science, 31, 227--245,1991SLDNF-resolution procedure is not comp...
We consider propositional logic programs with negations. We define notions of constructive transform...
In the logic programming, it is generally undecidable, whether or not a formula is deducible from a ...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...