A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete

DOI10.1016/0304-3975(93)90246-PzbMath0796.68052MaRDI QIDQ689290

Stefano Baratella

Publication date: 22 September 1994

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

zbMATH Keywords

allowed programslocally call-consistent programsnegation as-finite-failureSLDNF resolution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Related Items (1)

Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial models and logic programming
• Acyclic logic programs and the completeness of SLDNF-resolution
• A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
• Graph properties for normal logic programs
• Model theory
• A completeness theorem for SLDNF resolution
• Completed logic programs and their consistency
• A kripke-kleene semantics for logic programs*
• The consistency of negation as failure
• Negation in logic programming

This page was built for publication: A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete