Monotonic aggregation in deductive databases

DOI10.1006/jcss.1997.1453zbMath0869.68042OpenAlexW2063061546MaRDI QIDQ676422

Kenneth A. Ross, Yehoshua Sagiv

Publication date: 18 March 1997

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

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

zbMATH Keywords

minimalitydeductive databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (10)

Towards an efficient evaluation of recursive aggregates in deductive databases ⋮ Modular materialisation of Datalog programs ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ A datalog-based computational model for coordination-free, data-parallel systems ⋮ How expressive is stratified aggregation? ⋮ A declarative extension of horn clauses, and its significance for datalog and its applications ⋮ Preference queries in deductive databases ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ ASP-Core-2 Input Language Format ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages

Uses Software

• Datalog

Cites Work

• The alternating fixpoint of logic programs with negation
• Extrema predicates in deductive databases
• Inference of monotonicity constraints in Datalog programs
• A lattice-theoretical fixpoint theorem and its applications
• Horn clause queries and generalizations
• The well-founded semantics for general logic programs
• Modular stratification and magic sets for Datalog programs with negation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monotonic aggregation in deductive databases