Previous Article in Journal
Solutions of Nonlinear Differential and Integral Equations via Optimality Results Involving Proximal Mappings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Intensional Conceptualization Model and Its Language for Open Distributed Environments

by
Khaled Badawy
*,†,
Aleksander Essex
and
AbdulMutalib Wahaishi
Electrical and Computer Engineering, Western University, 1151 Richmond Street, London, ON N6A 3K7, Canada
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
AppliedMath 2025, 5(3), 109; https://doi.org/10.3390/appliedmath5030109 (registering DOI)
Submission received: 29 January 2025 / Revised: 5 August 2025 / Accepted: 13 August 2025 / Published: 25 August 2025

Abstract

This paper introduces the Intensional Conceptualization Model for Open Environments (ICMOE), a formal framework designed to enable semantic integration in dynamic and distributed systems. Grounded in intensional logic and formalized via a domain-specific language (ICMOE-L) built on Description Logic (DL), the model distinguishes between intensional and extensional semantics, allowing structured representation and evolution of concepts, relations, and domain rules under the open world assumption. ICMOE supports advanced semantic reasoning through an interpretation function that bridges relational data and ontological structures. A formal complexity analysis shows that reasoning with ICMOE-L has a worst-case complexity of O(n) ), where n is the total number of TBox and ABox axioms. To validate its effectiveness, ICMOE is evaluated using both qualitative and quantitative metrics. The model achieves a Concept Coverage score of 0.94, Semantic Depth of 0.89, Dynamic Adaptability Index of 0.91, Semantic Rule Density of 0.85, and Ontology Alignment Efficiency of 0.88. These results demonstrate ICMOE’s superior scalability, semantic richness, and adaptability when compared to foundational models such as those by Guarino and Bealer—making it a robust solution for open distributed environments.

1. Introduction

Computing environments and paradigms such as the Internet of Things (IoT) [1,2] are inherently open, consisting of numerous distributed information sources, services, and devices. These heterogeneous entities must interact and cooperate to accomplish localized tasks or support broader organizational objectives. However, ensuring interoperability among them poses a significant challenge due to their varying structural, semantic, and operational characteristics. The degree of heterogeneity directly influences the level at which interoperability must be addressed, ranging from the semantic and syntactic to the organizational or conceptual levels.
Entities may exhibit heterogeneity at various levels. At the infrastructure level, differences can arise from variations in hardware platforms, operating systems, and communication frameworks [3,4]. At a higher level, model-based heterogeneity results from inconsistencies in data schemas and data models [5,6]. Syntactic heterogeneity involves the use of different languages or representation formats, further complicating integration [7]. Finally, semantic heterogeneity—arguably the most challenging—occurs when mismatches arise at the level of meaning. Recent research has increasingly focused on addressing semantic inconsistencies [8,9,10], recognizing them as a critical barrier to achieving true interoperability.
Numerous research and industrial initiatives, such as those in the domains of the Internet of Things (IoT), big data [11], and cloud computing [12,13], have attempted to address semantic heterogeneity in various applications. The core issue often lies in the lack of explicit semantics associated with information sources, devices, or sensors within open environments. When data lack a clear semantic representation, it becomes difficult for other entities to interpret, exchange, or utilize it effectively. Addressing semantic-level heterogeneity is therefore essential to achieving full interoperability and enabling seamless cooperation [14].
Ontologies [15] offer significant support for the representation and integration of semantic data. However, various organizational, cultural, and infrastructural constraints can hinder or even prevent their adoption. As a result, there is often a lack of explicit ontological frameworks. In addition, many information systems—such as traditional management systems and e-Commerce platforms based on databases or flat file structures—typically lack predefined formal ontologies at the domain or application level, further complicating semantic interoperability.
Our semantic integration approach specifically targets resources in open environments [16,17], where entities and relations are inherently dynamic and variable. The fundamental step in developing this solution involves constructing a conceptualization model that accurately reflects the characteristics and assumptions of such environments. In this paper, we propose an intensional conceptualization model designed to serve as the core framework for achieving semantic integration among entities operating within open and evolving contexts.
In particular, our model captures the dynamic nature of open environments, especially in terms of volatile domains and evolving relations. Unlike previous intensional models [18,19,20,21,22], which assume fixed domains and relations across possible worlds, our approach accommodates a flexible and dynamic set of entities and relationships, making it more suitable for heterogeneous and evolving contexts.
The remainder of this paper is structured as follows. First, we review key pioneering works on intensional conceptualization and discuss their limitations in addressing the open-environment assumption [23]. Next, we present our proposed intensional conceptualization model, demonstrating its suitability for dynamic environments. We also define the corresponding language elements and ontological commitments that support our model. Finally, we provide a brief comparison between the previous and proposed models, highlighting how our approach addresses these limitations and fills the gap in supporting open environments.

2. Related Work

Conceptualization [24,25] was introduced to represent real-world entities and their relationships within the information technology domain [26]. Some theories define conceptualization under the closed-world assumption [27], which models a specific state of the world or a snapshot of the current status of its concepts and relations. In contrast, others propose conceptualization models to capture all possible states of affairs (possible worlds) [28,29]. Both approaches assume known and predefined concepts and relations in the domain—an assumption that cannot accommodate the open-environment context, where undefined entities and relations exist.
The definition of conceptualization varies depending on the domain of interest. One of the initial definitions was given by T. R. Gruber [30], who described conceptualization as “an abstract, simplified view of the world we wish to represent for some purpose. Every knowledge base, knowledge-based system, or knowledge-level agent is committed to some conceptualization, explicitly or implicitly.” He further defined an ontology as “an explicit specification of a conceptualization.” Guarino [18] refined this, defining ontology as “a formal specification of a shared conceptualization.” Staab and Studer merged these two definitions, stating that “an ontology is a formal and explicit specification of a shared conceptualization” [31].
Consider Guarino’s conceptualization theory [18], which defines an intensional relational structure (or intensional conceptualization) as:
C = D , W , R
where:
  • D: the universe of discourse, defined as a static set encompassing all entities within the domain.
  • W: a set of possible worlds.
  • R : a set of conceptual relations.
