2011
DOI: 10.1007/978-3-642-22688-5_5
|View full text |Cite
|
Sign up to set email alerts
|

A Mapping from Conceptual Graphs to Formal Concept Analysis

Abstract: A straightforward mapping from Conceptual Graphs (CGs) to Formal Concept Analysis (FCA) is presented. It is shown that the benefits of FCA can be added to those of CGs, in, for example, formally reasoning about a system design. In the mapping, a formal attribute in FCA is formed by combining a CG source concept with its relation. The corresponding formal object in FCA is the corresponding CG target concept. It is described how a CG, represented by triples of the form source-concept, relation, target-concept, c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
6

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
1

Relationship

5
1

Authors

Journals

citations
Cited by 14 publications
(18 citation statements)
references
References 7 publications
0
12
0
6
Order By: Relevance
“…Additional rigour to CGs logical-level rigour is provided at the mathematical level by another Conceptual Structure, Formal Concept Analysis (FCA), the value of which has been demonstrated including a conversion from CGs to FCA, CG-FCA (Andrews & Polovina, 2011;Polovina & Andrews, 2013). The Transaction Concept in FCA is represented by the FCA Concept Lattice depicted by Figure 3.…”
Section: The Soec Transaction Conceptmentioning
confidence: 99%
“…Additional rigour to CGs logical-level rigour is provided at the mathematical level by another Conceptual Structure, Formal Concept Analysis (FCA), the value of which has been demonstrated including a conversion from CGs to FCA, CG-FCA (Andrews & Polovina, 2011;Polovina & Andrews, 2013). The Transaction Concept in FCA is represented by the FCA Concept Lattice depicted by Figure 3.…”
Section: The Soec Transaction Conceptmentioning
confidence: 99%
“…11), converts a set of triples, T , into a corresponding set of binaries, B , exploiting the direction in the triples as explained above. It is a generalised form of the CGtoFCA algorithm previously presented [5]. Whilst its application to CGs is the focus of this paper, the more general form makes it applicable to directed triples obtained from any source, including UML, RDF, OWL, the Entity-Relation Diagram and linked data.…”
Section: Obtaining Triples From a Conceptual Graph: A Parser For Cgifmentioning
confidence: 99%
“…CGFCA originated with a comparative study to Wille's Concept Graphs as stated earlier, revealing the comparative advantages of CGFCA [5,20]. CGFCAhence Triples2Binaries-is however now at a level of maturity that it can play a useful role whilst recognising the existence of other FCA approaches to triplebased structures, such as Relational Concept Analysis (RCA), EL-Implications and Graph-FCA [6,7,16].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The FCA formal context is generated from the CGs by the CGFCA software 2 [2]. Essentially, this software transforms CGs' underlying concept→relation→concept triples structure into sourceconcept relation→target-concept binaries thereby making them suitable for FCA.…”
Section: Formal Concept Analysismentioning
confidence: 99%