{"id":"https://openalex.org/W2198541531","doi":"https://doi.org/10.1017/s1471068415000320","title":"Taming primary key violations to query large inconsistent data via ASP","display_name":"Taming primary key violations to query large inconsistent data via ASP","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2198541531","doi":"https://doi.org/10.1017/s1471068415000320","mag":"2198541531"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000320","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000320","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":["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/A5072659963","display_name":"Marco Manna","orcid":"https://orcid.org/0000-0003-3323-9328"},"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":"MARCO MANNA","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","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":["Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084620092","display_name":"Giorgio Terracina","orcid":"https://orcid.org/0000-0002-3090-7223"},"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":"GIORGIO TERRACINA","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Calabria, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072659963"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":9.7862,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.98013245,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"15","issue":"4-5","first_page":"696","last_page":"710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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.9872999787330627,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9848999977111816,"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.8562073707580566},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6627872586250305},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6395628452301025},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6365192532539368},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5886515378952026},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.522132933139801},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4359327256679535},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.43516698479652405},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.42053964734077454},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.41383013129234314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3801839351654053},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.36761853098869324},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3547287881374359},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.256158709526062},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.22935092449188232},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.225018709897995},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.20126354694366455},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.14764747023582458}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8562073707580566},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6627872586250305},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6395628452301025},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6365192532539368},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5886515378952026},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.522132933139801},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4359327256679535},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.43516698479652405},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.42053964734077454},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.41383013129234314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3801839351654053},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.36761853098869324},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3547287881374359},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.256158709526062},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.22935092449188232},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.225018709897995},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.20126354694366455},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.14764747023582458},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068415000320","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000320","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W561957468","https://openalex.org/W1558832481","https://openalex.org/W1606891084","https://openalex.org/W1985239372","https://openalex.org/W1993398079","https://openalex.org/W1994353670","https://openalex.org/W2011958646","https://openalex.org/W2062180302","https://openalex.org/W2076698873","https://openalex.org/W2077518845","https://openalex.org/W2091138122","https://openalex.org/W2098764906","https://openalex.org/W2108658789","https://openalex.org/W2108991785","https://openalex.org/W2110993096","https://openalex.org/W2126697916","https://openalex.org/W2154093507","https://openalex.org/W2163600218","https://openalex.org/W2178708778","https://openalex.org/W2610740441","https://openalex.org/W2914880889","https://openalex.org/W3104588709","https://openalex.org/W3146259567","https://openalex.org/W4205204813","https://openalex.org/W4206031975","https://openalex.org/W6648898532","https://openalex.org/W6653586194","https://openalex.org/W6678761077","https://openalex.org/W6685822861","https://openalex.org/W6712368405","https://openalex.org/W6771676130","https://openalex.org/W6785946784"],"related_works":["https://openalex.org/W1483388050","https://openalex.org/W2137382312","https://openalex.org/W2004485491","https://openalex.org/W4298325446","https://openalex.org/W1492449180","https://openalex.org/W2964058024","https://openalex.org/W2156776134","https://openalex.org/W1558141798","https://openalex.org/W1939132863","https://openalex.org/W2063039776"],"abstract_inverted_index":{"Abstract":[0],"Consistent":[1],"query":[2,67],"answering":[3],"over":[4,68],"a":[5,13,46,65,69,77],"database":[6,18,70,111],"that":[7,20,52,86],"violates":[8],"primary":[9,73],"key":[10,74],"constraints":[11,75],"is":[12,35,94],"classical":[14],"hard":[15],"problem":[16,58],"in":[17,54],"research":[19],"has":[21],"been":[22],"traditionally":[23],"dealt":[24],"with":[25],"logic":[26],"programming.":[27],"However,":[28],"the":[29,57,61,83,110,114],"applicability":[30],"of":[31,40,59,79,82,118],"existing":[32],"logic-based":[33],"solutions":[34],"restricted":[36],"to":[37,64,72,76],"data":[38,125],"sets":[39],"moderate":[41],"size.":[42],"This":[43],"paper":[44],"presents":[45],"novel":[47],"decomposition":[48],"and":[49,97,116],"pruning":[50],"strategy":[51,93],"reduces,":[53],"polynomial":[55],"time,":[56],"computing":[60],"consistent":[62],"answer":[63],"conjunctive":[66],"subject":[71],"collection":[78],"smaller":[80],"problems":[81],"same":[84],"sort":[85],"can":[87],"be":[88],"solved":[89],"independently.":[90],"The":[91],"new":[92],"naturally":[95],"modeled":[96],"implemented":[98],"using":[99],"Answer":[100],"Set":[101],"Programming":[102],"(ASP).":[103],"An":[104],"experiment":[105],"run":[106],"on":[107,123],"benchmarks":[108],"from":[109],"world":[112],"prove":[113],"effectiveness":[115],"efficiency":[117],"our":[119],"ASP-based":[120],"approach":[121],"also":[122],"large":[124],"sets.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}