{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:27:23Z","timestamp":1756384043836,"version":"3.33.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"unspecified","delay-in-days":198,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic formalisms. The proposed semantics generalizes the classical two-valued stable model semantics of Gelfond and Lifschitz as well as the three-valued one of Przymusinski, retaining their desirable properties. Due to the use of AFT, we also get for free alternative semantics for higher-order logic programs, namely <jats:italic>supported model<\/jats:italic>, <jats:italic>Kripke-Kleene<\/jats:italic>, and <jats:italic>well-founded<\/jats:italic>. Additionally, we define a broad class of <jats:italic>stratified higher-order logic programs<\/jats:italic> and demonstrate that they have a unique two-valued higher-order stable model which coincides with the well-founded semantics of such programs. We provide a number of examples in different application domains, which demonstrate that higher-order logic programming under the stable model semantics is a powerful and versatile formalism, which can potentially form the basis of novel ASP systems.<\/jats:p>","DOI":"10.1017\/s1471068424000231","type":"journal-article","created":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T09:52:44Z","timestamp":1736934764000},"page":"737-754","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["The Stable Model Semantics for Higher-Order Logic Programming"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"BART","family":"BOGAERTS","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7437-410X","authenticated-orcid":false,"given":"ANGELOS","family":"CHARALAMBIDIS","sequence":"additional","affiliation":[]},{"given":"GIANNOS","family":"CHATZIAGAPIS","sequence":"additional","affiliation":[]},{"given":"BABIS","family":"KOSTOPOULOS","sequence":"additional","affiliation":[]},{"given":"SAMUELE","family":"POLLACI","sequence":"additional","affiliation":[]},{"given":"PANOS","family":"RONDOGIANNIS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2025,1,15]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068424000231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T09:53:11Z","timestamp":1736934791000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000231\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["S1471068424000231"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000231","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}