作者: 旁觀者 時(shí)間: 2025-3-21 20:39
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.作者: 疲憊的老馬 時(shí)間: 2025-3-22 02:26 作者: 平庸的人或物 時(shí)間: 2025-3-22 05:51
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 時(shí)間: 2025-3-22 08:46 作者: GUILT 時(shí)間: 2025-3-22 13:19
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 時(shí)間: 2025-3-22 17:05 作者: freight 時(shí)間: 2025-3-22 23:03
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 時(shí)間: 2025-3-23 02:53
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作者: 碎石頭 時(shí)間: 2025-3-23 08:10 作者: 自愛(ài) 時(shí)間: 2025-3-23 10:11
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.作者: 聲音刺耳 時(shí)間: 2025-3-23 16:13 作者: breadth 時(shí)間: 2025-3-23 20:21
Rules . is present then . can be added,” where . and . are two graphs with a correspondence between some of their concept nodes. . is called the hypothesis of the rule, and . its conclusion. A rule frequently represents implicit or general knowledge, which can be applied to particular entities, thus maki作者: AV-node 時(shí)間: 2025-3-24 00:24 作者: Junction 時(shí)間: 2025-3-24 03:13
Conceptual Graphs with Negation for more complex constructs, corresponding to more expressive conceptual graphs, for instance rules (cf. Chap. 10). In this chapter, we consider the addition of negation to basic graphs..FCGs extend BGs with negation, but in a way that does not suit the approach to knowledge representation develope作者: 相反放置 時(shí)間: 2025-3-24 08:13
An Application of Nested Typed Graphs: Semantic Annotation Basesed graphs. In the first section, semantic annotations are defined as a kind of metadata. Two applications, information retrieval and editing, are also briefly described, and the annotation-based resource retrieval (.) problem is stated. The main components of an . system are also presented. In the s作者: Eeg332 時(shí)間: 2025-3-24 11:01
https://doi.org/10.1007/978-4-431-53965-0 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作者: ALIBI 時(shí)間: 2025-3-24 18:40 作者: miscreant 時(shí)間: 2025-3-24 21:58
https://doi.org/10.1007/978-3-319-41093-7 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 作者: legislate 時(shí)間: 2025-3-25 00:12 作者: 允許 時(shí)間: 2025-3-25 07:02 作者: GRAVE 時(shí)間: 2025-3-25 08:29 作者: CLAM 時(shí)間: 2025-3-25 15:41 作者: 沙草紙 時(shí)間: 2025-3-25 15:59 作者: 極為憤怒 時(shí)間: 2025-3-25 20:32
https://doi.org/10.1007/978-1-4684-1740-1as internal and external information, zooming, partial description of an entity, or specific contexts. This model also allows reasoning while taking a tree hierarchical structuring of knowledge into account. Nestings are represented by boxes. A box is an SG and, more generally, a box is a typed SG. 作者: 颶風(fēng) 時(shí)間: 2025-3-26 02:54
Masahide Terazima,Mikio Kataoka,Yuko Okamoto . is present then . can be added,” where . and . are two graphs with a correspondence between some of their concept nodes. . is called the hypothesis of the rule, and . its conclusion. A rule frequently represents implicit or general knowledge, which can be applied to particular entities, thus maki作者: Inordinate 時(shí)間: 2025-3-26 04:54 作者: Ordnance 時(shí)間: 2025-3-26 09:18 作者: impale 時(shí)間: 2025-3-26 15:36 作者: 斑駁 時(shí)間: 2025-3-26 16:51 作者: 庇護(hù) 時(shí)間: 2025-3-26 23:30 作者: Water-Brash 時(shí)間: 2025-3-27 03:02
https://doi.org/10.1007/978-4-431-53965-0e graph-based KR formalism that is detailed in the book. This KR formalism is based on a graph theoretical vision of conceptual graphs and complies with the main principles delineated in the first section.作者: Innocence 時(shí)間: 2025-3-27 07:24 作者: capsule 時(shí)間: 2025-3-27 12:02
Introductione graph-based KR formalism that is detailed in the book. This KR formalism is based on a graph theoretical vision of conceptual graphs and complies with the main principles delineated in the first section.作者: SUE 時(shí)間: 2025-3-27 14:56 作者: dendrites 時(shí)間: 2025-3-27 20:47 作者: 我悲傷 時(shí)間: 2025-3-27 22:16 作者: botany 時(shí)間: 2025-3-28 04:53 作者: Chromatic 時(shí)間: 2025-3-28 08:48
Conceptual Graphs with Negationxtensions that keep their intuitive graphical appeal, as nested graphs, rules and constraints. One advantage of these extensions is to help to distinguish between different kinds of knowledge—a key issue in knowledge-based systems building. Note however that these extensions only provide an implicit and very specific form of negation.作者: Affable 時(shí)間: 2025-3-28 10:34 作者: 修飾 時(shí)間: 2025-3-28 15:33 作者: Allege 時(shí)間: 2025-3-28 19:41
Formal Semantics of SGs. This first section ends by the fundamental theorem stating that if there is a homomorphism from . to . then . entails . and if . entails . then there is a homomorphism from . to . (i.e., a soundness and completeness theorem of SG homomorphism with respect to entailment)..FOL is used to give a sema作者: 螢火蟲(chóng) 時(shí)間: 2025-3-29 02:21 作者: Palpitation 時(shí)間: 2025-3-29 05:25
Tractable Casesrithms compute a filter that allows to enumerate the solutions. We point out the equivalence between hypergraph-acyclic BGs and . BGs, which correspond to the guarded fragment of existential conjunctive positive first-order logic. We then briefly present generalizations of acyclicity to . and ., and作者: Devastate 時(shí)間: 2025-3-29 10:55
Nested Conceptual Graphseasonings must follow the hierarchical structure, because in an NTG the hierarchy is explicitly and graphically represented. Nested graphs can also be interesting whenever large graphs have to be manually constructed, as the separation of levels of reasoning increases efficiency and clarity when ext作者: 真繁榮 時(shí)間: 2025-3-29 13:03 作者: hangdog 時(shí)間: 2025-3-29 17:06
https://doi.org/10.1007/978-3-658-10267-8 Finally, the subsumption relation restricted to irredundant BGs is not only an order but also a lattice. Section 2.4 introduces another way of defining the subsumption relation by sets of elementary graph operations. There is a set of . operations and the inverse set of . operations. Given two BGs 作者: GROUP 時(shí)間: 2025-3-29 22:56
https://doi.org/10.1007/978-3-319-41093-7s coreference relation is the identity relation, i.e., each node is solely coreferent with itself. A normal SG can be associated with any SG. In fact, normal SGs and normal BGs can be identified, which emphasizes the importance of normal BGs. The notion of ., which is specific to SGs, is introduced 作者: 靈敏 時(shí)間: 2025-3-30 01:31
https://doi.org/10.1007/978-3-030-63896-2. This first section ends by the fundamental theorem stating that if there is a homomorphism from . to . then . entails . and if . entails . then there is a homomorphism from . to . (i.e., a soundness and completeness theorem of SG homomorphism with respect to entailment)..FOL is used to give a sema作者: BANAL 時(shí)間: 2025-3-30 04:49 作者: Estrogen 時(shí)間: 2025-3-30 09:28
Molecular Reviews in Cardiovascular Medicinerithms compute a filter that allows to enumerate the solutions. We point out the equivalence between hypergraph-acyclic BGs and . BGs, which correspond to the guarded fragment of existential conjunctive positive first-order logic. We then briefly present generalizations of acyclicity to . and ., and作者: avulsion 時(shí)間: 2025-3-30 12:31