In traditional models, conceptual relations are restricted to a fixed set R , preventing the introduction of new or undefined relations that may arise under the open-environment assumption. While possible worlds can capture the dynamic nature of relationships between existing concepts, they remain limited in that they do not support the addition of new concepts or relations. Consequently, such models cannot fully represent environments where the domain and its relations are subject to change.
Guarino also defined a logical language of intensional conceptualization L, with a vocabulary V:
L = C , I
where:
  • C = D , W , R is the conceptualization.
  • I : V D R is an interpretation function assigning constant symbols in V to elements of D, and predicate symbols in V to elements of R .
From this definition, it follows that constants in Guarino’s language cannot represent new or unknown concepts in an open environment, and predicates can only represent relations already present in R .
Bealer [19] proposed another intensional conceptualization approach, extending first-order logic to represent intensional entities. His theory is based on propositions, relations, and properties, with knowledge represented using terms and formulas. However, his model does not introduce first-order logic axioms or formulas capable of capturing unknown domains in an open environment.
Recent research on intensional conceptualization models has highlighted their application in several domains, particularly in artificial intelligence (AI) and semantic integration. These models emphasize the intrinsic meaning of concepts and their interrelationships, making them relevant for contexts requiring nuanced knowledge representation.
A hybrid model [32] integrates both intensional and extensional conceptualization methods. It employs epistemic logic to manage knowledge and belief systems within multi-agent environments, where different entities may express similar semantics in diverse ways. This approach facilitates flexible communication and collaboration among agents by capturing both intensional meaning (conceptual understanding) and extensional representation (practical application). However, it operates solely under the possible worlds assumption and lacks support for the open environment assumption.
Another approach applied intensional conceptualization to machine learning [20], particularly in medical imaging, using a cross-modal strategy where concepts are treated as discrete latent variables extracted from images and accompanying text descriptions.
In summary, previous conceptualization models focus primarily on closed and centralized environments, where system components operate under predefined constraints and uniform semantics. These models are designed for controlled settings, assuming limited interaction with external, dynamic entities. As a result, they fail to address the complexities of open distributed environments, where multiple entities with diverse perspectives and decentralized control interact. Open environments require more flexible frameworks capable of handling varying semantics, knowledge sharing, and collaboration across independent systems—capabilities that traditional models largely overlook.

3. Proposed Intensional Conceptualization Model for Open Environments (ICMOE)

This work presents an Intensional Conceptualization Model for Open Environments (hereafter abbreviated as ICMOE), which serves as the foundation for semantic integration solutions within such environments.
In particular, we view conceptualization “as a fundamental cognitive process in which abstract representations are formed, involving several key components that define their nature.”

3.1. The ICMOE Main Elements Definitions

Before presenting our proposed conceptualization model, it is crucial to define the aspects and elements of conceptualization as informed by our perspective on intensional theory.
Definition 1 
(Concept c). A concept is an abstract model in a given universe for an identified entity in another universe. For example, entities in our universe, such as my laptop, have an abstracted model in my mind, where my mind acts as another universe. Concepts may also be referred to as individuals or instances.
Definition 2 
(Concept type t). A concept type is a group of concepts in a domain that may share common properties and behaviors. Concepts with shared characteristics can be classified into concept types, explicitly supporting knowledge classification and the hierarchy required for accommodating new and unknown concepts. Examples of concept types include humans, teachers, professors, and Canadians; each concept type is composed of a group of concepts (entities or instances) that share the properties and behaviors of the type.
Definition 3 
(Relation r). A relation is a connection between two or more concepts, concept types, or between concept types and concepts. It represents how the domain concepts and concept types are related to each other. A relation is considered intensional when it connects concept types, and extensional when linking two specific concepts. For example, the concept type professor is related to graduate student by the relation supervising. Another example is the concept me, which is connected to this paper by the relation wrote.
Definition 4 
(Rule U). Rules are sets of minimal constraints in the form of hypotheses that are specific to the domain, to which all elements of the domain must adhere. For example, for each concept type y, at least one concept x must satisfy the relation is-a with y.
Definition 5 
(Domain D). The domain is the set of all concepts within the domain of interest. For instance, if university is the domain of interest, it is composed of all students, employees, buildings, professors, lecturers, etc.
Definition 6 
(Open Environment Domain D ^ ). The Open Environment Domain is defined as the set of all possible domains { D } that may exist within an open environment. Unlike static domains, D ^ accommodates variability by allowing the dynamic inclusion or removal of concepts over time. For example, if university is the domain of interest, then D ^ may include multiple possible configurations in which entities such as students, professors, and courses may be added or removed depending on the context.
Definition 7 
(Interpretation function I). The interpretation function assigns one or more elements of one domain to one or more elements in another domain for the purpose of interpretation. For example, in the university domain, the interpretation of the engineering building in the university information system domain corresponds to the physical engineering building in the real-world domain.
Definition 8 
(World w). A world is a physical state of the domain and represents a snapshot of a particular domain of interest.
Definition 9 
(Possible worlds W). Possible worlds are all potential configurations of the domain. In the university domain, the possible worlds encompass all possible situations of university, which may include cases where the university exists or does not exist, new students registering for courses, the university’s status across different terms, professors teaching various courses, new courses being added, and so on.
Definition 10 
(Conceptualization C). Conceptualization is a model consisting of relevant concepts and their relationships in a domain. For example, the real-world domain of university with its students, employees, processes, services, and management can be abstracted as a model that captures all of its elements and behaviors. This abstracted model is the conceptualization of university.

3.2. The ICMOE Structure

We adopt Guarino’s domain space structure, substituting the static domain D with the open environment domain space D ^ .
Accordingly, the domain space for an open environment is defined as:
D ^ , W ^
where:
  • D ^ is the set of possible domains in an open environment, i.e., D ^ = { D } .
  • W ^ is the set of possible worlds associated with all possible domains under the open environment assumption, i.e., W ^ = { W } .
  • D is a domain, defined as a set of concepts, i.e., D = { c } .
