Theoretical Computer Science
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Resolution, Inverse Method and the Sequent Calculus
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Resource-Distribution via Boolean Constraint (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
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
A focusing inverse method theorem prover for first-order linear logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
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
Focused inductive theorem proving
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
Focusing is traditionally seen as a means of reducing inessential non-determinism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in the inverse method. We show that the focused inverse method conservatively generalizes the classical hyperresolution strategy for Horn-theories, and demonstrate through a practical implementation that the focused inverse method is considerably faster than the non-focused version.