In this paper, we are interested of the end-user for who have been defined different approaches f... more In this paper, we are interested of the end-user for who have been defined different approaches for Knowledge Discovery in Database (KDD). One of the problems met with these approaches is the big number of generated rules that are not easily assimilated by the human brain. In this paper, we discuss these problems and we propose a pragmatic solution by
New approach for conception and implementation of object oriented expert system using UML
The International Arab Journal of Information Technology, 2009
Since conception is the primary part in the realization of a computer system and in order to help... more Since conception is the primary part in the realization of a computer system and in order to help designers describe their software, several languages and tools such the UML modelling language have been proposed in the literature. UML knew an important success for the conception of object oriented systems. In this paper, we propose a new approach of conception and
Hierarchical verification in maude of Lf P software architectures
Proceedings of the First European Conference on Software Architecture, Sep 24, 2007
Software architecture description languages allow software designers to focus on high level aspec... more Software architecture description languages allow software designers to focus on high level aspects of an application by abstracting from details. In general, a system’s architecture is specified in a hierarchical way. In fact, hierarchical components hide, at each level, the complexity of the sub-entities composing the system. As rewriting logic is a natural semantic framework for representing concurrency, parallelism, communication and interaction, it can be used for systems specification and verification. In this paper, we show how we can take advantage of hierarchical modeling of software systems specified with LfP, to prototype model checking process using Maude system. This approach allows us to hide and show, freely and easily, encapsulated details by moving between hierarchical levels. Thus, state explosion problem is mastered and reduced. In addition, system’s maintainability and error detection become easier and faster.
Maude is an executable rewriting logic language particularly well suited for the specification of... more Maude is an executable rewriting logic language particularly well suited for the specification of object-oriented open and distributed real time systems. In this paper we explore the possibility of using Real-Time Maude as a formal notation for software architecture description and verification of real time systems. The system model is composed of two kinds of descriptions: static and dynamic. The static description consists in identifying the different elements composing the architecture, while the dynamic description is the definition of the rules governing the system behaviour in terms of the possible actions allowed. The correspondence between software architecture concepts and the Real-Time Maude concepts are developed for this purpose. The step towards verifying system architecture is realized by applying Real-Time Maude simulation and analysis techniques to the described model and the properties that must be satisfied. An example is used to illustrate our proposal and to compare it with other architecture description languages.
VISUAL JESS: AN Expandable Visual Generator of Oriented Object Expert systems
... of JESS, its strength and limits are presented in Section 1. The extension of JESS, called VI... more ... of JESS, its strength and limits are presented in Section 1. The extension of JESS, called VISUALJESS that we propose is described in Section 2. Section 3 present the main choices done in the implementation of VISUAL JESS while putting the accent on the extensibility. ...
This research reports on the synthesis of flexible database querying approach based on ordered la... more This research reports on the synthesis of flexible database querying approach based on ordered lattice theory extension to deal with imprecise and structured data. This approach allows us to construct a multi-attributes type abstraction hierarchy structure for the case of decomposition according several attributes. This structure is defined from an ordered lattice theory extension. Our approach consists of two steps: the first step consists in data organization and the second at seeking, to interrogate them, relevant data sources for a given query. The contributions of this approach are a) the interdependence of the query research criteria, b) the research of the relevant data sources for a given query, and d) the scheduling of the results.
This research reports on the synthesis of flexible database querying approach based on ordered la... more This research reports on the synthesis of flexible database querying approach based on ordered lattice theory extension to deal with imprecise and structured data. This approach allows us to construct a multi-attributes type abstraction hierarchy structure for the case of decomposition according several attributes. This structure is defined from an ordered lattice theory extension. Our approach consists of two steps: the first step consists in data organization and the second at seeking, to interrogate them, relevant data sources for a given query. The contributions of this approach are a) the interdependence of the query research criteria, b) the research of the relevant data sources for a given query, and d) the scheduling of the results. Keywords: Fuzzy cluster analysis, formal concept analysis, flexible database querying, concept query, relieving query.
Moved by the need increased for modeling of the fuzzy data, the success of the systems of exact g... more Moved by the need increased for modeling of the fuzzy data, the success of the systems of exact generation of summary of data, we propose in this paper, a new approach of generation of summary from fuzzy data called Fuzzy-SaintEtiQ. This approach is an extension of the SaintEtiQ model to support the fuzzy data. It presents the following optimizations such as 1) the minimization of the expert risk; 2) the construction of a more detailed and more precise summaries hierarchy, and 3) the co-operation with the user by giving him fuzzy summaries in different hierarchical levels
Data is often partially known, vague or ambiguous in many real world applications. To deal with s... more Data is often partially known, vague or ambiguous in many real world applications. To deal with such imprecise information, fuzziness is introduced in the classical model. SQLf is one of the practical language to deal with flexible fuzzy querying in Fuzzy DataBases (FDB). However, with a huge amount of fuzzy data, the necessity to work with synthetic views became a challenge for many DB community researchers. The present work deals with Flexible SQLf query based on fuzzy linguistic summaries. We use the fuzzy summaries produced by our Fuzzy-SaintEtiq approach. It provides a description of objects depending on the fuzzy linguistic labels specified as selection criteria.
Fuzzy relational data bases have been extensively studied in a theoretical level. Unfortunately, ... more Fuzzy relational data bases have been extensively studied in a theoretical level. Unfortunately, the repercussions of these works on the practical plan are negligible. Medina et al. have developed a server named fuzzy SQL, supporting flexible queries and based on a theoretic model called GEFRED. This server has been programmed in PL/SQL language under Oracle database management systems. To model the flexible queries and the concept of fuzzy attributes, an extension of the SQL language named fuzzy SQL has been defined. The FSQL language extends the SQL language, to support the flexible queries, with many fuzzy concepts. The FRDB is supposed has already been defined by the user. In this paper, we extend the work of medina et al. to present a new architecture of fuzzy DBMS based on the GEFRED model. This architecture is based on the concept of weak coupling with the DBMS Oracle. It permits, in particular, the description, the manipulation and the interrogation of FRDB in FSQL language.
Negation is useful in the majority of the real world applications. However, its introduction lead... more Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. We propose in this paper an approach based on stratification to deal with negation problems. This approach is based on an extension of predicates nets. It is characterized with two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimizations on stratified programs (maximal stratification, incremental updates …).
Negation is useful in the majority of the real world applications. However, its introduction lead... more Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. SEPN nets are well adapted extension of predicate nets for the definition and manipulation of stratified programs. This formalism is characterized by two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimization (maximal stratification, incremental updates …). We propose, in this paper, useful algorithms for manipulating stratified programs using SEPN. These algorithms were implemented and validated with STRPRO tool.
In this paper, we are interested of the end-user for who have been defined different approaches f... more In this paper, we are interested of the end-user for who have been defined different approaches for Knowledge Discovery in Database (KDD). One of the problems met with these approaches is the big number of generated rules that are not easily assimilated by the human brain. In this paper, we discuss these problems and we propose a pragmatic solution by
New approach for conception and implementation of object oriented expert system using UML
The International Arab Journal of Information Technology, 2009
Since conception is the primary part in the realization of a computer system and in order to help... more Since conception is the primary part in the realization of a computer system and in order to help designers describe their software, several languages and tools such the UML modelling language have been proposed in the literature. UML knew an important success for the conception of object oriented systems. In this paper, we propose a new approach of conception and
Hierarchical verification in maude of Lf P software architectures
Proceedings of the First European Conference on Software Architecture, Sep 24, 2007
Software architecture description languages allow software designers to focus on high level aspec... more Software architecture description languages allow software designers to focus on high level aspects of an application by abstracting from details. In general, a system’s architecture is specified in a hierarchical way. In fact, hierarchical components hide, at each level, the complexity of the sub-entities composing the system. As rewriting logic is a natural semantic framework for representing concurrency, parallelism, communication and interaction, it can be used for systems specification and verification. In this paper, we show how we can take advantage of hierarchical modeling of software systems specified with LfP, to prototype model checking process using Maude system. This approach allows us to hide and show, freely and easily, encapsulated details by moving between hierarchical levels. Thus, state explosion problem is mastered and reduced. In addition, system’s maintainability and error detection become easier and faster.
Maude is an executable rewriting logic language particularly well suited for the specification of... more Maude is an executable rewriting logic language particularly well suited for the specification of object-oriented open and distributed real time systems. In this paper we explore the possibility of using Real-Time Maude as a formal notation for software architecture description and verification of real time systems. The system model is composed of two kinds of descriptions: static and dynamic. The static description consists in identifying the different elements composing the architecture, while the dynamic description is the definition of the rules governing the system behaviour in terms of the possible actions allowed. The correspondence between software architecture concepts and the Real-Time Maude concepts are developed for this purpose. The step towards verifying system architecture is realized by applying Real-Time Maude simulation and analysis techniques to the described model and the properties that must be satisfied. An example is used to illustrate our proposal and to compare it with other architecture description languages.
VISUAL JESS: AN Expandable Visual Generator of Oriented Object Expert systems
... of JESS, its strength and limits are presented in Section 1. The extension of JESS, called VI... more ... of JESS, its strength and limits are presented in Section 1. The extension of JESS, called VISUALJESS that we propose is described in Section 2. Section 3 present the main choices done in the implementation of VISUAL JESS while putting the accent on the extensibility. ...
This research reports on the synthesis of flexible database querying approach based on ordered la... more This research reports on the synthesis of flexible database querying approach based on ordered lattice theory extension to deal with imprecise and structured data. This approach allows us to construct a multi-attributes type abstraction hierarchy structure for the case of decomposition according several attributes. This structure is defined from an ordered lattice theory extension. Our approach consists of two steps: the first step consists in data organization and the second at seeking, to interrogate them, relevant data sources for a given query. The contributions of this approach are a) the interdependence of the query research criteria, b) the research of the relevant data sources for a given query, and d) the scheduling of the results.
This research reports on the synthesis of flexible database querying approach based on ordered la... more This research reports on the synthesis of flexible database querying approach based on ordered lattice theory extension to deal with imprecise and structured data. This approach allows us to construct a multi-attributes type abstraction hierarchy structure for the case of decomposition according several attributes. This structure is defined from an ordered lattice theory extension. Our approach consists of two steps: the first step consists in data organization and the second at seeking, to interrogate them, relevant data sources for a given query. The contributions of this approach are a) the interdependence of the query research criteria, b) the research of the relevant data sources for a given query, and d) the scheduling of the results. Keywords: Fuzzy cluster analysis, formal concept analysis, flexible database querying, concept query, relieving query.
Moved by the need increased for modeling of the fuzzy data, the success of the systems of exact g... more Moved by the need increased for modeling of the fuzzy data, the success of the systems of exact generation of summary of data, we propose in this paper, a new approach of generation of summary from fuzzy data called Fuzzy-SaintEtiQ. This approach is an extension of the SaintEtiQ model to support the fuzzy data. It presents the following optimizations such as 1) the minimization of the expert risk; 2) the construction of a more detailed and more precise summaries hierarchy, and 3) the co-operation with the user by giving him fuzzy summaries in different hierarchical levels
Data is often partially known, vague or ambiguous in many real world applications. To deal with s... more Data is often partially known, vague or ambiguous in many real world applications. To deal with such imprecise information, fuzziness is introduced in the classical model. SQLf is one of the practical language to deal with flexible fuzzy querying in Fuzzy DataBases (FDB). However, with a huge amount of fuzzy data, the necessity to work with synthetic views became a challenge for many DB community researchers. The present work deals with Flexible SQLf query based on fuzzy linguistic summaries. We use the fuzzy summaries produced by our Fuzzy-SaintEtiq approach. It provides a description of objects depending on the fuzzy linguistic labels specified as selection criteria.
Fuzzy relational data bases have been extensively studied in a theoretical level. Unfortunately, ... more Fuzzy relational data bases have been extensively studied in a theoretical level. Unfortunately, the repercussions of these works on the practical plan are negligible. Medina et al. have developed a server named fuzzy SQL, supporting flexible queries and based on a theoretic model called GEFRED. This server has been programmed in PL/SQL language under Oracle database management systems. To model the flexible queries and the concept of fuzzy attributes, an extension of the SQL language named fuzzy SQL has been defined. The FSQL language extends the SQL language, to support the flexible queries, with many fuzzy concepts. The FRDB is supposed has already been defined by the user. In this paper, we extend the work of medina et al. to present a new architecture of fuzzy DBMS based on the GEFRED model. This architecture is based on the concept of weak coupling with the DBMS Oracle. It permits, in particular, the description, the manipulation and the interrogation of FRDB in FSQL language.
Negation is useful in the majority of the real world applications. However, its introduction lead... more Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. We propose in this paper an approach based on stratification to deal with negation problems. This approach is based on an extension of predicates nets. It is characterized with two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimizations on stratified programs (maximal stratification, incremental updates …).
Negation is useful in the majority of the real world applications. However, its introduction lead... more Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. SEPN nets are well adapted extension of predicate nets for the definition and manipulation of stratified programs. This formalism is characterized by two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimization (maximal stratification, incremental updates …). We propose, in this paper, useful algorithms for manipulating stratified programs using SEPN. These algorithms were implemented and validated with STRPRO tool.
Uploads
Papers by Amel Touzi