{"id":"https://openalex.org/W2898772359","doi":"https://doi.org/10.1017/s1471068420000095","title":"Omission-Based Abstraction for Answer Set Programs","display_name":"Omission-Based Abstraction for Answer Set Programs","publication_year":2020,"publication_date":"2020-06-09","ids":{"openalex":"https://openalex.org/W2898772359","doi":"https://doi.org/10.1017/s1471068420000095","mag":"2898772359"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068420000095","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000095","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD63017419E44CA4450AE8B2F1CDA9BB/S1471068420000095a.pdf/div-class-title-omission-based-abstraction-for-answer-set-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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD63017419E44CA4450AE8B2F1CDA9BB/S1471068420000095a.pdf/div-class-title-omission-based-abstraction-for-answer-set-programs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024232019","display_name":"Zeynep G. Saribatur","orcid":"https://orcid.org/0000-0001-8690-5043"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"ZEYNEP G. SARIBATUR","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082178480","display_name":"Thomas Eiter","orcid":"https://orcid.org/0000-0001-6003-6345"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"THOMAS EITER","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024232019"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.6857,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75491641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"2","first_page":"145","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.991599977016449,"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.991599977016449,"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.9882000088691711,"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.946399986743927,"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.88331139087677},{"id":"https://openalex.org/keywords/spurious-relationship","display_name":"Spurious relationship","score":0.8743548393249512},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.8714572787284851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7527873516082764},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.7356076836585999},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.6415627002716064},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6397210955619812},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5042949914932251},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12178853154182434}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.88331139087677},{"id":"https://openalex.org/C97256817","wikidata":"https://www.wikidata.org/wiki/Q1462316","display_name":"Spurious relationship","level":2,"score":0.8743548393249512},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.8714572787284851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7527873516082764},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.7356076836585999},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.6415627002716064},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6397210955619812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5042949914932251},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12178853154182434},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068420000095","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000095","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD63017419E44CA4450AE8B2F1CDA9BB/S1471068420000095a.pdf/div-class-title-omission-based-abstraction-for-answer-set-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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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:2004.01410","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.01410","pdf_url":"https://arxiv.org/pdf/2004.01410","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":"doi:10.48550/arxiv.2004.01410","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.01410","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-journal"},{"id":"mag:2898772359","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2004.01410","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":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"doi:10.1017/s1471068420000095","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000095","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/FD63017419E44CA4450AE8B2F1CDA9BB/S1471068420000095a.pdf/div-class-title-omission-based-abstraction-for-answer-set-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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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.7099999785423279,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G1975729292","display_name":null,"funder_award_id":"W1255-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":null,"funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320322839","display_name":"Technische Universit\u00e4t Wien","ror":"https://ror.org/04d836q62"},{"id":"https://openalex.org/F4320335937","display_name":"Technische Universit\u00e4t Wien Bibliothek","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2898772359.pdf","grobid_xml":"https://content.openalex.org/works/W2898772359.grobid-xml"},"referenced_works_count":62,"referenced_works":["https://openalex.org/W20730496","https://openalex.org/W73864267","https://openalex.org/W203432916","https://openalex.org/W1482532598","https://openalex.org/W1488478372","https://openalex.org/W1602726442","https://openalex.org/W1694306392","https://openalex.org/W1766332311","https://openalex.org/W1787538678","https://openalex.org/W1968513265","https://openalex.org/W1981627423","https://openalex.org/W1985274317","https://openalex.org/W1995876561","https://openalex.org/W2004414305","https://openalex.org/W2036241121","https://openalex.org/W2055486654","https://openalex.org/W2066287719","https://openalex.org/W2076698873","https://openalex.org/W2077518845","https://openalex.org/W2078727257","https://openalex.org/W2080593426","https://openalex.org/W2081810835","https://openalex.org/W2091138122","https://openalex.org/W2105869173","https://openalex.org/W2108309071","https://openalex.org/W2112090702","https://openalex.org/W2123740011","https://openalex.org/W2127574686","https://openalex.org/W2169041689","https://openalex.org/W2170482119","https://openalex.org/W2171836055","https://openalex.org/W2222364239","https://openalex.org/W2254622818","https://openalex.org/W2399696728","https://openalex.org/W2505202112","https://openalex.org/W2507704646","https://openalex.org/W2562038926","https://openalex.org/W2572801424","https://openalex.org/W2573779957","https://openalex.org/W2604896086","https://openalex.org/W2738112172","https://openalex.org/W2778562959","https://openalex.org/W2885963677","https://openalex.org/W2963164881","https://openalex.org/W4249771336","https://openalex.org/W6603921552","https://openalex.org/W6630023811","https://openalex.org/W6630994661","https://openalex.org/W6632261324","https://openalex.org/W6634479986","https://openalex.org/W6635564579","https://openalex.org/W6655318335","https://openalex.org/W6664728123","https://openalex.org/W6683832619","https://openalex.org/W6684126406","https://openalex.org/W6684232067","https://openalex.org/W6694132994","https://openalex.org/W6713642645","https://openalex.org/W6740977992","https://openalex.org/W6755791511","https://openalex.org/W6761893011","https://openalex.org/W6771676130"],"related_works":["https://openalex.org/W3101458312","https://openalex.org/W201814071","https://openalex.org/W2776804019","https://openalex.org/W2964210039","https://openalex.org/W2289854974","https://openalex.org/W2510852717","https://openalex.org/W3036025663","https://openalex.org/W2964023786","https://openalex.org/W3103165021","https://openalex.org/W2050680750","https://openalex.org/W2285416797","https://openalex.org/W1550020009","https://openalex.org/W38786560","https://openalex.org/W3093047347","https://openalex.org/W1538709216","https://openalex.org/W1588107453","https://openalex.org/W2963222651","https://openalex.org/W2951471155","https://openalex.org/W2156962871","https://openalex.org/W3211219023"],"abstract_inverted_index":{"Abstract":[0],"Abstraction":[1],"is":[2,89,188],"a":[3,8,15,31,39,94,156],"well-known":[4],"approach":[5,136],"to":[6,41,64,93,112,118,137,162,182],"simplify":[7],"complex":[9],"problem":[10,35],"by":[11,50,190],"over-approximating":[12],"it":[13],"with":[14,80,127,139],"deliberate":[16],"loss":[17],"of":[18,82,101,165,170,177],"information.":[19],"It":[20],"was":[21],"not":[22],"considered":[23],"so":[24],"far":[25],"in":[26,121,152,168],"Answer":[27],"Set":[28],"Programming":[29],"(ASP),":[30],"convenient":[32],"tool":[33],"for":[34,71],"solving.":[36],"We":[37],"introduce":[38],"method":[40],"automatically":[42],"abstract":[43,66,86],"ASP":[44,134,166],"programs":[45,167],"that":[46,77,180],"preserves":[47,184],"their":[48],"structure":[49],"reducing":[51],"the":[52,85,99,153,175],"vocabulary":[53],"while":[54],"ensuring":[55],"an":[56,133],"over-approximation":[57],"(i.e.,":[58],"each":[59],"original":[60],"answer":[61,67,74,87,104,115,122,129],"set":[62,75,123],"maps":[63],"some":[65],"set).":[68],"This":[69],"allows":[70],"generating":[72],"partial":[73],"candidates":[76],"can":[78],"help":[79,138],"approximation":[81],"reasoning.":[83],"Computing":[84],"sets":[88,116,176],"intuitively":[90],"easier":[91],"due":[92],"smaller":[95],"search":[96],"space,":[97],"at":[98],"cost":[100],"encountering":[102],"spurious":[103,128],"sets.":[105],"Faithful":[106],"(non-spurious)":[107],"abstractions":[108],"may":[109],"be":[110],"used":[111],"represent":[113],"projected":[114],"and":[117,148],"guide":[119],"solvers":[120],"construction.":[124],"For":[125],"dealing":[126],"sets,":[130,172],"we":[131,159],"employ":[132],"debugging":[135],"abstraction":[140,161,181],"refinement,":[141],"which":[142,173],"determines":[143],"atoms":[144,178],"as":[145],"badly":[146],"omitted":[147],"adds":[149],"them":[150,183],"back":[151],"abstraction.":[154],"As":[155],"show":[157],"case,":[158],"apply":[160],"explain":[163],"unsatisfiability":[164],"terms":[169],"blocker":[171],"are":[174],"such":[179],"unsatisfiability.":[185],"Their":[186],"usefulness":[187],"demonstrated":[189],"experimental":[191],"results.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}