Titlebook: ;

只看該作者 · 發(fā)表于 2025-3-21 19:31:59

書(shū)目名稱Graph-based Knowledge Representation影響因子(影響力)

書(shū)目名稱Graph-based Knowledge Representation影響因子(影響力)學(xué)科排名

書(shū)目名稱Graph-based Knowledge Representation網(wǎng)絡(luò)公開(kāi)度

書(shū)目名稱Graph-based Knowledge Representation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名

書(shū)目名稱Graph-based Knowledge Representation被引頻次

書(shū)目名稱Graph-based Knowledge Representation被引頻次學(xué)科排名

書(shū)目名稱Graph-based Knowledge Representation年度引用

書(shū)目名稱Graph-based Knowledge Representation年度引用學(xué)科排名

書(shū)目名稱Graph-based Knowledge Representation讀者反饋

書(shū)目名稱Graph-based Knowledge Representation讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-22 02:26:49

只看該作者 · 發(fā)表于 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 [Sow76] and developed in [Sow84]. In the third section, we introduce th

只看該作者 · 發(fā)表于 2025-3-22 08:46:29

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-22 17:05:22

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-23 08:10:54

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 19:17
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved