標(biāo)題: Titlebook: Conceptual Structures: Broadening the Base; 9th International Co Harry S. Delugach,Gerd Stumme Conference proceedings 2001 Springer-Verlag [打印本頁] 作者: 不足木 時間: 2025-3-21 17:18
書目名稱Conceptual Structures: Broadening the Base影響因子(影響力)
書目名稱Conceptual Structures: Broadening the Base影響因子(影響力)學(xué)科排名
書目名稱Conceptual Structures: Broadening the Base網(wǎng)絡(luò)公開度
書目名稱Conceptual Structures: Broadening the Base網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Conceptual Structures: Broadening the Base被引頻次
書目名稱Conceptual Structures: Broadening the Base被引頻次學(xué)科排名
書目名稱Conceptual Structures: Broadening the Base年度引用
書目名稱Conceptual Structures: Broadening the Base年度引用學(xué)科排名
書目名稱Conceptual Structures: Broadening the Base讀者反饋
書目名稱Conceptual Structures: Broadening the Base讀者反饋學(xué)科排名
作者: 撤退 時間: 2025-3-21 23:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235042.jpg作者: 悄悄移動 時間: 2025-3-22 00:56 作者: 認(rèn)識 時間: 2025-3-22 06:43
A Peircean ontology of languageFormal models of natural language often suffer from excessive complexity. A reason for this, we think, may be due to the underlying approach itself. In this paper we introduce a novel, semiotic based model of language which provides us with a simple algorithm for language processing.作者: Endemic 時間: 2025-3-22 10:57
https://doi.org/10.1007/3-540-44583-8Cognitive Science; Computational Linguistics; Conceptual Knowledge; Conceptual Structures; Concpetual An作者: 等級的上升 時間: 2025-3-22 13:08 作者: 等級的上升 時間: 2025-3-22 21:06 作者: negligence 時間: 2025-3-22 23:58
William Hsiao,Mingqiang Li,Shufang ZhangSemantico-Cognitive Schemes (SCS) and the aspecto-temporal theory. The expression of a semantico-cognitive representation within SCGs is automatically tractable. The SCS allows us to build a representation of a text taking into account the information about time and aspect. It allows us to represent作者: 變色龍 時間: 2025-3-23 01:55
https://doi.org/10.1057/978-1-137-53377-7ntation language for natural language information source. However, up to now only few approaches have been proposed for this task and most of them either are highly dependent on one domain or use manual rules. In this paper, we propose a machine-learning based approach that can be trained for differ作者: Ige326 時間: 2025-3-23 08:12 作者: sulcus 時間: 2025-3-23 13:22
https://doi.org/10.1007/978-981-15-1120-2paper is to extend this approach of cuts to simple concept graphs . generic markers. For these graphs, a set-theoretical semantics is presented. After this a modification of Peirce’s beta-calculus is provided, and definitions for mappings Φ and Ψ between concept graps and first order logic are given作者: Fillet,Filet 時間: 2025-3-23 17:01
https://doi.org/10.1007/978-981-15-1120-2 which is one of its advantages over predicate logic. However, classical semantics of conceptual graphs cannot deal with intrinsically vague generalized quantifiers like ., or ., which represent imprecise quantities that go beyond the capability of classical arithmetic. In this paper, we apply the f作者: 摘要 時間: 2025-3-23 21:38 作者: 譏笑 時間: 2025-3-23 23:03
https://doi.org/10.1007/978-981-15-1120-2aphs of power context families, there is the problem that the negation of a judgment is no more a judgment since judgments are understood as valid propositions. This problem is solved in “.” by introducing the “.” This leads to basic algebras of (semi-)concept graphs of power context families which 作者: libertine 時間: 2025-3-24 04:48 作者: 繁榮中國 時間: 2025-3-24 07:38 作者: Mercantile 時間: 2025-3-24 14:39
Imre Keseru,Thierry Coosemans,Cathy Macharisoncept as a set of objects together with the ...We introduce a . as a mapping from the set of attributes to the power set of the values (which is extended appropriately to empty cells), assigning to each attribute the set of allowed values. Descriptions are naturally ordered by preciseness. Using th作者: Afflict 時間: 2025-3-24 16:39
Imre Keseru,Thierry Coosemans,Cathy Macharisme of this paper. Those theories are considered which can be formalized by a contextual attribute logic. The empirical data are coded by formal contexts whose attribute logic can be used for representing scientific theories. Specific formal contexts, namely conceptual scales, are representing aspect作者: nitroglycerin 時間: 2025-3-24 22:14 作者: Neuralgia 時間: 2025-3-25 01:24 作者: Defiance 時間: 2025-3-25 04:58
Susana Val,M. Teresa de la Cruzconsists in correcting the errors that are detected during the validation, in order to restore the KB validity. We propose to perform the semantic validation and refinement of a KB composed of conceptual graphs in two stages. First, we study the coherence of the KB with respect to negative constrain作者: 怪物 時間: 2025-3-25 07:29 作者: poliosis 時間: 2025-3-25 14:08 作者: auxiliary 時間: 2025-3-25 17:48
https://doi.org/10.1007/978-3-030-38028-1orative activities. However, the requirements of these communities and the technologies in use change rapidly, so that requirements and available functionalities continuously need to be recalibrated. Changing their mappings is not trivial, because of the many dependencies between the business proces作者: 把手 時間: 2025-3-25 20:06
Conceptual Structures: Broadening the Base978-3-540-44583-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Engaged 時間: 2025-3-26 04:06
Conference proceedings 2001xcellence in conceptual structures research. We have adopted the title Broadening the Base," acknowledging the importance of contributions from scholars in many research areas. The rst ICCS meetings focused primarily on Sowa’s conceptual graphs; in recent years, however, the ICCS conference series h作者: Delude 時間: 2025-3-26 07:54 作者: Daily-Value 時間: 2025-3-26 09:02
Carolina Ciprés,M. Teresa de la Cruzion contexts. From these the complete implicational knowledge can be derived. Combining the techniques of attribute exploration and determination of a formal context’s concepts, we demonstrate a procedure which interactively asks for the validity of implications and from this information designs a dynamic CG system with the desired properties.作者: Inkling 時間: 2025-3-26 13:28
Imre Keseru,Thierry Coosemans,Cathy Macharisretical and the empirical side becomes apparent by comparing the semiproduct and the apposition representation. In an iterative process of theory building this gap should be diminished. Specific support is given by algebraic representations of formal contexts which are used to represent scientific theories.作者: 頭盔 時間: 2025-3-26 17:46 作者: heckle 時間: 2025-3-27 00:39
Susana Val,M. Teresa de la Cruz. Second, we study the completeness of the KB with respect to positive constraints, which represent the knowledge that the KB must contain. When the KB is not complete, we propose an assistant, which helps the user to correct the errors of the KB one by one.作者: foodstuff 時間: 2025-3-27 04:32 作者: 放逐 時間: 2025-3-27 07:26
Formal Concept Analysis Methods for Dynamic Conceptual Graphsion contexts. From these the complete implicational knowledge can be derived. Combining the techniques of attribute exploration and determination of a formal context’s concepts, we demonstrate a procedure which interactively asks for the validity of implications and from this information designs a dynamic CG system with the desired properties.作者: B-cell 時間: 2025-3-27 12:29
Mathematical Support for Empirical Theory Buildingretical and the empirical side becomes apparent by comparing the semiproduct and the apposition representation. In an iterative process of theory building this gap should be diminished. Specific support is given by algebraic representations of formal contexts which are used to represent scientific theories.作者: 不能根除 時間: 2025-3-27 16:19
Searching for Objects and Properties with Logical Concept Analysisormal context. It can be generalized to recover more classical KD operations like machine-learning through the computation of necessary or sufficient properties (modulo some confidence), or data-mining through association rules.作者: DEAWL 時間: 2025-3-27 18:37 作者: stressors 時間: 2025-3-27 22:31
William Hsiao,Mingqiang Li,Shufang Zhange first structure models the semantico-cognitive representation while the second one is the temporal diagram representing the temporal constraints between the situations described in the text. Linking these structures leads us to slightly extend the original SCG model.作者: DOLT 時間: 2025-3-28 02:31
https://doi.org/10.1057/978-1-137-53377-7zation operations, we can train the system to generate conceptual graphs from domain specific sentences. An implementation system of the method is currently under development with IBM China Research Lab.作者: CLASP 時間: 2025-3-28 06:34
Imre Keseru,Thierry Coosemans,Cathy Macharistes..Within this approach, we reformulate the known theory under a different point of view. It certainly does not provide a better analysis than scaling, but it allows to avoid the generation of a huge one-valued context.作者: 連詞 時間: 2025-3-28 10:24 作者: Budget 時間: 2025-3-28 15:21
Learning to Generate CGs from Domain Specific Sentenceszation operations, we can train the system to generate conceptual graphs from domain specific sentences. An implementation system of the method is currently under development with IBM China Research Lab.作者: Accrue 時間: 2025-3-28 21:07
Many-Valued Context Analysis Using Descriptionstes..Within this approach, we reformulate the known theory under a different point of view. It certainly does not provide a better analysis than scaling, but it allows to avoid the generation of a huge one-valued context.作者: Cocker 時間: 2025-3-29 00:52 作者: Collected 時間: 2025-3-29 07:00 作者: Galactogogue 時間: 2025-3-29 09:07
https://doi.org/10.1007/978-981-15-1120-2racterization of the entailment relation and as a mechanism to translate knowledge given on the graph level to the context level. A standard graph is constructed which entails all semiconcept graphs valid in a given power context family. The possible use of semiconcept graphs in conceptual knowledge processing is illustrated by an example.作者: CEDE 時間: 2025-3-29 15:01 作者: 總 時間: 2025-3-29 19:23
Word Graphs: The Third Setds) in two other papers [.], [.]. In this paper, we propose the concept of the logic word and classify logic words into groups in terms of semantics and the way they are used in describing reasoning processes.作者: 做作 時間: 2025-3-29 20:42 作者: 爵士樂 時間: 2025-3-30 00:15
Conceptual Graphs and Metamodelingd its flexibility to represent metalevel knowledge through the use of contexts makes it a serious contender for the representation of a metamodeling theory. Therefore, this paper presents a CG based metamodeling framework for the modeling of information systems.作者: Mortar 時間: 2025-3-30 05:09
https://doi.org/10.1007/978-981-99-6124-5tructures in relation to the cognitive (solving-oriented) patterns in the context of problem solving activities. The results appear to be consistent with the role of some solving-oriented cognitive patterns in debugging activity and the contextual effects of the problem on the conceptual structures.作者: 典型 時間: 2025-3-30 11:37
https://doi.org/10.1007/978-981-15-1120-2uzzy set-theoretic semantics of generalized quantifiers and formally define the semantics of generally quantified fuzzy conceptual graphs as probabilistic logic rules comprising only simple fuzzy conceptual graphs. Then we derive inference rules performed directly on fuzzy conceptual graphs with either relative or absolute quantifiers.作者: 附錄 時間: 2025-3-30 13:41
https://doi.org/10.1007/978-981-15-1120-2are investigated in this paper to obtain a mathematical foundation of Boolean Judgment Logic. The basic notions and relationships are illustrated by an example concerned with an information system for supporting the configuration of PCs.作者: foliage 時間: 2025-3-30 16:31 作者: 顛簸地移動 時間: 2025-3-30 22:41 作者: 膠水 時間: 2025-3-31 03:41
Solving-Oriented and Domain-Oriented Knowledge Structures: Their Application to Debugging Problem Sotructures in relation to the cognitive (solving-oriented) patterns in the context of problem solving activities. The results appear to be consistent with the role of some solving-oriented cognitive patterns in debugging activity and the contextual effects of the problem on the conceptual structures.作者: Ejaculate 時間: 2025-3-31 05:53 作者: curettage 時間: 2025-3-31 10:39 作者: 小口啜飲 時間: 2025-3-31 16:35
Pattern Structures and Their Projections classifications are defined for data given by pattern structures. Since computation in pattern structures may be intractable, approximations of patterns by means of projections are introduced. It is shown how concepts, implications, hypotheses, and classifications in projected pattern structures are related to those in original ones.作者: 搖曳 時間: 2025-3-31 20:46 作者: 詞匯記憶方法 時間: 2025-3-31 22:24
Large-scale cooperatively-built KBsWebKB-2 is ultimately intended to permit cooperatively-built Yellow-Page like catalogs, that is, permit Web users to publish their information in a way that is automatically retrievable and comparable with other users’ knowledge (as opposed to publishing information in plain text documents or even R作者: 記憶 時間: 2025-4-1 03:06 作者: Yourself 時間: 2025-4-1 07:30 作者: 填滿 時間: 2025-4-1 11:03
https://doi.org/10.1007/978-3-030-38028-1s of a series of matching process steps which are based on a functionality matching meta-model. We illustrate how such an approach could be used in practice by applying it to a proposed system change process in the case of an electronic journal.作者: Basilar-Artery 時間: 2025-4-1 14:57 作者: 象形文字 時間: 2025-4-1 20:56 作者: 破布 時間: 2025-4-2 01:56
Word Graphs: The Third Set This is why we study word graphs. Word graphs were already built for prepositions and adwords (including adjectives, adverbs and Chinese quantity words) in two other papers [.], [.]. In this paper, we propose the concept of the logic word and classify logic words into groups in terms of semantics a
