-
[1] Andreoli, J.-M.: Logic Programming with Focusing Proofs in Linear Logic, J. Log. Comput., 2(3), 1992, 297–347.
-
[2] Avellone, A., Ferrari, M., Miglioli, P.: Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics, Logic J. of the IGPL, 7(4), 1999, 447–480.
-
[3] Avellone, A., Fiorentini, C., Momigliano, A.: Focusing on Contraction, Proceedings of the 28th Italian Conference on Computational Logic, Catania, Italy, September 25-27, 2013. (D. Cantone, M. N. Asmundo, Eds.), 1068, CEUR-WS.org, 2013.
-
[4] Avellone, A., Fiorino, G., Moscato, U.: Optimization Techniques for Propositional Intuitionistic Logic and their Implementation, Theor. Comput. Sci., 409(1), 2008, 41–58.
-
[5] Avron, A., Konikowska, B.: Decomposition Proof Systems for G¨odel-Dummett Logics, Studia Logica, 69(2), 2001, 197–219.
-
[6] Baelde, D.: Least and Greatest Fixed Points in Linear Logic, ACM Trans. Comput. Logic, 13(1), 2012, 1–44.
-
[7] Baelde, D., Miller, D., Snow, Z.: Focused Inductive Theorem Proving, IJCAR (J. Giesl, R. H¨ahnle, Eds.), 6173, Springer, 2010.
-
[8] Chaudhuri, K.: The Focused Inverse Method for Linear Logic, Ph.D. Thesis, Carnegie Mellon University, 2006.
-
[9] Chaudhuri, K., Pfenning, F., Price, G.: A Logical Characterization of Forward and Backward Chaining in the Inverse Method, J. Autom. Reasoning, 40(2-3), 2008, 133–177.
-
[10] Dyckhoff, R.: Contraction-Free Sequent Calculi for Intuitionistic Logic, J. Symb. Log., 57(3), 1992, 795–807.