6th International Conference on Conceptual Structures, ICCS’98 Montpellier, France, August 10–12, 1998 Proceedings
The proposed ANSI standard for conceptual graphs codifies the basic core that has formed the basis for most CG implementations since 1984. Standards are essential for building and sharing development tools and for supporting commercial applications. But the CG community has traditionally been a coalition of researchers who have been actively extending conceptual graphs with a variety of experimental...
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a “concept-centered” normal form,...
The word ‘ontology‘ belongs to the vocabulary of Philosophy, and it is now commonly used in Artificial Intelligence with a rather different meaning. There is nothing wrong here, so long as what is meant remains clear. AI typically claims to use ontology for building ‘conceptual structures‘. Now concepts are named by words, and in the relation concept-word, the goals of AI imply not to move too far...
This paper addresses the issue of directly executing conceptual graphs by developing an execution model that simulates interactions among behavioral concepts and with attributes related to object concepts. While several researchers have proposed various mechanisms for computing or simulating conceptual graphs, but these usually rely on extensions to conceptual graphs. The simulation algorithm described...
The conceptual graph formalism provides all necessary representational primitives needed to model static knowledge. As such, it offers a complete set of knowledge modeling tools, covering a wide range of knowledge modeling requirements. However, the representation of dynamic knowledge falls outside the scope of the actual theory. Dynamic knowledge supposes that transformations of objects are possible...
Validation is an important part of the research work on knowledge based systems. Three kinds of validation have been studied: syntactic validation, logical validation and semantic validation. We are interested in these three kinds of validation for knowledge based systems based on conceptual graphs. This paper focuses on semantic validation. We present a method to check whether a knowledge base is...
In Concurrent Engineering, several participants (designers, managers,...) stemming from different specialities, collaborate in order to build a system. In this paper, we propose a representation with the Conceptual Graph formalism to keep a trace of the design process in Concurrent Engineering as a project memory. Such design process is a cycle of individual design and collaborative evaluation. In...
This paper reports a CG editor implementation which uses canonical formation as the direct manipulation metaphore. The editor is written in Java and embedded within the WekKB indexation tool. The user's mental map is explicitly supported by a separate representation of a graph's visual layout. In addition, co-operative knowledge formulation is supported by network-aware work-sharing features. The...
The Conceptual Graph Interchange Format (CGIF) is a notation for conceptual graphs which is meant for communication between computers. CGIF is represented through a grammar that defines “on-the-wire-representations”. In this paper we argue that for interacting applications in an open distributed environment this is too inefficient both in terms of the application creation process as well as runtime...
TOSCANA is a computer program which allows an online interaction with data bases to analyse and explore data conceptually. Such interaction uses conceptual data systems which are based on formal contexts consisting of relationships between objects and attributes. Those formal contexts often have attributes taken from a thesaurus, which may be understood as ordered set and be completed to a join-semilattice...
This paper presents MULTIKAT, a tool aimed at conflict management during knowledge modeling from multiple experts: this tools allows to compare knowledge of several experts both automatically and cooperatively, when such knowledge is represented through Sowa's conceptual graph formalism. MULTIKAT implements an algorithm of comparison and integration of several supports, and an algorithm of comparison...
This paper presents CoGITaNT, a software development platform for applications based on conceptual graphs. CoGITaNT is a new version of the CoGITo platform, adding simple graph rules and typed nested graphs with coreference links.
We present a formal correspondence between Conceptual Graphs and Description Logics. More precisely, we consider the Simple Conceptual Graphs model provided with type definitions (which we call TSCG) and the ALEOI standard Description Logic. We prove an equivalence between a subset of TSCG and a subset of ALEOI. Based on this equivalence, we suggest extensions of both formalisms while preserving the...
This paper focuses on two aspects of piece resolution in backward chaining for conceptual graph rules [13]. First, as conceptual graphs admit a first-order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we define piece resolution over a class of first-order logical formulae: the logical rules...
In the paper “Conceptual Graphs and Formal Concept Analysis”, the author has presented a first attempt in unifying the Theory of Conceptual Graphs and Formal Concept Analysis. This context-based approach, which is philosophically supported by Peirce's pragmatic epistemology, is grounded on families of related formal contexts whose formal concepts allow a mathematical representation of the concepts...
The Boolean lattices are fundamental algebraic structures in Lattice Theory and Mathematical Logic. Since the triadic approach to Formal Concept Analysis gave rise to the triadic generalization of lattices, the trilattices, it is natural to ask for the triadic analogue of Boolean lattices, the Boolean trilattices. The first step in establishing Boolean trilattices is the study of powerset trilattices...
Conceptual Graphs and Formal Concept Analysis are combined by developing a logical theory for concept graphs of relational contexts. Therefore, concept graphs are introduced as syntactical constructs, and their semantics is defined based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails all...
J.F. Sowa has defined a FOL semantics for Simple Conceptual Graphs and proved the soundness of the graph operation called projection with respect to this semantics. M. Chein and M.L. Mugnier have proved the completeness result, with a restriction on the form of the target graph of the projection. I propose here another FOL semantics for Simple Conceptual Graphs corresponding to a slightly different...
Peirce completed his work on graphical methods for reasoning within prepositional and predicate logic, but left unfinished similar systems for various modal logics. In the present paper, we put forward a system of Peircean graphs for reasoning within the modal logic S5. It is proved that our graph-based formulation of S5 is indeed equivalent to the traditional Hilbert-Frege formulation. Our choice...