Search (34 results, page 1 of 2)

0.024208048 = product of:
  0.048416097 = sum of:
    0.048416097 = sum of:
      0.0047357627 = weight(_text_:a in 5710) [ClassicSimilarity], result of:
        0.0047357627 = score(doc=5710,freq=2.0), product of:
          0.053105544 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046056706 = queryNorm
          0.089176424 = fieldWeight in 5710, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5710)
      0.043680333 = weight(_text_:22 in 5710) [ClassicSimilarity], result of:
        0.043680333 = score(doc=5710,freq=2.0), product of:
          0.16128273 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046056706 = queryNorm
          0.2708308 = fieldWeight in 5710, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5710)
  0.5 = coord(1/2)

Pages

S.22-33

Type

a

0.022150666 = product of:
  0.04430133 = sum of:
    0.04430133 = sum of:
      0.013101093 = weight(_text_:a in 1204) [ClassicSimilarity], result of:
        0.013101093 = score(doc=1204,freq=30.0), product of:
          0.053105544 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046056706 = queryNorm
          0.24669915 = fieldWeight in 1204, product of:
            5.477226 = tf(freq=30.0), with freq of:
              30.0 = termFreq=30.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1204)
      0.03120024 = weight(_text_:22 in 1204) [ClassicSimilarity], result of:
        0.03120024 = score(doc=1204,freq=2.0), product of:
          0.16128273 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046056706 = queryNorm
          0.19345059 = fieldWeight in 1204, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1204)
  0.5 = coord(1/2)

Abstract

A main goal of recent studies in semantics is to integrate into conceptual structures the models of representation used in linguistics, logic, and/or artificial intelligence. A fundamental problem resides in the need to structure knowledge and then to check the validity of constructed representations. We propose associating logical properties with relationships by introducing the relationships into a typed and functional system of specifcations. This makes it possible to compare conceptual representations against the relationships established between the concepts. The mandatory condition to validate such a conceptual representation is consistency. The semantic system proposed is based an a structured set of semantic primitives-types, relations, and properties-based an a global model of language processing, Applicative and Cognitive Grammar (ACG) (Desc16s, 1990), and an extension of this model to terminology (Jouis & Mustafa 1995, 1996, 1997). The ACG postulates three levels of representation of languages, including a cognitive level. At this level, the meanings of lexical predicates are represented by semantic cognitive schemes. From this perspective, we propose a set of semantic concepts, which defines an organized system of meanings. Relations are part of a specification network based an a general terminological scheure (i.e., a coherent system of meanings of relations). In such a system, a specific relation may be characterized as to its: (1) functional type (the semantic type of arguments of the relation); (2) algebraic properties (reflexivity, symmetry, transitivity, etc.); and (3) combinatorial relations with other entities in the same context (for instance, the part of the text where a concept is defined).

Date

1.12.2002 11:12:22

Type

a

0.020074995 = product of:
  0.04014999 = sum of:
    0.04014999 = sum of:
      0.00894975 = weight(_text_:a in 5588) [ClassicSimilarity], result of:
        0.00894975 = score(doc=5588,freq=14.0), product of:
          0.053105544 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046056706 = queryNorm
          0.1685276 = fieldWeight in 5588, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5588)
      0.03120024 = weight(_text_:22 in 5588) [ClassicSimilarity], result of:
        0.03120024 = score(doc=5588,freq=2.0), product of:
          0.16128273 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046056706 = queryNorm
          0.19345059 = fieldWeight in 5588, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5588)
  0.5 = coord(1/2)

Abstract

