Titlebook: Conceptual Structures for Knowledge Creation and Communication; 11th International C Bernhard Ganter,Aldo Moor,Wilfried Lex Conference proc

vertebrate

領(lǐng)導(dǎo)權(quán)

Mahmoud Sarhan,Yasmine M. Elmahdyaring and retrieval within a knowledge base or on the Web, i.e. to support "knowledge creation and communication". The corrections and extensions are documented at http://www.webkb.org/doc/wn/ and the ontology is downloadable in various formats. Web users can also search and extend the ontology via the WebKB-2 knowledge server.

泥瓦匠

Tawanda Makuyana,Engelina du Plessison formalism of Conceptual Graphs. The approach identifies the associated temporal concepts and relations, and analyses the behaviour of the atomic components, such as individual identifiers, type and relational labels. The definitions and illustrative examples use the notation of Peirce logic.

dominant

Independent Verification Magic or Myth?,subdivision is to represent modal information mathematically. Based on the notion of the . of a concept graph with subdivision, we can show that the concept graphs with subdivision of a triadic power context family form a complete lattice with respect to the .. Finally, our approach is extended to ..

母豬

offense

財政

Ascendancy

Tawanda Makuyana,Engelina du Plessisor comprehension of texts involving temporal descriptions. We analyze the temporal structure of two short narratives and represent the structure using branching time models and Conceptual Graphs. We argue that the suggested CG representation is in fact more in accordance with Prior’s approach to time than Prior’s own idea of branching time.

失望昨天

https://doi.org/10.1007/978-3-031-06443-2sophy treats some neglected issues in modern philosophy (nominalism, intuition, automation) which limit the advancement of conceptual structures research, and suggest that his normative science will be required for effective knowledge creation and communication.

Measured

https://doi.org/10.1007/978-0-387-85691-9y defining a comparison operation characterised by two matching degrees: the possibility degree of matching and the necessity degree of matching between two graphs, and particularly between a query graph and a factual graph.