Abstract
Abstract Graph matching is recognized as a central problem across a variety of application areas, and application-specific matchers have been developed with different simplifying assumptions to reduce the computational complexity. Graph matching is viewed as a form of plausible reasoning when conceptual information contained in graphs are considered, and thus requires an underlying algorithm flexible and general enough to accommodate application-specific matching heuristics and schemes that determine the degree of plausibility. This paper presents such an algorithm, based on the notion of association graphs, developed for matching Sowa's conceptual graphs (CG). While the general subgraph isomorphism problem is known to be NP-complete, matching graphs containing conceptual information appears to be computationally tractable. Following the detailed description of the algorithm, some experimental results are shown to discuss the time complexity of the algorithm and its practicality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Experimental & Theoretical Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
