標(biāo)題: Titlebook: Conceptual Structures: Theory, Tools and Applications; 6th International Co Marie-Laure Mugnier,Michel Chein Conference proceedings 1998 Sp [打印本頁] 作者: Filament 時(shí)間: 2025-3-21 18:44
書目名稱Conceptual Structures: Theory, Tools and Applications影響因子(影響力)
書目名稱Conceptual Structures: Theory, Tools and Applications影響因子(影響力)學(xué)科排名
書目名稱Conceptual Structures: Theory, Tools and Applications網(wǎng)絡(luò)公開度
書目名稱Conceptual Structures: Theory, Tools and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Conceptual Structures: Theory, Tools and Applications被引頻次
書目名稱Conceptual Structures: Theory, Tools and Applications被引頻次學(xué)科排名
書目名稱Conceptual Structures: Theory, Tools and Applications年度引用
書目名稱Conceptual Structures: Theory, Tools and Applications年度引用學(xué)科排名
書目名稱Conceptual Structures: Theory, Tools and Applications讀者反饋
書目名稱Conceptual Structures: Theory, Tools and Applications讀者反饋學(xué)科排名
作者: 額外的事 時(shí)間: 2025-3-21 22:01
Piece resolution: Towards larger perspectives, “chase”, was already studied. The chase is a bottom-up procedure: from hypothesis to conclusion. This paper introduces a new proof procedure which is topdown: from conclusion to hypothesis. Indeed, we show that the implication problem for dependencies can be reduced to the existence of a piece reso作者: Interdict 時(shí)間: 2025-3-22 03:42 作者: committed 時(shí)間: 2025-3-22 08:31
Andrée C. Ehresmann,Jean-Paul Vanbremeersch offer a solution to this problem by developing a method for extending line diagrams to those whose attributes are join-closed. This method allows to implement TOSCANA-systems based on thesauri which respect the join-structure of the thesauri.作者: Commonplace 時(shí)間: 2025-3-22 12:41 作者: Classify 時(shí)間: 2025-3-22 14:34 作者: Classify 時(shí)間: 2025-3-22 20:16
A semantic validation of conceptual graphs,ach kind of descriptive constraints we propose a way of checking if a knowledge base is valid and define their logical semantics. Finally we compare descriptive constraints with other extensions of the conceptual graph model.作者: 原告 時(shí)間: 2025-3-22 22:06
Matching in description logics: Preliminary results,ion” normal form for concepts. As a result, matching can be performed (in polynomial time) using . concept patterns of the description language .?, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional “side conditions”, which were motivated by practical experience.作者: insurrection 時(shí)間: 2025-3-23 05:15
Ontologically yours,ain that ‘conceptual structures‘ should be handled in the way that logicians and philosophers consider to be adequate for concepts. Thinking about the actual use of words in reasoning may therefore open some new perspectives in the theory of ‘conceptual structures‘.作者: packet 時(shí)間: 2025-3-23 07:56
Mapping of CGIF to operational interfaces,CORBA to allow the interoperability within a heterogeneous environment. The major result of this paper is a specification of an operational interface written in CORBA‘s . (IDL) that is equivalent to CGIF, yet better suited for the efficient implementation of applications in distributed systems.作者: municipality 時(shí)間: 2025-3-23 12:48
Powerset trilattices,d. In particular, the finite .-trilattices are (up to isomorphism) just the finite powerset trilattices. They have 3. elements. Further topics are the ., the . as the triadic complementation and the ., which take over the role of the atoms in the theory of Boolean lattices.作者: CROW 時(shí)間: 2025-3-23 14:26
Two FOL semantics for simple and nested conceptual graphs,and completeness of the projection with respect to this semantics are true without any restriction. I extend the definitions and results on both semantics to Conceptual Graphs containing co-reference links and to Nested Conceptual Graphs.作者: 消耗 時(shí)間: 2025-3-23 19:54 作者: cancellous-bone 時(shí)間: 2025-3-23 22:16
0302-9743 l graphs and other models, relationships with logics, algorithms and complexity, natural language processing, and applications.978-3-540-64791-1978-3-540-68673-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 起來了 時(shí)間: 2025-3-24 05:05
Conceptual graph standard and extensions,ition of researchers who have been actively extending conceptual graphs with a variety of experimental features that often go far beyond the core and are sometimes incompatible with it. This paper discusses the recently developed CG standard and its approach to standardizing the CG core while allowing innovative extensions.作者: jabber 時(shí)間: 2025-3-24 09:14
Using viewpoints and CG for the representation and management of a corporate memory in concurrent eproject memory. Such design process is a cycle of individual design and collaborative evaluation. In order to facilitate knowledge extraction from this memory and to ensure the evolution of knowledge, we define a viewpoints management. This management is based in our study of viewpoints in Conceptual Graphs.作者: 終端 時(shí)間: 2025-3-24 12:31
,WebKB-GE — A visual editor for canonical conceptual graphs,dition, co-operative knowledge formulation is supported by network-aware work-sharing features. The layout language and its implementation are described as well as the design and implementation features.作者: 聰明 時(shí)間: 2025-3-24 17:06
MULTIKAT, a tool for comparing knowledge of multiple experts,plements an algorithm of comparison and integration of several supports, and an algorithm of comparison and integration of multiple conceptual graphs corresponding to different viewpoints, the integration being guided by different integration strategies. This paper details this last algorithm.作者: CHAR 時(shí)間: 2025-3-24 22:48 作者: Palter 時(shí)間: 2025-3-25 00:29 作者: Diastole 時(shí)間: 2025-3-25 06:21
Towards a Relational Theory of the Firmion” normal form for concepts. As a result, matching can be performed (in polynomial time) using . concept patterns of the description language .?, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional “side conditions”, which were motivated by practical experience.作者: confederacy 時(shí)間: 2025-3-25 10:54 作者: 四目在模仿 時(shí)間: 2025-3-25 13:58 作者: Bereavement 時(shí)間: 2025-3-25 16:32 作者: fructose 時(shí)間: 2025-3-25 22:53 作者: Spinal-Fusion 時(shí)間: 2025-3-26 02:55 作者: induct 時(shí)間: 2025-3-26 05:57
Conference proceedings 1998August 1998..The 20 revised full papers and 10 research reports presented were carefully selected from a total of 66 submissions; also included are three invited contributions. The volume is divided in topical sections on knowledge representation and knowledge engineering, tools, conceptual graphs a作者: Myelin 時(shí)間: 2025-3-26 10:24 作者: FILTH 時(shí)間: 2025-3-26 12:40
Towards a Relational Theory of the Firmition of researchers who have been actively extending conceptual graphs with a variety of experimental features that often go far beyond the core and are sometimes incompatible with it. This paper discusses the recently developed CG standard and its approach to standardizing the CG core while allowing innovative extensions.作者: CANDY 時(shí)間: 2025-3-26 18:06
https://doi.org/10.1007/978-3-642-17694-4project memory. Such design process is a cycle of individual design and collaborative evaluation. In order to facilitate knowledge extraction from this memory and to ensure the evolution of knowledge, we define a viewpoints management. This management is based in our study of viewpoints in Conceptual Graphs.作者: 痛苦一生 時(shí)間: 2025-3-26 22:34 作者: Vulnerary 時(shí)間: 2025-3-27 02:39 作者: 歡樂東方 時(shí)間: 2025-3-27 08:07
https://doi.org/10.1007/978-1-4615-8082-9 complete system of inference rules is presented and a standard graph is introduced that entails all concept graphs being valid in a given relational context. A possible use for conceptual knowledge representation and processing is suggested.作者: 連累 時(shí)間: 2025-3-27 12:57
Quantum Memory in the USC Regime,btypes. Activity in such concepts propagates over conceptual relations to invoke activity or changes in other behavioral concepts or to affect the attributes related to object type concepts. The challenging issues of orderly simulation of behavior recursively described by another graphs, and of combinational relations are also addressed.作者: 悲觀 時(shí)間: 2025-3-27 15:32 作者: 被詛咒的人 時(shí)間: 2025-3-27 21:04
https://doi.org/10.1007/978-3-031-38274-1ons from the “conjunction” of any two types and consequently partial type definitions. Symmetrically, regarding generalization/specialization operations in Conceptual Graphs, we conclude by suggesting how Description Logics could take advantage of these correspondences to improve the explanation of subsumption computation.作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-27 23:52
The Early Detection of Emergent Processesonceptual graphs by “.”. As in the preceding paper, our focuss lies on the mathematical structure theory, which later could be used for extending the already developed logical theory of simple concept graphs. The overall aim of this research is to contribute to the development of a . as basis of ..作者: Uncultured 時(shí)間: 2025-3-28 03:17 作者: 緯線 時(shí)間: 2025-3-28 09:42
From actors to processes: The representation of dynamic knowledge using conceptual graphs,extended to include the description of processes based on the representation of assertions and retractions about the world. This paper extends the conceptual graph theory in that direction, taking into account the implementation considerations that such an extension entails.作者: strdulate 時(shí)間: 2025-3-28 13:56
Towards correspondences between Conceptual Graphs and Description Logics,ons from the “conjunction” of any two types and consequently partial type definitions. Symmetrically, regarding generalization/specialization operations in Conceptual Graphs, we conclude by suggesting how Description Logics could take advantage of these correspondences to improve the explanation of subsumption computation.作者: OATH 時(shí)間: 2025-3-28 14:52
Triadic concept graphs,onceptual graphs by “.”. As in the preceding paper, our focuss lies on the mathematical structure theory, which later could be used for extending the already developed logical theory of simple concept graphs. The overall aim of this research is to contribute to the development of a . as basis of ..作者: 擦掉 時(shí)間: 2025-3-28 22:46
Conceptual graph standard and extensions,re essential for building and sharing development tools and for supporting commercial applications. But the CG community has traditionally been a coalition of researchers who have been actively extending conceptual graphs with a variety of experimental features that often go far beyond the core and 作者: LIMN 時(shí)間: 2025-3-29 01:28
Matching in description logics: Preliminary results,nguages (description logics), originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a “concept-centered” normal form, rather than the more standard “structural subsumpt作者: 廣大 時(shí)間: 2025-3-29 03:07 作者: Ornithologist 時(shí)間: 2025-3-29 10:39 作者: 干涉 時(shí)間: 2025-3-29 13:07 作者: harrow 時(shí)間: 2025-3-29 16:33
A semantic validation of conceptual graphs,gical validation and semantic validation. We are interested in these three kinds of validation for knowledge based systems based on conceptual graphs. This paper focuses on semantic validation. We present a method to check whether a knowledge base is semantically valid. This is done with respect to 作者: 五行打油詩 時(shí)間: 2025-3-29 23:29
Using viewpoints and CG for the representation and management of a corporate memory in concurrent e. In this paper, we propose a representation with the Conceptual Graph formalism to keep a trace of the design process in Concurrent Engineering as a project memory. Such design process is a cycle of individual design and collaborative evaluation. In order to facilitate knowledge extraction from thi作者: Hearten 時(shí)間: 2025-3-30 03:13 作者: 預(yù)定 時(shí)間: 2025-3-30 04:45
Mapping of CGIF to operational interfaces,s “on-the-wire-representations”. In this paper we argue that for interacting applications in an open distributed environment this is too inefficient both in terms of the application creation process as well as runtime characteristics. We propose to employ the widespread middleware platform based on 作者: 難聽的聲音 時(shí)間: 2025-3-30 10:13 作者: 消息靈通 時(shí)間: 2025-3-30 14:14
MULTIKAT, a tool for comparing knowledge of multiple experts,dge of several experts both automatically and cooperatively, when such knowledge is represented through Sowa‘s conceptual graph formalism. MULTIKAT implements an algorithm of comparison and integration of several supports, and an algorithm of comparison and integration of multiple conceptual graphs 作者: Explosive 時(shí)間: 2025-3-30 18:23
Towards correspondences between Conceptual Graphs and Description Logics,ovided with type definitions (which we call . and the . standard Description Logic. We prove an equivalence between a subset of . and a subset of .. Based on this equivalence, we suggest extensions of both formalisms while preserving the equivalence. In particular, regarding to standard Description 作者: 推延 時(shí)間: 2025-3-31 00:34
Piece resolution: Towards larger perspectives,order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we define piece resolution over a class of first-order logical formulae: the .. An implementation of this procedure has been done, and we 作者: 吞下 時(shí)間: 2025-3-31 02:02 作者: 不愛防注射 時(shí)間: 2025-3-31 05:02 作者: 小母馬 時(shí)間: 2025-3-31 09:17
Simple concept graphs: A logic approach,t graphs are introduced as syntactical constructs, and their semantics is defined based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails all concept graphs being valid in a given relational 作者: faucet 時(shí)間: 2025-3-31 13:27
Two FOL semantics for simple and nested conceptual graphs,his semantics. M. Chein and M.L. Mugnier have proved the completeness result, with a restriction on the form of the target graph of the projection. I propose here another FOL semantics for Simple Conceptual Graphs corresponding to a slightly different interpretation of a Conceptual Graph. Soundness 作者: jealousy 時(shí)間: 2025-3-31 17:39
Peircean graphs for the modal logic S5, modal logics. In the present paper, we put forward a system of Peircean graphs for reasoning within the modal logic S5. It is proved that our graph-based formulation of S5 is indeed equivalent to the traditional Hilbert-Frege formulation. Our choice of proof-rules for the system is proof-theoretica作者: 殘忍 時(shí)間: 2025-3-31 23:22
https://doi.org/10.1007/BFb0054900Artificial Intelligence; Evolution; Extension; Knowledge Engineering; Mathematical Logics; Powerset; agent作者: 最高峰 時(shí)間: 2025-4-1 03:16
978-3-540-64791-1Springer-Verlag Berlin Heidelberg 1998作者: Ornithologist 時(shí)間: 2025-4-1 08:10
Conceptual Structures: Theory, Tools and Applications978-3-540-68673-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 乳白光 時(shí)間: 2025-4-1 10:32
Yuri Borgianni,Dominik T. Matt,Guido OrzesThis paper presents CoGITaNT, a software development platform for applications based on conceptual graphs. CoGITaNT is a new version of the CoGITo platform, adding simple graph rules and typed nested graphs with coreference links.作者: mastopexy 時(shí)間: 2025-4-1 15:47 作者: Inelasticity 時(shí)間: 2025-4-1 22:19
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235056.jpg
