Among various approaches to explication of Data-Information-Knowledge-Wisdom Hierarchy (DIKW) we advocate a logic-oriented approach. It stems from analysis of the notion of wisdom which often is understood as the abil...
详细信息
The multiplicity of data structures used in programming complicates analysis and verification of software systems. Nominative data aim to serve as a unified model of different data structures. The main feature of such...
详细信息
ISBN:
(数字)9781728167602
ISBN:
(纸本)9781728167619
The multiplicity of data structures used in programming complicates analysis and verification of software systems. Nominative data aim to serve as a unified model of different data structures. The main feature of such data is usage of complex names to access or modify data components. This leads to a problem considered in the paper: to define and investigate a class of nominative data with complex names (complex-named data), operations on this class, properties of this class (specified as predicates over such data), and compositions of such predicates. We define an algebra of predicates over data with complex names and specify a first order logic that describes general properties of such algebras. For this logic we construct a sequent calculus and prove its soundness and completeness.
The mathematical models of diagrams of using cases of computer systems and information technologies (for Microsoft Visual *** platform) are built in the forms of Glushkov's algorithmic algebra systems, Zeitlin-Pog...
详细信息
The mathematical models of diagrams of using cases of computer systems and information technologies (for Microsoft Visual *** platform) are built in the forms of Glushkov's algorithmic algebra systems, Zeitlin-Pogorilyi's modified algorithmic algebra systems, modified algorithmic algebras and primitive program algebras (PPA), which is an example of programing algebra class of composite type. Property of monotonicity and continuity is established for the branching operation of PPA as the corollary of the representation of branching operation in terms of set-theoretic constructions of function restriction over set using the properties of monotonicity and distributivity of function restriction and whole image of set with respect to binary relation.
暂无评论