|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 3 van 8 gevonden artikelen
| Titel: |
Conceptual graph matching: a flexible algorithm and experiments |
| Auteur: |
Myaeng, Sung H. Lopez-Lopez, Aurelio |
| Verschenen in: |
Journal of experimental & theoretical artificial intelligence |
| Paginering: | Jaargang 4 (1992) nr. 2 pagina's 107-126 |
| Jaar: |
1992-04-01 |
| Inhoud: |
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. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 3 van 8 gevonden artikelen
| << vorige | volgende >> |