{"id":"https://openalex.org/W2963588392","doi":"https://doi.org/10.1017/s1471068419000176","title":"Better Paracoherent Answer Sets with Less Resources","display_name":"Better Paracoherent Answer Sets with Less Resources","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2963588392","doi":"https://doi.org/10.1017/s1471068419000176","mag":"2963588392"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000176","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000176","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.09560","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"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, Rende, Italy (e-mails:"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy (e-mails:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"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, 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":null,"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":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.1447,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57188089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":"5-6","first_page":"757","last_page":"772"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9886999726295471,"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.9886999726295471,"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.003599999938160181,"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.0020000000949949026,"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.8845999836921692},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.7056999802589417},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6963000297546387},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6277999877929688},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4675000011920929},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.45579999685287476}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8845999836921692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.824400007724762},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.7056999802589417},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6963000297546387},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6277999877929688},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5461000204086304},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.47920000553131104},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.421999990940094},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.37869998812675476},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C89497691","wikidata":"https://www.wikidata.org/wiki/Q7981058","display_name":"Well-founded semantics","level":5,"score":0.31200000643730164},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.30390000343322754},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2671000063419342}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068419000176","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000176","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.09560","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.09560","pdf_url":"https://arxiv.org/pdf/1907.09560","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.09560","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.09560","pdf_url":"https://arxiv.org/pdf/1907.09560","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W20730496","https://openalex.org/W1183699148","https://openalex.org/W1516535258","https://openalex.org/W1597654764","https://openalex.org/W1606891084","https://openalex.org/W1968513265","https://openalex.org/W1976055110","https://openalex.org/W1985161451","https://openalex.org/W1993524183","https://openalex.org/W2010968193","https://openalex.org/W2021305476","https://openalex.org/W2024943265","https://openalex.org/W2048639548","https://openalex.org/W2076698873","https://openalex.org/W2085084839","https://openalex.org/W2091138122","https://openalex.org/W2106614716","https://openalex.org/W2150903551","https://openalex.org/W2167440926","https://openalex.org/W2178708778","https://openalex.org/W2211798527","https://openalex.org/W2222364239","https://openalex.org/W2265638991","https://openalex.org/W2276017294","https://openalex.org/W2301736536","https://openalex.org/W2401337862","https://openalex.org/W2417688306","https://openalex.org/W2505202112","https://openalex.org/W2506402500","https://openalex.org/W2531238681","https://openalex.org/W2542981480","https://openalex.org/W2733732676","https://openalex.org/W2914398864","https://openalex.org/W2945094890","https://openalex.org/W2949217420","https://openalex.org/W2963234253","https://openalex.org/W4211177236","https://openalex.org/W6633272674","https://openalex.org/W6635729712","https://openalex.org/W6744620888"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Answer":[1],"Set":[2],"Programming":[3],"(ASP)":[4],"is":[5,133],"a":[6,42,50,129],"well-established":[7],"formalism":[8],"for":[9,34,58,127],"logic":[10],"programming.":[11],"Problem":[12],"solving":[13],"in":[14,52],"ASP":[15,20,36,70,97],"requires":[16],"to":[17,26,48,71,107],"write":[18],"an":[19,123],"program":[21],"whose":[22],"answers":[23],"sets":[24,33,145],"correspond":[25],"solutions.":[27],"Albeit":[28],"the":[29,66,80,84,92,99,110],"non-existence":[30],"of":[31,69,82,86,88,91,95],"answer":[32,62,144],"some":[35],"programs":[37],"can":[38,146],"be":[39,49,104,147],"considered":[40],"as":[41],"modeling":[43],"feature,":[44],"it":[45],"turns":[46],"out":[47],"weakness":[51],"many":[53],"other":[54],"cases,":[55],"and":[56],"especially":[57],"query":[59],"answering.":[60],"Paracoherent":[61],"set":[63],"semantics":[64,68,114],"extend":[65],"classical":[67],"draw":[72],"meaningful":[73],"conclusions":[74],"also":[75],"from":[76],"incoherent":[77],"programs,":[78],"with":[79],"result":[81],"increasing":[83],"range":[85],"applications":[87],"ASP.":[89],"State":[90],"art":[93],"implementations":[94],"paracoherent":[96,143],"adopt":[98],"semi-equilibrium":[100,113,118,131],"semantics,":[101],"but":[102],"cannot":[103],"lifted":[105],"straightforwardly":[106],"compute":[108],"efficiently":[109],"(better)":[111],"split":[112,130],"that":[115,141],"discards":[116],"undesirable":[117],"models.":[119],"In":[120],"this":[121],"paper":[122],"efficient":[124],"evaluation":[125],"technique":[126],"computing":[128],"model":[132],"presented.":[134],"An":[135],"experiment":[136],"on":[137],"hard":[138],"benchmarks":[139],"shows":[140],"better":[142],"computed":[148],"consuming":[149],"less":[150],"computational":[151],"resources":[152],"than":[153],"existing":[154],"methods.":[155]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-07-30T00:00:00"}