Over 10 mio. titler Fri fragt ved køb over 499,- Hurtig levering 30 dages retur

Graph-based Knowledge Representation

  • Format
  • Bog, hardback
  • Engelsk

Normalpris

kr. 1.424,95

Medlemspris

kr. 1.359,95
  • Du sparer kr. 65,00
  • Fri fragt
Som medlem af Saxo Premium 20 timer køber du til medlemspris, får fri fragt og 20 timers streaming/md. i Saxo-appen. De første 7 dage er gratis for nye medlemmer, derefter koster det 99,-/md. og kan altid opsiges. Løbende medlemskab, der forudsætter betaling med kreditkort. Fortrydelsesret i medfør af Forbrugeraftaleloven. Mindstepris 0 kr. Læs mere

Beskrivelse

This book provides a de?nition and study of a knowledge representation and r- soning formalism stemming from conceptual graphs, while focusing on the com- tational properties of this formalism. Knowledge can be symbolically represented in many ways. The knowledge representation and reasoning formalism presented here is a graph formalism - knowledge is represented by labeled graphs, in the graph theory sense, and r- soning mechanisms are based on graph operations, with graph homomorphism at the core. This formalism can thus be considered as related to semantic networks. Since their conception, semantic networks have faded out several times, but have always returned to the limelight. They faded mainly due to a lack of formal semantics and the limited reasoning tools proposed. They have, however, always rebounded - cause labeled graphs, schemas and drawings provide an intuitive and easily und- standable support to represent knowledge. This formalism has the visual qualities of any graphic model, and it is logically founded. This is a key feature because logics has been the foundation for knowledge representation and reasoning for millennia. The authors also focus substantially on computational facets of the presented formalism as they are interested in knowledge representation and reasoning formalisms upon which knowledge-based systems can be built to solve real problems. Since object structures are graphs, naturally graph homomorphism is the key underlying notion and, from a computational viewpoint, this moors calculus to combinatorics and to computer science domains in which the algorithmicqualitiesofgraphshavelongbeenstudied,asindatabasesandconstraint networks.

Læs hele beskrivelsen
Detaljer
  • SprogEngelsk
  • Sidetal444
  • Udgivelsesdato21-10-2008
  • ISBN139781848002852
  • Forlag Springer London Ltd
  • FormatHardback
Størrelse og vægt
  • Vægt1760 g
  • Dybde3,5 cm
  • coffee cup img
    10 cm
    book img
    15,5 cm
    23,5 cm

    Anmeldelser

    Vær den første!

    Log ind for at skrive en anmeldelse.

    Findes i disse kategorier...