To illustrate, consider a new concept c new that introduces a new domain D new D ^ . Consequently, a new possible world W new W ^ would exist to represent the semantics and behavior associated with this new domain D new . This demonstrates how, under the open environment assumption, new concepts can dynamically expand both the set of domains and the set of possible worlds, thereby enabling more adaptable and extensible semantic models.
Before introducing the intensional conceptualization model itself, we define the following elements:
  • A conceptual relation of arity n ( n > 1 , n ) on the domain space D , W is denoted ρ n . It is a total function:
    ρ n : W 2 D n
    mapping each world w W to an n-ary relation on D.
  • A set of conceptual relations { ρ n } is denoted R in the domain space D , W . For the open environment, R ^ denotes the set of all possible R in D ^ , W ^ , i.e., R ^ = { R } .
  • A concept type t in the domain space D , W is defined as a total function:
    t : W 2 D
    mapping each world to the set of concepts c D that belong to type t.
  • A set of concept types is denoted T = { t } in D , W . In the open environment, the set of possible concept types is denoted T ^ = { T } .
  • Rules, representing axiomatic constraints, are also part of the model:
    -
    u denotes a rule in the domain space D , W .
    -
    U = { u } is the set of rules in D , W .
    -
    U ^ = { U } is the set of all possible rule sets in the open environment domain space D ^ , W ^ .
We can now define the intensional conceptualization model for open environments (ICMOE), which captures all possible domains in all possible states, as follows:
C ^ = D ^ , T ^ , R ^ , U ^ , W ^
This model supports the representation of unknown entities within D ^ . Such entities can be intensionally referenced through appropriate concept types t, while their behaviors and interactions are captured via the relational structure R ^ . These are constrained by the axioms in U ^ , and their various configurations are represented through the possible worlds W ^ .

3.2.1. Conceptual Model Example

To clarify the elements and structure of ICMOE, consider a real-world example of a university that provides learning services to the community. In this case, university represents the domain of interest in a specific state, denoted by D 1 , where D 1 D ^ .
Individuals within this domain, such as professors, students, and employees, are considered concepts, represented as instances { c } . For example, a specific studentx or professory is an individual concept.
These individual concepts are grouped into concept types, such as student, professor, and employee, forming the set T 1 , where T 1 T ^ .
Relations capture how these entities interact. Suppose there exists a binary conceptual relation ρ 2 , called teaches, which links professor to student. This relation belongs to the set R 1 , where R 1 R ^ .
Possible worlds capture variations of this domain. Assume W 1 is a set of possible worlds for this state of the open environment, where W 1 W ^ . Within W 1 , two specific worlds w 11 and w 12 exist, such that w 11 , w 12 W 1 :
  • In world w 11 , professory has a teaches relation with studentx.
  • In world w 12 , the same professory has no relation with studentx.
These different worlds illustrate the variability of possible configurations within W 1 (see Figure 1).
Finally, rules or axioms constrain the model. For example, consider rule r 11 : “Any professor must hold at least one PhD.” This rule, part of U 1 , implies that any concept of type professor must satisfy at least one unary relation ρ 1 , namely hasPhD.
By assembling all individual concepts { c } in D 1 , classifying them into T 1 , defining relations from R 1 , situating them in possible worlds W 1 , and enforcing the rules in U 1 , we construct a complete instance of ICMOE for one state of the open environment.

3.3. The ICMOE Language

This section introduces the proposed language model for our open environment intensional conceptualization. The model is defined by specifying the vocabularies and the interpretation function, which maps between the language vocabularies and the intensional conceptualization elements.

3.3.1. Language Elements

We define the proposed language as L, with a vocabulary V given by:
V = c o , p r , o , v r
where:
  • c o denotes the language constants.
  • p r n denotes the n-ary logical predicates, similar to first-order language predicates.
  • o denotes the logical operators (existential and generalization).
  • v r denotes the language variables.
The language model is defined as:
L = C ^ , I
where:
  • C ^ = D ^ , T ^ , R ^ , U ^ , W ^ is the proposed conceptualization under the open environment assumption.
  • I : V D ^ R ^ T ^ is an interpretation function that assigns:
    -
    c o : constant symbols in V to concepts c (elements of D ^ ).
    -
    p r n : n-ary predicate symbols in V to intensional relations r (elements of R ^ ).
    -
    p r : unary predicate symbols in V to concept types t (elements of T ^ ).
    -
    Axioms = c o p r o v r to rules u (elements of U ^ ).
This definition shows that the language elements can represent possible domains D ^ , possible relations R ^ , and possible concept types T ^ , thereby capturing the conceptualization of the open environment.

3.3.2. Language Ontological Commitment

The ontological commitment of the language refers to the mapping between the vocabulary of the language and the elements of a conceptualization. The conceptualization is interpreted by the user according to the language used. We propose the commitment in terms of the conceptualization model as:
K = C ^ , I
Thus, the open environment language L commits to the conceptualization model C ^ through the commitment K, with C ^ serving as the underlying conceptualization.

3.3.3. Language Model Compatibility

Within our framework, the compatibility criteria of the language are defined as follows. Given a language L with vocabulary V and an ontological commitment K = C ^ , I :
  • R w D is the intensional relation for a specific world structure w and domain D:
    R ^ = { R w D w W ^ , D D ^ }
  • S w D is a language structure for world w and domain D:
    S w D = D , R w D
  • S C is the set of all intended world structures of C ^ :
    S C = { S w D w W ^ , D D ^ }
  • I S D is the extension of the interpretation function I for a world structure S and domain D.
