A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses

DOI10.1016/0304-3975(92)90391-RzbMath0774.68023MaRDI QIDQ1193863

Stefano Baratella

Publication date: 27 September 1992

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

zbMATH Keywords

strictness3-valued logicwell-behavednessSLDNF-resolution2-valued logicallowed programNAF-ruleSLDNF-refutation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial models and logic programming
• Model theory
• A completeness theorem for SLDNF resolution
• A kripke-kleene semantics for logic programs*
• Negation in logic programming