Extrema predicates in deductive databases

DOI10.1006/JCSS.1995.1064MaRDI QIDQ1900929zbMATH OpenOpenAlexFDO

Authors Sumit Ganguly, Sergio Greco, Carlo Zaniolo

Publication date 25 October 1995

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1995.1064

zbMATH Keywords

shortest path problemDijkstra's algorithmgreedy fixpoint

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Fixpoint strategies for deductive databases
• scientific article; zbMATH DE number 4094869
• Computing only minimal answers in disjunctive deductive databases
• Querying best paths in graph databases
• Greedy algorithms in Datalog

Cited in

(7)

• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Pushing extrema aggregates to optimize logic queries
• The expressive power of ``possible-is-certain semantics (extended abstract)
• Monotonic aggregation in deductive databases
• scientific article; zbMATH DE number 2080031 (Why is no real title available?)
• On acceptance conditions in abstract argumentation frameworks
• Scaling-up reasoning and advanced analytics on BigData

This page was built for publication: Extrema predicates in deductive databases

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