Skip to main content
SpringerLink
Log in

Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic

  • Conference paper
  • First Online:
Functional and Logic Programming (FLOPS 2018)

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

Included in the following conference series:

Abstract

In this paper, we provide direct encodings into Horn sequents of Multiplicative Linear Logic for two NP-complete problems, 3D MATCHING and PARTITION. Their correctness proofs are given by using a characterization of multiplicative proof nets.

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 EPUB and 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

References

  1. Kanovich, M.I.: Horn programming in linear logic is NP-complete. In: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 200–210 (1992)

    Google Scholar 

  2. Kanovich, M.I.: The complexity of Horn fragments of linear logic. Ann. Pure Appl. Logic 69, 195–241 (1994)

    Article  MathSciNet  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  4. Krantz, T., Mogbil, V.: Encoding Hamiltonian circuits into multiplicative linear logic. Theoret. Comput. Sci. 266, 987–996 (2001)

    Article  MathSciNet  Google Scholar 

  5. Malik, S., Zhang, L.: Boolean satisfiability: from theoretical hardness to practical success. Commun. ACM 52, 76–82 (2009)

    Article  Google Scholar 

  6. Matsuoka, S.: Proof Net Calculator (2017). https://staff.aist.go.jp/s-matsuoka/PNCalculator/index.html

  7. Matsuoka, S.: Weak typed Böhm theorem on IMLL. Ann. Pure Appl. Logic 145(1), 37–90 (2007)

    Article  MathSciNet  Google Scholar 

  8. Matsuoka, S.: A coding theoretic study of MLL proof nets. Math. Struct. Comput. Sci. 22(3), 409–449 (2012)

    Article  MathSciNet  Google Scholar 

  9. Girard, J.Y.: Multiplicatives. In: Logic and Computer Science: New Trends and Applications, pp. 11–34 (1988)

    Google Scholar 

  10. Matsuoka, S.: Strong typed Böhm theorem and functional completeness on the linear lambda calculus. In: Proceedings of 6th Workshop on Mathematically Structured Functional Programming, MSFP 2016, pp. 1–22 (2016)

    Article  Google Scholar 

  11. Odersky, M., Spoon, L., Venners, B.: Programming in Scala, 3rd edn. Artima Inc., Walnut Creek (2016)

    Google Scholar 

  12. Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  13. Murawski, A.M., Ong, C.H.L.: Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Logic 7, 473–498 (2006)

    Article  MathSciNet  Google Scholar 

  14. Danos, V., Regnier, R.: The structure of multiplicatives. Arch. Math. Logic 28, 181–203 (1989)

    Article  MathSciNet  Google Scholar 

  15. Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50, 1–102 (1987)

    Article  MathSciNet  Google Scholar 

  16. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85–103. Springer, Boston (1972)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Advanced Industrial Science and Technology (AIST), 1-1-1 Umezono, Tsukuba, Ibaraki, 305-8565, Japan

    Satoshi Matsuoka

Authors
  1. Satoshi Matsuoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoshi Matsuoka .

Editor information

Editors and Affiliations

  1. Roskilde University, Roskilde, Denmark

    John P. Gallagher

  2. Karlsruhe University of Applied Sciences, Karlsruhe, Germany

    Martin Sulzmann

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Matsuoka, S. (2018). Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic. In: Gallagher, J., Sulzmann, M. (eds) Functional and Logic Programming. FLOPS 2018. Lecture Notes in Computer Science(), vol 10818. Springer, Cham. https://doi.org/10.1007/978-3-319-90686-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90686-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-90685-0

  • Online ISBN: 978-3-319-90686-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation