Abstract
The article presents a proposal of the formal symbolic notation operate for basic mathematical concepts. This notation is distinguished by its unambiguousness in terms of key terms used in computer science. This notation defines many concepts such as entity, type, structure definition, compositional relationship and aggregation relationship, references, features related to the admission of variation, ordering, uniqueness, generalisation-specialisation relationship, inheritance, and polymorphism mechanism. Purely mathematical notation operates on concepts that are blurry in the sense of computer science. Moreover, in mathematics, there are no direct mechanisms such as inheritance or polymorphism. They can be defined mathematically in many ways, which can sometimes make it difficult to understand such formalisms in the context of computer science solutions. The proposed solution is a response to a research problem defined in this way. The article also presents a case study illustrating how to apply the proposed method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
state of an entity is determined by the set of values it has.
- 2.
Creating a new entity on the basis of an existing one (copying an entity) creates a new, independent entity. An entity created as a result of copying another entity may be identical with the original entity or not, it all depends on how the relation operator identity is defined, and this in turn must be embedded in context of the type for which it was defined.
- 3.
CRUD – create, read, update, delete.
- 4.
reference type i.e. it is a reference entity, but it points to entities of a specific type.
- 5.
this applies to the intensional aspect.
- 6.
data space The concept of data space has been used informally, without being defined, and only as some kind of intuition related to the data allocation mechanism and its consequent consequences.
- 7.
Properties are understood as specific values of the features, in which case all features take the logical values true or false: \( E, I, O, U \in \left\{ \top , \bot \right\} \).
- 8.
The smallest index value is 1.
- 9.
in other words: “consists of”.
References
Delugach, H.S.: Towards conceptual structures interoperability using common logic. In: CS-TIW, pp. 13–21 (2008)
Evans, A., France, R., Lano, K., Rumpe, B.: The UML as a formal modeling notation. In: Bézivin, J., Muller, P.-A. (eds.) UML 1998. LNCS, vol. 1618, pp. 336–348. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48480-6_26
Hitzler, P.: A review of the semantic web field. Commun. ACM 64(2), 76–83 (2021)
Jodłowiec, M., Krótkiewicz, M.: An approach to expressing metamodels’ semantics in a concept system. In: Fujita, H., Selamat, A., Lin, J.C.-W., Ali, M. (eds.) IEA/AIE 2021. LNCS (LNAI), vol. 12798, pp. 274–282. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79457-6_24
Jodłowiec, M., Krótkiewicz, M., Zabawa, P.: The extended graph generalization as a representation of the metamodels’ extensional layer. In: Fujita, H., Selamat, A., Lin, J.C.-W., Ali, M. (eds.) IEA/AIE 2021. LNCS (LNAI), vol. 12798, pp. 369–382. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79457-6_32
Leivant, D.: Higher order logic. Handbook of Logic in Artificial Intelligence and Logic Programming 2, 229–322 (1994)
OMG: Object Management Group, Unified Modeling Language (UML) superstructure version 2.5 (2015). http://www.omg.org/spec/UML/2.5/
OMG: Object Management Group, Semantics Of Business Vocabulary And Rules 1.5 (2019). http://www.omg.org/spec/SBVR/1.5/
Orłowska, E., Pawlak, Z.: Expressive power of knowledge representation systems. Int. J. Man-Mach. Stud. 20(5), 485–500 (1984). https://doi.org/10.1016/s0020-7373(84)80023-1
Schirrmacher, N., Siebertz, S., Vigny, A.: First-order logic with connectivity operators. In: Manea, F., Simpson, A. (eds.) 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 216, pp. 34:1–34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2022). http://drops.dagstuhl.de/opus/volltexte/2022/15754
Turhan, A.Y.: Description logic reasoning for semantic web ontologies. In: Proceedings of the International Conference on Web Intelligence, Mining and Semantics. WIMS 2011, New York, NY, USA. Association for Computing Machinery (2011). https://doi.org/10.1145/1988688.1988696
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Krótkiewicz, M. (2022). Fundamental Formal Language. In: Nguyen, N.T., Manolopoulos, Y., Chbeir, R., Kozierkiewicz, A., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2022. Lecture Notes in Computer Science(), vol 13501. Springer, Cham. https://doi.org/10.1007/978-3-031-16014-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-031-16014-1_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16013-4
Online ISBN: 978-3-031-16014-1
eBook Packages: Computer ScienceComputer Science (R0)