標(biāo)題: Titlebook: Conceptual Structures for Knowledge Creation and Communication; 11th International C Bernhard Ganter,Aldo Moor,Wilfried Lex Conference proc [打印本頁] 作者: 可入到 時間: 2025-3-21 19:45
書目名稱Conceptual Structures for Knowledge Creation and Communication影響因子(影響力)
書目名稱Conceptual Structures for Knowledge Creation and Communication影響因子(影響力)學(xué)科排名
書目名稱Conceptual Structures for Knowledge Creation and Communication網(wǎng)絡(luò)公開度
書目名稱Conceptual Structures for Knowledge Creation and Communication網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Conceptual Structures for Knowledge Creation and Communication被引頻次
書目名稱Conceptual Structures for Knowledge Creation and Communication被引頻次學(xué)科排名
書目名稱Conceptual Structures for Knowledge Creation and Communication年度引用
書目名稱Conceptual Structures for Knowledge Creation and Communication年度引用學(xué)科排名
書目名稱Conceptual Structures for Knowledge Creation and Communication讀者反饋
書目名稱Conceptual Structures for Knowledge Creation and Communication讀者反饋學(xué)科排名
作者: 欺騙世家 時間: 2025-3-21 23:11 作者: VEST 時間: 2025-3-22 03:44
Correction and Extension of WordNet 1.7aring and retrieval within a knowledge base or on the Web, i.e. to support "knowledge creation and communication". The corrections and extensions are documented at http://www.webkb.org/doc/wn/ and the ontology is downloadable in various formats. Web users can also search and extend the ontology via the WebKB-2 knowledge server.作者: 消毒 時間: 2025-3-22 07:33
Representing Temporal Ontology in Conceptual Graphson formalism of Conceptual Graphs. The approach identifies the associated temporal concepts and relations, and analyses the behaviour of the atomic components, such as individual identifiers, type and relational labels. The definitions and illustrative examples use the notation of Peirce logic.作者: Conjuction 時間: 2025-3-22 11:33
Concept Graphs with Subdivision: A Semantic Approachsubdivision is to represent modal information mathematically. Based on the notion of the . of a concept graph with subdivision, we can show that the concept graphs with subdivision of a triadic power context family form a complete lattice with respect to the .. Finally, our approach is extended to ..作者: 貪婪性 時間: 2025-3-22 16:47 作者: 貪婪性 時間: 2025-3-22 21:08
Tawanda Makuyana,Engelina du PlessisThe purpose of this paper is to clarify in the framework of Temporal Concept Analysis the distinction between the notion of the dimension of time and the one-dimensionality of life tracks of simple objects. The reader is led to the central problems by many examples.作者: transient-pain 時間: 2025-3-22 23:43 作者: CORD 時間: 2025-3-23 02:25
https://doi.org/10.1007/b11835Fuzzy; cognition; cognitive science; cognitive technologies; communication; computational linguistics; des作者: CAND 時間: 2025-3-23 08:12
978-3-540-40576-4Springer-Verlag Berlin Heidelberg 2003作者: 輕觸 時間: 2025-3-23 12:52
Mohammad Taufique,Vajahat Khursheedpresent information formally based on a power context family and rhetorically structured by relational graphs. The . of a concept graph is viewed as the information directly represented by the graph together with the information deducible from the direct information by object and concept implication作者: Carcinoma 時間: 2025-3-23 14:10
Towards Sustainable Natural Resourcesed method of using analogies. Before any subject can be formalized to the stage where logic can be applied to it, analogies must be used to derive an abstract representation from a mass of irrelevant detail. After the formalization is complete, every logical step – of deduction, induction, or abduct作者: 晚來的提名 時間: 2025-3-23 21:58
https://doi.org/10.1007/978-3-031-06443-2gically located in his Classification of the Sciences between . and . Barely enough evidence is available from his archived manuscripts to indicate how he might have developed that part of his philosophy in the three disciplines of esthetics, ethics, and logic-as-semiotic (I will use his preferred s作者: Exclaim 時間: 2025-3-24 02:12 作者: 脾氣暴躁的人 時間: 2025-3-24 02:24 作者: CANON 時間: 2025-3-24 06:35 作者: evasive 時間: 2025-3-24 14:23 作者: SKIFF 時間: 2025-3-24 17:45 作者: Vulnerable 時間: 2025-3-24 21:04
Lang Xia,Wang Cailian,Victor Squires process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies o作者: RADE 時間: 2025-3-24 23:27 作者: 母豬 時間: 2025-3-25 04:47 作者: 使厭惡 時間: 2025-3-25 10:26 作者: 誘騙 時間: 2025-3-25 12:43 作者: defile 時間: 2025-3-25 17:50 作者: 茁壯成長 時間: 2025-3-25 20:03 作者: carbohydrate 時間: 2025-3-26 01:01
Fumihiko Kimura,Kenichiro Horiohave on the graphs the usual semantical entailment relation ?, and we consider the restriction ? of the calculus for concept graph with cuts, which has been introduced in [Da02], to the system of concept graphs without cuts. Secondly, we introduce a semantical entailment relation ? as well as syntac作者: MAZE 時間: 2025-3-26 04:37
R. Malcolm,S. Clarke,S. Hatton,R. Mayd systems consisting of concept graphs. The aim is to construct for every distributed system a channel consisting of a concept graph representing the distributed system and a set concept graph morphisms representing the relation between the parts of the system and the whole system. To reach this aim作者: 調(diào)整 時間: 2025-3-26 12:20
Independent Verification Magic or Myth?,subdivision is to represent modal information mathematically. Based on the notion of the . of a concept graph with subdivision, we can show that the concept graphs with subdivision of a triadic power context family form a complete lattice with respect to the .. Finally, our approach is extended to .作者: STELL 時間: 2025-3-26 15:14 作者: 審問 時間: 2025-3-26 16:52 作者: vertebrate 時間: 2025-3-26 21:58 作者: 領(lǐng)導(dǎo)權(quán) 時間: 2025-3-27 02:11
Mahmoud Sarhan,Yasmine M. Elmahdyaring and retrieval within a knowledge base or on the Web, i.e. to support "knowledge creation and communication". The corrections and extensions are documented at http://www.webkb.org/doc/wn/ and the ontology is downloadable in various formats. Web users can also search and extend the ontology via the WebKB-2 knowledge server.作者: 泥瓦匠 時間: 2025-3-27 06:03
Tawanda Makuyana,Engelina du Plessison formalism of Conceptual Graphs. The approach identifies the associated temporal concepts and relations, and analyses the behaviour of the atomic components, such as individual identifiers, type and relational labels. The definitions and illustrative examples use the notation of Peirce logic.作者: dominant 時間: 2025-3-27 10:19
Independent Verification Magic or Myth?,subdivision is to represent modal information mathematically. Based on the notion of the . of a concept graph with subdivision, we can show that the concept graphs with subdivision of a triadic power context family form a complete lattice with respect to the .. Finally, our approach is extended to ..作者: 母豬 時間: 2025-3-27 16:42 作者: offense 時間: 2025-3-27 19:56 作者: 財政 時間: 2025-3-28 01:21 作者: Ascendancy 時間: 2025-3-28 06:04
Tawanda Makuyana,Engelina du Plessisor comprehension of texts involving temporal descriptions. We analyze the temporal structure of two short narratives and represent the structure using branching time models and Conceptual Graphs. We argue that the suggested CG representation is in fact more in accordance with Prior’s approach to time than Prior’s own idea of branching time.作者: 失望昨天 時間: 2025-3-28 09:30
https://doi.org/10.1007/978-3-031-06443-2sophy treats some neglected issues in modern philosophy (nominalism, intuition, automation) which limit the advancement of conceptual structures research, and suggest that his normative science will be required for effective knowledge creation and communication.作者: Measured 時間: 2025-3-28 12:54
https://doi.org/10.1007/978-0-387-85691-9y defining a comparison operation characterised by two matching degrees: the possibility degree of matching and the necessity degree of matching between two graphs, and particularly between a query graph and a factual graph.作者: STANT 時間: 2025-3-28 14:51 作者: 公司 時間: 2025-3-28 22:23
Fumihiko Kimura,Kenichiro Horiodels and vice versa. Together with the relations ? and ? on the graphs and on the models, we show that both calculi are adequate and that reasoning can be carried over from graphs to models and vice versa.作者: tariff 時間: 2025-3-29 02:27 作者: Patrimony 時間: 2025-3-29 03:05 作者: 試驗(yàn) 時間: 2025-3-29 08:31
Modeling and Representing Structures for Analyzing Spatial Organization in Agronomylso concept classification and spatial reasoning. Finally, we describe the manipulation of spatial organization graphs using case-based reasoning, and we discuss the overall approach before concluding.作者: CORD 時間: 2025-3-29 12:50
Concept Graphs without Negations: Standard Models and Standard Graphsdels and vice versa. Together with the relations ? and ? on the graphs and on the models, we show that both calculi are adequate and that reasoning can be carried over from graphs to models and vice versa.作者: HUMID 時間: 2025-3-29 19:18
Conceptual Contents as Information – Basics for Contextual Judgment Logics coded in the power context family. The main result of this paper is that the conceptual contents can be derived as extents of the so-called . of the corresponding power context family. In short, the conceptual contents of judgments are formally derivable as concept extents.作者: Enteropathic 時間: 2025-3-29 20:06 作者: indifferent 時間: 2025-3-30 03:14
Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorevelopped for Constraint Satisfaction Problems. In order to benefit from the optimization work done in this community, we have chosen to present an alternate version of SGs, differences being the definition of these graphs as hypergraphs and the use of conjunctive types.作者: 執(zhí)拗 時間: 2025-3-30 06:12 作者: interior 時間: 2025-3-30 11:04 作者: 廣口瓶 時間: 2025-3-30 15:15
Computing the Least Common Subsumer in the Description Logic , w.r.t. Terminological Cycles with Desumer, they can also be used to approximate the lcs even if it does not exist. In addition, we give a sufficient condition for the lcs to exist, and show that, under this condition, it can be computed in polynomial time.作者: SPALL 時間: 2025-3-30 20:21 作者: 極為憤怒 時間: 2025-3-30 20:41
Hypotheses and Version Spacesscussed. We give an algorithm how to generate a version space for which the classifiers are closed under conjunction..As an application we discuss an example from predicitive toxicology. The classifiers here are chemical compounds and their substructures. The example also indicates how the methodology can be applied to Conceptual Graphs.作者: negligence 時間: 2025-3-31 04:05 作者: 救護(hù)車 時間: 2025-3-31 07:20 作者: 確定方向 時間: 2025-3-31 09:25
Mohammad Taufique,Vajahat Khursheeds coded in the power context family. The main result of this paper is that the conceptual contents can be derived as extents of the so-called . of the corresponding power context family. In short, the conceptual contents of judgments are formally derivable as concept extents.作者: Eviction 時間: 2025-3-31 17:02
Victor Squires,Zhang Degang,Hua Liminalence relation is introduced. The purpose of this relation is to enable formalization of intensional equivalence of concepts. The intensional semantics is defined by a novel algebraic semantics which basically is an algebraic generalization of the well-known extensional semantics.作者: TAG 時間: 2025-3-31 20:43
Charlotte Bellmann,Olav Clemensevelopped for Constraint Satisfaction Problems. In order to benefit from the optimization work done in this community, we have chosen to present an alternate version of SGs, differences being the definition of these graphs as hypergraphs and the use of conjunctive types.作者: SOB 時間: 2025-3-31 22:32