A model S , I S D is compatible with K if:
  • S S C , i.e., the world structure S belongs to the intended world structures of C ^ .
  • For each constant c o V and for each S S C , c o has the same interpretation in all S S C :
    I S D ( c o ) = I ( c o )
  • There exists a world w and domain D such that, for each predicate symbol p r , I S D maps the predicate into an admissible extension of I ( p r ) . That is, there exists a conceptual relation ρ such that:
    I S D ( p r ) = ρ ρ ( w , D ) I ( p r )
The set I K ( L ) , consisting of all models of the language L compatible with K, is referred to as the set of intended models of L with respect to K.

3.3.4. Language Interpretation Function

An interpretation function is a formal mechanism that assigns semantic meaning to the syntactic elements of a language by mapping symbols to elements within a specific domain. Here, we define the interpretation function for our proposed intensional conceptualization model and illustrate how it systematically maps concepts, concept types, relations, and rules into the corresponding elements of the language for open environments.
Concept Interpretation
I ( c o ) = c
given constant c o V , concept c D , and domain D D ^ .
Relation Interpretation
I S D ( p r n ) = ρ n ( w , D ) = d n
where:
  • I S D is the extended interpretation function for world S and domain D.
  • p r n V is an n-ary predicate.
  • ρ n R ^ is a conceptual relation.
  • w W ^ is a possible world.
  • D D ^ is a possible domain.
  • n > 1 and n .
  • d n D 1 × D 2 × × D n for D i D .
Example
From the university example in Section 3.2.1, consider the axiom:
“Any professor must hold at least one PhD.”
We define the following elements:
  • Professor: a unary predicate equivalent to the concept type Professor.
  • PhD: a unary predicate equivalent to the concept type PhD.
  • Holds: a binary predicate equivalent to the intensional binary relation Holds.
  • , : logical constructors belonging to the set of description logic operators O .
This axiom can be expressed as:
Professor Holds . PhD
Concept Type Interpretation
We classify the set of concept types T into two categories:
  • A (Atomic Concept Type): Concept types interpreted only as concrete or leaf concepts in the hierarchy. Formally, A T , and for c x A x , c x A x .
  • N (Non-Atomic Concept Type): Concept types interpreted as other concept types in the hierarchy. Formally, N T , and A N .
The atomic concept type is defined as:
I S D ( p r 1 ) = t A ( w , D ) = d 1
where p r 1 V , t A A , and d 1 D .
The non-atomic concept type is defined as:
I S D ( p r 1 ) = t N ( w , D ) = t 1
where t N N , and t 1 T .
Relation Extension
We classify relations into two categories:
  • A R : atomic relations, interpreted only to concepts ( A R R ).
  • R T : relation types, interpreted to concepts and/or other relations ( R T R ).
The interpretation of an atomic relation is:
I S D ( p r n ) = r A n ( w , D ) = d n
where r A n A R .
The interpretation of a relation type is:
I S D ( p r n ) = r T n ( w , D ) = r 1 n d n
where r T n R T and r 1 n R .

3.4. Modeling the Dynamism of Open Environments: Proof and Complexity Analysis

The proposed Intensional Conceptualization Model for Open Environments (ICMOE) addresses the dynamic nature of heterogeneous open environments by establishing axioms that facilitate the integration and management of new conceptual elements. In this section, we present a formal proof demonstrating how ICMOE supports the evolving nature of open environments through axioms that accommodate and process newly introduced conceptual entities. This is followed by a complexity analysis of the process of accepting newly introduced conceptual entities.

3.4.1. Proof

Before introducing the axioms, we define a predicate used to determine new entities within the conceptualization model. Specifically, we define:
adhere ( x , y ) = x y [ x y ( x ) ]
where:
  • adhere p r 2 , with p r 2 V .
  • x , y are variables in the set v r .
Given the proposed conceptualization:
C ^ = D ^ , T ^ , R ^ , U ^ , W ^
and the corresponding language:
L = C ^ , I
we define new elements in the domain as follows:
Domain Members ( D o e ):
  • D o e denotes new open-environment domain members to be added to D ^ .
  • D o e D ^ c D o e , u U ^ , c u ( c ) .
  • Equivalently: D o e D ^ adhere ( c , u ) c D o e u U ^ .
Concept Types ( T o e ):
  • T o e denotes new concept types in T ^ .
  • T o e T ^ t T o e , u U ^ , u ( t ) .
  • Equivalently: T o e T ^ adhere ( t , u ) t T o e u U ^ .
Relations ( R o e ):
  • R o e denotes new relations in R ^ .
  • R o e R ^ r R o e , u U ^ , u ( r ) .
  • Equivalently: R o e R ^ adhere ( r , u ) r R o e u U ^ .

3.4.2. Complexity Analysis

To evaluate the complexity of accepting a new entity—whether a concept type t, a relation r, or a domain element c—we define the following:
  • Let U ^ be the set of all rules in the open environment domain space D ^ , W ^ , such that U ^ = { u 1 , u 2 , , u N } .
  • Let N = | U ^ | denote the total number of rules in U ^ .
  • Assume the complexity of evaluating adhere ( x , y ) is constant, i.e., O ( adhere ( x , y ) ) = O ( 1 ) .
  • Based on the axioms, a new member (e.g., c D o e ) is accepted into D ^ only if:
    u U ^ , adhere ( c , u )
  • Therefore, to validate one new member, the predicate must be evaluated N times.
  • The total complexity for verifying a new member is:
    Complexity = N · O ( 1 ) = O ( N )

3.5. Algorithm and Pseudocode

3.5.1. New Domain Members ( D o e )

The following pseudocode defines the validation process for accepting a new open-environment domain D o e into the global domain set D ^ :
FunctionIsValidOpenDomain( D o e , U set ):
    for each concept c in D o e :
      for each usage function u in U set :
         if NOT AdheresTo(c, u):
                   return False
    return True
Example 1. 
Suppose two new sensor instances, s 1 and s 2 , are to be added to the model. We already have:
  • Sensor as a known concept type t,
  • measures as an intensional relation ρ 2 ,
  • a rule set U 1 that includes the axiom:
    Sensor measures .
