{"id":"https://openalex.org/W2026155585","doi":"https://doi.org/10.1080/09528139208953741","title":"Conceptual graph matching: a flexible algorithm and experiments","display_name":"Conceptual graph matching: a flexible algorithm and experiments","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W2026155585","doi":"https://doi.org/10.1080/09528139208953741","mag":"2026155585"},"language":"en","primary_location":{"id":"doi:10.1080/09528139208953741","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528139208953741","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","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/A5112346565","display_name":"Sung Hyon Myaeng","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SUNG H. MYAENG","raw_affiliation_strings":["School of Information Studies, Syracuse University , Syracuse, NY, 13244, USA E-mail: shmyaeng@mailbox.syr.edu"],"affiliations":[{"raw_affiliation_string":"School of Information Studies, Syracuse University , Syracuse, NY, 13244, USA E-mail: shmyaeng@mailbox.syr.edu","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091835429","display_name":"Aurelio L\u00f3pez\u2010L\u00f3pez","orcid":"https://orcid.org/0000-0001-8832-3880"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"AURELIO LOPEZ-LOPEZ","raw_affiliation_strings":["School of Computer Information Science, Syracuse University , Syracuse, NY, 13244, USA E-mail: lopez-lo@mailbox.syr.edu"],"affiliations":[{"raw_affiliation_string":"School of Computer Information Science, Syracuse University , Syracuse, NY, 13244, USA E-mail: lopez-lo@mailbox.syr.edu","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112346565"],"corresponding_institution_ids":["https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":3.7474,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.93152004,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"2","first_page":"107","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9977999925613403,"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.7765916585922241},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7239049077033997},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6409674882888794},{"id":"https://openalex.org/keywords/conceptual-graph","display_name":"Conceptual graph","score":0.599224328994751},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5916600823402405},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5608016848564148},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.514761209487915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49210113286972046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4341166317462921},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4180281162261963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3960287272930145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2609471082687378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17361938953399658},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10515353083610535}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7765916585922241},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7239049077033997},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6409674882888794},{"id":"https://openalex.org/C234837","wikidata":"https://www.wikidata.org/wiki/Q1420493","display_name":"Conceptual graph","level":3,"score":0.599224328994751},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5916600823402405},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5608016848564148},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.514761209487915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49210113286972046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4341166317462921},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4180281162261963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3960287272930145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2609471082687378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17361938953399658},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10515353083610535},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C161301231","wikidata":"https://www.wikidata.org/wiki/Q3478658","display_name":"Knowledge representation and reasoning","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09528139208953741","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528139208953741","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1493596129","https://openalex.org/W1499764936","https://openalex.org/W1579248359","https://openalex.org/W1588879371","https://openalex.org/W1595973755","https://openalex.org/W2073826624","https://openalex.org/W2106588364","https://openalex.org/W2740373864","https://openalex.org/W2792633684","https://openalex.org/W3020898714"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W2954463587","https://openalex.org/W2018568077","https://openalex.org/W2393701947","https://openalex.org/W2915540008","https://openalex.org/W1887488684","https://openalex.org/W1965191464","https://openalex.org/W167435155","https://openalex.org/W2128390795"],"abstract_inverted_index":{"Abstract":[0],"Graph":[1,30],"matching":[2,31,61,86,102],"is":[3,32,97],"recognized":[4],"as":[5,34],"a":[6,10,35],"central":[7],"problem":[8,96],"across":[9],"variety":[11],"of":[12,37,69,81,116,129],"application":[13],"areas,":[14],"and":[15,48,55,63,132],"application-specific":[16,60],"matchers":[17],"have":[18],"been":[19],"developed":[20,84],"with":[21],"different":[22],"simplifying":[23],"assumptions":[24],"to":[25,58,99,108,124],"reduce":[26],"the":[27,67,79,92,113,117,126,130],"computational":[28],"complexity.":[29],"viewed":[33],"form":[36],"plausible":[38],"reasoning":[39],"when":[40],"conceptual":[41,88,105],"information":[42,106],"contained":[43],"in":[44],"graphs":[45,89,103],"are":[46,122],"considered,":[47],"thus":[49],"requires":[50],"an":[51,75],"underlying":[52],"algorithm":[53,131],"flexible":[54],"general":[56,93],"enough":[57],"accommodate":[59],"heuristics":[62],"schemes":[64],"that":[65],"determine":[66],"degree":[68],"plausibility.":[70],"This":[71],"paper":[72],"presents":[73],"such":[74],"algorithm,":[76,118],"based":[77],"on":[78],"notion":[80],"association":[82],"graphs,":[83],"for":[85],"Sowa's":[87],"(CG).":[90],"While":[91],"subgraph":[94],"isomorphism":[95],"known":[98],"be":[100,109],"NP-complete,":[101],"containing":[104],"appears":[107],"computationally":[110],"tractable.":[111],"Following":[112],"detailed":[114],"description":[115],"some":[119],"experimental":[120],"results":[121],"shown":[123],"discuss":[125],"time":[127],"complexity":[128],"its":[133],"practicality.":[134]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}