AbstractA classification of any logic program's failures into different levels of general finite failure is introduced. The general failure is then shown to be the limit of those general finite failures, and its interpretation coincides with the complement of the greatest model of the program. As a consequence of this, the negation-as-failure rule is proved
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractConsider the class of programs P where the greatest fixpoint of TP is equal to the complemen...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
AbstractA classification of any logic program's failures into different levels of general finite fai...
AbstractThe paper [1] purports to present a classification of the general failure sets of logic prog...
AbstractA general logic program is a set of rules that have both positive and negative subgoals. We ...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been...
AbstractIncorporating equality into the unification process has added great power to automated theor...
Abstract goes here. 1 Introduction Let us recall that a logic program is a set of clauses of the f...
AbstractThe class of logic programs with negation as failure in the head is a subset of the logic of...
Various approximations of classic negation have been proposed for logic programming. But the semanti...
AbstractThis paper deals with logic programs containing two kinds of negation: negation as failure a...
AbstractWe define in this paper a system of axioms for any general logic program. With regard to thi...
AbstractThe use of the negation as failure rule in logic programming is often considered to be tanta...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractConsider the class of programs P where the greatest fixpoint of TP is equal to the complemen...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
AbstractA classification of any logic program's failures into different levels of general finite fai...
AbstractThe paper [1] purports to present a classification of the general failure sets of logic prog...
AbstractA general logic program is a set of rules that have both positive and negative subgoals. We ...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been...
AbstractIncorporating equality into the unification process has added great power to automated theor...
Abstract goes here. 1 Introduction Let us recall that a logic program is a set of clauses of the f...
AbstractThe class of logic programs with negation as failure in the head is a subset of the logic of...
Various approximations of classic negation have been proposed for logic programming. But the semanti...
AbstractThis paper deals with logic programs containing two kinds of negation: negation as failure a...
AbstractWe define in this paper a system of axioms for any general logic program. With regard to thi...
AbstractThe use of the negation as failure rule in logic programming is often considered to be tanta...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractConsider the class of programs P where the greatest fixpoint of TP is equal to the complemen...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
DOI
Add to ORKG