Skip to main content
SpringerLink
Log in

The Semantics of Nominal Logic Programs

  • Conference paper
Logic Programming (ICLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4079))

Included in the following conference series:

Abstract

Nominal logic programming is a form of logic programming with “concrete” names and binding, based on nominal logic, a theory of α-equivalence founded on swapping and freshness constraints. Previous papers have employed diverse characterizations of the semantics of nominal logic programs, including operational, denotational, and proof-theoretic characterizations; however, the formal properties and relationships among them have not been fully investigated. In this paper we give a uniform and improved presentation of these characterizations and prove appropriate soundness and completeness results. We also give some applications of these results.

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. Cheney, J., Urban, C.: Alpha-Prolog: A logic programming language with names, binding and a-equivalence. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 269–283. Springer, Heidelberg (2004)

    Google Scholar 

  2. Cheney, J.: The Complexity of Equivariant Unification. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 332–344. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Cheney, J.: A Simpler Proof Theory for Nominal Logic. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 379–394. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Cheney, J.: Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic 81(1), 299–320 (2006)

    Article  MathSciNet  Google Scholar 

  5. Cheney, J.R.: Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY (August 2004)

    Google Scholar 

  6. Darlington, J., Guo, Y.: Constraint logic programming in the sequent calculus. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol. 822, pp. 200–214. Springer, Heidelberg (1994)

    Google Scholar 

  7. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  8. Gabbay, M.J., Cheney, J.: A sequent calculus for nominal logic. In: Ganzinger, H. (ed.) Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), Turku, Finland, pp. 139–148. IEEE, Los Alamitos (2004)

    Chapter  Google Scholar 

  9. Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming 37(1-3), 1–46 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Leach, J., Nieva, S., Rodríguez-Artalejo, M.: Constraint logic programming with hereditary Harrop formulas. Theory and Practice of Logic Programming 1(4), 409–445 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  12. Michaylov, S., Pfenning, F.: Higher-order logic programming as constraint logic programming. In: Position Papers for the First Workshop on Principles and Practice of Constraint Programming, Newport, Rhode Island, pp. 221–229 (April 1993)

    Google Scholar 

  13. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation 1(4), 497–536 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  14. Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125–157 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 183, 165–193 (2003)

    Article  MathSciNet  Google Scholar 

  16. Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science 323(1-3), 473–497 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Urban, C., Cheney, J.: Avoiding equivariant unification. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Edinburgh,  

    James Cheney

Authors
  1. James Cheney
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Twente, The Netherlands

    Sandro Etalle

  2. Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA

    Mirosław Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheney, J. (2006). The Semantics of Nominal Logic Programs. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_27

Download citation

  • DOI: https://doi.org/10.1007/11799573_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation