On the power of magic

From MaRDI portal
Publication:3210147

DOI10.1016/0743-1066(91)90038-QzbMath0722.68018MaRDI QIDQ3210147

Catriel Beeri, Raghu Ramakrishnan

Publication date: 1991

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




Related Items

Towards an efficient evaluation of recursive aggregates in deductive databases, The Relationlog system prototype, A Framework for Goal-Directed Query Evaluation with Negation, CoLab: A hybrid knowledge representation and compilation laboratory, Parallelism in logic programs, An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases, Logic programming approach to automata-based decision procedures, Magic sets revisited, Counting and topological order, Magic Sets and their application to data integration, Graph traversal and top-down evaluation of logic queries, Checking termination of bottom-up evaluation of logic programs with function symbols, Enhancing Magic Sets with an Application to Ontological Reasoning, An extended constraint deductive database: theory and implementation, Unnamed Item, Magic-sets for localised analysis of Java bytecode, A simple correctness proof for magic transformation, Reasoning in description logics by a reduction to disjunctive datalog, The pushdown method to optimize chain logic programs, Incorporating top-down information into bottom-up hypothetical reasoning, On the graph traversal method for evaluating linear binary-chain programs, Complexity of super-coherence problems in ASP, Magic sets for disjunctive Datalog programs, Inherent complexity of recursive queries, A transformation system for deductive database modules with perfect model semantics, Disjunctive ASP with functions: Decidable queries and effective computation, Incremental reasoning on monadic second-order logics with logic programming, Compilation and evaluation of linear mutual recursions, Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty, Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving, Loop checking in SLD-derivations by well-quasi-ordering of goals, GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES, A Theoretical Framework for the Declarative Debugging of Datalog Programs, Generating Specialized Rules and Programs for Demand-Driven Analysis, Well-founded semantics and stratification for ordered logic programs