{"id":"https://openalex.org/W3033339654","doi":"https://doi.org/10.1017/s1471068420000265","title":"Modular Answer Set Programming as a Formal Specification Language","display_name":"Modular Answer Set Programming as a Formal Specification Language","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3033339654","doi":"https://doi.org/10.1017/s1471068420000265","mag":"3033339654"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068420000265","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068420000265","pdf_url":null,"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":"green","oa_url":"https://arxiv.org/pdf/2008.02015","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"PEDRO CABALAR","orcid":"https://orcid.org/0000-0001-7440-0953"},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"PEDRO CABALAR","raw_affiliation_strings":["University of Corunna, Spain (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Corunna, Spain (e-mail:","institution_ids":["https://openalex.org/I11019714"]}]},{"author_position":"middle","author":{"id":null,"display_name":"JORGE FANDINNO","orcid":"https://orcid.org/0000-0002-3917-8717"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"JORGE FANDINNO","raw_affiliation_strings":["University of Potsdam, Germany (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Potsdam, Germany (e-mail:","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"last","author":{"id":null,"display_name":"YULIYA LIERLER","orcid":"https://orcid.org/0000-0002-6146-623X"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YULIYA LIERLER","raw_affiliation_strings":["University of Nebraska Omaha, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha, USA (e-mail:","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I11019714"],"apc_list":null,"apc_paid":null,"fwci":0.9603,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80844033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":"5","first_page":"767","last_page":"782"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9916999936103821,"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.9916999936103821,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.0031999999191612005,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.0010999999940395355,"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/answer-set-programming","display_name":"Answer set programming","score":0.6754999756813049},{"id":"https://openalex.org/keywords/specification-language","display_name":"Specification language","score":0.6328999996185303},{"id":"https://openalex.org/keywords/programming-language-specification","display_name":"Programming language specification","score":0.6309000253677368},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5856000185012817},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5777000188827515},{"id":"https://openalex.org/keywords/formal-specification","display_name":"Formal specification","score":0.5462999939918518},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5232999920845032},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.504800021648407},{"id":"https://openalex.org/keywords/object-language","display_name":"Object language","score":0.5016999840736389},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45489999651908875}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8285999894142151},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8259000182151794},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6754999756813049},{"id":"https://openalex.org/C201677973","wikidata":"https://www.wikidata.org/wiki/Q1209840","display_name":"Specification language","level":2,"score":0.6328999996185303},{"id":"https://openalex.org/C15077461","wikidata":"https://www.wikidata.org/wiki/Q7248507","display_name":"Programming language specification","level":5,"score":0.6309000253677368},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5856000185012817},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.5462999939918518},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.504800021648407},{"id":"https://openalex.org/C185954173","wikidata":"https://www.wikidata.org/wiki/Q4347052","display_name":"Object language","level":3,"score":0.5016999840736389},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42980000376701355},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.428600013256073},{"id":"https://openalex.org/C90069079","wikidata":"https://www.wikidata.org/wiki/Q1805432","display_name":"Language Of Temporal Ordering Specification","level":3,"score":0.41760000586509705},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.3882000148296356},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C2777691520","wikidata":"https://www.wikidata.org/wiki/Q4724019","display_name":"Algebraic specification","level":3,"score":0.35429999232292175},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.3352000117301941},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.3093999922275543},{"id":"https://openalex.org/C14331664","wikidata":"https://www.wikidata.org/wiki/Q3417382","display_name":"Refinement","level":3,"score":0.29919999837875366},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.2915000021457672},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.2906999886035919},{"id":"https://openalex.org/C169796678","wikidata":"https://www.wikidata.org/wiki/Q835124","display_name":"Very high-level programming language","level":5,"score":0.28439998626708984},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C570499","wikidata":"https://www.wikidata.org/wiki/Q1289116","display_name":"First-generation programming language","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C19024347","wikidata":"https://www.wikidata.org/wiki/Q211496","display_name":"High-level programming language","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C119263510","wikidata":"https://www.wikidata.org/wiki/Q7248501","display_name":"Programming domain","level":4,"score":0.25690001249313354},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2556999921798706}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068420000265","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068420000265","pdf_url":null,"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:2008.02015","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.02015","pdf_url":"https://arxiv.org/pdf/2008.02015","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"},{"id":"pmh:oai:kobv.de-opus4-uni-potsdam:60772","is_oa":false,"landing_page_url":"https://publishup.uni-potsdam.de/frontdoor/index/index/docId/60772","pdf_url":null,"source":{"id":"https://openalex.org/S4306400594","display_name":"publish.UP (University of Potsdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176453806","host_organization_name":"University of Potsdam","host_organization_lineage":["https://openalex.org/I176453806"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2008.02015","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.02015","pdf_url":"https://arxiv.org/pdf/2008.02015","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1486448317","https://openalex.org/W1527039196","https://openalex.org/W1800801472","https://openalex.org/W1985274317","https://openalex.org/W2074596576","https://openalex.org/W2091138122","https://openalex.org/W2134039900","https://openalex.org/W2152131859","https://openalex.org/W2215047634","https://openalex.org/W2624964952","https://openalex.org/W2692232979","https://openalex.org/W2899983118","https://openalex.org/W2964186776","https://openalex.org/W3033339654","https://openalex.org/W6658210860"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,51],"paper,":[3],"we":[4,53],"study":[5],"the":[6,23,36,39,47,76,108],"problem":[7,40,48,77],"of":[8,26,46,75,90,117],"formal":[9,19,56],"verification":[10],"for":[11],"Answer":[12],"Set":[13],"Programming":[14],"(ASP),":[15],"namely,":[16],"obtaining":[17],"a":[18,27,55,87],"proof":[20],"showing":[21],"that":[22,64,97],"answer":[24],"sets":[25],"given":[28],"(non-ground)":[29],"logic":[30,109],"program":[31,95,110],"P":[32,43,111,120],"correctly":[33],"correspond":[34],"to":[35,38,70,113],"solutions":[37],"encoded":[41],"by":[42],",":[44],"regardless":[45],"instance.":[49],"To":[50],"aim,":[52],"use":[54],"specification":[57,83],"language":[58,84],"based":[59],"on":[60,86],"ASP":[61],"modules,":[62],"so":[63],"each":[65],"module":[66],"can":[67],"be":[68],"proved":[69],"capture":[71],"some":[72,115],"informal":[73],"aspect":[74],"in":[78],"an":[79],"isolated":[80],"way.":[81],"This":[82],"relies":[85],"novel":[88],"definition":[89],"(possibly":[91],"nested,":[92],"first":[93],"order)":[94],"modules":[96],"may":[98],"incorporate":[99],"local":[100],"hidden":[101],"atoms":[102],"at":[103],"different":[104],"levels.":[105],"Then,":[106],"verifying":[107],"amounts":[112],"prove":[114],"kind":[116],"equivalence":[118],"between":[119],"and":[121],"its":[122],"modular":[123],"specification.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2020-06-12T00:00:00"}