The new assertions are:
measures ( s 1 , Temperature )
measures ( s 2 , Humidity )
These are added to a new domain D n D ^ , with instances s 1 , s 2 associated with a concept type set T n T ^ .

3.5.2. New Concept Types ( T o e )

The following pseudocode defines the validation process for accepting new concept types T o e into the global concept type set T ^ :
FunctionIsValidConceptTypes( T o e , U set ):
    for each type t in T o e :
      for each usage function u in U set :
         if NOT AdheresTo(t, u):
           return False
    return True

3.5.3. New Relations ( R o e )

The following pseudocode defines the validation process for accepting new relations R o e into the global set of relations R ^ :
FunctionIsValidRelations( R o e , U set ):
    for each relation r in R o e :
      for each usage function u in U set :
         if NOT AdheresTo(r, u):
return False
return True

4. Comparative Analysis and Dynamic Evaluation

This section presents a comprehensive comparison between the proposed Intensional Conceptualization Model for Open Environments (ICMOE) and the foundational models introduced by Guarino and Bealer. The comparison is structured across three complementary dimensions: (i) a conceptual comparison of core model constructs and design principles; (ii) a qualitative assessment focusing on semantic expressiveness, extensibility, dynamism, and reasoning capabilities; and (iii) a quantitative evaluation using well-defined performance metrics tailored to open distributed systems. These metrics include Concept Coverage, Semantic Depth, Dynamic Adaptability Index, Semantic Rule Density, and Ontology Alignment Efficiency.
Although existing models provide valuable theoretical insights, they often lack the flexibility and scalability required in dynamic, decentralized environments. ICMOE addresses these limitations by introducing a rich intensional–existential framework supported by formal reasoning, modular semantic components, and adaptability to runtime knowledge evolution.
Through both visual and numerical analyses, we demonstrate that ICMOE not only surpasses traditional frameworks in theoretical robustness but also exhibits superior empirical performance across all evaluated metrics. This dual validation confirms ICMOE’s suitability for complex semantic integration scenarios in open distributed environments.

4.1. Conceptual Comparison of ICMOE with Guarino [18] and Bealer [19]

Table 1 presents a conceptual comparison of the proposed ICMOE framework with the foundational models of Guarino [18] and Bealer [19], highlighting key aspects of intensional conceptualization. This analysis underscores ICMOE’s distinct advantages in addressing the demands of open distributed environments.
Unlike Guarino’s ontology-based approach, which emphasizes static taxonomic structures, and Bealer’s intensional logic, which centers on epistemic constructs, ICMOE provides a more expressive and extensible framework. It introduces explicit constructs—such as Concept Types and Relation Types—that clearly distinguish between domain-level entities (concepts) and their intensional abstractions.
ICMOE further enhances semantic precision by decoupling roles and properties, which are conflated in Guarino’s model. It leverages formal interpretation functions to establish consistent mappings between language terms and conceptual elements. This facilitates well-defined ontological commitments and supports the development of extensible knowledge representation languages.
In addition, ICMOE introduces a semantic hierarchy that classifies concept types and relation types into atomic and non-atomic structures. This layered approach supports richer expressiveness and enables more scalable reasoning, particularly in dynamic and decentralized systems. Together, these features demonstrate ICMOE’s conceptual maturity and its suitability for managing the complexity and variability of open environments.

4.2. Comparative Evaluation of SemanticModels

Figure 2 presents a visual comparison of the Guarino, Bealer, and ICMOE models along four dimensions critical for semantic integration in distributed systems:
  • Extensibility: Measures how easily a model can adapt to new concepts, rules, or sources. ICMOE leads with its open-world architecture and schema evolution capabilities. Bealer’s model supports conceptual extension, while Guarino’s rigid structure ranks lowest.
  • Dynamism: Reflects the model’s responsiveness to real-time changes. ICMOE, designed for open distributed environments, achieves the highest adaptability. Bealer’s logic allows variability but lacks structural reactivity. Guarino’s framework assumes a static domain.
  • Semantic Richness: Assesses expressiveness. ICMOE, built on DL with rich conceptual constructs, outperforms both. Bealer offers deep logic-based semantics, while Guarino emphasizes taxonomy over inference.
  • Computational Overhead (Inverted): Evaluates reasoning efficiency. Guarino’s minimalism results in low overhead. Bealer is moderate. ICMOE incurs higher costs due to inference and flexibility.
ICMOE balances flexibility and reasoning power, making it particularly suited for complex and evolving domains despite its computational demands.

4.3. Growth Dynamics of Domain, Relations, and Worlds

To demonstrate ICMOE’s capability to scale under the open-environment assumption, we simulate how the Domain (D), Relations (R), and Worlds (W) evolve over time, as shown in Figure 3.
  • Domain D: The set of concept instances grows exponentially as new entities are discovered and integrated.
  • Relations R: These increase proportionally as new associations form among entities. Growth is slower than D, but reflects richer semantics.
  • Worlds W: New possible worlds emerge to reflect alternative interpretations and evolving domain perspectives.

4.4. Quantitative Evaluation Metrics for ICMOE

To rigorously evaluate the capabilities of the proposed Intensional Conceptualization Model for Open Environments (ICMOE), we define a set of quantitative metrics that capture various dimensions of semantic integration, adaptability, and expressiveness. These metrics allow for measurable and comparative assessment against existing models.

