Advertisement

Concurrency problem for Horn fragment of Girard's Linear Logic

  • Dmitry A. Archangelsky
  • Mikhail I. Dekhtyar
  • Evgeny Kruglov
  • Ilmir Kh. Musikaev
  • Mikhail A. Taitslin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 813)

Abstract

In this paper we propose a sufficient condition for a sequence of Horn implications to be concurrent. We prove that the problem of determining of nonconcurrency of a sequence of Horn implications is NP-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.A.Archangelsky and M.A.Taitslin, Linear Logic With Fixed Resources, Annals Pure Appl. Logic (to appear).Google Scholar
  2. 2.
    J.Y.Girard, Linear Logic, Theoretical Computer Science 50 (1987), 1–102.Google Scholar
  3. 3.
    M.I.Kanovich, Horn Programming in Linear Logic is NP-complete, Proc.7-th Annual IEEE Symposium on Logic in Computer Science, 1992, pp. 200–210.Google Scholar
  4. 4.
    P.Lincoln, J.Mitchell, A.Scerdov,and N.Shankar, Decision Problems for Propositional Linear Logic, Proc.31-th IEEE Symposium on Foundation of Computer Science, 1990, pp. 662–671.Google Scholar
  5. 5.
    P.Lincoln, J.Mitchell, A.Scerdov, and N.Shankar, Decision Problems for Propositional Linear Logic, Annals Pure Appl. Logic 56 (1992), 239–311.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Dmitry A. Archangelsky
    • 1
  • Mikhail I. Dekhtyar
    • 1
  • Evgeny Kruglov
    • 1
  • Ilmir Kh. Musikaev
    • 1
  • Mikhail A. Taitslin
    • 1
  1. 1.Tver State UniversityTverRussia

Personalised recommendations