To organize information, librarians create structures. These structures grow from a logic that goes back at least as far as Aristotle. It is the basis of classification as we practice it, and thesauri and subject headings have developed from it. Feminist critiques of logic suggest that logic is gendered in nature. This article will explore how these critiques play out in contemporary standards for the organization of information. Our widely used classification schemes embody principles such as hierarchical force that conform to traditional/Aristotelian logic. Our subject heading strings follow a linear path of subdivision. Our thesauri break down subjects into discrete concepts. In thesauri and subject heading lists we privilege hierarchical relationships, reflected in the syndetic structure of broader and narrower terms, over all other relationships. Are our classificatory and syndetic structures gendered? Are there other options? Carol Gilligan's In a Different Voice (1982), Women's Ways of Knowing (Belenky, Clinchy, Goldberger, & Tarule, 1986), and more recent related research suggest a different type of structure for women's knowledge grounded in "connected knowing." This article explores current and potential elements of connected knowing in subject access with a focus on the relationships, both paradigmatic and syntagmatic, between concepts.

Date

11.12.2019 19:00:22

Type

a

0.00270615 = product of:
  0.0054123 = sum of:
    0.0054123 = product of:
      0.0108246 = sum of:
        0.0108246 = weight(_text_:a in 1186) [ClassicSimilarity], result of:
          0.0108246 = score(doc=1186,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.20383182 = fieldWeight in 1186, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=1186)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This chapter deals with the paradigmatic sense relation of hyponymy as manifested in nouns. A number of approaches to the definition of the relation are discussed, with particular attention being given to the problems of framing a prototype-theoretical characterization. An account is offered of a number of sub-varieties of hyponymy.

Type

a

0.0026473717 = product of:
  0.0052947435 = sum of:
    0.0052947435 = product of:
      0.010589487 = sum of:
        0.010589487 = weight(_text_:a in 1191) [ClassicSimilarity], result of:
          0.010589487 = score(doc=1191,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.19940455 = fieldWeight in 1191, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1191)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The principal relation linking verbs in a semantic network is the manner relation (or "troponymy"). We examine the nature of troponymy across different semantic domains and verb classes in an attempt to arrive at a more subtle understanding of this intuitive relation. Troponymy is not a semantically homogeneous relation; rather, it is polysemous and encompasses distinct sub-relations. We identify and discuss Manner, Function, and Result. Furthermore, different kinds of troponyms differ from their semantically less elaborated superordinates in their syntactic behavior. In some cases, troponyms exhibit a wider range of syntactic altemations; in other cases, the troponyms are more restricted in their argument-projecting properties.

Type

a

0.0024857575 = product of:
  0.004971515 = sum of:
    0.004971515 = product of:
      0.00994303 = sum of:
        0.00994303 = weight(_text_:a in 1207) [ClassicSimilarity], result of:
          0.00994303 = score(doc=1207,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.18723148 = fieldWeight in 1207, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1207)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Specialized domains often come with an extensive terminology, suitable for storing and exchanging information, but not necessarily for knowledge processing. Knowledge structures such as semantic networks, or ontologies, are required to explore the semantics of a domain. The UMLS project at the National Library of Medicine is a research effort to develop knowledge-based resources for the biomedical domain. The Metathesaurus is a large body of knowledge that defines and inter-relates 730,000 biomedical concepts, and the Semantic Network defines the semantic principles that apply to this domain. This chapter presents these two knowledge sources and illustrates through a research study how they can collaborate to further structure the domain. The limits of the approach are discussed.

Type

a

0.0024857575 = product of:
  0.004971515 = sum of:
    0.004971515 = product of:
      0.00994303 = sum of:
        0.00994303 = weight(_text_:a in 2178) [ClassicSimilarity], result of:
          0.00994303 = score(doc=2178,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.18723148 = fieldWeight in 2178, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=2178)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A set of semantic relations is created every time a domain modeler wants to solve some complex problem computationally. These relations are usually organized into ontologies. But three is little standardization of ontologies today, and almost no discussion an ways of comparing relations, of determining a general approach to creating relations, or of modeling in general. This chapter outlines an approach to establishing a general methodology for comparing and justifying sets of relations (and ontologies in general). It first provides several dozen characteristics of ontologies, organized into three taxonomies of increasingly detailed features, by which many essential characteristics of ontologies can be described. These features enable one to compare ontologies at a general level, without studying every concept they contain. But sometimes it is necessary to make detailed comparisons of content. The chapter then illustrates one method for determining salient points for comparison, using algorithms that semi-automatically identify similarities and differences between ontologies.

