SLDR-resolution: Parallelizing structural recursion in logic programs

DOI10.1016/0743-1066(95)00036-JMaRDI QIDQ3128621zbMATH OpenOpenAlexWikidataFDO

Authors Håkan Millroth

Publication date 17 April 1997

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(95)00036-j

zbMATH Keywords

operational semanticsSLDR-resolution inference

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• A parallel Prolog resolution based on multiple unifications
• scientific article; zbMATH DE number 549963
• Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions

Cited in

(2)

• SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
• Runtime repeated recursion unfolding in CHR: a just-in-time online program optimization strategy that can achieve super-linear speedup

This page was built for publication: SLDR-resolution: Parallelizing structural recursion in logic programs

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