Skip to main content
SpringerLink
Log in

Focusing the Inverse Method for Linear Logic

  • Conference paper
Computer Science Logic (CSL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3634))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2, 297–347 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Andreoli, J.M.: Focussing and proof construction. Annals of Pure and Applied Logic 107, 131–163 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Howe, J.M.: Proof Search Issues in Some Non-Classical Logics. PhD thesis, University of St. Andrews (1998)

    Google Scholar 

  4. Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barber, A.: Dual Intuitionistic Linear Logic. Technical Report ECS-LFCS-96-347, University of Edinburgh (1996)

    Google Scholar 

  6. Chang, B.Y.E., Chaudhuri, K., Pfenning, F.: A judgmental analysis of linear logic. Technical Report CMU-CS-03-131R, Carnegie Mellon University (2003)

    Google Scholar 

  7. Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework I & II. Technical Report CMU-CS-02-101 and 102, Department of Computer Science, Carnegie Mellon University (2002) (revised May 2003)

    Google Scholar 

  8. Degtyarev, A., Voronkov, A.: The Inverse Method. In: Handbook of Automated Reasoning, pp. 179–272. MIT Press, Cambridge (2001)

    Chapter  Google Scholar 

  9. Chaudhuri, K., Pfenning, F.: A focusing inverse method theorem prover for first-order linear logic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 69–83. Springer, Heidelberg (2005) (to appear)

    Chapter  Google Scholar 

  10. Tammet, T.: Resolution, inverse method and the sequent calculus. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol. 1289, pp. 65–83. Springer, Heidelberg (1997)

    Google Scholar 

  11. Mints, G.: Resolution calculus for the first order linear logic. Journal of Logic. Language and Information 2, 59–83 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. Theoretical Computer Science 232, 133–163 (2000); Special issue on Proof Search in Type-Theoretic Languages, D. Galmiche and D. Pym, editors

    Article  MATH  MathSciNet  Google Scholar 

  13. Harland, J., Pym, D.J.: Resource-distribution via boolean constraints. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 222–236. Springer, Heidelberg (1997)

    Google Scholar 

  14. Girard, J.Y.: Locus solum: from the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11, 301–506 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Chaudhuri, K., Pfenning, F.: Focusing the inverse method for linear logic. Technical Report CMU-CS-05-106, Carnegie Mellon University (2005)

    Google Scholar 

  16. Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56, 239–311 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 795–807 (1992)

    Google Scholar 

  18. Bozzano, M., Delzanno, G., Martelli, M.: Model checking linear logic specifications. TPLP 4, 573–619 (2004)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie Mellon University,  

    Kaustuv Chaudhuri & Frank Pfenning

Authors
  1. Kaustuv Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, United Kingdom

    Luke Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaudhuri, K., Pfenning, F. (2005). Focusing the Inverse Method for Linear Logic. In: Ong, L. (eds) Computer Science Logic. CSL 2005. Lecture Notes in Computer Science, vol 3634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538363_15

Download citation

  • DOI: https://doi.org/10.1007/11538363_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28231-0

  • Online ISBN: 978-3-540-31897-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation