株式会社極東書店トップ > 商品一覧 > Graph-based Knowledge Representation : Computational Foundations of Conceptual Graphs. Softcover reprint of hardcover 1st ed. 2009.
商品詳細
Graph-based Knowledge Representation : Computational Foundations of Conceptual Graphs. Softcover reprint of hardcover 1st ed. 2009.
・ISBN 978-1-84996-769-3 paper EUR 179.99
¥48,110.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Chein, Michel / Mugnier, Marie-Laure, |
|---|---|
| シリーズ | Advanced Information and Knowledge Processing |
| 出版社 | (Springer London Ltd, UK) |
| 出版年月 | 2010 |
| ページ数 | 428 pp. |
| 言語 | ENG |
| ニュース番号 | <M25-25054> |
解説
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.