{"id":"https://openalex.org/W3187301058","doi":"https://doi.org/10.3390/a14080235","title":"Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data","display_name":"Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data","publication_year":2021,"publication_date":"2021-08-09","ids":{"openalex":"https://openalex.org/W3187301058","doi":"https://doi.org/10.3390/a14080235","mag":"3187301058"},"language":"en","primary_location":{"id":"doi:10.3390/a14080235","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080235","pdf_url":"https://www.mdpi.com/1999-4893/14/8/235/pdf?version=1628747358","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/8/235/pdf?version=1628747358","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090463247","display_name":"Giuseppe Lancia","orcid":"https://orcid.org/0000-0001-5323-8483"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giuseppe Lancia","raw_affiliation_strings":["Department of Mathematics, Computer Science and Physics, University of Udine, 33100 Udine, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Computer Science and Physics, University of Udine, 33100 Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031318559","display_name":"Paolo Serafini","orcid":"https://orcid.org/0000-0002-0094-6520"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Serafini","raw_affiliation_strings":["Department of Mathematics, Computer Science and Physics, University of Udine, 33100 Udine, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Computer Science and Physics, University of Udine, 33100 Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090463247"],"corresponding_institution_ids":["https://openalex.org/I129043915"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.8878,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77904776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"8","first_page":"235","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9919999837875366,"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/set","display_name":"Set (abstract data type)","score":0.7134312391281128},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5807993412017822},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5488851070404053},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5485877394676208},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5429480075836182},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5159902572631836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5004363059997559},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48923516273498535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4544657766819},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.41822439432144165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39729976654052734},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3714999556541443},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2871665954589844}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.7134312391281128},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5807993412017822},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5488851070404053},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5485877394676208},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5429480075836182},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5159902572631836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5004363059997559},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48923516273498535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4544657766819},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.41822439432144165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39729976654052734},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3714999556541443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2871665954589844},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a14080235","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080235","pdf_url":"https://www.mdpi.com/1999-4893/14/8/235/pdf?version=1628747358","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:air.uniud.it:11390/1213510","is_oa":true,"landing_page_url":"http://hdl.handle.net/11390/1213510","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"262"},{"id":"pmh:oai:doaj.org/article:ff35087114024129b93d15a8adf24b31","is_oa":true,"landing_page_url":"https://doaj.org/article/ff35087114024129b93d15a8adf24b31","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 8, p 235 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/8/235/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14080235","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 8; Pages: 235","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14080235","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080235","pdf_url":"https://www.mdpi.com/1999-4893/14/8/235/pdf?version=1628747358","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3187301058.pdf","grobid_xml":"https://content.openalex.org/works/W3187301058.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W82653910","https://openalex.org/W133015606","https://openalex.org/W876204075","https://openalex.org/W1993266708","https://openalex.org/W2009369868","https://openalex.org/W2081532498","https://openalex.org/W2100110464","https://openalex.org/W2109363337","https://openalex.org/W2116079122","https://openalex.org/W2153736474","https://openalex.org/W2187800576","https://openalex.org/W2406811695","https://openalex.org/W2768829501","https://openalex.org/W2770314314","https://openalex.org/W2963448547","https://openalex.org/W3023480501","https://openalex.org/W4249247926","https://openalex.org/W4255061073"],"related_works":["https://openalex.org/W2316583766","https://openalex.org/W2010452943","https://openalex.org/W2087771022","https://openalex.org/W2951823763","https://openalex.org/W2162868025","https://openalex.org/W2147437603","https://openalex.org/W2987889044","https://openalex.org/W2151029224","https://openalex.org/W3038064903","https://openalex.org/W3187301058"],"abstract_inverted_index":{"Logical":[0],"Analysis":[1],"of":[2,65,69,79,81,115,121,129,134,163,170,183,193,200],"Data":[3],"is":[4,23,202],"a":[5,48,66,118,151,160,190,197],"procedure":[6,153],"aimed":[7],"at":[8,212],"identifying":[9],"relevant":[10],"features":[11],"in":[12,54,89],"data":[13,49],"sets":[14,133],"with":[15,159],"both":[16],"positive":[17,44],"and":[18,93,123,210],"negative":[19],"samples.":[20,144,164],"The":[21],"goal":[22],"to":[24,39,62,102,196,205],"build":[25],"Boolean":[26],"formulas,":[27],"represented":[28],"by":[29],"strings":[30],"over":[31],"{0,1,-}":[32],"called":[33],"patterns,":[34],"which":[35],"can":[36,51],"be":[37,52,103],"used":[38],"classify":[40],"new":[41],"samples":[42,122],"as":[43],"or":[45],"negative.":[46],"Since":[47],"set":[50,68,114,120,162,192,199],"explained":[53],"alternative":[55],"ways,":[56],"many":[57],"computational":[58,77],"problems":[59,84],"arise":[60],"related":[61],"the":[63,76,112,127,142,168,181,206,213],"choice":[64],"particular":[67],"patterns.":[70],"In":[71],"this":[72],"paper":[73],"we":[74,94,178],"study":[75],"complexity":[78],"several":[80],"these":[82],"pattern":[83],"(showing":[85],"that":[86,100,154,180],"they":[87,139],"are,":[88],"general,":[90],"computationally":[91],"hard)":[92],"propose":[95],"some":[96],"integer":[97],"programming":[98],"models":[99,172],"appear":[101],"effective.":[104],"We":[105,145],"describe":[106],"an":[107,184],"ILP":[108,186],"model":[109,149,187],"for":[110,126,188],"finding":[111,189],"minimum-size":[113,191],"patterns":[116,135,157,194,201],"explaining":[117],"given":[119,161,198],"another":[124],"one":[125],"problem":[128,207],"determining":[130],"whether":[131],"two":[132],"are":[136],"equivalent,":[137],"i.e.,":[138],"explain":[140],"exactly":[141],"same":[143,214],"base":[146],"our":[147,171],"first":[148],"on":[150,173],"polynomial":[152],"computes":[155],"all":[156],"compatible":[158],"Computational":[165],"experiments":[166],"substantiate":[167],"effectiveness":[169],"fairly":[174],"large":[175],"instances.":[176],"Finally,":[177],"conjecture":[179],"existence":[182],"effective":[185],"equivalent":[195],"unlikely,":[203],"due":[204],"being":[208],"NP-hard":[209],"co-NP-hard":[211],"time.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-08-16T00:00:00"}