SPARK
发表于 2025-3-21 19:31:59
书目名称Graph-based Knowledge Representation影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0388046<br><br> <br><br>书目名称Graph-based Knowledge Representation读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0388046<br><br> <br><br>
旁观者
发表于 2025-3-21 20:39:21
Other Specialization/Generalization Operationsap. 2. In order to focus on the main ideas, the conceptual graphs considered here are BGs, and not SGs. Moreover, for operations involving compatibility notions (i.e., maximal join and extended join) we consider conjunctive concept types.
疲惫的老马
发表于 2025-3-22 02:26:49
http://reply.papertrans.cn/39/3881/388046/388046_3.png
平庸的人或物
发表于 2025-3-22 05:51:28
Introduction concepts of the KR domain, and then review KR formalism properties that we consider to be essential. The second section is devoted to an intuitive presentation of Conceptual Graphs that were initially introduced by Sowa in 1976 and developed in . In the third section, we introduce th
Sinus-Node
发表于 2025-3-22 08:46:29
http://reply.papertrans.cn/39/3881/388046/388046_5.png
GUILT
发表于 2025-3-22 13:19:58
Simple Conceptual Graphs enrich BGs with unrestricted coreference. The introduction of this chapter develops the discussion concerning equality started in the previous chapter and presents the . and . notions. A new definition of a vocabulary extending the previous one with conjunctive types is given in Sect. 3.2. Section
GUILT
发表于 2025-3-22 17:05:22
http://reply.papertrans.cn/39/3881/388046/388046_7.png
freight
发表于 2025-3-22 23:03:14
BG Homomorphism and Equivalent Notions In this chapter, it is shown that computing BG homomorphisms between two BGs is “strongly equivalent” to important combinatorial problems in graph theory, algebra, database theory, and constraint satisfaction networks. In Sect. 5.1, basic conceptual hypergraphs (BHs) are introduced, with a BH homom
Affectation
发表于 2025-3-23 02:53:27
Basic Algorithms for BG Homomorphism then improve it by consistency-maintaining techniques, essentially adapted from the constraint processing domain (Sect. 6.1). As this book is about conceptual graphs and not constraint networks, these techniques are applied directly on BGs. However, another section is entirely devoted to constraint
碎石头
发表于 2025-3-23 08:10:54
http://reply.papertrans.cn/39/3881/388046/388046_10.png