On generalization/specialization for conceptual graphs
From MaRDI portal
Recommendations
- Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms
- Conceptual Graphs and First Order Logic
- scientific article; zbMATH DE number 1322795
- Conceptual structures: applications, implementation and theory. 3rd International Conference on Conceptual Structures, ICCS '95, Santa Cruz, CA, USA, August 14-18, 1995. Proceedings
- scientific article; zbMATH DE number 1946846
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Analysis of a Good Algorithm for the Subtree Problem
- Backtrack search algorithms and the maximal common subgraph problem
- scientific article; zbMATH DE number 3852463 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- Pattern associativity and the retrieval of semantic networks
Cited in
(8)- Conceptual structures: applications, implementation and theory. 3rd International Conference on Conceptual Structures, ICCS '95, Santa Cruz, CA, USA, August 14-18, 1995. Proceedings
- scientific article; zbMATH DE number 1670920 (Why is no real title available?)
- UTILIZING LOCAL CONTEXT FOR EFFECTIVE INFORMATION RETRIEVAL
- Arc Consistency Projection: A New Generalization Relation for Graphs
- scientific article; zbMATH DE number 1946846 (Why is no real title available?)
- scientific article; zbMATH DE number 219208 (Why is no real title available?)
- Formal Concept Analysis
- Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms
This page was built for publication: On generalization/specialization for conceptual graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846732)
