Titlebook: ;

SPARK

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




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




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




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




書目名稱Graph-based Knowledge Representation被引頻次




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




書目名稱Graph-based Knowledge Representation年度引用




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




書目名稱Graph-based Knowledge Representation讀者反饋




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

旁觀者

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.

疲憊的老馬

平庸的人或物

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

Sinus-Node

GUILT

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

freight

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

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

碎石頭