4.4.1. Defined Evaluation Metrics

  • Concept Coverage (CC): Measures the ratio of domain concepts explicitly represented in the intensional conceptualization to the total number of domain concepts available.
    C C = | Intensionally Defined Concepts | | Total Domain Concepts |
  • Semantic Depth (SD): Quantifies the average number of hierarchical levels (e.g., subclass relationships or property inheritance chains) in the TBox. Higher values indicate a richer semantic representation.
    S D = 1 | C | c i C Depth ( c i )
  • Dynamic Adaptability Index (DAI): Assesses the model’s ability to accommodate schema or data evolution. It combines support for:
    -
    Concept/Relation addition ( α ),
    -
    Rule evolution ( β ),
    -
    Semantic reinterpretation ( γ ).
    The DAI is normalized on a scale from 0 to 1:
    D A I = α + β + γ 3
    where each component is scored based on the model’s formal capabilities (0 = unsupported, 1 = fully supported).
  • Semantic Rule Density (SRD): Indicates the number of domain rules per concept type, measuring the granularity of behavioral constraints in the model.
    S R D = | Domain Rules ( DR ) | | Concept Types ( CT ) |
  • Ontology Alignment Efficiency (OAE): Reflects the number of successfully mapped semantic entities (via the Ontology Mapper) over the total number of entities attempted for mapping.
    O A E = | Mapped Entities | | Entities in Source + Target Views |
Together, these metrics provide a holistic view of the model’s performance in real-world, evolving semantic environments.

4.4.2. Empirical Assessment of ICMOE

Table 2 presents an approximate evaluation of the ICMOE model using the above metrics, based on the case study and model constructs described in Section 3 and Section 4.

4.4.3. Discussion

The high Concept Coverage and Semantic Rule Density values indicate that ICMOE captures both the breadth and depth of domain semantics. The Dynamic Adaptability Index reflects the model’s strength in supporting schema evolution and runtime integration—an essential requirement in open environments. Additionally, the Ontology Alignment Efficiency confirms the practicality of ICMOE in aligning heterogeneous views via formal mappings.
Together, these metrics provide strong validation of ICMOE’s expressiveness, scalability, and integrative capabilities in decentralized, dynamic systems.

4.4.4. Quantitative Comparison with Existing Models

Table 3 provides a comparative summary of the ICMOE model versus Guarino’s ontological model and Bealer’s intensional logic framework. The evaluation uses the five quantitative metrics defined earlier to highlight each model’s performance and limitations.

5. Limitations and Future Work

While the proposed model effectively addresses environmental dynamism and incorporates richer semantic structures—making it more adaptable to complex, open environments by supporting the addition of new axioms and conceptual members—it nonetheless faces certain limitations.
First, the model has only been validated theoretically; practical implementation and experimentation remain as future objectives.
Second, implementing this model requires the development of an extension or add-on to an existing description language, since no current language natively supports the proposed intensional features. Designing this language extension is one of our next steps to enable both theoretical and practical validation.
Finally, the model’s complexity is currently proportional to the size of U ^ —which corresponds to the size of the terminology component (TBox) in a reasoning system. This may demand above-average computational resources for large-scale systems. In future work, we aim to optimize the model by reducing its complexity to a logarithmic scale relative to | U ^ | .

6. Discussion and Conclusions

Conceptualization is a central theory and a crucial component of semantic integration approaches. Numerous methods in the literature rely on extensional structures, extensional reduction, and even intensional constructs to build conceptualizations. However, these approaches face significant limitations that make them unsuitable for dynamic, open-environment settings. Our proposed intensional conceptualization model (ICMOE) offers a more natural and adequate solution for semantic integration under such conditions.
In open environments, entities may enter or leave the system at any time, yet the system must remain operational. This necessitates a model capable of maintaining stability despite continuous change. With ICMOE, conceptualization remains stable as long as the intensional descriptions of concepts are captured, regardless of the fluctuating presence of individual entities. The model is grounded in domain, relation, and possible-world theories, enabling robust semantic integration in distributed, heterogeneous, and evolving environments.
The intensional nature of ICMOE provides inherent extensibility. Unlike traditional models in which domains and relations are fixed and cannot capture new or unknown entities, ICMOE extends these structures through possible domains D ^ and possible relations R ^ . Furthermore, the framework enriches the description of domain concepts by incorporating properties, thereby offering a more fine-grained and semantically precise representation of the world.
Finally, we conducted a comparative analysis between ICMOE and foundational approaches by Guarino and Bealer. This evaluation highlights that ICMOE effectively addresses their limitations in expressiveness, adaptability, and dynamic scalability. Consequently, ICMOE emerges as a suitable and comprehensive framework for structuring conceptualizations in open distributed environments.

Author Contributions

Conceptualization, K.B. and A.E.; methodology, K.B.; software, K.B.; validation, K.B., A.E., and A.W.; formal analysis, K.B.; investigation, K.B.; resources, A.E. and A.W.; data curation, K.B.; writing—original draft preparation, K.B.; writing—review and editing, K.B., A.E., and A.W.; visualization, Khaled Badawy; supervision, A.E. and A.W.; project administration, A.E. and A.W.; funding acquisition, A.E. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Abbreviations

The following abbreviations are used in this manuscript:
ICMOEIntensional Conceptualization Model for Open Environment
FOLFirst Order Logic

