{"id":"https://openalex.org/W2963406506","doi":"https://doi.org/10.1017/s1471068419000164","title":"Abstract Solvers for Computing Cautious Consequences of ASP programs","display_name":"Abstract Solvers for Computing Cautious Consequences of ASP programs","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2963406506","doi":"https://doi.org/10.1017/s1471068419000164","mag":"2963406506"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000164","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000164","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.09402","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070069387","display_name":"Giovanni Amendola","orcid":"https://orcid.org/0000-0002-2111-9671"},"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":true,"raw_author_name":"GIOVANNI AMENDOLA","raw_affiliation_strings":["University of Calabria, Italy (e-mails:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031224507","display_name":"Carmine Dodaro","orcid":"https://orcid.org/0000-0002-5617-5286"},"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":"CARMINE DODARO","raw_affiliation_strings":["University of Calabria, Italy (e-mails:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077756388","display_name":"Marco Maratea","orcid":"https://orcid.org/0000-0002-9034-2527"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MARCO MARATEA","raw_affiliation_strings":["University of Genoa, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Genoa, Italy (e-mail:","institution_ids":["https://openalex.org/I83816512"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070069387"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.1447,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57175733,"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":"740","last_page":"756"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9951000213623047,"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.9912999868392944,"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/answer-set-programming","display_name":"Answer set programming","score":0.9358824491500854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8204285502433777},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6092126965522766},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5740841627120972},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5678345561027527},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5577662587165833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5264055132865906},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5130142569541931},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5045410394668579},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44381487369537354},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4244476556777954},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.41931354999542236},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41403743624687195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14809593558311462},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.140203058719635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13109442591667175}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.9358824491500854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8204285502433777},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6092126965522766},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5740841627120972},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5678345561027527},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5577662587165833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5264055132865906},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5130142569541931},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5045410394668579},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44381487369537354},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4244476556777954},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.41931354999542236},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41403743624687195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14809593558311462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.140203058719635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13109442591667175},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068419000164","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000164","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.09402","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.09402","pdf_url":"https://arxiv.org/pdf/1907.09402","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:iris.unige.it:11567/1033630","is_oa":false,"landing_page_url":"https://hdl.handle.net/11567/1033630","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.09402","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.09402","pdf_url":"https://arxiv.org/pdf/1907.09402","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":50,"referenced_works":["https://openalex.org/W84921168","https://openalex.org/W89175885","https://openalex.org/W169672073","https://openalex.org/W602973331","https://openalex.org/W1516600063","https://openalex.org/W1523419405","https://openalex.org/W1557663601","https://openalex.org/W1568917966","https://openalex.org/W1580970166","https://openalex.org/W1593288312","https://openalex.org/W1606891084","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1934765622","https://openalex.org/W1964233932","https://openalex.org/W1976055110","https://openalex.org/W1993398079","https://openalex.org/W2011958646","https://openalex.org/W2018172994","https://openalex.org/W2022846948","https://openalex.org/W2049791401","https://openalex.org/W2051475155","https://openalex.org/W2076698873","https://openalex.org/W2089928029","https://openalex.org/W2100983017","https://openalex.org/W2101757655","https://openalex.org/W2119361337","https://openalex.org/W2123120140","https://openalex.org/W2126102461","https://openalex.org/W2152131859","https://openalex.org/W2178708778","https://openalex.org/W2180614101","https://openalex.org/W2211798527","https://openalex.org/W2241862190","https://openalex.org/W2254161830","https://openalex.org/W2265638991","https://openalex.org/W2295882966","https://openalex.org/W2328438203","https://openalex.org/W2406975053","https://openalex.org/W2505202112","https://openalex.org/W2755687384","https://openalex.org/W2781871790","https://openalex.org/W2899766884","https://openalex.org/W2945094890","https://openalex.org/W2963164881","https://openalex.org/W3103070746","https://openalex.org/W3103684517","https://openalex.org/W3104588709","https://openalex.org/W6635564579","https://openalex.org/W6744620888"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2396384868","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2460803124","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Abstract":[0,1],"solvers":[2,67],"are":[3,106,134],"a":[4],"method":[5],"to":[6,62,84,109,136],"formally":[7,94],"analyze":[8],"algorithms":[9,98],"that":[10,96,131],"have":[11],"been":[12],"profitably":[13],"used":[14],"for":[15,53,68,99,111],"describing,":[16],"comparing":[17],"and":[18,39,48,129],"composing":[19],"solving":[20,87,100],"techniques":[21,75],"in":[22,57,71,80,82,104,124],"various":[23],"fields":[24],"such":[25],"as":[26],"Propositional":[27],"Satisfiability":[28,32],"(SAT),":[29],"Quantified":[30],"SAT,":[31,81],"Modulo":[33],"Theories,":[34],"Answer":[35],"Set":[36],"Programming":[37],"(ASP),":[38],"Constraint":[40],"ASP.":[41,58],"In":[42],"this":[43],"paper,":[44],"we":[45,92],"design,":[46],"implement":[47,118],"test":[49],"novel":[50],"abstract":[51,66],"solutions":[52,123,138],"cautious":[54,69,101],"reasoning":[55,70,102],"tasks":[56,103],"We":[59,117],"show":[60,95,130],"how":[61],"improve":[63],"the":[64,97,121,125,140,144],"current":[65],"ASP":[72,105,126,146],"with":[73],"new":[74,86,122],"borrowed":[76],"from":[77,143],"backbone":[78],"computation":[79],"order":[83],"design":[85],"algorithms.":[88],"By":[89],"doing":[90],"so,":[91],"also":[93],"strongly":[107],"related":[108],"those":[110],"computing":[112],"backbones":[113],"of":[114,120],"Boolean":[115],"formulas.":[116],"some":[119],"solver":[127],"wasp":[128],"their":[132],"performance":[133],"comparable":[135],"state-of-the-art":[137],"on":[139],"benchmark":[141],"problems":[142],"past":[145],"Competitions.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}