Magically Constraining the Inverse Method Using Dynamic Polarity Assignment
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.
KeywordsLogic Program Inference Rule Logic Programming Inverse Method Atomic Formula
Unable to display preview. Download preview PDF.
- 4.Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon University, Technical report CMU-CS-06-162 (2006)Google Scholar
- 6.Chaudhuri, K.: Classical and intuitionistic subexponential logics are equally expressive. In: Veith, H. (ed.) CSL 2010. LNCS, vol. 6247, pp. 185–199. Springer, Heidelberg (2010)Google Scholar
- 9.Degtyarev, A., Voronkov, A.: The inverse method. In: Handbook of Automated Reasoning, pp. 179–272. Elsevier and MIT Press (2001)Google Scholar
- 12.Howe, J.M.: Proof Search Issues in Some Non-Classical Logics. PhD thesis, U. of St Andrews, Research Report CS/99/1 (1998)Google Scholar
- 14.Liang, C., Miller, D.: A unified sequent calculus for focused proofs. In: LICS 24, pp. 355–364 (2009)Google Scholar
- 19.Ullman, J.D.: Principles of Database and Knowledge-base Systems, Volume II: The New Techniques. In: Principles of Computer Science. Computer Science Press, Rockville (1989)Google Scholar