Results 1  10
of
23
A Conceptual Graph Model for W3C Resource Description Framework
 Proc. of the 8th International Conference on Conceptual Structures (ICCS'2000
, 2000
"... ..."
(Show Context)
Conceptual Graphs and Formal Concept Analysis
, 1997
"... It is shown how Conceptual Graphs and Formal Concept Analysis may be combined to obtain a formalization of Elementary Logic which is useful for knowledge representation and processing. For this, a translation of conceptual graphs to formal contexts and concept lattices is described through an exampl ..."
Abstract

Cited by 61 (7 self)
 Add to MetaCart
It is shown how Conceptual Graphs and Formal Concept Analysis may be combined to obtain a formalization of Elementary Logic which is useful for knowledge representation and processing. For this, a translation of conceptual graphs to formal contexts and concept lattices is described through an example. Using a suitable mathematization of conceptual graphs, basics of a unified mathematical theory for Elementary Logic are proposed.
Sound and Complete Forward and Backward Chainings of Graph Rules
, 1996
"... This paper presents graph operations for processing conceptual graph rules in forward chaining and backward chaining. In both cases the operations provide sound and complete procedures with respect to firstorder logic deduction. First we present our framework: simple conceptual graphs, rules as cou ..."
Abstract

Cited by 31 (13 self)
 Add to MetaCart
This paper presents graph operations for processing conceptual graph rules in forward chaining and backward chaining. In both cases the operations provide sound and complete procedures with respect to firstorder logic deduction. First we present our framework: simple conceptual graphs, rules as couples of lambdaabstractions, knowledge base, logical semantics. Next we focus on forward chaining. In particular, using the notion of redundancy, we exactly characterize when the application of a rule to a graph enriches or not this graph with a "new" information. The forward mechanism is complete if the knowledge base is in normal form. Basic notions (cut points, pieces, compatible partitions, unification) for backward chaining are detailed. A parallel with previous works on backward chaining is done, in particular with the work of B.C. Ghosh and V. Wuwongse, which is close to ours. The main difference is that we do not split the goals into trivial subgraphs (a relation and its neighbours...
Conceptual Graphs are also Graphs
 LIRMM (CNRS & Universite de Montpellier II), 161, rue Ada, 34392 Montpellier Cedex 5
, 1995
"... . The main objective of this paper is to add one more brick in building the CG model as a knowledge representation model autonomous from logic. The CG model is not only a graphical representation of logic, it is much more: it is a declarative model encoding knowledge in a mathematical theory, na ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
. The main objective of this paper is to add one more brick in building the CG model as a knowledge representation model autonomous from logic. The CG model is not only a graphical representation of logic, it is much more: it is a declarative model encoding knowledge in a mathematical theory, namely labelled graph theory, which has efficient computable forms, with a fundamental graph operation on the encodings to do reasoning, projection, which is a labelled graph morphism. Main topics of this paper are: a generalized formalism for simple CGs; a strong equivalence between CSP (Constraint Satisfaction Problem) and labelled graph morphism. This correspondence allows the transportation of efficient algorithms from one domain to the other, and confirms that projection or more generally labelled graph morphism firmly moors CGs to combinatorial algorithmics, which is a cornerstone of computer science. The usual sound and complete first order logic semantics for CGs is stil...
Basic Conceptual Structures Theory
, 1994
"... Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and reformulations. However, most of these are done in an informal way, which doesn't help in clarifying the issues involved. It i ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and reformulations. However, most of these are done in an informal way, which doesn't help in clarifying the issues involved. It is our hope that this paper will provide a first step towards the complete and rigorous account of Conceptual Structures (CS) Theory, which is needed for ongoing standardization and implementation efforts. Towards that goal, we present formal definitions of some of the central notions of CS theory (type, referent, concept, relation, conceptual graph, canonical formation rules, canon, and canonical graph) in its simplest form, i.e. no contexts nor coreference links are allowed and referents must be individuals. We thereby introduce higherorder types in order to enable the use of conceptual graphs at the metalevel, the restriction operation of the canonical formation rules is extended to make use o...
A Viewpoint Model for Cooperative Building of an Ontology
 Proc. of the 10th International Conference in Conceptual Structures (ICCS’2002), SpringerVerlag, LNCS 2393
, 2002
"... Abstract. This paper presents the CVISTA model enabling viewpoint representation for improving knowledge modelling from several experts: this model can thus be used for cooperative building of an ontology. We describe the CVISTA model in the framework of conceptual graph formalism. 1 ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents the CVISTA model enabling viewpoint representation for improving knowledge modelling from several experts: this model can thus be used for cooperative building of an ontology. We describe the CVISTA model in the framework of conceptual graph formalism. 1
Accounting for Domain Knowledge in the Construction of a Generalization Space
 In Proceedings of the Third International Conference on Conceptual Structures
, 1997
"... . Our study registers in the framework of the automatic construction of classifications. We tackle an issue which has been less explored, that of the discovery of classifications. To tackle this problem we have chosen to pursue and develop the works of Mineau in the domain of the organization of ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
. Our study registers in the framework of the automatic construction of classifications. We tackle an issue which has been less explored, that of the discovery of classifications. To tackle this problem we have chosen to pursue and develop the works of Mineau in the domain of the organization of knowledge bases using generalization [20]. We propose an original approach, called COING, to the discovery of classifications of structured objects represented using conceptual graphs. This approach consists in building a space of concepts which generalize the objects descriptions, called the Generalization Space, and then exploring this space so as to iteratively extract one or several conceptual classifications [2]. In this paper, we describe the method of construction of the Generalization Space that has been implemented in COING. This method is an extension of the MSG proposed by Mineau [19], which enables to account for knowledge about the types during the construction of the...
Requirements modelling and formal analysis using graph operations
 International Journal of Production Research
, 2006
"... The increasing complexity of enterprise systems requires a more advanced analysis about the representation of services expected than is currently possible. Consequently, the specification stage, which could be facilitated by formal verification, becomes very important to the system life cycle. This ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
The increasing complexity of enterprise systems requires a more advanced analysis about the representation of services expected than is currently possible. Consequently, the specification stage, which could be facilitated by formal verification, becomes very important to the system life cycle. This paper presents a formal modelling approach, which may be used in order to better represent the reality of the system and to verify the awaited or existing system’s properties, taking into account the environmental characteristics. For that, we firstly propose a formalization process based upon properties specification, and secondly we use Conceptual Graphs operations to develop reasoning mechanisms of verifying requirements statements. The graphic visualization of these reasoning enables us to correctly capture the system specifications by making easier to determine if desired properties hold. It is applied to the field of the Enterprise modelling. Keywords:
Conceptual graphs for Semantic Web applications
 PROC. ICCS 2005. VOLUME 3596 OF LNCS
, 2005
"... In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several realworld applications in the framework of Corporate Semantic Webs. We describe the RDF(S)dedicated semantic search engine, CORESE, based on a correspondence between RDF(S) and Concep ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several realworld applications in the framework of Corporate Semantic Webs. We describe the RDF(S)dedicated semantic search engine, CORESE, based on a correspondence between RDF(S) and Conceptual Graphs, and we illustrate the interest of Conceptual Graphs through the analysis of several realworld applications based on CORESE.