{"id":"https://openalex.org/W2576910171","doi":"https://doi.org/10.1017/s1471068417000047","title":"Logic + control: On program construction and verification","display_name":"Logic + control: On program construction and verification","publication_year":2017,"publication_date":"2017-06-19","ids":{"openalex":"https://openalex.org/W2576910171","doi":"https://doi.org/10.1017/s1471068417000047","mag":"2576910171"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068417000047","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000047","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BAA723F8DEE33A1F718A6637D9CCFE50/S1471068417000047a.pdf/div-class-title-logic-control-on-program-construction-and-verification-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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BAA723F8DEE33A1F718A6637D9CCFE50/S1471068417000047a.pdf/div-class-title-logic-control-on-program-construction-and-verification-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066576127","display_name":"W\u0142odzimierz Drabent","orcid":"https://orcid.org/0000-0002-4700-7272"},"institutions":[{"id":"https://openalex.org/I99542240","display_name":"Polish Academy of Sciences","ror":"https://ror.org/01dr6c206","country_code":"PL","type":"funder","lineage":["https://openalex.org/I99542240"]},{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL","SE"],"is_corresponding":true,"raw_author_name":"W\u0141ODZIMIERZ DRABENT","raw_affiliation_strings":["IDA, Link\u00f6ping University, Link\u00f6ping, Sweden (e-mails:","Institute of Computer Science, Polish Academy of Sciences, Warsaw"],"affiliations":[{"raw_affiliation_string":"IDA, Link\u00f6ping University, Link\u00f6ping, Sweden (e-mails:","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Institute of Computer Science, Polish Academy of Sciences, Warsaw","institution_ids":["https://openalex.org/I99542240","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066576127"],"corresponding_institution_ids":["https://openalex.org/I99542240","https://openalex.org/I102134673","https://openalex.org/I4210087266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0079905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983000159263611,"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.9980000257492065,"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/correctness","display_name":"Correctness","score":0.839605450630188},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.752651572227478},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.719455361366272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7140652537345886},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6673879623413086},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6141535639762878},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5747525691986084},{"id":"https://openalex.org/keywords/axiomatic-semantics","display_name":"Axiomatic semantics","score":0.5034460425376892},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.48753902316093445},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.41491368412971497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38193613290786743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18365806341171265},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.1604696810245514}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.839605450630188},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.752651572227478},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.719455361366272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7140652537345886},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6673879623413086},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6141535639762878},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5747525691986084},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.5034460425376892},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.48753902316093445},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.41491368412971497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38193613290786743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18365806341171265},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.1604696810245514},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068417000047","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000047","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BAA723F8DEE33A1F718A6637D9CCFE50/S1471068417000047a.pdf/div-class-title-logic-control-on-program-construction-and-verification-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:1110.4978","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1110.4978","pdf_url":"https://arxiv.org/pdf/1110.4978","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":"","raw_type":null},{"id":"mag:2576910171","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1110.4978v6","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1110.4978","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1110.4978","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s1471068417000047","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000047","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BAA723F8DEE33A1F718A6637D9CCFE50/S1471068417000047a.pdf/div-class-title-logic-control-on-program-construction-and-verification-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":[{"score":0.800000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2576910171.pdf","grobid_xml":"https://content.openalex.org/works/W2576910171.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1497328860","https://openalex.org/W1514468887","https://openalex.org/W1532248060","https://openalex.org/W1549449731","https://openalex.org/W1804654308","https://openalex.org/W2011306767","https://openalex.org/W2057361103","https://openalex.org/W2059709382","https://openalex.org/W2060714294","https://openalex.org/W2094612221","https://openalex.org/W2120869002","https://openalex.org/W2121531736","https://openalex.org/W2133186235","https://openalex.org/W2289914401","https://openalex.org/W4210897223","https://openalex.org/W4298085906","https://openalex.org/W6639303686","https://openalex.org/W6639662885","https://openalex.org/W6652235469","https://openalex.org/W6677109729","https://openalex.org/W6764690749"],"related_works":["https://openalex.org/W2963114687","https://openalex.org/W2221067658","https://openalex.org/W1636056063","https://openalex.org/W2289914401","https://openalex.org/W2950567239","https://openalex.org/W2963910881","https://openalex.org/W2010333114","https://openalex.org/W1804654308","https://openalex.org/W2036395016","https://openalex.org/W2075909731","https://openalex.org/W180156219","https://openalex.org/W1970434055","https://openalex.org/W2279194953","https://openalex.org/W153459646","https://openalex.org/W2120620984","https://openalex.org/W1983409972","https://openalex.org/W3086076508","https://openalex.org/W2259407217","https://openalex.org/W2337756575","https://openalex.org/W2098780033"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"an":[4,186],"example":[5,118,147],"of":[6,12,16,22,46,73,98,131,166],"formal":[7],"reasoning":[8,156],"about":[9,157],"the":[10,74,99,105,132,138,164],"semantics":[11],"a":[13,31,79],"Prolog":[14,107],"program":[15,27,35,41,76,101,168],"practical":[17],"importance":[18],"(the":[19],"SAT":[20],"solver":[21],"Howe":[23],"and":[24,55,89,96,115,124,181],"King).":[25],"The":[26,39,58,146],"is":[28,42,102],"treated":[29],"as":[30],"definite":[32],"clause":[33],"logic":[34,40,75,100,158],"with":[36,52,122,125,183],"added":[37],"control.":[38],"constructed":[43],"by":[44],"means":[45],"stepwise":[47],"refinement,":[48],"hand":[49,51],"in":[50,104,154],"its":[53],"correctness":[54,95,180],"completeness":[56,97,182],"proofs.":[57],"proofs":[59,133],"are":[60,86,152],"declarative":[61],"\u2013":[62],"they":[63,151],"do":[64],"not":[65,172],"refer":[66],"to":[67,82,185],"any":[68,143],"operational":[69,144],"semantics.":[70,145],"Each":[71],"step":[72],"construction":[77],"follows":[78],"systematic":[80],"approach":[81],"constructing":[83],"programs":[84],"which":[85,178],"provably":[87],"correct":[88],"complete.":[90],"We":[91,174],"also":[92,161],"prove":[93,111],"that":[94,163],"preserved":[103],"final":[106],"program.":[108],"Additionally,":[109],"we":[110],"termination,":[112],"occur-check":[113],"freedom":[114],"non-floundering.":[116],"Our":[117],"shows":[119,162],"how":[120],"dealing":[121],"\u201clogic\u201d":[123,139],"\u201ccontrol\u201d":[126],"can":[127,134],"be":[128,135,171],"separated.":[129],"Most":[130],"done":[136],"at":[137],"level,":[140],"abstracting":[141],"from":[142],"employs":[148],"approximate":[149,187],"specifications;":[150],"crucial":[153],"simplifying":[155],"programs.":[159],"It":[160],"paradigm":[165],"semantics-preserving":[167],"transformations":[169,177],"may":[170],"sufficient.":[173],"suggest":[175],"considering":[176],"preserve":[179],"respect":[184],"specification.":[188]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}