{"id":"https://openalex.org/W2798485127","doi":"https://doi.org/10.1017/s1471068418000108","title":"Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs","display_name":"Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2798485127","doi":"https://doi.org/10.1017/s1471068418000108","mag":"2798485127"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068418000108","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000108","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5F6FF1A7BB73DAE5FB12F148868BE9C7/S1471068418000108a.pdf/div-class-title-approximation-fixpoint-theory-and-the-well-founded-semantics-of-higher-order-logic-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5F6FF1A7BB73DAE5FB12F148868BE9C7/S1471068418000108a.pdf/div-class-title-approximation-fixpoint-theory-and-the-well-founded-semantics-of-higher-order-logic-programs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078140903","display_name":"Angelos Charalambidis","orcid":"https://orcid.org/0000-0001-7437-410X"},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"ANGELOS CHARALAMBIDIS","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:","institution_ids":["https://openalex.org/I200777214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038937008","display_name":"Panos Rondogiannis","orcid":null},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"PANOS RONDOGIANNIS","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:","institution_ids":["https://openalex.org/I200777214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052186541","display_name":"Ioanna Symeonidou","orcid":null},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"IOANNA SYMEONIDOU","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Athens, Greece (e-mail:","institution_ids":["https://openalex.org/I200777214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078140903"],"corresponding_institution_ids":["https://openalex.org/I200777214"],"apc_list":null,"apc_paid":null,"fwci":0.675,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.76788847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"3-4","first_page":"421","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.631039559841156},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.6023341417312622},{"id":"https://openalex.org/keywords/well-founded-semantics","display_name":"Well-founded semantics","score":0.6010565161705017},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5948222875595093},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.5799964070320129},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5345674157142639},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5307744741439819},{"id":"https://openalex.org/keywords/classical-logic","display_name":"Classical logic","score":0.49811577796936035},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.49787473678588867},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.4848848283290863},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.45169612765312195},{"id":"https://openalex.org/keywords/axiomatic-semantics","display_name":"Axiomatic semantics","score":0.4346483051776886},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4332507252693176},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4275050163269043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40232354402542114},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3819642663002014},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.365644246339798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27974146604537964},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.27327483892440796},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.2215251326560974}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.631039559841156},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.6023341417312622},{"id":"https://openalex.org/C89497691","wikidata":"https://www.wikidata.org/wiki/Q7981058","display_name":"Well-founded semantics","level":5,"score":0.6010565161705017},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5948222875595093},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.5799964070320129},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5345674157142639},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5307744741439819},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.49811577796936035},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.49787473678588867},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.4848848283290863},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.45169612765312195},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.4346483051776886},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4332507252693176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4275050163269043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40232354402542114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3819642663002014},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.365644246339798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27974146604537964},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.27327483892440796},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.2215251326560974},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068418000108","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000108","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5F6FF1A7BB73DAE5FB12F148868BE9C7/S1471068418000108a.pdf/div-class-title-approximation-fixpoint-theory-and-the-well-founded-semantics-of-higher-order-logic-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1804.08335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.08335","pdf_url":"https://arxiv.org/pdf/1804.08335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s1471068418000108","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000108","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5F6FF1A7BB73DAE5FB12F148868BE9C7/S1471068418000108a.pdf/div-class-title-approximation-fixpoint-theory-and-the-well-founded-semantics-of-higher-order-logic-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2798485127.pdf","grobid_xml":"https://content.openalex.org/works/W2798485127.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W149229917","https://openalex.org/W1443075279","https://openalex.org/W1544662935","https://openalex.org/W1565496223","https://openalex.org/W1590388140","https://openalex.org/W1591526886","https://openalex.org/W1968513265","https://openalex.org/W1972464717","https://openalex.org/W2029438897","https://openalex.org/W2031868932","https://openalex.org/W2093397547","https://openalex.org/W2099792091","https://openalex.org/W2100577610","https://openalex.org/W2108911687","https://openalex.org/W2122293551","https://openalex.org/W2145648043","https://openalex.org/W2181625186","https://openalex.org/W2338573381","https://openalex.org/W2541650181","https://openalex.org/W2575897612","https://openalex.org/W2885902420","https://openalex.org/W2963286515","https://openalex.org/W6678146486","https://openalex.org/W6753695981"],"related_works":["https://openalex.org/W2029220517","https://openalex.org/W2508757230","https://openalex.org/W996903698","https://openalex.org/W342706626","https://openalex.org/W2556685378","https://openalex.org/W1578725873","https://openalex.org/W2265342114","https://openalex.org/W2515292966","https://openalex.org/W144015317","https://openalex.org/W2073311296"],"abstract_inverted_index":{"Abstract":[0],"We":[1,38,104],"define":[2,88],"a":[3,43,100,111],"novel,":[4],"extensional,":[5],"three-valued":[6,28],"semantics":[7,16,124,142],"for":[8,94,125,138,143],"higher-order":[9,97,144],"logic":[10,98,127,145],"programs":[11,146],"with":[12],"negation.":[13],"The":[14],"new":[15],"is":[17,61,67,109],"based":[18],"on":[19],"interpreting":[20],"the":[21,24,35,55,59,64,84,121,140],"types":[22],"of":[23,34,51,58,73],"source":[25],"language":[26],"as":[27],"Fitting-monotonic":[29,47],"functions":[30,48,53],"at":[31],"all":[32],"levels":[33],"type":[36],"hierarchy.":[37],"prove":[39,116],"that":[40,92,106,117],"there":[41],"exists":[42],"bijection":[44],"between":[45],"such":[46],"and":[49,63,82],"pairs":[50],"two-valued-result":[52],"where":[54],"first":[56],"member":[57,66],"pair":[60],"monotone-antimonotone":[62],"second":[65],"antimonotone-monotone.":[68],"By":[69],"deriving":[70],"an":[71,89,135],"extension":[72],"consistent":[74],"approximation":[75],"fixpoint":[76],"theory":[77],"(Denecker":[78],"et":[79],"al.":[80],"2004)":[81],"utilizing":[83],"above":[85],"bijection,":[86],"we":[87,115],"iterative":[90],"procedure":[91],"produces":[93],"any":[95],"given":[96],"program":[99],"distinguished":[101],"extensional":[102],"model.":[103],"demonstrate":[105],"this":[107,131],"model":[108],"actually":[110],"minimal":[112],"one.":[113],"Moreover,":[114],"our":[118,133],"construction":[119],"generalizes":[120],"familiar":[122],"well-founded":[123,141],"classical":[126],"programs,":[128],"making":[129],"in":[130],"way":[132],"proposal":[134],"appealing":[136],"formulation":[137],"capturing":[139],".":[147]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}