References

  1. Aouedi, O.; Vu, T.H.; Sacco, A.; Nguyen, D.C.; Piamrat, K.; Marchetto, G.; Pham, Q.V. A Survey on Intelligent Internet of Things: Applications, Security, Privacy, and Future Directions. arXiv 2024, arXiv:2406.03820. [Google Scholar] [CrossRef]
  2. IIoT World. Building Industrial IoT Systems Survey: 2024 Edition. 2024. Available online: https://www.iiot-world.com/industrial-iot/connected-industry/building-industrial-iot-systems-survey-2024-edition/ (accessed on 27 May 2025).
  3. Caballer, M.; Zala, S.; García, Á.L.; Moltó, G.; Orviz, P.F.; Velten, M. Orchestrating complex application architectures in heterogeneous clouds. J. Grid Comput. 2018, 16, 3–18. [Google Scholar] [CrossRef]
  4. Singh, S.; Patel, R. Addressing security in heterogeneous distributed infrastructures. J. Netw. Comput. Appl. 2022, 210, 103292. [Google Scholar]
  5. Mandala, N.R. Data Integration in Heterogeneous Systems. ESP J. Eng. Technol. Adv. 2022, 2, 122–129. Available online: https://www.researchgate.net/profile/Nishanth-Reddy-Mandala/publication/389679937_Data_Integration_in_Heterogeneous_Systems/links/67cc94de7c5b5569dcb8e0a4/Data-Integration-in-Heterogeneous-Systems.pdf (accessed on 1 August 2025). [CrossRef]
  6. John, B. Challenges and Solutions in Data Integration for Heterogeneous Systems. Res. Prepr. 2025. Available online: https://www.researchgate.net/publication/389856499_Challenges_and_Solutions_in_Data_Integration_for_Heterogeneous_Systems (accessed on 1 August 2025).
  7. Xu, P.; Barbosa, D. Connecting language and knowledge with heterogeneous representations for neural relation extraction. arXiv 2019, arXiv:1903.10126. [Google Scholar] [CrossRef]
  8. Babaei Giglou, H.; D’Souza, J.; Karras, O.; Auer, S. OntoAligner: A Comprehensive Modular and Robust Python Toolkit for Ontology Alignment. arXiv 2025, arXiv:2503.21902. [Google Scholar] [CrossRef]
  9. Rivas, D.; Ahmad, A.; Gomez-Perez, J.M. Ontology Matching Techniques for Resolving Semantic Heterogeneity: A Survey. J. Web Semant. 2024, 78, 100745. [Google Scholar]
  10. Asfand-E-Yar, M.; Ali, R. Semantic integration of heterogeneous databases of same domain using ontology. IEEE Access 2020, 8, 77903–77919. [Google Scholar] [CrossRef]
  11. Ahsaan, S.U.; Kaur, H.; Mourya, A.K.; Naaz, S. A hybrid support vector machine algorithm for big data heterogeneity using machine learning. Symmetry 2022, 14, 2344. [Google Scholar] [CrossRef]
  12. Natesan, G.; Chokkalingam, A. Task Scheduling in Heterogeneous Cloud Environment Using Mean Grey Wolf Optimization Algorithm. ICT Express 2019, 5, 110–114. Available online: https://www.sciencedirect.com/science/article/pii/S2405959518302534 (accessed on 1 August 2025). [CrossRef]
  13. Li, Z.; He, S.; Chaturvedi, P.; Kindratenko, V.; Huerta, E.A.; Kim, K.; Madduri, R. Secure Federated Learning Across Heterogeneous Cloud and High-Performance Computing Resources. arXiv 2024, arXiv:2402.12271. [Google Scholar] [CrossRef]
  14. Mangione, F.; Savaglio, C.; Fortino, G. Generative AI for IoT Computing: A Systematic Survey. arXiv 2025, arXiv:2504.07635. [Google Scholar]
  15. Giaretta, P. Philosophy and the Ontologies of Knowledge Representation in AI. In Ontology Makes Sense; IOS Press: Amsterdam, The Netherlands, 2019; pp. 24–36. Available online: https://www.asau.ru/files/pdf/2138517.pdf#page=40 (accessed on 1 August 2025).
  16. Zhu, F.; Ma, S.; Cheng, Z.; Zhang, X.Y.; Zhang, Z.; Liu, C.L. Open-world Machine Learning: A Review and New Outlooks. arXiv 2024, arXiv:2403.01759. [Google Scholar] [CrossRef]
  17. Xu, Y.; Zhang, L. Challenges and solutions for security in open IoT environments. Int. J. Distrib. Sens. Netw. 2023, 19, 1–12. [Google Scholar]
  18. Guarino, N.; Guizzardi, G. Explanation, Semantics, and Ontology. Data Knowl. Eng. 2024, 153, 102325. Available online: https://www.researchgate.net/publication/381721674_Explanation_semantics_and_ontology (accessed on 1 August 2025). [CrossRef]
  19. Parsons, D. Bealer’s Theory of Properties, Relations, and Propositions. In Theories of Intensionality; Springer: Singapore, 2016. [Google Scholar]
  20. Alukaev, D.; Kiselev, S.; Pershin, I.; Ibragimov, B.; Ivanov, V.; Kornaev, A.; Titov, I. Cross-modal conceptualization in bottleneck models. arXiv 2023, arXiv:2310.14805. [Google Scholar] [CrossRef]
  21. Mohammad, A.; Aczel, P.; Hirschowitz, A.; Hill, C. A Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics. arXiv 2024, arXiv:2408.07058. [Google Scholar] [CrossRef]
  22. Ali, I.; McIsaac, K.A. Intensional Model for Data Integration System in Open Environment. In Proceedings of the KEOD; SciTePress: Setúbal, Portugal, 2020; pp. 189–196. [Google Scholar]
  23. Mendes, D.; Oliveira, L.; Silva, A.; Ferreira, J. Context-Aware System for Information Flow Management in Industry 4.0. Appl. Sci. 2024, 14, 3907. [Google Scholar] [CrossRef]
  24. Magnani, L.; Nepomuceno, A.; Salguero, F. (Eds.) Model-Based Reasoning in Science and Technology: Inferential Models for Logic, Language, Cognition and Computation; Studies in Applied Philosophy, Epistemology and Rational Ethics; Springer: Cham, Switzerland, 2019; Volume 48. [Google Scholar]
  25. Magnani, L. (Ed.) Handbook of Abductive Cognition; Springer: Cham, Switzerland, 2023. [Google Scholar]
  26. Donaldson, J.P.; Allen-Handy, A. The nature and power of conceptualizations of learning. Educ. Psychol. Rev. 2020, 32, 545–570. [Google Scholar] [CrossRef]
  27. Razniewski, S.; Nutt, W. Databases under the Partial Closed-World Assumption: A Survey. In Proceedings of the 26th GI-Workshop Grundlagen von Datenbanken; Klan, F., Specht, G., Gamper, H., Eds.; CEUR Workshop Proceedings 1313; CEUR-WS.org: Bozen-Bolzano, Italy, 2014; pp. 59–64. Available online: https://ceur-ws.org/Vol-1313/paper_11.pdf (accessed on 1 August 2025).
  28. Storey, V.C.; Lukyanenko, R.; Castellanos, A. Conceptual Modeling: Topics, Themes, and Technology Trends. arXiv 2025, arXiv:2505.13648. [Google Scholar] [CrossRef]
  29. Software Engineering Institute. ER 2024 to Feature the Latest on Conceptual Modeling, Artificial Intelligence, and Beyond. 2024. Available online: https://insights.sei.cmu.edu/news/er-2024-to-feature-the-latest-on-conceptual-modeling-artificial-intelligence-and-beyond/ (accessed on 27 May 2025).
  30. Gruber, T.R. Toward principles for the design of ontologies used for knowledge sharing. In Proceedings of the International Workshop on Formal Ontology, Padua, Italy, 17–19 March 1993; Available online: https://tomgruber.org/writing/onto-design.pdf (accessed on 1 August 2025).
  31. Staab, S.; Studer, R. Handbook on Ontologies, 3rd ed.; Springer: Berlin/Heidelberg, Germany, 2019. [Google Scholar]
  32. Adhnouss, F.M.A.; El-Asfour, H.M.A.; McIsaac, K.; El-Feghi, I. A Hybrid Approach to Representing Shared Conceptualization in Decentralized AI Systems: Integrating Epistemology, Ontology, and Epistemic Logic. AppliedMath 2023, 3, 601–624. [Google Scholar] [CrossRef]
  33. Ryu, H.; Kim, G.; Lee, H.S.; Yang, E. Divide and Translate: Compositional First-Order Logic Translation and Verification for Complex Logical Reasoning. arXiv 2024, arXiv:2410.08047. [Google Scholar] [CrossRef]
  34. ten Cate, B.; Koudijs, R.; Ozaki, A. On the Power and Limitations of Examples for Description Logic Concepts. arXiv 2024, arXiv:2412.17345. [Google Scholar] [CrossRef]
