{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:39Z","timestamp":1750306779962,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Greek national funds"},{"name":"Operational Program Education and Lifelong Learning of the National Strategic Reference Framework (NSRF) - Research Funding Program: Heracleitus II"},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of an immediate consequence operator. We also propose an SLD-resolution proof system which is proven sound and complete with respect to the minimum Herbrand model semantics. In other words, we provide a purely extensional theoretical framework for higher-order logic programming which generalizes the familiar theory of classical (first-order) logic programming.<\/jats:p>","DOI":"10.1145\/2499937.2499942","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T11:57:11Z","timestamp":1378209431000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Extensional Higher-Order Logic Programming"],"prefix":"10.1145","volume":"14","author":[{"given":"Angelos","family":"Charalambidis","sequence":"first","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Handjopoulos","sequence":"additional","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Rondogiannis","sequence":"additional","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William W.","family":"Wadge","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Abramsky S. and Jung A. 1994. Domain theory. In Handbook of Logic in Computer Science III S. Abramsky D. Gabbay and T. Maibaum Eds. Clarendon Press. Abramsky S. and Jung A. 1994. Domain theory. In Handbook of Logic in Computer Science III S. Abramsky D. Gabbay and T. Maibaum Eds. Clarendon Press.","DOI":"10.1093\/oso\/9780198537809.001.0001"},{"volume-title":"Handbook of Theoretical Computer Science (Vol. B)","author":"Apt K. R.","key":"e_1_2_2_2_1"},{"volume-title":"The Lambda Calculus: Its Syntax and Semantics","series-title":"Studies in logic and the foundations of mathematics series","author":"Barendregt H. P.","key":"e_1_2_2_3_1"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1102022211"},{"volume-title":"Proceedings of the International Conference on Logic Programming. The MIT Press, 395--410","year":"1999","author":"Bezem M.","key":"e_1_2_2_5_1"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737254"},{"volume-title":"Lattice Theory","author":"Birkhoff G.","key":"e_1_2_2_7_1"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/75609.75615"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90039-J"},{"volume-title":"Predicate logic as a computational formalism. Res. rep. DOC 79\/59. Department of Computing","author":"Clark K. L.","key":"e_1_2_2_10_1"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Dowty D. Wall R. and Peters S. 1981. Introduction to Montague Semantics. Studies in Linguistics and Philosophy Kluwer Academic Publishers. Dowty D. Wall R. and Peters S. 1981. Introduction to Montague Semantics . Studies in Linguistics and Philosophy Kluwer Academic Publishers.","DOI":"10.1007\/978-94-009-9065-4"},{"key":"e_1_2_2_12_1","unstructured":"Field A. and Harrison P. 1988. Functional Programming. International Computer Science Series Addison-Wesley. Field A. and Harrison P. 1988. Functional Programming . International Computer Science Series Addison-Wesley."},{"volume-title":"General Lattice Theory","author":"Gr\u00e4tzer G.","key":"e_1_2_2_13_1"},{"volume-title":"Department of Artificial Intelligence","author":"Hill R.","key":"e_1_2_2_14_1"},{"volume-title":"Constructivity in Mathematics","author":"Kleene S.","key":"e_1_2_2_15_1"},{"volume-title":"Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Short Paper). 1--5.","author":"Kountouriotis V.","key":"e_1_2_2_16_1"},{"volume-title":"Constructivity in Mathematics","author":"Kreisel G.","key":"e_1_2_2_17_1"},{"volume-title":"Foundations of Logic Programming","author":"Lloyd J. W.","key":"e_1_2_2_18_1"},{"volume-title":"Proceedings of the 3rd International Conference on Logic Programming. 448--462","author":"Miller D.","key":"e_1_2_2_19_1"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96570"},{"volume":"5","volume-title":"Handbook of Logics for Artificial Intelligence and Logic Programming","author":"Nadathur G.","key":"e_1_2_2_22_1"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1140640943"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055686.1055694"},{"volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","year":"1977","author":"Stoy J. E.","key":"e_1_2_2_25_1"},{"volume-title":"Semantics of Programming Languages","author":"Tennent R. D.","key":"e_1_2_2_26_1"},{"volume-title":"Proceedings of the International Symposium on Logic Programming. 289--303","year":"1991","author":"Wadge W. W.","key":"e_1_2_2_27_1"},{"key":"e_1_2_2_28_1","first-page":"441","article-title":"Higher-order extensions to prolog: Are they needed","volume":"10","author":"Warren D. H.","year":"1982","journal-title":"Machine Intell."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499937.2499942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2499937.2499942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:00Z","timestamp":1750232040000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499937.2499942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1145\/2499937.2499942"],"URL":"https:\/\/doi.org\/10.1145\/2499937.2499942","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2013,8]]},"assertion":[{"value":"2011-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}