Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2002: Logic Programming pp 302–316Cite as

A Purely Logical Account of Sequentiality in Proof Search

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2401))

Abstract

A strict correspondence between the proof-search space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system in this sense our approach is purely logical, no axioms or encodings are involved. The process algebra is a minimal restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. This way we get the first purely logical account of sequentiality in proof search. Since we restrict attention to a small but meaningful fragment, which is then of very broad interest, our techniques should become a common basis for several possible extensions. In particular, we argue about this work being the first step in a two-step research for capturing most of CCS in a purely logical fashion.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Samson Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543–574, June 1994.

    Google Scholar 

  2. Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical processes with built-in inheritance. New Generation Computing, 9:445–473, 1991.

    Article  Google Scholar 

  3. Gerhard Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland, Amsterdam, 1969.

    Google Scholar 

  4. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  5. Alessio Guglielmi. Concurrency and plan generation in a logic programming language with a sequential operator. In P. Van Hentenryck, editor, Logic Programming, 11th International Conference, S. Margherita Ligure, Italy, pages 240–254. The MIT Press, 1994.

    Google Scholar 

  6. Alessio Guglielmi. Sequentiality by linear implication and universal quantification. In Jörg Desel, editor, Structures in Concurrency Theory, Workshops in Computing, pages 160–174. Springer-Verlag, 1995.

    Google Scholar 

  7. Alessio Guglielmi. A system of interaction and order. Technical Report WV-01-01, Dresden University of Technology, 2001. On the web at: http://www.ki.inf.tu-dresden.de/~guglielm/Research/Gug/Gug.pdf.

  8. Alessio Guglielmi and Lutz Straßburger. Non-commutativity and MELL in the calculus of structures. In L. Fribourg, editor, CSL 2001, volume 2142 of Lecture Notes in Computer Science, pages 54–68. Springer-Verlag, 2001. On the web at: http://www.ki.inf.tu-dresden.de/~guglielm/Research/GugStra/GugStra.pdf.

    Google Scholar 

  9. Alessio Guglielmi and Lutz Straßburger. A non-commutative extension of MELL in the calculus of structures. Technical Report WV-02-03, Dresden University of Technology, 2002. On the web at: http://www.ki.inf.tu-dresden.de/~guglielm/Research/NEL/NELbig.pdf, submitted.

  10. Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327–365, May 1994.

    Google Scholar 

  11. Dale Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, 1992 Workshop on Extensions to Logic Programming, volume 660 of Lecture Notes in Computer Science, pages 242–265. Springer-Verlag, 1993.

    Google Scholar 

  12. Dale Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165:201–232, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  14. Robin Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

  15. Lutz Straßburger. A local system for linear logic. Technical Report WV-02-01, Dresden University of Technology, 2002. On the web at: http://www.ki.inf.tu-dresden.de/~lutz/lls.pdf.

  16. Alwen Fernanto Tiu. Properties of a logical system in the calculus of structures. Technical Report WV-01-06, Dresden University of Technology, 2001. On the web at: http://www.cse.psu.edu/~tiu/thesisc.pdf.

Download references

Author information

Authors and Affiliations

  1. Fakultät Informatik, Technische Universität Dresden, 01062, Dresden, Germany

    Paola Bruscoli

Authors
  1. Paola Bruscoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Melbourne, 221 Bouverie St., Carlton, 3053, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruscoli, P. (2002). A Purely Logical Account of Sequentiality in Proof Search. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45619-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43930-1

  • Online ISBN: 978-3-540-45619-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation