Depth-bounded bottom-up evaluation of logic programs

DOI10.1016/0743-1066(94)00030-AMaRDI QIDQ3128527zbMATH OpenFDO

Authors Jan Chomicki

Publication date 5 October 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(94)00030-A

zbMATH Keywords

\(\text{Datalog}_{nS}\)depth-bounded bottom-up evaluation algorithm

Mathematics Subject Classification ID

Logic programming (68N17) Parallel algorithms in computer science (68W10)

Recommendations

• On the termination of logic programs with function symbols
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Undecidable boundedness problems for datalog programs
• Checking termination of bottom-up evaluation of logic programs with function symbols

Cited in

(10)

• A framework for testing safety and effective computability
• Positive Dedalus programs tolerate non-causality
• Temporal stratification tests for linear and branching-time deductive databases
• scientific article; zbMATH DE number 1692896 (Why is no real title available?)
• scientific article; zbMATH DE number 458994 (Why is no real title available?)
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Parallel bottom-up evaluation of logic programs: \(\mathcal{D}e\mathcal{ALS}\) on shared-memory multicore machines
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• On the termination of logic programs with function symbols
• Temporal disjunctive logic programming

This page was built for publication: Depth-bounded bottom-up evaluation of logic programs

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