On the power of magic
From MaRDI portal
Recommendations
Cited in
(45)- Graph traversal and top-down evaluation of logic queries
- A transformation system for deductive database modules with perfect model semantics
- Well-founded semantics and stratification for ordered logic programs
- Towards an efficient evaluation of recursive aggregates in deductive databases
- Parallelism in logic programs
- Magic sets revisited
- Counting and topological order
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Magic sets for disjunctive Datalog programs
- Compilation and evaluation of linear mutual recursions
- Magic semi-joins
- CoLab: A hybrid knowledge representation and compilation laboratory
- An extended constraint deductive database: theory and implementation
- Reasoning in description logics by a reduction to disjunctive datalog
- The Magic of ELFs
- An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
- A framework for goal-directed query evaluation with negation
- Logic programming approach to automata-based decision procedures
- On the Almighty Wand
- Disjunctive ASP with functions: decidable queries and effective computation
- Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty
- Implementation of logical query languages for databases
- A generalization of the differential approach to recursive query evaluation
- scientific article; zbMATH DE number 4053071 (Why is no real title available?)
- Old Magic Powers
- On the bottom-up evaluation of recursive queries
- Checking termination of bottom-up evaluation of logic programs with function symbols
- The pushdown method to optimize chain logic programs
- scientific article; zbMATH DE number 219225 (Why is no real title available?)
- The Relationlog system prototype
- A simple correctness proof for magic transformation
- Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
- Enhancing magic sets with an application to ontological reasoning
- Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving
- Grammars and automata to optimize chain logic queries
- Complexity of super-coherence problems in ASP
- A Theoretical Framework for the Declarative Debugging of Datalog Programs
- Generating Specialized Rules and Programs for Demand-Driven Analysis
- On the graph traversal method for evaluating linear binary-chain programs
- Incremental reasoning on monadic second-order logics with logic programming
- Magic-sets for localised analysis of Java bytecode
- Finite combinatory logic with predicates
- Incorporating top-down information into bottom-up hypothetical reasoning
- Inherent complexity of recursive queries
- Magic Sets and their application to data integration
This page was built for publication: On the power of magic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210147)