Type

a

0.002440756 = product of:
  0.004881512 = sum of:
    0.004881512 = product of:
      0.009763024 = sum of:
        0.009763024 = weight(_text_:a in 5089) [ClassicSimilarity], result of:
          0.009763024 = score(doc=5089,freq=34.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1838419 = fieldWeight in 5089, product of:
              5.8309517 = tf(freq=34.0), with freq of:
                34.0 = termFreq=34.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.02734375 = fieldNorm(doc=5089)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The 8th International Conference on Conceptual Structures - Logical, Linguistic, and Computational Issues (ICCS 2000) brings together a wide range of researchers and practitioners working with conceptual structures. During the last few years, the ICCS conference series has considerably widened its scope on different kinds of conceptual structures, stimulating research across domain boundaries. We hope that this stimulation is further enhanced by ICCS 2000 joining the long tradition of conferences in Darmstadt with extensive, lively discussions. This volume consists of contributions presented at ICCS 2000, complementing the volume "Conceptual Structures: Logical, Linguistic, and Computational Issues" (B. Ganter, G.W. Mineau (Eds.), LNAI 1867, Springer, Berlin-Heidelberg 2000). It contains submissions reviewed by the program committee, and position papers. We wish to express our appreciation to all the authors of submitted papers, to the general chair, the program chair, the editorial board, the program committee, and to the additional reviewers for making ICCS 2000 a valuable contribution in the knowledge processing research field. Special thanks go to the local organizers for making the conference an enjoyable and inspiring event. We are grateful to Darmstadt University of Technology, the Ernst Schröder Center for Conceptual Knowledge Processing, the Center for Interdisciplinary Studies in Technology, the Deutsche Forschungsgemeinschaft, Land Hessen, and NaviCon GmbH for their generous support

Content

Concepts & Language: Knowledge organization by procedures of natural language processing. A case study using the method GABEK (J. Zelger, J. Gadner) - Computer aided narrative analysis using conceptual graphs (H. Schärfe, P. 0hrstrom) - Pragmatic representation of argumentative text: a challenge for the conceptual graph approach (H. Irandoust, B. Moulin) - Conceptual graphs as a knowledge representation core in a complex language learning environment (G. Angelova, A. Nenkova, S. Boycheva, T. Nikolov) - Conceptual Modeling and Ontologies: Relationships and actions in conceptual categories (Ch. Landauer, K.L. Bellman) - Concept approximations for formal concept analysis (J. Saquer, J.S. Deogun) - Faceted information representation (U. Priß) - Simple concept graphs with universal quantifiers (J. Tappe) - A framework for comparing methods for using or reusing multiple ontologies in an application (J. van ZyI, D. Corbett) - Designing task/method knowledge-based systems with conceptual graphs (M. Leclère, F.Trichet, Ch. Choquet) - A logical ontology (J. Farkas, J. Sarbo) - Algorithms and Tools: Fast concept analysis (Ch. Lindig) - A framework for conceptual graph unification (D. Corbett) - Visual CP representation of knowledge (H.D. Pfeiffer, R.T. Hartley) - Maximal isojoin for representing software textual specifications and detecting semantic anomalies (Th. Charnois) - Troika: using grids, lattices and graphs in knowledge acquisition (H.S. Delugach, B.E. Lampkin) - Open world theorem prover for conceptual graphs (J.E. Heaton, P. Kocura) - NetCare: a practical conceptual graphs software tool (S. Polovina, D. Strang) - CGWorld - a web based workbench for conceptual graphs management and applications (P. Dobrev, K. Toutanova) - Position papers: The edition project: Peirce's existential graphs (R. Mülller) - Mining association rules using formal concept analysis (N. Pasquier) - Contextual logic summary (R Wille) - Information channels and conceptual scaling (K.E. Wolff) - Spatial concepts - a rule exploration (S. Rudolph) - The TEXT-TO-ONTO learning environment (A. Mädche, St. Staab) - Controlling the semantics of metadata on audio-visual documents using ontologies (Th. Dechilly, B. Bachimont) - Building the ontological foundations of a terminology from natural language to conceptual graphs with Ribosome, a knowledge extraction system (Ch. Jacquelinet, A. Burgun) - CharGer: some lessons learned and new directions (H.S. Delugach) - Knowledge management using conceptual graphs (W.K. Pun)

0.0023678814 = product of:
  0.0047357627 = sum of:
    0.0047357627 = product of:
      0.009471525 = sum of:
        0.009471525 = weight(_text_:a in 6036) [ClassicSimilarity], result of:
          0.009471525 = score(doc=6036,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.17835285 = fieldWeight in 6036, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6036)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The notion of category, from Aristotle and Kant to the present time, has been used as a basic intellectual tool for the analysis of the existence and changeableness of things. Ranganathan was the first to extrapolate the concept into the Theory of Classification, placing it as an essential axis for the logical organization of knowledge and the construction of indexing languages. This paper proposes a conceptual and methodological reexamination of the notion of category from a functional and instrumental perspective, and tries to clarify the essential characters of categories in that context, and their present implications regarding the construction and evaluation of indexing languages

Type

a

0.0023678814 = product of:
  0.0047357627 = sum of:
    0.0047357627 = product of:
      0.009471525 = sum of:
        0.009471525 = weight(_text_:a in 6046) [ClassicSimilarity], result of:
          0.009471525 = score(doc=6046,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.17835285 = fieldWeight in 6046, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6046)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Draws attention to the efforts to define the terms 'concept' and 'term' and suggests a schedule of isolates for the term 'concept' under eight headings: 0. Concept; 1. Theoretical aspects; 2. Learning theory and Psychological aspects; 3. Origin, evolution, formation, construction; 4. Semantic aspects; 5.Terms and Terminology; 6. Usage and discipline-specific applications; and 7. Concepts and ISAR systems. The schedule also includes about 150 aspects/isolate terms related to 'concept' along with the name of the authors who have used them. The schedule is intended to help in identifying the various aspects of a concept with the help of the terms used for them. These aspects may guide to some extent, in dissecting and seeing the social science concepts from various point of views

Type

a

0.0023678814 = product of:
  0.0047357627 = sum of:
    0.0047357627 = product of:
      0.009471525 = sum of:
        0.009471525 = weight(_text_:a in 1195) [ClassicSimilarity], result of:
          0.009471525 = score(doc=1195,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.17835285 = fieldWeight in 1195, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1195)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The intuitive simplicity of the so-called is-a (or subsumption) relationship has led to widespread ontological misuse. Where previous work has focused largely an the semantics of the relationship itself, we concentrate here an the ontological nature of its arguments, in Order to tell whether a single is-a link is ontologically well-founded. For this purpose, we introduce some techniques based an the philosophical notions of identity, unity, and essence, which have been adapted to the needs of taxonomy design. We demonstrate the effectiveness of these techniques by taking real examples of poorly structured taxonomies and revealing cases of invalid generalization.

Type

a

0.0023435948 = product of:
  0.0046871896 = sum of:
    0.0046871896 = product of:
      0.009374379 = sum of:
        0.009374379 = weight(_text_:a in 170) [ClassicSimilarity], result of:
          0.009374379 = score(doc=170,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.17652355 = fieldWeight in 170, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=170)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper present an alternative approach to knowledge organization based on semiotic reasoning. The semantic distance between domain specific terminology and KOS is analyzed by means of their different sign systems. It is argued that a faceted approach may provide the means needed to minimize the gap between knowledge domains and KOS.

Source

Knowledge organization for a global learning society: Proceedings of the 9th International ISKO Conference, 4-7 July 2006, Vienna, Austria. Hrsg.: G. Budin, C. Swertz u. K. Mitgutsch

Type

a

0.002269176 = product of:
  0.004538352 = sum of:
    0.004538352 = product of:
      0.009076704 = sum of:
        0.009076704 = weight(_text_:a in 5078) [ClassicSimilarity], result of:
          0.009076704 = score(doc=5078,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1709182 = fieldWeight in 5078, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=5078)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Knowledge management, in particular corporate knowledge management, is a challenge companies and researchers have to meet. The conceptual graph formalism is a good candidate for the representation of corporate knowledge, and for the development of knowledge management systems. But many of the issues concerning the use of conceptual graphs as a metalanguage have not been worked out in detail. By introducing a function that maps higher level to lower level, this paper clarifies the metalevel semantics, notation and manipulation of concepts in the conceptual graph formalism. In addition, this function allows metamodeling activities to take place using the CG notation

Type

a

0.0020506454 = product of:
  0.004101291 = sum of:
    0.004101291 = product of:
      0.008202582 = sum of:
        0.008202582 = weight(_text_:a in 1189) [ClassicSimilarity], result of:
          0.008202582 = score(doc=1189,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1544581 = fieldWeight in 1189, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1189)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Relationships can provide a rich and powerful set of information and can be used to accomplish application goals, such as information retrieval and natural language processing. A growing trend in the information science community is the use of information visualization-taking advantage of people's natural visual capabilities to perceive and understand complex information. This chapter explores how visualization and visual exploration can help users gain insight from known relationships and discover evidence of new relationships not previously anticipated.

Type

a

0.0020506454 = product of:
  0.004101291 = sum of:
    0.004101291 = product of:
      0.008202582 = sum of:
        0.008202582 = weight(_text_:a in 3273) [ClassicSimilarity], result of:
          0.008202582 = score(doc=3273,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1544581 = fieldWeight in 3273, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3273)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Starting from the premise that extant knowledge of the discipline of Knowledge Organization ought to be made accessible by its knowledge units (concepts) this article includes short descriptions of the work of E.Wuester (Austria) and F. Riggs (USA) who both had laid foundations in this field. A noematic concept of knowledge (Diemer 1962, 474) is used for the necessary work to be done. It is shown how a concept-theoretical approach (relying on the characteristics of concepts and their system-building capacity) can be applied for pertinent terminological work. Earlier work in this regard by standardization bodies is mentioned. Seven necessary steps towards accomplishment are outlined.

Type

a

0.0020296127 = product of:
  0.0040592253 = sum of:
    0.0040592253 = product of:
      0.008118451 = sum of:
        0.008118451 = weight(_text_:a in 1192) [ClassicSimilarity], result of:
          0.008118451 = score(doc=1192,freq=8.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.15287387 = fieldWeight in 1192, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1192)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This chapter presents a broad survey of the cause-effect relation, with particular emphasis an how the relation is expressed in text. Philosophers have been grappling with the concept of causation for centuries. Researchers in social psychology have found that the human mind has a very complex mechanism for identifying and attributing the cause for an event. Inferring cause-effect relations between events and statements has also been found to be an important part of reading and text comprehension, especially for narrative text. Though many of the cause-effect relations in text are implied and have to be inferred by the reader, there is also a wide variety of linguistic expressions for explicitly indicating cause and effect. In addition, it has been found that certain words have "causal valence"-they bias the reader to attribute cause in certain ways. Cause-effect relations can also be divided into several different types.

Type

a

0.001913537 = product of:
  0.003827074 = sum of:
    0.003827074 = product of:
      0.007654148 = sum of:
        0.007654148 = weight(_text_:a in 6013) [ClassicSimilarity], result of:
          0.007654148 = score(doc=6013,freq=4.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.14413087 = fieldWeight in 6013, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=6013)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Type

a

0.0018909799 = product of:
  0.0037819599 = sum of:
    0.0037819599 = product of:
      0.0075639198 = sum of:
        0.0075639198 = weight(_text_:a in 4484) [ClassicSimilarity], result of:
          0.0075639198 = score(doc=4484,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.14243183 = fieldWeight in 4484, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4484)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This article presents the semantic information theory, formulated by the philosopher Fred I. Dretske, as a contribution to the discussion of metatheories and their practical implications in the field of library and information science. Dretske's theory is described in Knowledge and the flow of information. It is founded on mathematical communication theory but developed and elaborated into a cognitive, functionalistic theory, is individually oriented, and deals with the content of information. The topics are: the information process from perception to cognition, and how concept formation takes place in terms of digitisation. Other important issues are the concepts of information and knowledge, truth and meaning. Semantic information theory can be used as a frame of reference in order to explain, clarify and refute concepts currently used in library and information science, and as the basis for critical reviews of elements of the cognitive viewpoint in IR, primarily the notion of "potential information". The main contribution of the theory lies in a clarification of concepts, but there are still problems regarding the practical applications. More research is needed to combine philosophical discussions with the practice of information and library science.

Type

a

0.0018909799 = product of:
  0.0037819599 = sum of:
    0.0037819599 = product of:
      0.0075639198 = sum of:
        0.0075639198 = weight(_text_:a in 2527) [ClassicSimilarity], result of:
          0.0075639198 = score(doc=2527,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.14243183 = fieldWeight in 2527, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2527)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The evolution of bibliographic classification schemes, from the end of the 19th century to our time, shows a trend of increasing possibilities to combine concepts in a classmark. While the early schemes, like DDC and LCC, were largely enumerative, more and more synthetic devices have appeared with common auxiliaries, facets, and phase relationships. The last editions of UDC and the UDC-derived FATKS project follow this evolution, by introducing more specific phase relationships and more common auxiliaries, like those for general properties and processes. This agrees with the Farradane's principle that each concept should have a place of unique definition, instead of being re-notated in each context where it occurs. This evolution appears to be unfinished, as even in most synthetic schemes many concepts have a different notation according to the disciplinary main classes where they occur. To overcome this limitation, main classes should be defined in terms of phenomena rather than disciplines: the Integrative Level Classification (ILC) research project is currently exploring this possibility. Examples with UDC, FATKS, and ILC notations are discussed.

Type

a

0.001829468 = product of:
  0.003658936 = sum of:
    0.003658936 = product of:
      0.007317872 = sum of:
        0.007317872 = weight(_text_:a in 691) [ClassicSimilarity], result of:
          0.007317872 = score(doc=691,freq=26.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.13779864 = fieldWeight in 691, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0234375 = fieldNorm(doc=691)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Computer scientists create models of a perceived reality. Through AI techniques, these models aim at providing the basic support for emulating cognitive behavior such as reasoning and learning, which is one of the main goals of the Al research effort. Such computer models are formed through the interaction of various acquisition and inference mechanisms: perception, concept learning, conceptual clustering, hypothesis testing, probabilistic inference, etc., and are represented using different paradigms tightly linked to the processes that use them. Among these paradigms let us cite: biological models (neural nets, genetic programming), logic-based models (first-order logic, modal logic, rule-based systems), virtual reality models (object systems, agent systems), probabilistic models (Bayesian nets, fuzzy logic), linguistic models (conceptual dependency graphs, language-based rep resentations), etc. One of the strengths of the Conceptual Graph (CG) theory is its versatility in terms of the representation paradigms under which it falls. It can be viewed and therefore used, under different representation paradigms, which makes it a popular choice for a wealth of applications. Its full coupling with different cognitive processes lead to the opening of the field toward related research communities such as the Description Logic, Formal Concept Analysis, and Computational Linguistic communities. We now see more and more research results from one community enrich the other, laying the foundations of common philosophical grounds from which a successful synergy can emerge. ICCS 2000 embodies this spirit of research collaboration. It presents a set of papers that we believe, by their exposure, will benefit the whole community. For instance, the technical program proposes tracks on Conceptual Ontologies, Language, Formal Concept Analysis, Computational Aspects of Conceptual Structures, and Formal Semantics, with some papers on pragmatism and human related aspects of computing. Never before was the program of ICCS formed by so heterogeneously rooted theories of knowledge representation and use. We hope that this swirl of ideas will benefit you as much as it already has benefited us while putting together this program

Content

Concepts and Language: The Role of Conceptual Structure in Human Evolution (Keith Devlin) - Concepts in Linguistics - Concepts in Natural Language (Gisela Harras) - Patterns, Schemata, and Types: Author Support through Formalized Experience (Felix H. Gatzemeier) - Conventions and Notations for Knowledge Representation and Retrieval (Philippe Martin) - Conceptual Ontology: Ontology, Metadata, and Semiotics (John F. Sowa) - Pragmatically Yours (Mary Keeler) - Conceptual Modeling for Distributed Ontology Environments (Deborah L. McGuinness) - Discovery of Class Relations in Exception Structured Knowledge Bases (Hendra Suryanto, Paul Compton) - Conceptual Graphs: Perspectives: CGs Applications: Where Are We 7 Years after the First ICCS ? (Michel Chein, David Genest) - The Engineering of a CC-Based System: Fundamental Issues (Guy W. Mineau) - Conceptual Graphs, Metamodeling, and Notation of Concepts (Olivier Gerbé, Guy W. Mineau, Rudolf K. Keller) - Knowledge Representation and Reasonings: Based on Graph Homomorphism (Marie-Laure Mugnier) - User Modeling Using Conceptual Graphs for Intelligent Agents (James F. Baldwin, Trevor P. Martin, Aimilia Tzanavari) - Towards a Unified Querying System of Both Structured and Semi-structured Imprecise Data Using Fuzzy View (Patrice Buche, Ollivier Haemmerlé) - Formal Semantics of Conceptual Structures: The Extensional Semantics of the Conceptual Graph Formalism (Guy W. Mineau) - Semantics of Attribute Relations in Conceptual Graphs (Pavel Kocura) - Nested Concept Graphs and Triadic Power Context Families (Susanne Prediger) - Negations in Simple Concept Graphs (Frithjof Dau) - Extending the CG Model by Simulations (Jean-François Baget) - Contextual Logic and Formal Concept Analysis: Building and Structuring Description Logic Knowledge Bases: Using Least Common Subsumers and Concept Analysis (Franz Baader, Ralf Molitor) - On the Contextual Logic of Ordinal Data (Silke Pollandt, Rudolf Wille) - Boolean Concept Logic (Rudolf Wille) - Lattices of Triadic Concept Graphs (Bernd Groh, Rudolf Wille) - Formalizing Hypotheses with Concepts (Bernhard Ganter, Sergei 0. Kuznetsov) - Generalized Formal Concept Analysis (Laurent Chaudron, Nicolas Maille) - A Logical Generalization of Formal Concept Analysis (Sébastien Ferré, Olivier Ridoux) - On the Treatment of Incomplete Knowledge in Formal Concept Analysis (Peter Burmeister, Richard Holzer) - Conceptual Structures in Practice: Logic-Based Networks: Concept Graphs and Conceptual Structures (Peter W. Eklund) - Conceptual Knowledge Discovery and Data Analysis (Joachim Hereth, Gerd Stumme, Rudolf Wille, Uta Wille) - CEM - A Conceptual Email Manager (Richard Cole, Gerd Stumme) - A Contextual-Logic Extension of TOSCANA (Peter Eklund, Bernd Groh, Gerd Stumme, Rudolf Wille) - A Conceptual Graph Model for W3C Resource Description Framework (Olivier Corby, Rose Dieng, Cédric Hébert) - Computational Aspects of Conceptual Structures: Computing with Conceptual Structures (Bernhard Ganter) - Symmetry and the Computation of Conceptual Structures (Robert Levinson) An Introduction to SNePS 3 (Stuart C. Shapiro) - Composition Norm Dynamics Calculation with Conceptual Graphs (Aldo de Moor) - From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language (Adil Kabbaj, Martin Janta-Polczynski) - A Cost-Bounded Algorithm to Control Events Generalization (Gaël de Chalendar, Brigitte Grau, Olivier Ferret)