The following pages link to On the power of magic (Q3210147):
Displayed 35 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- Incorporating top-down information into bottom-up hypothetical reasoning (Q688821) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Graph traversal and top-down evaluation of logic queries (Q1130171) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- Well-founded semantics and stratification for ordered logic programs (Q1313371) (← links)
- Towards an efficient evaluation of recursive aggregates in deductive databases (Q1326572) (← links)
- Parallelism in logic programs (Q1360680) (← links)
- Magic sets revisited (Q1368187) (← links)
- Counting and topological order (Q1375328) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Compilation and evaluation of linear mutual recursions (Q1803866) (← links)
- CoLab: A hybrid knowledge representation and compilation laboratory (Q1897397) (← links)
- An extended constraint deductive database: theory and implementation (Q2436517) (← links)
- Reasoning in description logics by a reduction to disjunctive datalog (Q2462648) (← links)
- An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases (Q3192964) (← links)
- A Framework for Goal-Directed Query Evaluation with Negation (Q3449200) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty (Q3628499) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- The pushdown method to optimize chain logic programs (Q4645206) (← links)
- The Relationlog system prototype (Q4791100) (← links)
- A simple correctness proof for magic transformation (Q4897705) (← links)
- (Q5020560) (← links)
- Enhancing Magic Sets with an Application to Ontological Reasoning (Q5108494) (← links)
- Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving (Q5234700) (← links)
- GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES (Q5249009) (← links)
- Complexity of super-coherence problems in ASP (Q5418947) (← links)
- A Theoretical Framework for the Declarative Debugging of Datalog Programs (Q5504584) (← links)
- Generating Specialized Rules and Programs for Demand-Driven Analysis (Q5505434) (← links)
- On the graph traversal method for evaluating linear binary-chain programs (Q5926750) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)