Resource-Sensitive Reasoning with Sequential Information

  • Norihiro Kamide
  • Ken Kaneiwa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6464)

Abstract

A logic called sequence-indexed linear logic (SLL) is proposed to appropriately formalize resource-sensitive reasoning with sequential information. The completeness and cut-elimination theorems for SLL are shown, and SLL and a fragment of SLL are shown to be undecidable and decidable, respectively. As an application of SLL, some specifications of secure password authentication systems are discussed.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Kamide, N., Kaneiwa, K.: Extended full computation-tree logic with sequence modal operator: Representing hierarchical tree structures. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS (LNAI), vol. 5866, pp. 485–494. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Lincoln, P., Mitchell, L., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56, 239–311 (1992)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Miller, D.: An overview of linear logic programming. London Mathematical Society Lecture Note Series (Linear logic in computer science), vol. 316, pp. 119–150. Cambridge University Press, Cambridge (2004)MATHGoogle Scholar
  5. 5.
    Okada, M.: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science 281, 471–498 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Pym, D.J., O’Hearn, P.W., Yang, H.: Possible worlds and resources: The semantics of BI. Theoretical Computer Science 315, 257–305 (2004)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Russell, S., Norvig, P.: Artificial intelligence: A modern approach, 2nd edn. Pearson Education, Inc., London (2003)MATHGoogle Scholar
  8. 8.
    Wansing, H.: The Logic of Information Structures. LNCS (LNAI), vol. 681, 163 pages. Springer, Heidelberg (1993)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Norihiro Kamide
    • 1
  • Ken Kaneiwa
    • 2
  1. 1.Waseda Institute for Advanced StudyWaseda UniversityJapan
  2. 2.Department of Electrical Engineering and Computer ScienceIwate UniversityJapan

Personalised recommendations