The Alexander method-a technique for the processing of recursive axioms in deductive databases
New Generation Computing
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Proceedings of the workshop on Advances in linear logic
Resolution, Inverse Method and the Sequent Calculus
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Model checking linear logic specifications
Theory and Practice of Logic Programming
The focused inverse method for linear logic
The focused inverse method for linear logic
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A logical characterization of forward and backward chaining in the inverse method
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A focusing inverse method theorem prover for first-order linear logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
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
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Journal of Automated Reasoning
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
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
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Magically constraining the inverse method using dynamic polarity assignment
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
Agent deliberation via forward and backward chaining in linear logic
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Compact proof certificates for linear logic
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Subformula linking as an interaction method
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Hi-index | 0.02 |
The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli's focusing strategy can be adapted for the inverse method in linear logic. In this paper we introduce the notion of focusing bias for atoms and show that it gives rise to forward and backward chaining, generalizing both hyperresolution (forward) and SLD resolution (backward) on the Horn fragment. A key feature of our characterization is the structural, rather than purely operational, explanation for forward and backward chaining. A search procedure like the inverse method is thus able to perform both operations as appropriate, even simultaneously. We also present experimental results and an evaluation of the practical benefits of biased atoms for a number of examples from different problem domains.