Bottom-up evaluation and query optimization of well-founded models

DOI10.1016/0304-3975(94)00153-AzbMath0873.68032MaRDI QIDQ673130

Peter J. Stuckey, Divesh Srivastava, David B. Kemp

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bottum-up operational proceduremagic sets transformation

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items

Datalog Queries Distributing over Components, Magic Sets and their application to data integration, Enhancing Magic Sets with an Application to Ontological Reasoning, Unnamed Item, Magic sets for disjunctive Datalog programs, Disjunctive ASP with functions: Decidable queries and effective computation, Enhancing global SLS-resolution with loop cutting and tabling mechanisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Argument reduction by factoring
• Strict completion of logic programs
• The expressive power of stratified logic programs
• Safe computation of the well-founded semantics of datalog queries
• A generalization of the differential approach to recursive query evaluation
• Efficient bottom-up computation of queries on stratified databases
• A procedural semantics for well-founded negation in logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs