{"id":"https://openalex.org/W2965202943","doi":"https://doi.org/10.1017/s1471068419000322","title":"Relating Two Dialects of Answer Set Programming","display_name":"Relating Two Dialects of Answer Set Programming","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2965202943","doi":"https://doi.org/10.1017/s1471068419000322","mag":"2965202943"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000322","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000322","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/1907.12139","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"AMELIA HARRISON","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"AMELIA HARRISON","raw_affiliation_strings":["Google (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google (e-mail:","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":null,"display_name":"VLADIMIR LIFSCHITZ","orcid":"https://orcid.org/0000-0001-6051-7907"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VLADIMIR LIFSCHITZ","raw_affiliation_strings":["University of Texas at Austin (e-mail:"],"raw_orcid":"https://orcid.org/0000-0001-6051-7907","affiliations":[{"raw_affiliation_string":"University of Texas at Austin (e-mail:","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3168,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69427062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"5-6","first_page":"1006","last_page":"1020"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.987500011920929,"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.987500011920929,"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.002400000113993883,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.002099999925121665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7857000231742859},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7279999852180481},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6085000038146973},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5806000232696533},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.542900025844574},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5392000079154968},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4083000123500824}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.794700026512146},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7857000231742859},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7279999852180481},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6685000061988831},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6085000038146973},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5806000232696533},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45010000467300415},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4083000123500824},{"id":"https://openalex.org/C188087704","wikidata":"https://www.wikidata.org/wiki/Q369577","display_name":"Standardization","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30630001425743103},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.29510000348091125},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26170000433921814},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068419000322","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000322","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:1907.12139","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.12139","pdf_url":"https://arxiv.org/pdf/1907.12139","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:arXiv.org:1907.12139","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.12139","pdf_url":"https://arxiv.org/pdf/1907.12139","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W578063101","https://openalex.org/W1800801472","https://openalex.org/W1881914301","https://openalex.org/W2059245949","https://openalex.org/W2064864283","https://openalex.org/W2072190298","https://openalex.org/W2105869173","https://openalex.org/W2404213164","https://openalex.org/W2590401811","https://openalex.org/W6681189606","https://openalex.org/W6696829810","https://openalex.org/W6750119214"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,23,51],"input":[2],"language":[3],"of":[4,15,25,59,72,81,93,106],"the":[5,13,26,31,37,60,65,70,79,91,100,103,107,121],"answer":[6],"set":[7],"solver":[8],"clingo":[9],"is":[10],"based":[11,55],"on":[12,56],"definition":[14],"a":[16],"stable":[17,40,61,108],"model":[18,62,109],"proposed":[19],"by":[20,30],"Paolo":[21],"Ferraris.":[22],"semantics":[24],"ASP-Core":[27,66],"language,":[28],"developed":[29],"ASP":[32],"Standardization":[33],"Working":[34],"Group,":[35],"uses":[36],"approach":[38],"to":[39,43],"models":[41],"due":[42],"Wolfgang":[44],"Faber,":[45],"Nicola":[46],"Leone,":[47],"and":[48,64,111],"Gerald":[49],"Pfeifer.":[50],"two":[52,104],"languages":[53],"are":[54],"different":[57],"versions":[58,105],"semantics,":[63,110],"document":[67],"requires,":[68],"\u201cfor":[69],"sake":[71],"an":[73],"uncontroversial":[74],"semantics,\u201d":[75],"that":[76,90,114],"programs":[77],"avoid":[78],"use":[80],"recursion":[82,94],"through":[83,95],"aggregates.":[84],"In":[85],"this":[86],"paper":[87],"we":[88],"prove":[89],"absence":[92],"aggregates":[96],"does":[97],"indeed":[98],"guarantee":[99],"equivalence":[101,122],"between":[102],"show":[112],"how":[113],"requirement":[115],"can":[116],"be":[117],"relaxed":[118],"without":[119],"violating":[120],"property.":[123]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2019-08-13T00:00:00"}