AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect to a natural Herbrand based semantics. The paper discusses two aspects of this problem: Characterize those programs that are complete (i.e. for which SLD-resolution is complete); if a program is not complete, then construct a complete extension of the program so that the two programs have the same finite and infinite semantics. Partial results are obtained for both problems
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
Abstract. We consider an extensional higher-order logic programming language which possesses the min...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
International audienceThe question of the termination of logic programming computations is studied f...
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...
An obstacle to practical logic programming systems with equality is infinite computation. In the dis...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We show the completeness of an extension of SLD resolution to the equational setting. This proves a ...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractWe discuss semantics of equational Horn-clause programs based on the notion of a complete se...
AbstractWe show the completeness of an extension of SLD-resolution to the equational setting. This p...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
Abstract. We consider an extensional higher-order logic programming language which possesses the min...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
International audienceThe question of the termination of logic programming computations is studied f...
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...
An obstacle to practical logic programming systems with equality is infinite computation. In the dis...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We show the completeness of an extension of SLD resolution to the equational setting. This proves a ...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractWe discuss semantics of equational Horn-clause programs based on the notion of a complete se...
AbstractWe show the completeness of an extension of SLD-resolution to the equational setting. This p...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
Abstract. We consider an extensional higher-order logic programming language which possesses the min...
DOI
Add to ORKG