{"id":"https://openalex.org/W4383228181","doi":"https://doi.org/10.1017/s1471068423000121","title":"An Efficient Solver for ASP(Q)","display_name":"An Efficient Solver for ASP(Q)","publication_year":2023,"publication_date":"2023-07-01","ids":{"openalex":"https://openalex.org/W4383228181","doi":"https://doi.org/10.1017/s1471068423000121"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068423000121","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068423000121","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/130A3B6DEB91E6B75D912D28F95A937F/S1471068423000121a.pdf/div-class-title-an-efficient-solver-for-asp-q-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/130A3B6DEB91E6B75D912D28F95A937F/S1471068423000121a.pdf/div-class-title-an-efficient-solver-for-asp-q-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017101409","display_name":"Wolfgang Faber","orcid":"https://orcid.org/0000-0002-0330-5868"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"WOLFGANG FABER","raw_affiliation_strings":["Alpen-Adria Universit\u00e4t Klagenfurt, Austria (e-mail:"],"affiliations":[{"raw_affiliation_string":"Alpen-Adria Universit\u00e4t Klagenfurt, Austria (e-mail:","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012805227","display_name":"GIUSEPPE MAZZOTTA","orcid":null},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"GIUSEPPE MAZZOTTA","raw_affiliation_strings":["University of Calabria, Rende, Italy (e-mails:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013411309","display_name":"Francesco Ricca","orcid":"https://orcid.org/0000-0001-8218-3178"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"FRANCESCO RICCA","raw_affiliation_strings":["University of Calabria, Rende, Italy (e-mails:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017101409"],"corresponding_institution_ids":["https://openalex.org/I4210166741"],"apc_list":null,"apc_paid":null,"fwci":0.8842,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78729379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"23","issue":"4","first_page":"948","last_page":"964"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","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/T11010","display_name":"Logic, Reasoning, and Knowledge","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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9965000152587891,"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.9775999784469604,"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/computer-science","display_name":"Computer science","score":0.8345175981521606},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.823876142501831},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.6939325332641602},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6282042860984802},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5807428956031799},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5754486918449402},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5092743635177612},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46304088830947876},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4517943859100342},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44712573289871216},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4087860584259033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38571807742118835},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17774084210395813}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8345175981521606},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.823876142501831},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.6939325332641602},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6282042860984802},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5807428956031799},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5754486918449402},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5092743635177612},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46304088830947876},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4517943859100342},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44712573289871216},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4087860584259033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38571807742118835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17774084210395813},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068423000121","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068423000121","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/130A3B6DEB91E6B75D912D28F95A937F/S1471068423000121a.pdf/div-class-title-an-efficient-solver-for-asp-q-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1471068423000121","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068423000121","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/130A3B6DEB91E6B75D912D28F95A937F/S1471068423000121a.pdf/div-class-title-an-efficient-solver-for-asp-q-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4383228181.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1484403583","https://openalex.org/W1968513265","https://openalex.org/W1969965298","https://openalex.org/W2076698873","https://openalex.org/W2087432892","https://openalex.org/W2091138122","https://openalex.org/W2092211394","https://openalex.org/W2496580970","https://openalex.org/W2542981480","https://openalex.org/W2755687384","https://openalex.org/W2802750345","https://openalex.org/W2843957561","https://openalex.org/W2893932668","https://openalex.org/W2937448176","https://openalex.org/W2986691327","https://openalex.org/W3098293022","https://openalex.org/W3099669149","https://openalex.org/W3157980852","https://openalex.org/W3203120728","https://openalex.org/W4205326989","https://openalex.org/W4206395613","https://openalex.org/W4293180210","https://openalex.org/W4382239441","https://openalex.org/W6608145652","https://openalex.org/W6723825122","https://openalex.org/W6754701906","https://openalex.org/W6785272910","https://openalex.org/W6785301830","https://openalex.org/W6800252525"],"related_works":["https://openalex.org/W2092211394","https://openalex.org/W4383228181","https://openalex.org/W4377111673","https://openalex.org/W4293180210","https://openalex.org/W2920896101","https://openalex.org/W2761070866","https://openalex.org/W3208247616","https://openalex.org/W4287904833","https://openalex.org/W3000666777","https://openalex.org/W2996917877"],"abstract_inverted_index":{"Abstract":[0],"Answer":[1,8],"Set":[2,9],"Programming":[3,10],"with":[4,43],"Quantifiers":[5],"ASP(Q)":[6,117],"extends":[7],"(ASP)":[11],"to":[12,38,74,154],"allow":[13],"for":[14,76],"declarative":[15],"and":[16,50,67,87,104,112,135,137],"modular":[17],"modeling":[18],"of":[19,29,46,57,81,85,102,116,129,132],"problems":[20],"from":[21],"the":[22,44,48,55,58,82,100,130,167],"entire":[23],"polynomial":[24],"hierarchy.":[25],"The":[26,121],"first":[27],"implementation":[28,56,96],"ASP(Q),":[30],"called":[31],"QASP,":[32],"was":[33],"based":[34],"on":[35,99,162],"a":[36,94,107,140],"translation":[37],"Quantified":[39],"Boolean":[40],"Formulae":[41],"(QBF)":[42],"aim":[45],"exploiting":[47],"well-developed":[49],"mature":[51],"QBF-solving":[52,152],"technology.":[53],"However,":[54],"QBF":[59,78],"encoding":[60,110],"employed":[61],"in":[62,119,139],"qasp":[63],"is":[64],"very":[65],"general":[66],"might":[68],"produce":[69,124],"formulas":[70,126],"that":[71,97,166],"are":[72],"hard":[73],"evaluate":[75],"existing":[77],"solvers":[79],"because":[80],"large":[83],"number":[84,131],"symbols":[86],"subclauses.":[88],"In":[89],"this":[90],"paper,":[91],"we":[92],"present":[93],"new":[95,113,122,168],"builds":[98],"ideas":[101],"QASP":[103],"features":[105],"both":[106],"more":[108,141],"efficient":[109,142],"procedure":[111],"optimized":[114],"encodings":[115,123],"programs":[118],"QBF.":[120],"smaller":[125],"(in":[127],"terms":[128],"quantifiers,":[133],"variables,":[134],"clauses)":[136],"result":[138],"evaluation":[143],"process.":[144],"An":[145,158],"algorithm":[146],"selection":[147],"strategy":[148],"automatically":[149],"combines":[150],"several":[151],"back-ends":[153],"further":[155],"increase":[156],"performance.":[157],"experimental":[159],"analysis,":[160],"conducted":[161],"known":[163],"benchmarks,":[164],"shows":[165],"system":[169],"outperforms":[170],"QASP.":[171]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}