Ordering optimizations for concurrent logic programs

DOI10.1007/BFB0023876MaRDI QIDQ2757844zbMATH OpenFDO

Authors Andy King, Paul Soper

Publication date 4 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0023876

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 516999
• Semantics of partial-order programs
• Abstract domains for reordering CLP(RLin) programs
• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Static analysis of logic programs for independent and parallelism

Cited in

(3)

• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Dynamic reordering of alternatives for definite logic programs
• scientific article; zbMATH DE number 1254032 (Why is no real title available?)

This page was built for publication: Ordering optimizations for concurrent logic programs

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