標(biāo)題: Titlebook: Conceptual Structures: Knowledge Representations as Interlingua; 4th International Co Peter W. Eklund,Gerard Ellis,Graham Mann Conference p [打印本頁] 作者: 母牛膽小鬼 時間: 2025-3-21 18:00
書目名稱Conceptual Structures: Knowledge Representations as Interlingua影響因子(影響力)
書目名稱Conceptual Structures: Knowledge Representations as Interlingua影響因子(影響力)學(xué)科排名
書目名稱Conceptual Structures: Knowledge Representations as Interlingua網(wǎng)絡(luò)公開度
書目名稱Conceptual Structures: Knowledge Representations as Interlingua網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Conceptual Structures: Knowledge Representations as Interlingua被引頻次
書目名稱Conceptual Structures: Knowledge Representations as Interlingua被引頻次學(xué)科排名
書目名稱Conceptual Structures: Knowledge Representations as Interlingua年度引用
書目名稱Conceptual Structures: Knowledge Representations as Interlingua年度引用學(xué)科排名
書目名稱Conceptual Structures: Knowledge Representations as Interlingua讀者反饋
書目名稱Conceptual Structures: Knowledge Representations as Interlingua讀者反饋學(xué)科排名
作者: 赤字 時間: 2025-3-21 23:14 作者: FLOAT 時間: 2025-3-22 02:28 作者: SUE 時間: 2025-3-22 08:25
Propagating truth and detecting contradiction in conceptual graph databases,er phases, leads to provably complete and more efficient algorithms than we described last year. An example is carried through the explanation of these new features to illustrate each. And, after the updated algorithm is presented, an efficient lattice based superresolution theorem proof procedure i作者: Infantry 時間: 2025-3-22 11:39 作者: 猜忌 時間: 2025-3-22 14:27 作者: 猜忌 時間: 2025-3-22 20:25 作者: 開頭 時間: 2025-3-23 00:21 作者: Nomogram 時間: 2025-3-23 02:16 作者: Synthesize 時間: 2025-3-23 07:04 作者: 破裂 時間: 2025-3-23 13:41
Khansa Dhaouadi,Pierre Leclercq which have been used for encoding. As such, the algorithms developed for these implementations are directly applicable to sparse terms. We also argue that simple encoding algorithms (e.g. transitive closure and compact) implemented with sparse terms provide the efficiency and flexibility required f作者: Culmination 時間: 2025-3-23 14:27
Processes and participants, resulting classification provides an ontology of concept and relation types that can be used for representing both the semantics of verbs and the axioms for reasoning about the corresponding processes.作者: 不要不誠實(shí) 時間: 2025-3-23 18:10
Conceptual structures of multicontexts,per is to offer a first study of multicontexts and their conceptual structures; in particular, descriptions of conceptual coherences within the formalized network of contexts are presented. The theoretical considerations are illustrated by examples.作者: 高腳酒杯 時間: 2025-3-23 23:14
DB-MAT: Knowledge acquisition, processing and NL generation using conceptual graphs, they provide formal structures and operations suitable for representing and processing of terminological knowledge. We employ the CG operations to extract relevant knowledge with a flexible granularity. The paper describes all system components from a CG perspective and their interaction hidden under the user-friendly interface.作者: 陪審團(tuán)每個人 時間: 2025-3-24 05:12
Conference proceedings 1996erence from a respectable number of submissions. The issues addressed are natural language processing, information retrieval, graph operations, conceptual graph and Peirce theory, knowledge acquisition, theorem proving and CG programming, and order-based organisation and encoding.作者: 場所 時間: 2025-3-24 08:37
0302-9743 ns, conceptual graph and Peirce theory, knowledge acquisition, theorem proving and CG programming, and order-based organisation and encoding.978-3-540-61534-7978-3-540-68730-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 有幫助 時間: 2025-3-24 13:48 作者: AROMA 時間: 2025-3-24 17:47
Reunification and Consolidation (1990–2004) resulting classification provides an ontology of concept and relation types that can be used for representing both the semantics of verbs and the axioms for reasoning about the corresponding processes.作者: 一回合 時間: 2025-3-24 21:23 作者: 慎重 時間: 2025-3-25 00:46
https://doi.org/10.1007/978-3-030-67130-3 they provide formal structures and operations suitable for representing and processing of terminological knowledge. We employ the CG operations to extract relevant knowledge with a flexible granularity. The paper describes all system components from a CG perspective and their interaction hidden under the user-friendly interface.作者: ARM 時間: 2025-3-25 07:14
The Significance of Interannual Variability,ly the ‘Formal Concept Analysis’ of Wille‘s school to the means of immediate participation. Together these yield a principled poset of role types. We first discuss two foundational questions: How does an “event” differ from an “object”? — and: How is a relation related to its relata?作者: 和音 時間: 2025-3-25 08:40 作者: 去掉 時間: 2025-3-25 12:52 作者: Brain-Imaging 時間: 2025-3-25 15:57 作者: ONYM 時間: 2025-3-25 22:58
Conference proceedings 1996 in August 1996..The book presents five full papers by the invited speakers together with 15 revised full papers selected for presentation at the conference from a respectable number of submissions. The issues addressed are natural language processing, information retrieval, graph operations, concep作者: 立即 時間: 2025-3-26 04:07
https://doi.org/10.1007/978-3-030-67130-3in other publications this is the first paper when we prove optimality of the solution. We conclude that for a certain class of search problems Linguistic Geometry tools, a set of heuristic algorithms, generate optimal solutions.作者: 吼叫 時間: 2025-3-26 07:40
Analytical Instruments for Studying TSEImpared with other approaches according to which axioms they are governed by. Using this method we can show that . is indeed closely related to other classical aboutness derivations, and that in some aspects it has even more potential from an information retrieval perspective.作者: 鳴叫 時間: 2025-3-26 08:59
Shifting Paradigm of Terrorism,ructural .-preordering function. This system allows an effective search for a given conceptual graph according to its structure and so determines its specialization / generalization graphs without any projection test.作者: Fabric 時間: 2025-3-26 14:24
Ananta Kumar Giri,Saji Vargheseest, namely database inference detection, we believe that domain-directed microanalysis is a general approach that can be of significant value for databases in many domains. We describe the approach and give a brief example.作者: 不整齊 時間: 2025-3-26 19:49
Linguistic Geometry tools generate optimal solutions,in other publications this is the first paper when we prove optimality of the solution. We conclude that for a certain class of search problems Linguistic Geometry tools, a set of heuristic algorithms, generate optimal solutions.作者: 從容 時間: 2025-3-26 23:19
Conceptual graph aboutness,mpared with other approaches according to which axioms they are governed by. Using this method we can show that . is indeed closely related to other classical aboutness derivations, and that in some aspects it has even more potential from an information retrieval perspective.作者: 不知疲倦 時間: 2025-3-27 03:14 作者: 使聲音降低 時間: 2025-3-27 08:35
Microanalysis: Acquiring database semantics in conceptual graphs,est, namely database inference detection, we believe that domain-directed microanalysis is a general approach that can be of significant value for databases in many domains. We describe the approach and give a brief example.作者: 來這真柔軟 時間: 2025-3-27 09:56
Processes and participants,ately connected with the linguistic analysis of verbs that express the processes and thematic roles that relate the processes to the participants. The resulting classification provides an ontology of concept and relation types that can be used for representing both the semantics of verbs and the axi作者: 闖入 時間: 2025-3-27 16:33 作者: anniversary 時間: 2025-3-27 18:36 作者: Custodian 時間: 2025-3-28 01:29 作者: CHARM 時間: 2025-3-28 04:58 作者: STRIA 時間: 2025-3-28 06:49 作者: 火光在搖曳 時間: 2025-3-28 10:25 作者: Chronological 時間: 2025-3-28 18:30
Conceptual structures and structured documents, in the Conceptual Graph (CG) formalism. In structured documents, document elements (DEs) are typed and can be organized by structural or hypertext links. They can also be shared (included) by other DEs. The organization of DEs is specified by structure models (Document Type Definitions (DTDs)). A s作者: Inclement 時間: 2025-3-28 21:40 作者: 詞根詞綴法 時間: 2025-3-29 02:49 作者: 背心 時間: 2025-3-29 04:03 作者: 高興一回 時間: 2025-3-29 07:38
Microanalysis: Acquiring database semantics in conceptual graphs,is is due to the fact that database relations possess no inherent semantics. This paper describes an approach called . that we have used to effectively capture database semantics represented by conceptual graphs. The technique prescribes a manual knowledge acquisition process whereby each relation s作者: orthodox 時間: 2025-3-29 12:56
Propagating truth and detecting contradiction in conceptual graph databases,ed definition of both Formation and Inference Rules, a mechanism for storing nested, negative contexts, an extension to Method III for updating the database and truth values, a further extension to propagate some inferences, and a mechanism for representing and sometimes detecting contradictions. In作者: Salivary-Gland 時間: 2025-3-29 15:42 作者: 血友病 時間: 2025-3-29 22:24
Towards fuzzy conceptual graph programs, more appropriate and flexible manner than is possible by a real number based approach. Corresponding projection and other related operators are defined and their properties investigated. These FCGs and operators provide the basis on which FCG programs with declarative semantics and a sound modus po作者: 進(jìn)入 時間: 2025-3-30 01:32 作者: CRATE 時間: 2025-3-30 05:42 作者: 清澈 時間: 2025-3-30 08:35
Editing conceptual graphs,s and consistent editing of the linear form and its graphical correspondence. We discuss problems of formatting graphs and propose a formatting algorithm. Implementation details of the multiform editor for Conceptual Graphs and its integration of type hierarchies are presented.作者: 愛社交 時間: 2025-3-30 14:04 作者: minimal 時間: 2025-3-30 19:19
https://doi.org/10.1007/3-540-61534-2Algorithmische Linguistik; Fuzzy; Informationsabfrage; Konzeptuelle Graphen; Natruerlichsprachliche Vera作者: 要塞 時間: 2025-3-30 20:50 作者: 阻塞 時間: 2025-3-31 04:04 作者: anthropologist 時間: 2025-3-31 08:41 作者: 愚蠢人 時間: 2025-3-31 10:45
Yvan Saeys,Sven Degroeve,Yves Van de PeerIn this paper we investigate lattice homomorphism and in particular the embedding problem for lattices which is NP-complete. The use of lattice embedding in knowledge representation is showed by an example.作者: 小卒 時間: 2025-3-31 13:40
Graph drawing methods,Many structures in Information Technology can be modeled as graphs, and the success of the model depends on the appearance of the graph: a good drawing can be worth a thousand words, a poor drawing can confuse and obscure the model. This paper surveys recently developed methods for automatic graph drawing.作者: SOBER 時間: 2025-3-31 17:48
Existential graphs and tense logic,In this paper it is argued that the founder of modern tense logic, A.N. Prior was very much inspired by the logic and philosophy of C.S. Peirce. It is also demonstrated how the most important tense logical systems of Prior, K., K. and K., can be reformulated in terms of the existential graphs invented by Peirce.作者: antiquated 時間: 2025-4-1 01:01 作者: filicide 時間: 2025-4-1 02:06
Reunification and Consolidation (1990–2004)ately connected with the linguistic analysis of verbs that express the processes and thematic roles that relate the processes to the participants. The resulting classification provides an ontology of concept and relation types that can be used for representing both the semantics of verbs and the axi作者: Odyssey 時間: 2025-4-1 06:55 作者: SSRIS 時間: 2025-4-1 12:44 作者: 挑剔為人 時間: 2025-4-1 16:57 作者: 北極人 時間: 2025-4-1 21:18
Towards a Natural Social Contractn has to be mapped onto large knowledge bases. The most useful operation in the conceptual graphs formalism is the maximal join. This paper describes problems with ambiguities at different levels, including ambiguities resulting from the maximal join operation itself. This research was motivated by 作者: Inoperable 時間: 2025-4-1 22:52 作者: Notify 時間: 2025-4-2 05:56
Analytical Instruments for Studying TSEIormation inherent in the document and query. Graph operators can be used to determine whether a graph is a generalisation of another graph, in which case the information carried by the graph is said to be . the information carried by the generalisation of the graph. In this article we want to compar
