RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS

DOI10.1142/S0129054190000126MaRDI QIDQ3348389zbMATH OpenOpenAlexFDO

Authors Roberto Barbuti, M. Martelli

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000126

zbMATH Keywords

flounderingnegation

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Publication:3201746
• Completeness of SLDNF-resolution for nonfloundering queries
• scientific article; zbMATH DE number 4092826
• Negation as instantiation
• A direct proof of the completeness of SLDNF-resolution

Cited in

(3)

• scientific article; zbMATH DE number 4178746 (Why is no real title available?)
• Transforming floundering into success
• Strict completion of logic programs

This page was built for publication: RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348389)