scientific article; zbMATH DE number 4057010

MaRDI QIDQ3792244zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

computable functionsmodel of computationpartial recursive functionPrimlogrestricted logic programs

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Logic Programs for Primitive Recursive Sets
• scientific article; zbMATH DE number 1696840
• On computability by logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• scientific article; zbMATH DE number 3890698

Cited in

(9)

• An analysis of loop checking mechanisms for logic programs
• Generalizing completeness results for loop checks in logic programming
• scientific article; zbMATH DE number 1696840 (Why is no real title available?)
• scientific article; zbMATH DE number 3890698 (Why is no real title available?)
• scientific article; zbMATH DE number 4028939 (Why is no real title available?)
• scientific article; zbMATH DE number 58299 (Why is no real title available?)
• Tight, consistent, and computable completions for unrestricted logic programs
• Logic Programs for Primitive Recursive Sets
• Strict completion of logic programs

This page was built for publication:

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