Journal of Logic Programming
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The focused inverse method for linear logic
The focused inverse method for linear logic
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Unified Sequent Calculus for Focused Proofs
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Classical and intuitionistic subexponential logics are equally expressive
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A focusing inverse method theorem prover for first-order linear logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Compact proof certificates for linear logic
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
| Hi-index | 0.00 |
Given a logic program that is terminating and mode-correct in an idealised Prolog interpreter (i.e., in a top-down logic programming engine), a bottom-up logic programming engine can be used to compute exactly the same set of answers as the top-down engine for a given mode-correct query by rewriting the program and the query using the Magic Sets Transformation (MST). In previous work, we have shown that focusing can logically characterise the standard notion of bottom-up logic programming if atomic formulas are statically given a certain polarity assignment. In an analogous manner, dynamically assigning polarities can characterise the effect of MST without needing to transform the program or the query. This gives us a new proof of the completeness of MST in purely logical terms, by using the general completeness theorem for focusing. As the dynamic assignment is done in a general logic, the essence of MST can potentially be generalised to larger fragments of logic.