On generalization/specialization for conceptual graphs
From MaRDI portal
Publication:4846732
DOI10.1080/09528139508953815zbMath0844.68094OpenAlexW2092331514MaRDI QIDQ4846732
Publication date: 5 September 1996
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528139508953815
Related Items
Cites Work
- Pattern associativity and the retrieval of semantic networks
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- Backtrack search algorithms and the maximal common subgraph problem
- An Analysis of a Good Algorithm for the Subtree Problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
