{"id":"https://openalex.org/W1904191265","doi":"https://doi.org/10.1109/ijcnn.2003.1223403","title":"How hierarchies of objects and constraints reduce complexity","display_name":"How hierarchies of objects and constraints reduce complexity","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W1904191265","doi":"https://doi.org/10.1109/ijcnn.2003.1223403","mag":"1904191265"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2003.1223403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2003.1223403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5042628433","display_name":"B.N. Iordanova","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"B.N. Iordanova","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5042628433"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.441,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57920547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"535","last_page":"540"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7746999859809875,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7746999859809875,"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.684499979019165,"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.7241593599319458},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6868538856506348},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.670947790145874},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.569251537322998},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.544962465763092},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42653223872184753},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1493368148803711},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1471509039402008}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7241593599319458},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6868538856506348},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.670947790145874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.569251537322998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.544962465763092},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42653223872184753},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1493368148803711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1471509039402008},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2003.1223403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2003.1223403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1969481231","https://openalex.org/W1993686142","https://openalex.org/W2016604754","https://openalex.org/W2043084471","https://openalex.org/W2091579301","https://openalex.org/W2142334564","https://openalex.org/W2518042154","https://openalex.org/W4205634987","https://openalex.org/W6605045596"],"related_works":["https://openalex.org/W2045183646","https://openalex.org/W2162409446","https://openalex.org/W2109463584","https://openalex.org/W2504075107","https://openalex.org/W2354058185","https://openalex.org/W3014500535","https://openalex.org/W2319812372","https://openalex.org/W1482096554","https://openalex.org/W2370176626","https://openalex.org/W2191732422"],"abstract_inverted_index":{"Hierarchies":[0],"help":[1],"learning":[2,30,45],"clearance-categories":[3,33],"of":[4,14,24,29,32,50,52],"flights":[5],"and":[6,16,34,46],"organise":[7],"these":[8],"knowledge":[9],"categories":[10],"in":[11,26,35,44,47,54],"hierarchical":[12,27],"structures":[13],"objects":[15,31],"constraints.":[17,37],"They":[18,38,58],"reduce":[19,59],"complexity":[20,40],"by":[21,41],"introducing":[22],"levels":[23],"decomposition":[25],"layers":[28],"satisfying":[36],"lower":[39],"stressing":[42],"parallelism":[43],"the":[48,60],"formation":[49],"concepts":[51],"clearances":[53],"response":[55],"to":[56],"requests.":[57],"search":[61],"problem":[62],"into":[63],"a":[64],"decision":[65],"problem.":[66]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}