{"id":"https://openalex.org/W2804436922","doi":"https://doi.org/10.1093/logcom/exy015","title":"Computing the maximal Boolean complexity of families of Aristotelian diagrams","display_name":"Computing the maximal Boolean complexity of families of Aristotelian diagrams","publication_year":2018,"publication_date":"2018-04-30","ids":{"openalex":"https://openalex.org/W2804436922","doi":"https://doi.org/10.1093/logcom/exy015","mag":"2804436922"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exy015","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exy015","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/622052","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051081904","display_name":"Lorenz Demey","orcid":"https://orcid.org/0000-0002-0176-1958"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Lorenz Demey","raw_affiliation_strings":["Centre for Logic and Philosophy of Science KU Leuven, Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"Centre for Logic and Philosophy of Science KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051081904"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":1.3031,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85007321,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"6","first_page":"1323","last_page":"1339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9962999820709229,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9962999820709229,"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.9957000017166138,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9883000254631042,"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/computer-science","display_name":"Computer science","score":0.5641474723815918},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5456836223602295},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5058350563049316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4875290095806122},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.4869269132614136},{"id":"https://openalex.org/keywords/logical-conjunction","display_name":"Logical conjunction","score":0.47064489126205444},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.4493817985057831},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4203667640686035},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4198001027107239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38670238852500916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36780741810798645},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19940432906150818},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.12943723797798157}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5641474723815918},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5456836223602295},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5058350563049316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4875290095806122},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.4869269132614136},{"id":"https://openalex.org/C21847791","wikidata":"https://www.wikidata.org/wiki/Q191081","display_name":"Logical conjunction","level":2,"score":0.47064489126205444},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.4493817985057831},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4203667640686035},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4198001027107239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38670238852500916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36780741810798645},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19940432906150818},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.12943723797798157},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exy015","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exy015","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/622052","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/622052","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of Logic and Computation, vol. 28 (6), (1323-1339)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/622052","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/622052","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of Logic and Computation, vol. 28 (6), (1323-1339)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W25412590","https://openalex.org/W59020575","https://openalex.org/W156379767","https://openalex.org/W343411360","https://openalex.org/W626850778","https://openalex.org/W844278897","https://openalex.org/W1162524868","https://openalex.org/W1523712082","https://openalex.org/W1533381840","https://openalex.org/W1559666492","https://openalex.org/W1588388544","https://openalex.org/W1617290740","https://openalex.org/W1966710300","https://openalex.org/W1988046476","https://openalex.org/W1991650963","https://openalex.org/W1999273320","https://openalex.org/W2000595177","https://openalex.org/W2001457416","https://openalex.org/W2002093268","https://openalex.org/W2006766484","https://openalex.org/W2006941876","https://openalex.org/W2049004042","https://openalex.org/W2052154979","https://openalex.org/W2063729524","https://openalex.org/W2066770300","https://openalex.org/W2086796727","https://openalex.org/W2179211458","https://openalex.org/W2179956734","https://openalex.org/W2216040752","https://openalex.org/W2219204552","https://openalex.org/W2222047630","https://openalex.org/W2253255956","https://openalex.org/W2264275978","https://openalex.org/W2288821240","https://openalex.org/W2294374137","https://openalex.org/W2294851585","https://openalex.org/W2312860061","https://openalex.org/W2335736099","https://openalex.org/W2341415563","https://openalex.org/W2476954248","https://openalex.org/W2481772677","https://openalex.org/W2531452992","https://openalex.org/W2581369044","https://openalex.org/W2592067820","https://openalex.org/W2593074971","https://openalex.org/W2600077159","https://openalex.org/W2614826371","https://openalex.org/W2760099783","https://openalex.org/W2784035625","https://openalex.org/W4232040330","https://openalex.org/W4233906803","https://openalex.org/W6666334676","https://openalex.org/W6696872555","https://openalex.org/W6964286790"],"related_works":["https://openalex.org/W171542336","https://openalex.org/W1887191277","https://openalex.org/W2084071226","https://openalex.org/W2059387708","https://openalex.org/W2149888493","https://openalex.org/W2004655422","https://openalex.org/W2781051637","https://openalex.org/W2160927071","https://openalex.org/W4294760786","https://openalex.org/W2337624355"],"abstract_inverted_index":{"Logical":[0],"geometry":[1],"provides":[2],"a":[3,31,50,72,84],"broad":[4],"framework":[5],"for":[6,87],"systematically":[7],"studying":[8],"the":[9,28,63,67,98,110],"logical":[10,35,46,51],"(and":[11],"other)":[12],"properties":[13],"of":[14,20,30,58,65,71,75,100,113,128],"Aristotelian":[15,54,76,129],"diagrams.":[16,130],"The":[17],"main":[18],"aim":[19],"this":[21,90,114],"paper":[22],"is":[23,57,94],"to":[24,34,108],"present":[25,81],"and":[26,78,82],"illustrate":[27,109],"foundations":[29],"computational":[32],"approach":[33],"geometry.":[36],"In":[37,106],"particular,":[38,104],"after":[39],"briefly":[40],"discussing":[41],"some":[42],"key":[43],"notions":[44],"from":[45],"geometry,":[47],"I":[48,79,116],"describe":[49],"problem":[52],"concerning":[53],"diagrams":[55],"that":[56],"considerable":[59],"theoretical":[60,111],"importance,":[61],"viz.":[62],"task":[64],"finding":[66],"maximal":[68],"Boolean":[69],"complexity":[70],"given":[73],"family":[74],"diagrams,":[77],"then":[80],"discuss":[83],"simple":[85],"algorithm":[86,93],"automatically":[88],"solving":[89],"task.":[91],"This":[92],"naturally":[95],"implemented":[96],"within":[97],"paradigm":[99],"logic":[101],"programming":[102],"(in":[103],"Prolog).":[105],"order":[107],"fruitfulness":[112],"algorithm,":[115],"also":[117],"show":[118],"how":[119],"it":[120],"sheds":[121],"new":[122],"light":[123],"on":[124],"several":[125],"well-known":[126],"families":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}