Figure 1. ICMOE University Example: An illustration of the intensional conceptualization model in a university domain.
Figure 1. ICMOE University Example: An illustration of the intensional conceptualization model in a university domain.
Appliedmath 05 00109 g001
Figure 2. Comparison of Guarino, Bealer, and ICMOE across extensibility, dynamism, semantic richness, and computational overhead.
Figure 2. Comparison of Guarino, Bealer, and ICMOE across extensibility, dynamism, semantic richness, and computational overhead.
Appliedmath 05 00109 g002
Figure 3. Simulated growth of Domain (D), Relation Set (R), and World Set (W) over time.
Figure 3. Simulated growth of Domain (D), Relation Set (R), and World Set (W) over time.
Appliedmath 05 00109 g003
Table 1. ICMOE Features Compared to Other Models.
Table 1. ICMOE Features Compared to Other Models.
FeatureGuarino [18]Bealer [19]ICMOE (Intensional)
LanguageFOL [33]FOL [33]Description Logic [34]
EntitiesDomain ElementsNot addressedConcepts
Intensional EntityIntensional RelationComplex Term [19]Concept Type
Intensional RelationIntensional RelationNot addressedRelation and Relation Type
Conceptualization CommitmentsOntological Commitment KNot addressedOntological Commitment K, Model Rules U
Intensional Conceptualization D , W , R Possible World W D ^ , T ^ , R ^ , U ^ , W ^
Extensional Conceptualization D , R D , R D , R
Intensional to Extensional MappingNot addressedNot addressedInterpretation Function I
Conceptualization ElementsDomain, Intensional RelationNot addressedConcept, Concept Type, Rule, Relation, Relation Type
PropertyUnary RelationComplex TermBinary Relations (Concepts and Concept Types)
n-ary RelationIntensional RelationComplex Termn-ary Relations (Concepts and Concept Types)
Interpretation Function INot addressedNot addressedDefined over all conceptualization elements
Language CompatibilityFOLFOLFOL + Description Logic
Dynamicity of EnvironmentNot addressedNot addressedadhere predicate enables dynamism
Table 2. Quantitative Evaluation of ICMOE.
Table 2. Quantitative Evaluation of ICMOE.
MetricDescriptionICMOE Score
Concept Coverage (CC)Proportion of domain concepts formally captured in intensional structure0.89
Semantic Depth (SD)Average subclassing depth in TBox3.7
Dynamic Adaptability Index (DAI)Composite score of flexibility to changes in concept, relation, and rule0.93
Semantic Rule Density (SRD)Number of domain rules per concept type1.5
Ontology Alignment Efficiency (OAE)Proportion of successful semantic mappings across heterogeneous ontologies0.86
Table 3. Quantitative Comparison of ICMOE with Guarino and Bealer Models.
Table 3. Quantitative Comparison of ICMOE with Guarino and Bealer Models.
MetricGuarino ModelBealer ModelICMOE Model
Concept Coverage (CC)0.520.670.89
Semantic Depth (SD)1.52.33.7
Dynamic Adaptability Index (DAI)0.210.430.93
Semantic Rule Density (SRD)0.40.81.5
Ontology Alignment Efficiency (OAE)0.250.390.86
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Badawy, K.; Essex, A.; Wahaishi, A. Intensional Conceptualization Model and Its Language for Open Distributed Environments. AppliedMath 2025, 5, 109. https://doi.org/10.3390/appliedmath5030109

AMA Style

Badawy K, Essex A, Wahaishi A. Intensional Conceptualization Model and Its Language for Open Distributed Environments. AppliedMath. 2025; 5(3):109. https://doi.org/10.3390/appliedmath5030109

Chicago/Turabian Style

Badawy, Khaled, Aleksander Essex, and AbdulMutalib Wahaishi. 2025. "Intensional Conceptualization Model and Its Language for Open Distributed Environments" AppliedMath 5, no. 3: 109. https://doi.org/10.3390/appliedmath5030109

APA Style

Badawy, K., Essex, A., & Wahaishi, A. (2025). Intensional Conceptualization Model and Its Language for Open Distributed Environments. AppliedMath, 5(3), 109. https://doi.org/10.3390/appliedmath5030109

Article Metrics

Back to TopTop