Modular stratification and magic sets for Datalog programs with negation

DOI10.1145/195613.195646zbMath0830.68028OpenAlexW2061565124MaRDI QIDQ4327632

Kenneth A. Ross

Publication date: 10 April 1995

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195613.195646

zbMATH Keywords

rule rewritingmodular stratification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17)

Related Items

ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Magic Sets and their application to data integration, An algebraic construction of the well-founded model, A model building framework for answer set programming with external computations, Enhancing Magic Sets with an Application to Ontological Reasoning, Unnamed Item, Monotonic aggregation in deductive databases, An abstract machine for fixed-order dynamically stratified programs, Preference queries in deductive databases, Magic sets for disjunctive Datalog programs, The limits of fixed-order computation, Answer Set Programming: A Primer, Maintenance of datalog materialisations revisited, Combining Nonmonotonic Knowledge Bases with External Sources, Functional queries in datalog

Uses Software

• Datalog