{"id":"https://openalex.org/W2013130775","doi":"https://doi.org/10.1017/s1471068410000244","title":"Disjunctive ASP with functions: Decidable queries and effective computation","display_name":"Disjunctive ASP with functions: Decidable queries and effective computation","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2013130775","doi":"https://doi.org/10.1017/s1471068410000244","mag":"2013130775"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068410000244","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000244","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/1007.4028","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARIO ALVIANO","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":true,"raw_author_name":"MARIO ALVIANO","raw_affiliation_strings":["Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"display_name":"WOLFGANG FABER","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":"WOLFGANG FABER","raw_affiliation_strings":["Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":null,"display_name":"NICOLA LEONE","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":"NICOLA LEONE","raw_affiliation_strings":["Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy (e-mail:","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":3.7563,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.93181226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"4-6","first_page":"497","last_page":"512"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9440000057220459,"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.9440000057220459,"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.026100000366568565,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/decidability","display_name":"Decidability","score":0.8086000084877014},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7900999784469604},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.578499972820282},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5479000210762024},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5058000087738037},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.4684000015258789},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4553999900817871},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.45210000872612},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.423799991607666}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8086000084877014},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7900999784469604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.777899980545044},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.578499972820282},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5479000210762024},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4674000144004822},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4553999900817871},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.45210000872612},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4406000077724457},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41940000653266907},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41839998960494995},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.3808000087738037},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C2780512708","wikidata":"https://www.wikidata.org/wiki/Q850661","display_name":"XQuery","level":4,"score":0.35929998755455017},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.33219999074935913},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C2777502361","wikidata":"https://www.wikidata.org/wiki/Q1182254","display_name":"Deductive database","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2782000005245209},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068410000244","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000244","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:1007.4028","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.4028","pdf_url":"https://arxiv.org/pdf/1007.4028","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:1007.4028","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.4028","pdf_url":"https://arxiv.org/pdf/1007.4028","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":14,"referenced_works":["https://openalex.org/W200731164","https://openalex.org/W1552168992","https://openalex.org/W1604839944","https://openalex.org/W1606891084","https://openalex.org/W1965483956","https://openalex.org/W1978108034","https://openalex.org/W1982644528","https://openalex.org/W2034019663","https://openalex.org/W2036241121","https://openalex.org/W2066734765","https://openalex.org/W2070546615","https://openalex.org/W2076698873","https://openalex.org/W2115282751","https://openalex.org/W6659180483"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Querying":[1],"over":[2],"disjunctive":[3,20],"ASP":[4,76,124,130],"with":[5,23],"functions":[6,27],"is":[7,44,49,67,87,107,114],"a":[8],"highly":[9],"undecidable":[10],"task":[11],"in":[12,41,135],"general.":[13],"In":[14],"this":[15,42],"paper":[16],"we":[17,101],"focus":[18],"on":[19],"logic":[21],"programs":[22,119],"stratified":[24],"negation":[25],"and":[26,97],"under":[28],"the":[29,47,71,83,91,104,127],"stable":[30],"model":[31],"semantics":[32],"(ASP":[33,52],"fs":[34,53,77,131],").":[35,55],"We":[36,80],"show":[37,81],"that":[38,82,103,112],"query":[39,48,64,88],"answering":[40],"setting":[43],"decidable,":[45],"if":[46],"finitely":[50,109,117],"recursive":[51],"fr":[54,78,132],"Our":[56],"proof":[57],"yields":[58],"also":[59,108],"an":[60],"effective":[61],"method":[62],"for":[63],"evaluation.":[65],"It":[66],"done":[68],"by":[69],"extending":[70],"magic":[72],"set":[73],"technique":[74],"to":[75,90],".":[79],"magic-set":[84],"rewritten":[85,105],"program":[86,106],"equivalent":[89],"original":[92],"one":[93],"(under":[94],"both":[95],"brave":[96],"cautious":[98],"reasoning).":[99],"Moreover,":[100],"prove":[102],"ground,":[110],"implying":[111],"it":[113],"decidable.":[115],"Importantly,":[116],"ground":[118],"are":[120],"evaluable":[121],"using":[122],"existing":[123],"solvers,":[125],"making":[126],"class":[128],"of":[129],"queries":[133],"usable":[134],"practice.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}