{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:44Z","timestamp":1794341264011,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_27","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"361-375","source":"Crossref","is-referenced-by-count":2,"title":["The Semantics of Nominal Logic Programs"],"prefix":"10.1007","author":[{"given":"James","family":"Cheney","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"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.\u00a03132, pp. 269\u2013283. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27775-0_19"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-27836-8_30","volume-title":"Automata, Languages and Programming","author":"J. Cheney","year":"2004","unstructured":"Cheney, J.: The Complexity of Equivariant Unification. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 332\u2013344. Springer, Heidelberg (2004)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-31982-5_24","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Cheney","year":"2005","unstructured":"Cheney, J.: A Simpler Proof Theory for Nominal Logic. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 379\u2013394. Springer, Heidelberg (2005)"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2178\/jsl\/1140641176","volume":"81","author":"J. Cheney","year":"2006","unstructured":"Cheney, J.: Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic\u00a081(1), 299\u2013320 (2006)","journal-title":"Journal of Symbolic Logic"},{"key":"27_CR5","unstructured":"Cheney, J.R.: Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY (August 2004)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-58216-9_39","volume-title":"Logic Programming and Automated Reasoning","author":"J. Darlington","year":"1994","unstructured":"Darlington, J., Guo, Y.: Constraint logic programming in the sequent calculus. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol.\u00a0822, pp. 200\u2013214. Springer, Heidelberg (1994)"},{"key":"27_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/LICS.2004.1319608","volume-title":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"M.J. Gabbay","year":"2004","unstructured":"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\u2013148. IEEE, Los Alamitos (2004)"},{"issue":"1\u20133","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming\u00a037(1-3), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S1471068401001041","volume":"1","author":"J. Leach","year":"2001","unstructured":"Leach, J., Nieva, S., Rodr\u00edguez-Artalejo, M.: Constraint logic programming with hereditary Harrop formulas. Theory and Practice of Logic Programming\u00a01(4), 409\u2013445 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"key":"27_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"27_CR12","unstructured":"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\u2013229 (April 1993)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"J. Logic and Computation"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"183","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation\u00a0183, 165\u2013193 (2003)","journal-title":"Information and Computation"},{"issue":"1-3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C. Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science\u00a0323(1-3), 473\u2013497 (2004)","journal-title":"Theoretical Computer Science"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_29","volume-title":"Typed Lambda Calculi and Applications","author":"C. Urban","year":"2005","unstructured":"Urban, C., Cheney, J.: Avoiding equivariant unification. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:15Z","timestamp":1605625875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11799573_27","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}