SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs

DOI10.1016/0304-3975(95)00109-3zbMath0872.68018OpenAlexW2020251941MaRDI QIDQ1350529

Susumu Yamasaki

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00109-3

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Declarative modeling of the operational behavior of logic languages
• Properties of substitutions and unifications
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• A sound and complete semantics for a version of negation as failure
• A kripke-kleene semantics for logic programs*
• Negation as failure. II
• Negation in logic programming
• Bottom-up dataflow analysis of normal logic programs
• The well-founded semantics for general logic programs
• Abductive Logic Programming

This page was built for publication: SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs