Abstract
Previous work has demonstrated a straightforward mapping from Conceptual Graphs (CGs) to Formal Concept Analysis (FCA), and the combined benefits these types of Conceptual Structures bring in capturing and reasoning about the semantics in system design. As in that work, a CGs Transaction Model (or `Transaction Graph') exemplar is used, but in the form of a richer Financial Trading (FT) case study that has its business rules visualised in Peirce's cuts. The FT case study highlights that cuts can meaningfully be included in the CGs to FCA mapping. Accordingly, the case study's CGs Transaction Graph with its cuts is translated into a form suitable for the CGtoFCA algorithm described in that previous work. The process is tested through the CG-FCA software that implements the CGtoFCA algorithm. The algorithm describes how a Conceptual Graph (CG), represented by triples of the form source-concept, relation, target-concept can be transformed into a set of binary relations of the form target-concept, source-conceptnrelation thus creating a formal context in FCA. Cuts though can now be included in the same formal, rigorous, reproducible and general way. The mapping develops the Transaction Graph into a Transaction Concept, capturing and unifying the features of Conceptual Structures that CGs and FCA collectively embody.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Conceptual Structures and Smart Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
