Subsumption-stratified datalog

DOI10.1016/S0743-1066(97)10007-3MaRDI QIDQ4208864zbMATH OpenFDO

Authors Michael Meskes

Publication date 24 November 1998

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

Full work available at URL https://doi.org/10.1016/S0743-1066(97)10007-3

zbMATH Keywords

Datalog programsextensional database

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 870410
• The expressive power of stratified logic programs
• Modular stratification and magic sets for Datalog programs with negation
• scientific article; zbMATH DE number 4199653

Cited in

(7)

• Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
• Certifying standard and stratified Datalog inference engines in SSReflect
• Static analysis in Datalog extensions
• Expressing and supporting efficiently greedy algorithms as locally stratified logic programs
• Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
• scientific article; zbMATH DE number 2218053 (Why is no real title available?)
• Incorporating stratified negation into query-subquery nets for evaluating queries to stratified deductive databases

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Subsumption-stratified datalog

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