scientific article; zbMATH DE number 4049157

MaRDI QIDQ3786037zbMATH OpenFDO

Authors Paris C. Kanellakis

Publication date 1986

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4128360
• The parallel complexity of simple logic programs
• Parallel Logic Programming: A Sequel
• PARLOG: parallel programming in logic
• Parallel complexity of logical query programs

Cited in

(17)

• Parallel complexity of logical query programs
• The parallel complexity of single rule logic programs
• Exploiting parallelism in coalgebraic logic programming
• Distribution policies for Datalog
• scientific article; zbMATH DE number 4090786 (Why is no real title available?)
• scientific article; zbMATH DE number 107874 (Why is no real title available?)
• scientific article; zbMATH DE number 4128360 (Why is no real title available?)
• The parallel complexity of simple logic programs
• Parma—bridging the performance gap between imperative and logic programming
• Parallel execution of logic programs by load sharing
• scientific article; zbMATH DE number 2080295 (Why is no real title available?)
• Past and present (and future) of parallel and distributed computation in (constraint) logic programming
• scientific article; zbMATH DE number 1862076 (Why is no real title available?)
• Modern Datalog Engines
• Parallel Logic Programming: A Sequel
• Why a single parallelization strategy is not enough in knowledge bases
• Distribution policies for Datalog

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 Q3786037)