{"id":"https://openalex.org/W2397448600","doi":"https://doi.org/10.3233/fi-2016-1441","title":"Evaluating Answer Set Programming with Non-Convex Recursive Aggregates","display_name":"Evaluating Answer Set Programming with Non-Convex Recursive Aggregates","publication_year":2016,"publication_date":"2016-12-24","ids":{"openalex":"https://openalex.org/W2397448600","doi":"https://doi.org/10.3233/fi-2016-1441","mag":"2397448600"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1441","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1441","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039882261","display_name":"Mario Alviano","orcid":"https://orcid.org/0000-0002-2052-2063"},"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":"Mario Alviano","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Via Pietro Bucci 30/B, 87036 Rende (CS), Italy. alviano@mat.unical.it"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Via Pietro Bucci 30/B, 87036 Rende (CS), Italy. alviano@mat.unical.it","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039882261"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.4285,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77679237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"149","issue":"1-2","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.996999979019165,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.996999979019165,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996999979019165,"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.9065999984741211,"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/recursion","display_name":"Recursion (computer science)","score":0.7500369548797607},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.7193971276283264},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5942174196243286},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5034767985343933},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48480358719825745},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39215517044067383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37983453273773193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3093557357788086},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15976688265800476}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7500369548797607},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.7193971276283264},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5942174196243286},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5034767985343933},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48480358719825745},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39215517044067383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37983453273773193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3093557357788086},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15976688265800476},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2016-1441","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1441","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"mag:2397448600","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/aiia/rcra2015.html#Alviano15","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2562091408","https://openalex.org/W1539967703","https://openalex.org/W100292100","https://openalex.org/W1989195159","https://openalex.org/W2022959407","https://openalex.org/W2009995730","https://openalex.org/W1975592766","https://openalex.org/W1534683830","https://openalex.org/W1986060337","https://openalex.org/W2963195244","https://openalex.org/W2017747697","https://openalex.org/W2009068757","https://openalex.org/W2063926602","https://openalex.org/W2398922826","https://openalex.org/W2052381181","https://openalex.org/W2081048469","https://openalex.org/W2403603094","https://openalex.org/W2343967979","https://openalex.org/W2811295902","https://openalex.org/W2784921327"],"abstract_inverted_index":{"Aggregation":[0],"functions":[1],"are":[2],"widely":[3],"used":[4],"in":[5],"answer":[6],"set":[7],"programming":[8],"(ASP)":[9],"for":[10],"representing":[11],"and":[12],"reasoning":[13],"on":[14,27],"knowledge":[15],"involving":[16],"sets":[17,22],"of":[18,30],"objects":[19],"collectively.":[20],"These":[21],"may":[23],"also":[24],"depend":[25],"recursively":[26],"the":[28,31],"results":[29],"aggregation":[32],"functions,":[33],"even":[34],"if":[35],"so":[36],"f":[37]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}