AbstractWe present two sufficient conditions, a negative-cycle-free condition and an order-consistency condition, for a logic program to have a Herbrand model of its completion. They yield new classes of logic programs whose completions are consistent
This paper investigates the advantages of reasoning on logic programs and queries that have only s...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
Research in logic programming shows an increasing interest in studying tight logic programs because ...
AbstractWe present two sufficient conditions, a negative-cycle-free condition and an order-consisten...
AbstractThe completion of a program introduced by Clark is important for giving a declarative semant...
The completion of a program introduced by Clark is important for giving a declarative semantics to t...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
AbstractSemantics for positive programs have been thoroughly explored in the context of Herbrand mod...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
AbstractWe prove the completeness of SLDNF resolution and negation as failure for stratified, normal...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
We develop a perfect model semantics for logic programs with negation and equality. Our approach is ...
AbstractIn several familiar cases of logic programs and queries with infinitely many answers, the us...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
This paper investigates the advantages of reasoning on logic programs and queries that have only s...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
Research in logic programming shows an increasing interest in studying tight logic programs because ...
AbstractWe present two sufficient conditions, a negative-cycle-free condition and an order-consisten...
AbstractThe completion of a program introduced by Clark is important for giving a declarative semant...
The completion of a program introduced by Clark is important for giving a declarative semantics to t...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
AbstractSemantics for positive programs have been thoroughly explored in the context of Herbrand mod...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
AbstractWe prove the completeness of SLDNF resolution and negation as failure for stratified, normal...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
We develop a perfect model semantics for logic programs with negation and equality. Our approach is ...
AbstractIn several familiar cases of logic programs and queries with infinitely many answers, the us...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
This paper investigates the advantages of reasoning on logic programs and queries that have only s...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
Research in logic programming shows an increasing interest in studying tight logic programs because ...
DOI
Add to ORKG