Titlebook: Conceptual Structures: Theory, Tools and Applications; 6th International Co Marie-Laure Mugnier,Michel Chein Conference proceedings 1998 Sp

Filament

書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications影響因子(影響力)




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications被引頻次




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications被引頻次學(xué)科排名




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications年度引用




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications年度引用學(xué)科排名




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications讀者反饋




書(shū)目名稱(chēng)Conceptual Structures: Theory, Tools and Applications讀者反饋學(xué)科排名

額外的事

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

committed

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

Classify

Classify

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.

原告

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

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

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.