A study of query answering in prioritized ontological knowledge bases (KBs) has received attention in recent years. While several semantics of query answering have been proposed and their complexity is rather well-understood, the problem of explaining inconsistency-tolerant query answers has paid less attention. Explaining query answers permits users to understand not only what is entailed or not entailed by an inconsistent description logic DL-LiteR KBs in the presence of priority, but also why. We, therefore, concern with the use of argumentation frameworks to allow users to better understand explanation techniques of querying answers over inconsistent DLLiteR KBs in the presence of priority. More specifically, we propose a new variant of Dung’s argumentation frameworks, which corresponds to a given inconsistent DLLiteR KB. We clarify a close relation between preferred subtheories adopted in such prioritized DL-LiteR setting and acceptable semantics of the corresponding argumentation framework. The significant result paves the way for applying algorithms and proof theories to establish preferred subtheories inferences in prioritized DL-LiteR KBs.
AN IMPLEMENTATION, EMPIRICAL EVALUATION AND PROPOSED IMPROVEMENT FOR BIDIRECT...ijaia
Abstract argumentation frameworks are formal systems that facilitate obtaining conclusions from nonmonotonic knowledge systems. Within such a system, an argumentation semantics is defined as a set of arguments with some desired qualities, for example, that the elements are not in conflict with each other.
Splitting an argumentation framework can efficiently speed up the computation of argumentation semantics. With respect to stable semantics, two methods have been proposed to split an argumentation framework either in a unidirectional or bidirectional fashion. The advantage of bidirectional splitting is
that it is not structure-dependent and, unlike unidirectional splitting, it can be used for frameworks consisting of a single strongly connected component. Bidirectional splitting makes use of a minimum cut. In this paper, we implement and test the performance of the bidirectional splitting method, along with two
types of graph cut algorithms. Experimental data suggest that using a minimum cut will not improve the performance of computing stable semantics in most cases. Hence, instead of a minimum cut, we propose to use a balanced cut, where the framework is split into two sub-frameworks of equal size. Experimental results conducted on bidirectional splitting using the balanced cut show a significant improvement in the performance of computing semantics.
HOLISTIC EVALUATION OF XML QUERIES WITH STRUCTURAL PREFERENCES ON AN ANNOTATE...ijseajournal
With the emergence of XML as de facto format for storing and exchanging information over the Internet, the search for ever more innovative and effective techniques for their querying is a major and current concern of the XML database community. Several studies carried out to help solve this problem are mostly oriented towards the evaluation of so-called exact queries which, unfortunately, are likely (especially in the case of semi-structured documents) to yield abundant results (in the case of vague queries) or empty results (in the case of very precise queries). From the observation that users who make requests are not necessarily interested in all possible solutions, but rather in those that are closest to their needs, an important field of research has been opened on the evaluation of preferences queries. In this paper, we propose an approach for the evaluation of such queries, in case the preferences concern the structure of the document. The solution investigated revolves around the proposal of an evaluation plan in three phases: rewriting-evaluation-merge. The rewriting phase makes it possible to obtain, from a partitioningtransformation operation of the initial query, a hierarchical set of preferences path queries which are holistically evaluated in the second phase by an instrumented version of the algorithm TwigStack. The merge phase is the synthesis of the best results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/09/knowledgeengineering-fall2011.html
and http://www.jarrar.info
and on Youtube:
http://www.youtube.com/watch?v=3_-HGnI6AZ0&list=PLDEA50C29F3D28257
AN IMPLEMENTATION, EMPIRICAL EVALUATION AND PROPOSED IMPROVEMENT FOR BIDIRECT...ijaia
Abstract argumentation frameworks are formal systems that facilitate obtaining conclusions from nonmonotonic knowledge systems. Within such a system, an argumentation semantics is defined as a set of arguments with some desired qualities, for example, that the elements are not in conflict with each other.
Splitting an argumentation framework can efficiently speed up the computation of argumentation semantics. With respect to stable semantics, two methods have been proposed to split an argumentation framework either in a unidirectional or bidirectional fashion. The advantage of bidirectional splitting is
that it is not structure-dependent and, unlike unidirectional splitting, it can be used for frameworks consisting of a single strongly connected component. Bidirectional splitting makes use of a minimum cut. In this paper, we implement and test the performance of the bidirectional splitting method, along with two
types of graph cut algorithms. Experimental data suggest that using a minimum cut will not improve the performance of computing stable semantics in most cases. Hence, instead of a minimum cut, we propose to use a balanced cut, where the framework is split into two sub-frameworks of equal size. Experimental results conducted on bidirectional splitting using the balanced cut show a significant improvement in the performance of computing semantics.
HOLISTIC EVALUATION OF XML QUERIES WITH STRUCTURAL PREFERENCES ON AN ANNOTATE...ijseajournal
With the emergence of XML as de facto format for storing and exchanging information over the Internet, the search for ever more innovative and effective techniques for their querying is a major and current concern of the XML database community. Several studies carried out to help solve this problem are mostly oriented towards the evaluation of so-called exact queries which, unfortunately, are likely (especially in the case of semi-structured documents) to yield abundant results (in the case of vague queries) or empty results (in the case of very precise queries). From the observation that users who make requests are not necessarily interested in all possible solutions, but rather in those that are closest to their needs, an important field of research has been opened on the evaluation of preferences queries. In this paper, we propose an approach for the evaluation of such queries, in case the preferences concern the structure of the document. The solution investigated revolves around the proposal of an evaluation plan in three phases: rewriting-evaluation-merge. The rewriting phase makes it possible to obtain, from a partitioningtransformation operation of the initial query, a hierarchical set of preferences path queries which are holistically evaluated in the second phase by an instrumented version of the algorithm TwigStack. The merge phase is the synthesis of the best results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/09/knowledgeengineering-fall2011.html
and http://www.jarrar.info
and on Youtube:
http://www.youtube.com/watch?v=3_-HGnI6AZ0&list=PLDEA50C29F3D28257
In this natural language understanding (NLU) project, we implemented and compared various approaches for predicting the topics of paragraph-length texts. This paper explains our methodology and results for the following approaches: Naive Bayes, One-vs-Rest Support Vector Machine (OvR SVM) with GloVe vectors, Latent Dirichlet Allocation (LDA) with OvR SVM, Convolutional Neural Networks (CNN), and Long Short Term Memory networks (LSTM).
Many of previous research have proven that the usage of rhetorical relations is capable to enhance many applications such as text summarization, question answering and natural language generation. This work proposes an approach that expands the benefit of rhetorical
relations to address redundancy problem in text summarization. We first examined and redefined the type of rhetorical relations that is useful to retrieve sentences with identical content and performed the identification of those relations using SVMs. By exploiting the
rhetorical relations exist between sentences, we generate clusters of similar sentences from document sets. Then, cluster-based text summarization is performed using Conditional Markov Random Walk Model to measure the saliency scores of candidates summary. We evaluated our
method by measuring the cohesion and separation of the clusters and ROUGE score of generated summaries. The experimental result shows that our method performed well which shows promising potential of applying rhetorical relation in cluster-based text summarization.
A Document Exploring System on LDA Topic Model for Wikipedia Articlesijma
A Large number of digital text information is generated every day. Effectively searching, managing and
exploring the text data has become a main task. In this paper, we first present an introduction to text
mining and LDA topic model. Then we deeply explained how to apply LDA topic model to text corpus by
doing experiments on Simple Wikipedia documents. The experiments include all necessary steps of data
retrieving, pre-processing, fitting the model and an application of document exploring system. The result of
the experiments shows LDA topic model working effectively on documents clustering and finding the
similar documents. Furthermore, the document exploring system could be a useful research tool for
students and researchers.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
Extractive Document Summarization - An Unsupervised ApproachFindwise
In this paper we present and evaluate a system for automatic extractive document summarization. We employ three different unsupervised algorithms for sentence ranking - TextRank, K-means clustering and previously unexplored in this field, one- class SVM. By adding language and domain specific boosting we achieve state-of-the-art performance for English measured in ROUGE Ngram(1,1) score on the DUC 2002 dataset - 0,4797. In addition, the system can be used for both single and multi document summarization. We also present results for Swedish, based on a new corpus - featured Wikipedia articles.
ONTOLOGY INTEGRATION APPROACHES AND ITS IMPACT ON TEXT CATEGORIZATIONIJDKP
This article will introduce some approaches for improving text categorization models by integrating
previously imported ontologies. From the Reuters Corpus Volume I (RCV1) dataset, some categories very
similar in content and related to telecommunications, Internet and computer areas were selected for models
experiments. Several domain ontologies, covering these areas were built and integrated to categorization
models for their improvements.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Automated building of taxonomies for search enginesBoris Galitsky
We build a taxonomy of entities which is intended to improve the relevance of search engine in a vertical domain. The taxonomy construction process starts from the seed entities and mines the web for new entities associated with them. To form these new entities, machine learning of syntactic parse trees (their generalization) is applied to the search results for existing entities to form commonalities between them. These commonality expressions then form parameters of existing entities, and are turned into new entities at the next learning iteration.
Taxonomy and paragraph-level syntactic generalization are applied to relevance improvement in search and text similarity assessment. We conduct an evaluation of the search relevance improvement in vertical and horizontal domains and observe significant contribution of the learned taxonomy in the former, and a noticeable contribution of a hybrid system in the latter domain. We also perform industrial evaluation of taxonomy and syntactic generalization-based text relevance assessment and conclude that proposed algorithm for automated taxonomy learning is suitable for integration into industrial systems. Proposed algorithm is implemented as a part of Apache OpenNLP.Similarity project.
Bibliometric analysis highlighting the role of women in addressing climate ch...IJECEIAES
Fossil fuel consumption increased quickly, contributing to climate change
that is evident in unusual flooding and draughts, and global warming. Over
the past ten years, women's involvement in society has grown dramatically,
and they succeeded in playing a noticeable role in reducing climate change.
A bibliometric analysis of data from the last ten years has been carried out to
examine the role of women in addressing the climate change. The analysis's
findings discussed the relevant to the sustainable development goals (SDGs),
particularly SDG 7 and SDG 13. The results considered contributions made
by women in the various sectors while taking geographic dispersion into
account. The bibliometric analysis delves into topics including women's
leadership in environmental groups, their involvement in policymaking, their
contributions to sustainable development projects, and the influence of
gender diversity on attempts to mitigate climate change. This study's results
highlight how women have influenced policies and actions related to climate
change, point out areas of research deficiency and recommendations on how
to increase role of the women in addressing the climate change and
achieving sustainability. To achieve more successful results, this initiative
aims to highlight the significance of gender equality and encourage
inclusivity in climate change decision-making processes.
Voltage and frequency control of microgrid in presence of micro-turbine inter...IJECEIAES
The active and reactive load changes have a significant impact on voltage
and frequency. In this paper, in order to stabilize the microgrid (MG) against
load variations in islanding mode, the active and reactive power of all
distributed generators (DGs), including energy storage (battery), diesel
generator, and micro-turbine, are controlled. The micro-turbine generator is
connected to MG through a three-phase to three-phase matrix converter, and
the droop control method is applied for controlling the voltage and
frequency of MG. In addition, a method is introduced for voltage and
frequency control of micro-turbines in the transition state from gridconnected mode to islanding mode. A novel switching strategy of the matrix
converter is used for converting the high-frequency output voltage of the
micro-turbine to the grid-side frequency of the utility system. Moreover,
using the switching strategy, the low-order harmonics in the output current
and voltage are not produced, and consequently, the size of the output filter
would be reduced. In fact, the suggested control strategy is load-independent
and has no frequency conversion restrictions. The proposed approach for
voltage and frequency regulation demonstrates exceptional performance and
favorable response across various load alteration scenarios. The suggested
strategy is examined in several scenarios in the MG test systems, and the
simulation results are addressed.
More Related Content
Similar to Reasoning in inconsistent prioritized knowledge bases: an argumentative approach
In this natural language understanding (NLU) project, we implemented and compared various approaches for predicting the topics of paragraph-length texts. This paper explains our methodology and results for the following approaches: Naive Bayes, One-vs-Rest Support Vector Machine (OvR SVM) with GloVe vectors, Latent Dirichlet Allocation (LDA) with OvR SVM, Convolutional Neural Networks (CNN), and Long Short Term Memory networks (LSTM).
Many of previous research have proven that the usage of rhetorical relations is capable to enhance many applications such as text summarization, question answering and natural language generation. This work proposes an approach that expands the benefit of rhetorical
relations to address redundancy problem in text summarization. We first examined and redefined the type of rhetorical relations that is useful to retrieve sentences with identical content and performed the identification of those relations using SVMs. By exploiting the
rhetorical relations exist between sentences, we generate clusters of similar sentences from document sets. Then, cluster-based text summarization is performed using Conditional Markov Random Walk Model to measure the saliency scores of candidates summary. We evaluated our
method by measuring the cohesion and separation of the clusters and ROUGE score of generated summaries. The experimental result shows that our method performed well which shows promising potential of applying rhetorical relation in cluster-based text summarization.
A Document Exploring System on LDA Topic Model for Wikipedia Articlesijma
A Large number of digital text information is generated every day. Effectively searching, managing and
exploring the text data has become a main task. In this paper, we first present an introduction to text
mining and LDA topic model. Then we deeply explained how to apply LDA topic model to text corpus by
doing experiments on Simple Wikipedia documents. The experiments include all necessary steps of data
retrieving, pre-processing, fitting the model and an application of document exploring system. The result of
the experiments shows LDA topic model working effectively on documents clustering and finding the
similar documents. Furthermore, the document exploring system could be a useful research tool for
students and researchers.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
Extractive Document Summarization - An Unsupervised ApproachFindwise
In this paper we present and evaluate a system for automatic extractive document summarization. We employ three different unsupervised algorithms for sentence ranking - TextRank, K-means clustering and previously unexplored in this field, one- class SVM. By adding language and domain specific boosting we achieve state-of-the-art performance for English measured in ROUGE Ngram(1,1) score on the DUC 2002 dataset - 0,4797. In addition, the system can be used for both single and multi document summarization. We also present results for Swedish, based on a new corpus - featured Wikipedia articles.
ONTOLOGY INTEGRATION APPROACHES AND ITS IMPACT ON TEXT CATEGORIZATIONIJDKP
This article will introduce some approaches for improving text categorization models by integrating
previously imported ontologies. From the Reuters Corpus Volume I (RCV1) dataset, some categories very
similar in content and related to telecommunications, Internet and computer areas were selected for models
experiments. Several domain ontologies, covering these areas were built and integrated to categorization
models for their improvements.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Automated building of taxonomies for search enginesBoris Galitsky
We build a taxonomy of entities which is intended to improve the relevance of search engine in a vertical domain. The taxonomy construction process starts from the seed entities and mines the web for new entities associated with them. To form these new entities, machine learning of syntactic parse trees (their generalization) is applied to the search results for existing entities to form commonalities between them. These commonality expressions then form parameters of existing entities, and are turned into new entities at the next learning iteration.
Taxonomy and paragraph-level syntactic generalization are applied to relevance improvement in search and text similarity assessment. We conduct an evaluation of the search relevance improvement in vertical and horizontal domains and observe significant contribution of the learned taxonomy in the former, and a noticeable contribution of a hybrid system in the latter domain. We also perform industrial evaluation of taxonomy and syntactic generalization-based text relevance assessment and conclude that proposed algorithm for automated taxonomy learning is suitable for integration into industrial systems. Proposed algorithm is implemented as a part of Apache OpenNLP.Similarity project.
Bibliometric analysis highlighting the role of women in addressing climate ch...IJECEIAES
Fossil fuel consumption increased quickly, contributing to climate change
that is evident in unusual flooding and draughts, and global warming. Over
the past ten years, women's involvement in society has grown dramatically,
and they succeeded in playing a noticeable role in reducing climate change.
A bibliometric analysis of data from the last ten years has been carried out to
examine the role of women in addressing the climate change. The analysis's
findings discussed the relevant to the sustainable development goals (SDGs),
particularly SDG 7 and SDG 13. The results considered contributions made
by women in the various sectors while taking geographic dispersion into
account. The bibliometric analysis delves into topics including women's
leadership in environmental groups, their involvement in policymaking, their
contributions to sustainable development projects, and the influence of
gender diversity on attempts to mitigate climate change. This study's results
highlight how women have influenced policies and actions related to climate
change, point out areas of research deficiency and recommendations on how
to increase role of the women in addressing the climate change and
achieving sustainability. To achieve more successful results, this initiative
aims to highlight the significance of gender equality and encourage
inclusivity in climate change decision-making processes.
Voltage and frequency control of microgrid in presence of micro-turbine inter...IJECEIAES
The active and reactive load changes have a significant impact on voltage
and frequency. In this paper, in order to stabilize the microgrid (MG) against
load variations in islanding mode, the active and reactive power of all
distributed generators (DGs), including energy storage (battery), diesel
generator, and micro-turbine, are controlled. The micro-turbine generator is
connected to MG through a three-phase to three-phase matrix converter, and
the droop control method is applied for controlling the voltage and
frequency of MG. In addition, a method is introduced for voltage and
frequency control of micro-turbines in the transition state from gridconnected mode to islanding mode. A novel switching strategy of the matrix
converter is used for converting the high-frequency output voltage of the
micro-turbine to the grid-side frequency of the utility system. Moreover,
using the switching strategy, the low-order harmonics in the output current
and voltage are not produced, and consequently, the size of the output filter
would be reduced. In fact, the suggested control strategy is load-independent
and has no frequency conversion restrictions. The proposed approach for
voltage and frequency regulation demonstrates exceptional performance and
favorable response across various load alteration scenarios. The suggested
strategy is examined in several scenarios in the MG test systems, and the
simulation results are addressed.
Enhancing battery system identification: nonlinear autoregressive modeling fo...IJECEIAES
Precisely characterizing Li-ion batteries is essential for optimizing their
performance, enhancing safety, and prolonging their lifespan across various
applications, such as electric vehicles and renewable energy systems. This
article introduces an innovative nonlinear methodology for system
identification of a Li-ion battery, employing a nonlinear autoregressive with
exogenous inputs (NARX) model. The proposed approach integrates the
benefits of nonlinear modeling with the adaptability of the NARX structure,
facilitating a more comprehensive representation of the intricate
electrochemical processes within the battery. Experimental data collected
from a Li-ion battery operating under diverse scenarios are employed to
validate the effectiveness of the proposed methodology. The identified
NARX model exhibits superior accuracy in predicting the battery's behavior
compared to traditional linear models. This study underscores the
importance of accounting for nonlinearities in battery modeling, providing
insights into the intricate relationships between state-of-charge, voltage, and
current under dynamic conditions.
Smart grid deployment: from a bibliometric analysis to a surveyIJECEIAES
Smart grids are one of the last decades' innovations in electrical energy.
They bring relevant advantages compared to the traditional grid and
significant interest from the research community. Assessing the field's
evolution is essential to propose guidelines for facing new and future smart
grid challenges. In addition, knowing the main technologies involved in the
deployment of smart grids (SGs) is important to highlight possible
shortcomings that can be mitigated by developing new tools. This paper
contributes to the research trends mentioned above by focusing on two
objectives. First, a bibliometric analysis is presented to give an overview of
the current research level about smart grid deployment. Second, a survey of
the main technological approaches used for smart grid implementation and
their contributions are highlighted. To that effect, we searched the Web of
Science (WoS), and the Scopus databases. We obtained 5,663 documents
from WoS and 7,215 from Scopus on smart grid implementation or
deployment. With the extraction limitation in the Scopus database, 5,872 of
the 7,215 documents were extracted using a multi-step process. These two
datasets have been analyzed using a bibliometric tool called bibliometrix.
The main outputs are presented with some recommendations for future
research.
Use of analytical hierarchy process for selecting and prioritizing islanding ...IJECEIAES
One of the problems that are associated to power systems is islanding
condition, which must be rapidly and properly detected to prevent any
negative consequences on the system's protection, stability, and security.
This paper offers a thorough overview of several islanding detection
strategies, which are divided into two categories: classic approaches,
including local and remote approaches, and modern techniques, including
techniques based on signal processing and computational intelligence.
Additionally, each approach is compared and assessed based on several
factors, including implementation costs, non-detected zones, declining
power quality, and response times using the analytical hierarchy process
(AHP). The multi-criteria decision-making analysis shows that the overall
weight of passive methods (24.7%), active methods (7.8%), hybrid methods
(5.6%), remote methods (14.5%), signal processing-based methods (26.6%),
and computational intelligent-based methods (20.8%) based on the
comparison of all criteria together. Thus, it can be seen from the total weight
that hybrid approaches are the least suitable to be chosen, while signal
processing-based methods are the most appropriate islanding detection
method to be selected and implemented in power system with respect to the
aforementioned factors. Using Expert Choice software, the proposed
hierarchy model is studied and examined.
Enhancing of single-stage grid-connected photovoltaic system using fuzzy logi...IJECEIAES
The power generated by photovoltaic (PV) systems is influenced by
environmental factors. This variability hampers the control and utilization of
solar cells' peak output. In this study, a single-stage grid-connected PV
system is designed to enhance power quality. Our approach employs fuzzy
logic in the direct power control (DPC) of a three-phase voltage source
inverter (VSI), enabling seamless integration of the PV connected to the
grid. Additionally, a fuzzy logic-based maximum power point tracking
(MPPT) controller is adopted, which outperforms traditional methods like
incremental conductance (INC) in enhancing solar cell efficiency and
minimizing the response time. Moreover, the inverter's real-time active and
reactive power is directly managed to achieve a unity power factor (UPF).
The system's performance is assessed through MATLAB/Simulink
implementation, showing marked improvement over conventional methods,
particularly in steady-state and varying weather conditions. For solar
irradiances of 500 and 1,000 W/m2
, the results show that the proposed
method reduces the total harmonic distortion (THD) of the injected current
to the grid by approximately 46% and 38% compared to conventional
methods, respectively. Furthermore, we compare the simulation results with
IEEE standards to evaluate the system's grid compatibility.
Enhancing photovoltaic system maximum power point tracking with fuzzy logic-b...IJECEIAES
Photovoltaic systems have emerged as a promising energy resource that
caters to the future needs of society, owing to their renewable, inexhaustible,
and cost-free nature. The power output of these systems relies on solar cell
radiation and temperature. In order to mitigate the dependence on
atmospheric conditions and enhance power tracking, a conventional
approach has been improved by integrating various methods. To optimize
the generation of electricity from solar systems, the maximum power point
tracking (MPPT) technique is employed. To overcome limitations such as
steady-state voltage oscillations and improve transient response, two
traditional MPPT methods, namely fuzzy logic controller (FLC) and perturb
and observe (P&O), have been modified. This research paper aims to
simulate and validate the step size of the proposed modified P&O and FLC
techniques within the MPPT algorithm using MATLAB/Simulink for
efficient power tracking in photovoltaic systems.
Adaptive synchronous sliding control for a robot manipulator based on neural ...IJECEIAES
Robot manipulators have become important equipment in production lines, medical fields, and transportation. Improving the quality of trajectory tracking for
robot hands is always an attractive topic in the research community. This is a
challenging problem because robot manipulators are complex nonlinear systems
and are often subject to fluctuations in loads and external disturbances. This
article proposes an adaptive synchronous sliding control scheme to improve trajectory tracking performance for a robot manipulator. The proposed controller
ensures that the positions of the joints track the desired trajectory, synchronize
the errors, and significantly reduces chattering. First, the synchronous tracking
errors and synchronous sliding surfaces are presented. Second, the synchronous
tracking error dynamics are determined. Third, a robust adaptive control law is
designed,the unknown components of the model are estimated online by the neural network, and the parameters of the switching elements are selected by fuzzy
logic. The built algorithm ensures that the tracking and approximation errors
are ultimately uniformly bounded (UUB). Finally, the effectiveness of the constructed algorithm is demonstrated through simulation and experimental results.
Simulation and experimental results show that the proposed controller is effective with small synchronous tracking errors, and the chattering phenomenon is
significantly reduced.
Remote field-programmable gate array laboratory for signal acquisition and de...IJECEIAES
A remote laboratory utilizing field-programmable gate array (FPGA) technologies enhances students’ learning experience anywhere and anytime in embedded system design. Existing remote laboratories prioritize hardware access and visual feedback for observing board behavior after programming, neglecting comprehensive debugging tools to resolve errors that require internal signal acquisition. This paper proposes a novel remote embeddedsystem design approach targeting FPGA technologies that are fully interactive via a web-based platform. Our solution provides FPGA board access and debugging capabilities beyond the visual feedback provided by existing remote laboratories. We implemented a lab module that allows users to seamlessly incorporate into their FPGA design. The module minimizes hardware resource utilization while enabling the acquisition of a large number of data samples from the signal during the experiments by adaptively compressing the signal prior to data transmission. The results demonstrate an average compression ratio of 2.90 across three benchmark signals, indicating efficient signal acquisition and effective debugging and analysis. This method allows users to acquire more data samples than conventional methods. The proposed lab allows students to remotely test and debug their designs, bridging the gap between theory and practice in embedded system design.
Detecting and resolving feature envy through automated machine learning and m...IJECEIAES
Efficiently identifying and resolving code smells enhances software project quality. This paper presents a novel solution, utilizing automated machine learning (AutoML) techniques, to detect code smells and apply move method refactoring. By evaluating code metrics before and after refactoring, we assessed its impact on coupling, complexity, and cohesion. Key contributions of this research include a unique dataset for code smell classification and the development of models using AutoGluon for optimal performance. Furthermore, the study identifies the top 20 influential features in classifying feature envy, a well-known code smell, stemming from excessive reliance on external classes. We also explored how move method refactoring addresses feature envy, revealing reduced coupling and complexity, and improved cohesion, ultimately enhancing code quality. In summary, this research offers an empirical, data-driven approach, integrating AutoML and move method refactoring to optimize software project quality. Insights gained shed light on the benefits of refactoring on code quality and the significance of specific features in detecting feature envy. Future research can expand to explore additional refactoring techniques and a broader range of code metrics, advancing software engineering practices and standards.
Smart monitoring technique for solar cell systems using internet of things ba...IJECEIAES
Rapidly and remotely monitoring and receiving the solar cell systems status parameters, solar irradiance, temperature, and humidity, are critical issues in enhancement their efficiency. Hence, in the present article an improved smart prototype of internet of things (IoT) technique based on embedded system through NodeMCU ESP8266 (ESP-12E) was carried out experimentally. Three different regions at Egypt; Luxor, Cairo, and El-Beheira cities were chosen to study their solar irradiance profile, temperature, and humidity by the proposed IoT system. The monitoring data of solar irradiance, temperature, and humidity were live visualized directly by Ubidots through hypertext transfer protocol (HTTP) protocol. The measured solar power radiation in Luxor, Cairo, and El-Beheira ranged between 216-1000, 245-958, and 187-692 W/m 2 respectively during the solar day. The accuracy and rapidity of obtaining monitoring results using the proposed IoT system made it a strong candidate for application in monitoring solar cell systems. On the other hand, the obtained solar power radiation results of the three considered regions strongly candidate Luxor and Cairo as suitable places to build up a solar cells system station rather than El-Beheira.
An efficient security framework for intrusion detection and prevention in int...IJECEIAES
Over the past few years, the internet of things (IoT) has advanced to connect billions of smart devices to improve quality of life. However, anomalies or malicious intrusions pose several security loopholes, leading to performance degradation and threat to data security in IoT operations. Thereby, IoT security systems must keep an eye on and restrict unwanted events from occurring in the IoT network. Recently, various technical solutions based on machine learning (ML) models have been derived towards identifying and restricting unwanted events in IoT. However, most ML-based approaches are prone to miss-classification due to inappropriate feature selection. Additionally, most ML approaches applied to intrusion detection and prevention consider supervised learning, which requires a large amount of labeled data to be trained. Consequently, such complex datasets are impossible to source in a large network like IoT. To address this problem, this proposed study introduces an efficient learning mechanism to strengthen the IoT security aspects. The proposed algorithm incorporates supervised and unsupervised approaches to improve the learning models for intrusion detection and mitigation. Compared with the related works, the experimental outcome shows that the model performs well in a benchmark dataset. It accomplishes an improved detection accuracy of approximately 99.21%.
Developing a smart system for infant incubators using the internet of things ...IJECEIAES
This research is developing an incubator system that integrates the internet of things and artificial intelligence to improve care for premature babies. The system workflow starts with sensors that collect data from the incubator. Then, the data is sent in real-time to the internet of things (IoT) broker eclipse mosquito using the message queue telemetry transport (MQTT) protocol version 5.0. After that, the data is stored in a database for analysis using the long short-term memory network (LSTM) method and displayed in a web application using an application programming interface (API) service. Furthermore, the experimental results produce as many as 2,880 rows of data stored in the database. The correlation coefficient between the target attribute and other attributes ranges from 0.23 to 0.48. Next, several experiments were conducted to evaluate the model-predicted value on the test data. The best results are obtained using a two-layer LSTM configuration model, each with 60 neurons and a lookback setting 6. This model produces an R 2 value of 0.934, with a root mean square error (RMSE) value of 0.015 and a mean absolute error (MAE) of 0.008. In addition, the R 2 value was also evaluated for each attribute used as input, with a result of values between 0.590 and 0.845.
A review on internet of things-based stingless bee's honey production with im...IJECEIAES
Honey is produced exclusively by honeybees and stingless bees which both are well adapted to tropical and subtropical regions such as Malaysia. Stingless bees are known for producing small amounts of honey and are known for having a unique flavor profile. Problem identified that many stingless bees collapsed due to weather, temperature and environment. It is critical to understand the relationship between the production of stingless bee honey and environmental conditions to improve honey production. Thus, this paper presents a review on stingless bee's honey production and prediction modeling. About 54 previous research has been analyzed and compared in identifying the research gaps. A framework on modeling the prediction of stingless bee honey is derived. The result presents the comparison and analysis on the internet of things (IoT) monitoring systems, honey production estimation, convolution neural networks (CNNs), and automatic identification methods on bee species. It is identified based on image detection method the top best three efficiency presents CNN is at 98.67%, densely connected convolutional networks with YOLO v3 is 97.7%, and DenseNet201 convolutional networks 99.81%. This study is significant to assist the researcher in developing a model for predicting stingless honey produced by bee's output, which is important for a stable economy and food security.
A trust based secure access control using authentication mechanism for intero...IJECEIAES
The internet of things (IoT) is a revolutionary innovation in many aspects of our society including interactions, financial activity, and global security such as the military and battlefield internet. Due to the limited energy and processing capacity of network devices, security, energy consumption, compatibility, and device heterogeneity are the long-term IoT problems. As a result, energy and security are critical for data transmission across edge and IoT networks. Existing IoT interoperability techniques need more computation time, have unreliable authentication mechanisms that break easily, lose data easily, and have low confidentiality. In this paper, a key agreement protocol-based authentication mechanism for IoT devices is offered as a solution to this issue. This system makes use of information exchange, which must be secured to prevent access by unauthorized users. Using a compact contiki/cooja simulator, the performance and design of the suggested framework are validated. The simulation findings are evaluated based on detection of malicious nodes after 60 minutes of simulation. The suggested trust method, which is based on privacy access control, reduced packet loss ratio to 0.32%, consumed 0.39% power, and had the greatest average residual energy of 0.99 mJoules at 10 nodes.
Fuzzy linear programming with the intuitionistic polygonal fuzzy numbersIJECEIAES
In real world applications, data are subject to ambiguity due to several factors; fuzzy sets and fuzzy numbers propose a great tool to model such ambiguity. In case of hesitation, the complement of a membership value in fuzzy numbers can be different from the non-membership value, in which case we can model using intuitionistic fuzzy numbers as they provide flexibility by defining both a membership and a non-membership functions. In this article, we consider the intuitionistic fuzzy linear programming problem with intuitionistic polygonal fuzzy numbers, which is a generalization of the previous polygonal fuzzy numbers found in the literature. We present a modification of the simplex method that can be used to solve any general intuitionistic fuzzy linear programming problem after approximating the problem by an intuitionistic polygonal fuzzy number with n edges. This method is given in a simple tableau formulation, and then applied on numerical examples for clarity.
The performance of artificial intelligence in prostate magnetic resonance im...IJECEIAES
Prostate cancer is the predominant form of cancer observed in men worldwide. The application of magnetic resonance imaging (MRI) as a guidance tool for conducting biopsies has been established as a reliable and well-established approach in the diagnosis of prostate cancer. The diagnostic performance of MRI-guided prostate cancer diagnosis exhibits significant heterogeneity due to the intricate and multi-step nature of the diagnostic pathway. The development of artificial intelligence (AI) models, specifically through the utilization of machine learning techniques such as deep learning, is assuming an increasingly significant role in the field of radiology. In the realm of prostate MRI, a considerable body of literature has been dedicated to the development of various AI algorithms. These algorithms have been specifically designed for tasks such as prostate segmentation, lesion identification, and classification. The overarching objective of these endeavors is to enhance diagnostic performance and foster greater agreement among different observers within MRI scans for the prostate. This review article aims to provide a concise overview of the application of AI in the field of radiology, with a specific focus on its utilization in prostate MRI.
Seizure stage detection of epileptic seizure using convolutional neural networksIJECEIAES
According to the World Health Organization (WHO), seventy million individuals worldwide suffer from epilepsy, a neurological disorder. While electroencephalography (EEG) is crucial for diagnosing epilepsy and monitoring the brain activity of epilepsy patients, it requires a specialist to examine all EEG recordings to find epileptic behavior. This procedure needs an experienced doctor, and a precise epilepsy diagnosis is crucial for appropriate treatment. To identify epileptic seizures, this study employed a convolutional neural network (CNN) based on raw scalp EEG signals to discriminate between preictal, ictal, postictal, and interictal segments. The possibility of these characteristics is explored by examining how well timedomain signals work in the detection of epileptic signals using intracranial Freiburg Hospital (FH), scalp Children's Hospital Boston-Massachusetts Institute of Technology (CHB-MIT) databases, and Temple University Hospital (TUH) EEG. To test the viability of this approach, two types of experiments were carried out. Firstly, binary class classification (preictal, ictal, postictal each versus interictal) and four-class classification (interictal versus preictal versus ictal versus postictal). The average accuracy for stage detection using CHB-MIT database was 84.4%, while the Freiburg database's time-domain signals had an accuracy of 79.7% and the highest accuracy of 94.02% for classification in the TUH EEG database when comparing interictal stage to preictal stage.
Analysis of driving style using self-organizing maps to analyze driver behaviorIJECEIAES
Modern life is strongly associated with the use of cars, but the increase in acceleration speeds and their maneuverability leads to a dangerous driving style for some drivers. In these conditions, the development of a method that allows you to track the behavior of the driver is relevant. The article provides an overview of existing methods and models for assessing the functioning of motor vehicles and driver behavior. Based on this, a combined algorithm for recognizing driving style is proposed. To do this, a set of input data was formed, including 20 descriptive features: About the environment, the driver's behavior and the characteristics of the functioning of the car, collected using OBD II. The generated data set is sent to the Kohonen network, where clustering is performed according to driving style and degree of danger. Getting the driving characteristics into a particular cluster allows you to switch to the private indicators of an individual driver and considering individual driving characteristics. The application of the method allows you to identify potentially dangerous driving styles that can prevent accidents.
Hyperspectral object classification using hybrid spectral-spatial fusion and ...IJECEIAES
Because of its spectral-spatial and temporal resolution of greater areas, hyperspectral imaging (HSI) has found widespread application in the field of object classification. The HSI is typically used to accurately determine an object's physical characteristics as well as to locate related objects with appropriate spectral fingerprints. As a result, the HSI has been extensively applied to object identification in several fields, including surveillance, agricultural monitoring, environmental research, and precision agriculture. However, because of their enormous size, objects require a lot of time to classify; for this reason, both spectral and spatial feature fusion have been completed. The existing classification strategy leads to increased misclassification, and the feature fusion method is unable to preserve semantic object inherent features; This study addresses the research difficulties by introducing a hybrid spectral-spatial fusion (HSSF) technique to minimize feature size while maintaining object intrinsic qualities; Lastly, a soft-margins kernel is proposed for multi-layer deep support vector machine (MLDSVM) to reduce misclassification. The standard Indian pines dataset is used for the experiment, and the outcome demonstrates that the HSSF-MLDSVM model performs substantially better in terms of accuracy and Kappa coefficient.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Immunizing Image Classifiers Against Localized Adversary Attacks
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach
1. International Journal of Electrical and Computer Engineering (IJECE)
Vol. 12, No. 3, June 2022, pp. 2944∼2954
ISSN: 2088-8708, DOI: 10.11591/ijece.v12i3.pp2944-2954 ❒ 2944
Reasoning in inconsistent prioritized knowledge bases: an
argumentative approach
Loan Thi-Thuy Ho, Somjit Arch-int, Ngamnij Arch-int
Department of Computer Science, College of Computing, Khon Kaen University, Khon Kaen, Thailand
Article Info
Article history:
Received Jul 6, 2021
Revised Jan 27, 2022
Accepted Feb 8, 2022
Keywords:
Argumentation
Description logics
Inconsistency-tolerant
reasoning
Preferred subtheories
ABSTRACT
A study of query answering in prioritized ontological knowledge bases (KBs) has re-
ceived attention in recent years. While several semantics of query answering have
been proposed and their complexity is rather well-understood, the problem of explain-
ing inconsistency-tolerant query answers has paid less attention. Explaining query
answers permits users to understand not only what is entailed or not entailed by an
inconsistent description logic DL-LiteR KBs in the presence of priority, but also why.
We, therefore, concern with the use of argumentation frameworks to allow users to
better understand explanation techniques of querying answers over inconsistent DL-
LiteR KBs in the presence of priority. More specifically, we propose a new variant
of Dung’s argumentation frameworks, which corresponds to a given inconsistent DL-
LiteR KB. We clarify a close relation between preferred subtheories adopted in such
prioritized DL-LiteR setting and acceptable semantics of the corresponding argumen-
tation framework. The significant result paves the way for applying algorithms and
proof theories to establish preferred subtheories inferences in prioritized DL-LiteR
KBs.
This is an open access article under the CC BY-SA license.
Corresponding Author:
Somjit Arch-int
Department of Computer Science, College of Computing, Khon Kaen University
123 Mitrapad Road, Nai Muang, Khon Kaen, Thailand
Email: somjit@kku.ac.th
1. INTRODUCTION
Ontologies have been remarkably successful in a specific domain such as modelling biomedical
knowledge, policies and semantic web [1]-[4]. In oder to represent and reason over ontologies, the focus
has been placed on logical formalisms such as description logics [5] and rule-based languages (also called
Datalog±
) [6]. Description logic DL-Lite is a family of tractable description logics (DLs) where the ontologi-
cal view (i.e. TBox) is used to reformulate asked queries to offer better exploitation of assertions (i.e ABox),
since its expressiveness and decidability results [5].
In many real applications, there exist assertions in several conflicting sources having reliability lev-
els. Indeed, sets of assertions with different reliability levels in given sources are gathered to build a priori-
tized assertional base (i.e. a prioritized ABox). In order to reason in such assertional bases, variants of the
inconsistency-tolerant semantics (also called repairs) have been considered, in which attention has restricted
to the most preferred repairs based upon weight, cardinality or a stratification of the assertional base in DL
KBs [7], [8]. One of the potential approaches is to utilize a notion of preferred subtheories (which is used in
prioritized logic setting [9]) to generate preferred maximal consistent subsets instead of calculating all maximal
consistent subsets.
Journal homepage: http://ijece.iaescore.com
2. Int J Elec & Comp Eng ISSN: 2088-8708 ❒ 2945
While the study of inconsistency-tolerant querying in prioritized knowledge bases (KBs) is rather
well-understood, less interest has been paid to the issue of explaining query answers under such semantics.
There are some existing approaches concerning with the explanation of standard reasoning and query entail-
ment [10]-[16]. The earlier approaches mainly introduce a proof-theoretic approach with explanation services
[10], [11]. The main idea of these approaches is to identify explanations based on subsets of axioms in the
ontology, known as axiom pinpointing, that are responsible for an entailment. It should emphasize that the
works on axiom pinpointing focus on classical reasoning and the associated types of entailment. To date, the
only works in explaining inconsistency-tolerant querying are given for the DL-Lite family of languages [12],
[16] and Datalog±
[13]-[15]. The idea of these works is to determine a set of assertions as an explanation
that will lead to the answer of a given query entailing under inconsistency-tolerant semantics. Specifically,
Bienvenu et al. [12] considered the work in explaining query answers under inconsistency-tolerant semantics
for the DL-Lite family of languages , where explanations are defined as causes that are sets of assertions under
three semantics (intelligent augmented reality (IAR), brave and AR semantics). Lukasiewicz et al. [15] defined
explanations for conjunctive queries in different formalisms based on existential rules, and provided a thor-
ough complexity analysis under different complexity measures. An argumentation framework is a prominent
approach for representation and reasoning in inconsistent KBs, with an aim to improve explanation techniques
of querying answers [14], [16]. The authors explored the explanation techniques for query answering under the
intelligent character recognition (ICR) semantics in rule-based languages.
The analyses illustrate that the problem of explanation techniques for inconsistency-tolerant query
answering are not studied in the context where an ABox is prioritized. Therefore, we concern ourself with the
development of a framework for explaining inconsistency-tolerant querying in DL-LiteR KBs associated with
priorities. The main propose of this study is that we propose a new prioritized argumentation framework cor-
responding to an inconsistent DL-LiteR KB with a prioritized ABox. By considering the use of argumentation
framework, explanations of query answers allow users to naturally understand why a query is (not) entailed by
a DL-LiteR KB in the presence of the priority. In our work, the information expressed by the argument allows
for tracking the provenance of data employed to imply querying answers and the attack relations show which
pieces of information are incomparable, i.e. inconsistent information indicates erroneous data. Compared with
the former approaches, such as [12], [14], [15], [17], the result allows a user to better understand explanation
techniques of inconsistency-tolerant semantics in the presence of priority. Moreover, we clarify a relation be-
tween semantics from inconsistent prioritized KB query answering (preferred subtheories) and semantics from
the corresponding argumentation framework (preferred, stable semantics). The significant result, therefore,
paves the way for applying algorithms and argument-game proof theories to establish preferred subtheories
inferences in inconsistent DL-LiteR KB with the priority ABox.
The remaining sections of the paper contain: We discusses the preliminaries on description logics
(DLs) and abstract argumentation framework (AAF) in the second section. Section 3 introduces a logical in-
stantiating argumentation framework that corresponds to a given prioritized DL-LiteR KB. Section 4 discusses
other works from the literature. Finally, we summarize and set out some future works.
2. PRELIMINARIES ON AAF, DL
2.1. Abstract argumentation framework
In this section, we recall definitions of an abstract argumentation framework (AAF). The AAF is intro-
duced by Dung in [18]. In particular, we briefly introduce the definition of AAF, extensions and acceptability
semantics.
2.1.1. Abstract argumentation
An abstract argumentation framework (AAF) is a tuple of AF = ⟨Arg, Re⟩. The AAF includes two
components that are argument and attack relations. In particular, Arg is a set of arguments and Re ⊆ Arg×Arg
is a binary attack relation between arguments.
2.1.2. Extensions
Let AF = ⟨Arg, Re⟩ be an AAF, and k be an argument in Arg and R ⊆ Arg. Argument k is
acceptable w.r.t set R iff for any argument s in Arg, s attacks k and there exists argument t in R s.t. t attacks s.
R is conflict free if there are no arguments k and s in R such that k attacks s. R is admissible if R is conflict
free and for all argument k in R, k is acceptable w.r.t R. R is said to be a complete extension if k is acceptable
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach (Loan Thi-Thuy Ho)
3. 2946 ❒ ISSN: 2088-8708
w.r.t R implies argument k in R. R is said to be a preferred extension if R is a maximal (w.r.t. set inclusion)
complete extension. R is said to be a grounded extension if R is a minimal (w.r.t. set inclusion) complete
extension. R is said to be a stable extension iff R is conflict-free and there is no argument in R such that it is
attacked by other argument in R. In AF, the output is determined by the set of conclusions that are emerged
into all extensions under given semantics. We distinguish the following three acceptability states.
2.1.3. Acceptability semantics
Let AF = ⟨Arg, R⟩ be an AAF. For an argument x ∈ Arg and ex ∈ {g, s, p}, the argument x is
sceptically accepted w.r.t semantic ex iff x is in all extensions under ex, argument x is credulously accepted
w.r.t semantic ex if argument x is in at least on extensions under ex, the argument x is rejected if argument
x is not in any extension under ex, where g, s, p stand for a grounded, a stable and a preferred semantic,
respectively.
2.2. Description logics
We give a brief overview of description logic (DL) KBs. We will consider the DL-LiteR of the DL-
Lite family through this paper [5]. In partcular, we introduce syntax, semantics and queries, respectively.
2.2.1. Syntax
A DL-LiteR KB is a pair of TBox and ABox, written K = ⟨T , A⟩, which are built from a concept
name set NC (unary predicates), a role name set NR (binary predicates), an individual set NI (constants).
In DL-LiteR, A includes a finite set of concept assertions expressed by the form A(c) and role assertions
expressed by the form S(c, d), in which A ∈ NC, S ∈ NR, c, d ∈ NI. In DL-LiteR, T contains a set of
axioms. Axioms in T are concept inclusions of the form C ⊑ D and role inclusions of the form R ⊑ Q, which
are formulated by the syntax: C := A | ∃R D := C | ¬C R := S|S−
Q := R | ¬R, where A ∈ NC
are atomic concepts, S ∈ NR are atomic roles, S−
is the inverse of an atomic role. A basic concept is denoted
by C where C is either an atomic concept or a concept of the form ∃R. A basic role is denoted by R where R
is either an atomic role or the inverse of an atomic role. A (general) concept is denoted D where D is either a
basic concept or its negation. A (general) role is denoted by Q where Q is a basic role or its negation. ATBox
axiom is formulated by C1 ⊑ C2 or R1 ⊑ R2, which is called positive inclusions. A TBox axiom is formed by
C1 ⊑ ¬C2 or R1 ⊑ ¬R2, which is called a negative inclusion.
2.2.2. Semantics
An interpretation I = (∆I
, .I
) comprehends a non-empty set ∆I
and an interpretation function. I
that maps each individual c to each element cI
∈ ∆I
with cI
̸= dI
for c ̸= d (Note that cI
̸= dI
is known
as unique names assumption (UNA)), each concept A to a subset AI
⊆ ∆I
and each role S to a set SI
⊆
∆I
× ∆I
. For complex concepts and roles, the interpretation function .I
is extended as following: AI
⊆ ∆I
,
SI
⊆ ∆I
× ∆I
, (S−
)I
=
(d, c) ∈ ∆I
× ∆I
|(c, d) ∈ SI
, (∃Q)I
= {c ∈ ∆I
|∃c′
∈ ∆I
s.t.(c, c′
) ∈ QI
},
(¬C)I
= ∆I
CI
, (¬Q)I
= ∆I
× ∆I
QI
. An interpretation I satisfies a concept (resp. role) inclusion
axiom, denoted by I |= C1 ⊑ C2 (resp. I |= Q1 ⊑ Q2), if CI
1 ⊆ CI
2 (resp. QI
1 ⊆ QI
2 ). I satisfies a concept
(resp. role) assertion, denoted by I |= A(c) (resp. I |= S(c, d)) if cI
∈ AI
(resp. (cI
, dI
) ∈ SI
). We say
that I is a model of K = ⟨T , A⟩ if I satisfies all axioms in T and assertions in A. K is consistent if it has a
model; otherwise it is inconsistent. If K is the consistent KB the ABox A is T -consistent. For our work, we
are interested in querying DL KBs. A considered query class is a class of conjunctive queries (CQs) or unions
of conjunctive queries (UCQs). In a place, we present a specific query language, namely first-order queries
(FOL-queries).
2.2.3. Queries
A FOL-query is a first-order logic formula whose atoms are constructed using concepts and roles of K
(and variables and constants from NI). We denote a (CQ) by Q(−
→
u ) = ∃−
→
v .δ(−
→
u , −
→
v ), where δ is a conjunction
of atoms with atoms of the form A(s) or S(s, t) whose terms are either individuals or variables from −
→
u ∪−
→
v . If
CQ includes a single tom, then the CQ is called an instance query (IQ). If CQ has no free variables, then the CQ
is said to be a Boolean query. Let Q(−
→
u ) be a query with free variables −
→
u = (u1, ..., um) and −
→
s = (s1, ..., sm)
be a tuple of individuals, we say that Q has arity m and use Q(−
→
s ) to denote the Boolean query resulting from
substituting si for each ui. Given a FOL query Q(−
→
u ), a tuple of individuals −
→
s is an answer to Q(−
→
u ) of
an interpretation I, denoted by I |= Q(−
→
s ), iff −
→
s has the same arity as Q and the Boolean query Q(−
→
s ) is
Int J Elec Comp Eng, Vol. 12, No. 3, June 2022: 2944–2954
4. Int J Elec Comp Eng ISSN: 2088-8708 ❒ 2947
satisfiable in I following standard first-order logic semantics. For a CQ Q, a tuple −
→
s is said to be a certain
answer to Q w.r.t K, denoted by K |= Q(−
→
s ), iff it is an answer to Q(−
→
u ) in every model of K.
2.3. Prioritized DL-LiteR knowledge base
In many applications, there is some information from multiple sources that have different reliability
levels. To represent such information, we introduce a notion of a prioritized DL-LiteR KB where all assertions
of an ABox have different reliability levels.
Definition 1 (Prioritized DL KB) Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB where the ABox A is parti-
tioned into n strata A = (A1, A2, . . . , An) such that:
- The strata are pairwise disjoint, i.e. Ai ∩ Aj = ∅, for any Ai ̸= Aj.
- The priority of assertions in Ai have the same level.
- The priority of assertions in Ai are higher than the priority of ones in Aj where i j. Consequently, the
assertions of A1 are the most crucial ones and the assertions of An are the least crucial ones.
Example 1 Given K = ⟨T , A⟩ in which T = {G ⊑ ¬H} and assume that assertions of A provided by distinct
sources A = {A1, A2, A3} such that: A1 = {G(a2)}, A2 = {H(a1), G(a1)}, and A3 = {H(a2), H(a3)}.
In this example, A1 consists of the most reliable assertions while A3 contains the least reliable ones.
2.4. Inconsistency-tolerant semantics
In this section, we present definitions related to the problem of inconsistency in KBs. Note that the
problem of inconsistency in KBs is considered w.r.t some assertional bases (i.e. ABoxes) and considered
queries are Boolean queries.
Definition 2 (Inconsistency) A DL-LiteR KB K = ⟨T , A⟩ is said to be inconsistent if K does not have any
model. Otherwise, K is said to be consistent. Next, we introduce a concept of a conflict set, which is a minimal
inconsistent subset of assertions w.r.t. the TBox.
Definition 3 (Conflict) Let K = ⟨T , A⟩ be a DL-LiteR KB. A subset C ⊆ A is a minimal conflict subset in K
iff ⟨T , C⟩ is inconsistent and ∀c ∈ C, ⟨T , C {c}⟩ is consistent. We denote C(A) is a set of conflicts in A.
From definition 3, any assertion c from C is eliminated to restore to the consistency of ⟨T , C⟩. In the
case of the coherent TBox, a conflict set consists of exactly two assertions having either the same priority level
or the different priority level can be deduced from it.
Example 2 Consider K
′′
=
D
T
′′
, A
′′
E
with T
′′
= {G ⊑ ¬H}, A
′′
= {H(a1), G(a2), G(a1), H(a3)}. Then
by definition 3, we have the set of conflicts in A yielding: C(A) = {H(a1), G(a1)}.
In a flat KB, inconsistency-tolerant semantics (also called repairs) have been studied to obtain significantly
answer over the inconsistent KB [19].
Definition 4 (Repair) Let K = ⟨T , A⟩ be a flat DL-LiteR KB. RE ⊆ A is called a repair w.r.t K iff ⟨T , RE⟩
is consistent and ∀RE1 ⊃ RE, RE1 ⊆ A, ⟨T , RE1⟩ is inconsistent.
The above notion of repair can be extended when all ABox assertions have been partitioned into
priority levels with the coherent TBoxT . In such case, the repairs are also computed in the scene of the term
”flat ABox”. So from now on, we shall use the notation A = (A1 ∪· · ·∪An) for A = (A1, . . . , A2) to express
the prioritized ABox. To exploit the priorities of the assertions, we only consider some maximal consistent
subsets (not all of them), which are preferred maximal consistent subsets - called preferred subtheories used in
classical logic setting [9]. We now introduce a version of preferred subtheories for the prioritized ontological
KB.
Definition 5 (Preferred Subtheory) Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB with A = (A1 ∪ A2∪
· · · ∪ An). P = P1 ∪ · · · ∪ Pn is a preferred subtheory (PS) w.r.t K iff ∀k ∈ (1, . . . , n) P1 ∪ · · · ∪ Pk is
a maximal (w.r.t. set inclusion) consistent subset of A1 ∪ · · · ∪ Ak. We denote Prs(A) the set of preferred
theories w.r.t. K.
In order to compute a preferred subtheory of A w.r.t T , we first determine the maximal consistent
subset of A1, then enlarge this maximal consistent subset as much as possible with assertions from A2 while
preserving consistency and continuing this process for A3, . . . , An.
Example 3 (Example 1 Continued) Consider K = ⟨T , A⟩. We get the set of conflicts and the set of PS:
C(A) = ({G(a2), H(a2)}, {G(a1), H(a1)}), P1 = {H(a1), G(a2), H(a3)}, P2 = {G(a2), G(a1), H(a3)}.
Indeed, either the assertion X(A) is ignored, then the remaining assertions P1 = A1 ∪(A2 G(a1) is consistent
with T . Or the assertions G(a1) is kept and the assertions H(a1) is removed, then we get P2 in this case. Since
the assertion G(a2) ∈ A1 has a higher priority than the assertion Y (a2) ∈ A3, then H(a2) is ignored. Thus, the
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach (Loan Thi-Thuy Ho)
5. 2948 ❒ ISSN: 2088-8708
remaining assertions P1 = A {G(a1), H(a2)} is consistent with T . Computing P2 is similar to computing
P1.
We next introduce notions of consistent entailment under PSs in the KB. SPS-entailments consider a
query that is entailed by every preferred subtheory. CPS-entailments evaluate a query that is entailed by some
preferred subtheories. In our context, the accepted query has either ”Yes” answer (entailed) or ”No” answer
(not entailed). Note that the SPS-entailments (resp. the CPS-entailments) extend the definition of the AR
semantics (resp. the brave semantics) proposed in [19] when we consider the case of the prioritized ABox.
According to definition 6, |= denotes a standard entailment used in consistent and flat DL − LiteR KBs,
namely ⟨T , P⟩ |= Q iff all models of ⟨T , P⟩ are also models of Q [5].
Definition 6 Let K = ⟨T , A⟩ be a prioritized DL − LiteR KB and Q be a Boolean query. Then,
- Q is said to be a SPS-entailment w.r.t. K, written K |=SP S Q, iff ⟨T , P⟩ |= Q for every P ∈ Prs(A),
- Q is said to be a CPS-entailment w.r.t. K, written K |=CP S Q, iff ⟨T , P⟩ |= Q for some P ∈ Prs(A).
We remark a relation among the above semantics as follows: K |=SP S Q ⇒ K |=CP S Q.
Example 4 Consider a prioritized KB Kani = ⟨Tani, Aani⟩ where Tani = {jaguar ⊑ animal, leopard ⊑
animal, jaguar ⊑ ¬leopard}, Aani = {A1, A2} with A1 = {jaguar(m)} and A2 = {leopard(m)}.
The set of conflicts in A: C(A) = {jaguar(m), leopard(m)}. The set of preferred subtheories: P =
{jaguar(m)}. We consider a Boolean query Q1 = animal(m). It can see that ⟨Tani, P⟩ |= animal(m).
By definition 6, Kani |=SP S animal(m). Clearly, we also get Kani |=CP S animal(m) and Kani |=IP S
animal(m).
3. INSTANTIATING ABSTRACT ARGUMENTATION FRAMEWORKS WITH PRIORITIZED
KNOWLEDGE BASES
This section focuses on the use of argumentation framework to deal with the issue of explaining
answers for prioritized DL-LiteR KBs under preferred repair semantics. The idea is that we propose a new
prioritized argumentation framework (PAF) that corresponds to a given prioritized KB. By using a form of
arguments and extensions of the PAF, we show that the support set of argument is a minimal subset of A that
will lead to the answer (i.e. the consequence of arguments) holding under preferred repair semantics. Attack
relations between the arguments explain what has been stated in the KB that causes the inconsistency.
3.1. Prioritized argumentation framework
We now introduce a new prioritized argumentation framework, which includes arguments and attack
relations between the arguments. In the PAF, an argument consists of two elements: a support of the argument
(also called a hypothesis) is a set of assertion of A and a consequence is entailed from the hypothesis. Before
formalizing the notion of the argument, we discuss a closure of χ (χ ⊆ A) with respect to T , denoted ClT (χ),
is repeatedly calculated by possible applications of all rules (positive inclusion assertions) in the TBox T over
χ until reaching a fixed point. We employ a definition of restricted chase to calculate ClT (χ) [20]. In this
paper, the consequence of the argument is an assertion or a set of assertions.
Definition 7 (Argument) Let K = ⟨T , A⟩ be a prioritized KB. An argument x is a tuple (Φ, α) such that:
(1) Φ ⊆ A and ClT (Φ) is T -consistent. (2) α = {α0, ..., αk} is an assertion or a set of assertions s.t.
{α0, ..., αk} ⊆ ClT (Φ) (entailment). (3) ∄Φ
′
⊂ Φ,ClT (Φ
′
) ⊨ α.
For any argument, we observe that its support is the set of assertions induced for the entailment of
consequence α in the KB K. We emphasize that there are no positive or negative inclusion assertions in the
conclusion or the support of argument. In the above definition, the first statement guarantees that the support of
argument is consistent [21]. The next one guarantees that the consequence α of the argument is entailed from
the support Φ. The third one ensures that the support is minimal.
Notation 1 for an argument x = (Φ, α), its support is denoted by Sup(x) = Φ and its consequence is denoted
by Con(x) = α. Let us denote ArgK the set of arguments built from the DL-LiteR KB K.
A second element of PAF is attack relations between the arguments. We recall a notion of direct
undercut attack (known as assumption attack) as a concept of argumentative attacks to express the conflicts of
the assertions in a given DL-LiteR KB. The attack relations are not symmetric.
Definition 8 for two arguments x, z ∈ ArgK, x is said to attack z on the argument z′
= ({β}, β) (abusing notion
we may wirte ”x attack z on β”) iff for z′
= ({β}, β), β ∈ Sup(z), ClT ({Con(x), β}) is T -inconsistent.
Since our prioritized argumentation framework is built from a given prioritized DL-LiteR KB, there
Int J Elec Comp Eng, Vol. 12, No. 3, June 2022: 2944–2954
6. Int J Elec Comp Eng ISSN: 2088-8708 ❒ 2949
exist preference relations between arguments in such argumentation setting. Note that for the prioritized KB,
∀ϕ ∈ Ai, ∀µ ∈ Aj : ϕ is more important than µ, denoted by ϕ ≥ µ, iff rank(ϕ) ≤ rank(µ). We formally
define preference relations. Definition 9 (Preference relation) Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB
with A = (A1, . . . , An).
- For an assertion µ ∈ A, rank(µ) = k iff µ ∈ Ai, ∀i ∈ (1, . . . n). For an argument x ∈ Arg(A),
rank(x) = minµ∈Sup(x)rank(µ).
- Let x and y be arguments in ArgK. x is preferred to y, denoted by x ⪰rank y, iff rank(x) ≤ rank(y).
We now introduce a definition of R⪰rank
-attack relation, which means that the attack relation succeeds if the
attacking argument is more preferred than the one attacked. We remark that R⪰rank
-attack relation is not
symmetric, irreflexive.
Definition 10 (R⪰rank
-attack relation) Let x,y be two arguments in ArgK and ⪰rank be a preference relation
on ArgK. x R⪰rank
-attacks y, denoted by xR⪰rank
y, iff x attacks y on y′
s.t. x ⪰rank y′
.
Next, we introduce a prioritized argumentation framework.
Definition 11 (Prioritized argumentation framework) Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB. A pri-
oritized argumentation framework for K is a triple AF⪰rank
= ⟨ArgK, R⪰rank
⟩ such that ArgR is a set of
arguments. R⪰rank
⊆ ArgR × ArgR, where R⪰rank
is an attack relation of AF⪰rank
. We write xR⪰rank
y,
i.e, x R⪰rank
-attacks y.
Notation 2 Let AF⪰rank
= ⟨ArgK, R⪰rank
⟩ be a PAF and D ⊆ ArgK be a set of arguments constructed from
a given prioritized KB. The notations are used through this paper:
- Args(A′
) = {x ∈ D|Sup(x) ⊆ A′
}, where A′
⊆ A be a set of assertions in a given prioritized KB. We
call Arg(A′
) is a set of arguments built from the set of assertions A′
. We denote Extex(AF⪰rank
) a set
of extensions under ex semantics.
- Base(D) =
S
x∈D
Sup(x). Let Base(D) denote a base of arguments such that it includes the supports
of arguments in D. Cons(D) = {Con(x) | x ∈ D}. We denote Cons(D) the set of conclusions of
arguments in D. Output(AF⪰rank
) =
T
X∈Extex(AF⪰rank )
Cons(X). We denote Output(AF⪰rank
) the
output of AF⪰rank
under ex semantics.
3.2. The results for characterizing PAF
Now that we have translated prioritized DL-LiteR KBs into prioritized argumentation frameworks.
Next, we shows the main results of the paper are that: (1) We clarify a relation between preferred subtheories
of the prioritized KB are equal to stable/ preferred extensions of its corresponding PAF. (2) We show the use of
PAF to explain the query answering problem.
Proposition 1 Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB, AF⪰rank
= ⟨ArgK, R⪰rank
⟩ be its correspond-
ing argumentation framework. Then:
(a) If P ∈ Prs(A) is a preferred subtheory in K then Args(P) is a stable extension of ⟨ArgK, R⪰rank
⟩.
(b) If X ∈ Exts(AF⪰rank
) is a stable extension of ⟨ArgK, R⪰rank
⟩ then Base(X) is a preferred subtheory
in K.
Proof. 1) Firstly, we prove that Args(P) is conflict-free. Assume that the contrary that Args(P) is not
conflict-free. From definition 10 for R⪰rank
-attack, let x, y ∈ Args(P) so that xR⪰rank
y, then there exists
β ∈ Sup(y) s.t ClT ({Con(x), β}) is T -inconsistent. Thus ClT (Sup(x) ∪ {β}) is T -inconsistent. P is
hence not consistent. Contradiction. It can be concluded that Args(P) must be conflict-free. We prove now
that Args(P) attacks each argument not belong to itself. Let y ∈ Args(A) Args(P), β ∈ Sup(y) so that
β /
∈ P. Consider x = (P, P), we have β /
∈ P, and P is also the set inclusion maximality of preferred theories,
then ClT ({Con(x), β}) is T -inconsistent. By construction, P = P1 ∪ · · · ∪ Pn is a preferred subtheory s.t.
∀k = 1 . . . n, P1 ∪· · ·∪Pk is a maximal consistent subset of A1 ∪· · ·∪Ak. Therefore, we assume β ∈ Aj for
some j = 1 . . . n, then {β} ∪ P1 ∪ · · · ∪ Pj is inconsistent subset. Since β ∈ Aj and the supports of argument
x are in Pk, k ≤ j; i.e every support in x is greater or equal to β, then rank(Sup(x)) ≤ rank(Sup(y)), and
so by the definition of the attack relation xR⪰rank
y.
2) Next, we show that Base(X) =
S
Con(x)
x∈X
must be consistent. By contradiction, we suppose that
Base(X) is inconsistent. Let {α1, . . . , αn}, denoted by M, be a minimal inconsistent subset of Base (X). Let
x ∈ X be an argument s.t αn ∈ Sup (x). Let x′
= ({M {αn} , {α1, . . . , αn−1}}), then ClT ({Con(x′
), αn})
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach (Loan Thi-Thuy Ho)
7. 2950 ❒ ISSN: 2088-8708
is T -inconsistent and rank(x′
) ≤ rank(x). Therefore x′
R⪰rank
x. Because X is conflict-free, then x′
/
∈ X.
Since X is also a stable extension, ∃y ∈ X s.t yR⪰rank
x′
. It is clear that y attack x′
. Thus, there exists
k ∈ {1, . . . , n − 1} such that ClT ({Con(y), αk}) is T -inconsistent. Since αk ∈ Base (X), ∃z ∈ X such
that αk ∈ Sup(z) and rank(y) ≤ rank(z). Thus, yR⪰rank
z, contradiction.Therefore, Base (X) must be
consistent.
Next, we show that Base(X is a preferred subtheory. By means of contradiction, we assume that
Base(X) is not a preferred subtheory, which means that ∃k ∈ {1, . . . n} such that P1∪· · ·∪Pk is not a maximal
consistent subset in A1 ∪ · · · ∪ Ak. Thus, there exist β /
∈ Base (X) s.t β ∈ Ak and P1 ∪ · · · ∪ Pk ∪ {β} is
consistent. Let x′
= ({β} , β). Because X is a stable extension, ∃x ∈ X, xR⪰rank
x′
. Since P1∪· · ·∪Pk ∪{β}
is consistent, no argument in X having level at most k cannot attack x′
. This means that there exists no x ∈ X
s.t xR⪰rank
x′
, then X is not stable extension. Contradicting. Thus, Base (X) must be a preferred subtheory.
Let us indicate that if X ⊆ ArgK is a stable extension of ⟨ArgK, R⪰rank
⟩, then X = Args (Base (X)).
Suppose the contrary. For any X ⊆ Args(A), X ⊆ Args (Base (X)). Hence, it is easily be seen that the case
X ⊊ Args (Base (X)) is not possible.
The next theorem shows the main result of this section: the relation between acceptable semantics
(sceptical, credulous semantics) from the PAF and entailments (SPS, CPS entailments) from the inconsistent
prioritized DL-LiteR KB . A query Q is sceptically accepted (resp. credulously accepted) w.r.t semantics ex iff
it is a logical consequence over all extensions (at least one extension) with regards to stable/preferred semantics
ex.
Theorem 1 Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB, AF⪰rank
= ⟨ArgK, R⪰rank
⟩ be its corresponding
PAF. For a Boolean query Q and ex ∈ {s, p}. Then:
(a) K |=SP S Q iff Q is sceptically accepted w.r.t semantics ex.
(b) K |=CP S Q iff Q is credulously accepted w.r.t semantics ex.
Proof. We invoke proposition 1 to deduce that Extex AF⪰rank
= {Arg (P) | P ∈ Prs (A)}.
Evidently, the function Arg is a bijection between Prs (A) and Extex AF⪰rank
. It is easily seen that
for every preferred subtheory P ∈ Prs (A), we have that ClT (P) |= Q iff Cons (Arg (P)) |= Q. From
those two facts, the results of the proposition yield: (1) For query Q, K |=SP S Q iff for every preferred
subtheory P ∈ Prs (A), ClT (P) |= Q iff for every extension X ∈ Extex AF⪰rank
, Cons (X) |= Q
iff Q is sceptically accepted. (2) For query Q, K |=CP S Q iff at least one preferred subtheory P ∈ Prs (A),
ClT (P) |= Q iff at least one extension X ∈ Extex AF⪰rank
, Cons (X) |= Q iff Q is credulously accepted.
The next corollary follows theorem 1 and definition 7. Corollary 1 states that the use of characterizing
arguments provides explanations for the query in prioritized KBs.
Corollary 1 Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB, AF⪰rank
= ⟨ArgK, R⪰rank
⟩ be its corresponding
argumentation framework. For query Q and Ψ ⊆ A, A = (Ψ, α) is an argument s.t. {α} ⊆ Q holding under
semantics ex in AF⪰rank
iff Ψ is an explanation for α under preferred repairs in K.
The next example illustrates the use of PAF to explain the query answering problem.
Example 5 (Example 4 continued) Reconsider the KB Kani = ⟨Tani, Aani⟩. The set of arguments: x1 =
({jaguar(m)}, {jaguar(m)}), x2 = ({leopard(m)}, {leopard(m)}), x3 = ({jaguar(m)}, {animal(m)}),
x4 = ({leopard(m)}, {animal(m)}). The set of stable extensions Exts(AF⪰rank
): X = {x1, x3}. The out-
puts of PAF: output(AF⪰rank
) = Cons(X) = {jaguar(m), animal(m)}.
Consider Q1 = animal(m), it is clear that Kani |=SP S animal(m) and Kani |=CP S animal(m)).
The explanations of Q1: {jaguar(m)} in x3. The causes are Cx3
= {x4, x2}. The example shows that a user
receives the explanations that lead to the answer for Kani |=SP S animal(m) and (one or more) causes that
lead to the conflicts of Q1 (i.e. the set of attacked arguments). Thus, PAF allows users to ask why a given query
is (not) entailed in KB (in which case, the set of attacked arguments can be showed). Observe that the answers
of query Q1 are similar to the results in example 4. Moreover, the example explicitly illustrates the relation
between the preferred subtheories of prioritized KB and the acceptable semantics of the corresponding PAF.
3.3. Rationality postulates
We now demonstrate that our framework satisfies the rationality postulates in [21]. Definition 12
Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB, AF⪰rank
= ⟨ArgK, R⪰rank
⟩ be its corresponding PAF.
For every X ∈ Ext(AF⪰rank
) and an arbitrary argument x ∈ S. The postulates are defined as follows: i)
Closure of extensions: For each X ∈ Ext(AF⪰rank
), Cons(X) = ClT (Cons(X)); ii) Closure under Sub-
argument: For all X ∈ Ext(AF⪰rank
), if x ∈ X then Suba(x) ∈ X, where Suba(x) is a sub-arguments
Int J Elec Comp Eng, Vol. 12, No. 3, June 2022: 2944–2954
8. Int J Elec Comp Eng ISSN: 2088-8708 ❒ 2951
set of an argument x; iii) Weak Closure under sub-arguments: For all X ∈ Ext(AF⪰rank
), if x ∈ X,
y ∈ Suba(x) and x ⪰rank y, then y ∈ Ext(AF⪰rank
); iv) Consistency: For all X ∈ Ext(AF⪰rank
),
then Cons(X) and Base(X) are consistent; v) Exhaustiveness: For all X ∈ Ext(AF⪰rank
), for all x ∈ S,
if Sup(x) ∪ {Con(x)} ⊆ Cons(X), then x ∈ X; and vi) Free precedence: For all X ∈ Ext(AF⪰rank
),
Arg(Free(K)) ⊆ E where Free(K) = A
S
C is a minimal conflict C.
In the PAF, the preference relation has some interesting properties, namely Minimality and And, as stated in
[21]. Basing on the fact that the preference relation ⪰rank satisfies “Minimality” for set inclusion, one can see
that if y is a sub-argument of x (which means that Sup(y) ⊆ Sup(x)) then y ⪰rank x. We shall consider these
postulates under the following assumptions: i) The preference relation ⪰rank is left monotonic: If x ⪰rank y
and Sup(y) ⊆ Sup(y′
) then x ⪰rank y′
and ii) We will consider the preference relation ⪰rank on the sets of
arguments: x ⪰rank y iff Sup(x) ⪰rank Sup(y).
Proposition 2 Let K = ⟨T , A⟩ be a prioritized DL-LiteR KB, AF⪰rank
= ⟨ArgK, R⪰eli
⟩ be its corresponding
PAF. AF⪰eli
satisfies closure of extensions, Weak closure under sub-argument, consistency, exhaustiveness
and free precedence.
Proof. We prove each postulate in proposition 2:
(a) Closure of extensions: From the definition of closure of extensions, for any X ∈ Ext(AF), Cons(X) ⊆
ClT (Cons(X)). Next, we shall show that ClT (Cons(X)) ⊆ Cons(X). Let ϕ ∈ ClT (Cons(X)).
Since X is a stable extension, theorem 1 implies that ∃E, E ⊆ Base(X) so that X = Arg(E). Hence
X = Arg(Base(X)). Since the supports of arguments in X include the assertions from E, it follows
that ϕ ∈ ClT (E). Consequently, ∃x ∈ X s.t Con(x) = ϕ.
(b) Weak closure under sub-argument: Let y ∈ X and y′
be a sub-argument of y s.t y′
∈ X and y′
⪰rank y.
Assume the contrary, that y′
/
∈ X. Since X is a stable extension, ∃z, z ∈ X s.t z R⪰rank
-attacks y′
,
which means ∃ϕ ∈ Sup(z) s.t ClT ({Con(z), ϕ}) is T -inconsistent and z ⪰rank y′
. Since y′
is a sub-
argument of y, Sup(y′
) ⊆ Sup(y) then ϕ ∈ Sup(y). In addition, since z ⪰rank y′
and z′
⪰rank y,
then y ⪰rank y. Clearly, ClT ({Con(z), ϕ}) is T -inconsistent and z ⪰rank y, which implies zR⪰rank
-
attacks y. This contradicts with X, which has to be the stable extension and conflict-free.
(c) Consistency: We prove that for every extension, the conclusion set is consistent. Let Xi ∈ Ext(AF)
be a stable extension of AF⪰rank
= ⟨ArgK, R⪰rank
⟩ Taking theorem 1, we have a preferred theory
P ∈ Prs (A) such that Xi = Arg (P). It is easily seen that Cons (Xi) = ClT (P). Since P is a
preferred theory then ClT (P) is consistent. Thus, Cons(Xi) is consistent. Now, for each extension, we
prove that the base of them can be consistent. In view of theorem 1, we have Xi = Arg (Base (Xi)) and
Base (Xi) is a preferred theory due to Xi is a stable extension. Therefore, Xi is consistent.
(d) Exhaustiveness: Suppose the contrary, that z ∈ ArgK be an argument s.t Sup(z) ∪ {Con(z)} ⊆
Cons(X) and z /
∈ X. Since X is a stable extension, ∃y, y ∈ X s.t y attacks z, which means ∃ϕ, ϕ ∈
Sup(z) s.t ClT ({ϕ, Con(y)}) is T -inconsistent. We also have Sup(z) ⊆ Cons(X) and Con(z) ∈
Cons(X). By the above it follows that Cons(X) is inconsistent, which contradicts with the Consistency
postulate.
(e) Free precedence: We begin by supposing that z ∈ ArgK is an argument where Sup(x) ⊆ Free(K).
It can be seen that with every other consistent subset of A, Free(K) is consistent, it follows that there
is no an argument attacks z. Assume the contracdiction that there is an argument y ∈ ArgK such that
y attacks z. This means that ∃ϕ ∈ Sup(z) s.t ClT ({Con(y), ϕ}) is T -inconsistent and y ⪰rank z.
Thus, ClT (Free(K) ∪ Sup(y)) is T -inconsistent. However, we know that Sup(y) is consistent. This
shows that Free(K) is inconsistent with the consistent subset Sup(y) of the ABox A, a contradiction.
Consequently z is unattacked by any argument, then it must be in every extension.
4. DISCUSSION
4.1. Explanation technique
In this section, we survey works on explaining query (non-)answers and entailments. As mentioned in
the introduction, DL reasoning systems with explanation facilities have recently become interests in different
areas of AI [10]-[12], [14]-[16]. The earliest work mainly focuses on the explanation of standard reasoning
tasks and the associated types of entailments [10], [11]. The authors propose the notion of axiom pinpointing,
where the idea is that we compute minimal subsets of ontological axioms, which provide a consequence. In our
framework, TBox is considered to be coherent, namely, consequences of the TBox are desirable. It is clear that
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach (Loan Thi-Thuy Ho)
9. 2952 ❒ ISSN: 2088-8708
the works on axiom pinpointing is a first step to confirm that the errors arise from the data sources, i.e. ABoxes
are inconsistent. Beside the works of computing axiom pinpointing, explanation techniques for querying in
inconsistency-tolerant semantics have been recently addressed in the literature [12], [14]-[16]. Specifically,
Bienvenu et al. [12] consider the problem of explanations in DL-LiteR KBs. The authors introduced the
definition of explanations for (non-) answers of the query under three semantics (brave, AR, and IAR), and
the data complexity of different related problems. Their motivations are quite similar to our work. In order to
explain different (brave, AR and IAR)-answers, the authors use sets of causes that minimally cover the repairs,
whereas, for SPS and CPS-answers, the explanations are the sets of arguments covering the stable/preferred
extensions. Having said that, their work differs from us since we explore the explanation technique for querying
in prioritized DL-LiteR KBs. Lukasiewicz et al. [15] propose explanation techniques for query answering
under three inconsistency-tolerant semantics (AR, IAR, ICR semantics) in rule-based language and fulfil a
complexity analysis under the combined, bounded arity-combined and fixed-program-combined complexities,
besides the data complexity. In their work, a notion of minimal explanations is defined as minimal consistent
subsets from sets of facts that entail the query. Note that the notion of explanations is equivalent to the concept
of causes in [12]. In our paper, in contrast, we consider a different formalism expressed by DL-LiteR in
the context where the ABox has the preferences. While the existing approaches, such as [12], [15], have
showed how to compute explanations that can provide the answers for queries holding inconsistency-tolerant
semantics, our framework shows ”inconsistency of KBs” and ”why querying answers hold in the prioritized
KB”. The closest related approach is proposed by Arioua et al. [14] who present an argumentation framework
to explain query answers under the inconsistency-tolerant semantics in the presence of existential rules. The
authors compute one explanation for ICR-answer by using the hitting set algorithm, applied either on the set
of attacking arguments or on the sets of supporting arguments presenting in extensions (which corresponds to
repairs) [16]. Contrary to our framework, their focus is on building the arguments without considering priorities
in the set of facts and considering different inconsistency-tolerant semantics for Datalog±
.
4.2. Argumentation framework
In this section, we discuss our result with the related works in argumentation framework. Argu-
mentation is a potential approach for inconsistency-tolerant reasoning over KBs. To resolve conflicting and
uncertain information, several argumentation frameworks have recently been studied in different representa-
tion languages such as defeasible logics (DLs), classical Logics (CLs). Specially, GenAF presented in [22] to
address reasoning for inconsistent ontologies expressed by ALC. Garcia et al. [23] propose defeasible logic
programming (DeLP), which is a combination of defeasible argumentation with outcomes of logic program-
ming. These systems have several differences when comparing with our framework. First one is the way of
characterizing arguments: our work constructs arguments immediately from subsets of the KB by utilizing
the proof procedure, while arguments in these two systems are formed of inference trees by using two forms
of rules. The other difference is that all arguments in these systems are equally strong, whereas our frame-
work considers the preferences of arguments. In our work, we adopt the notion of preferred subtheories as the
variants of inconsistency-tolerant semantics for reasoning in ontological KBs, and clarify the correspondence
between diverse notions of extensions for (preference-based) AFs and preferred subtheories. Marcello et.al pro-
pose argumentative approach for reasoning under preferred subtheories in CLs [24], [25]. The authors consider
the argumentative characterisations in the standard and dialectical approaches to classical logic argumentation
(Cl-Arg). Moreover, they also indicate that the preferred and stable semantics of argumentation frameworks
instantiated by default theories coincide. From above analyses, all approaches can be viewed as the study for
characterizing preferred subtheories inference based on argumentation theory. However, all works noted so
far focus on classical logics associated with priorities while our work takes into account different formalism,
namely, description logics. An argument-based approach closely related to our work, i.e. an argumentation
framework is built from an inconsistent ontological KB to handle inconsistency under the locally optimal,
Pareto optimal, globally optimal semantics, which is proposed by Madalina and Rallou [26]. Their framework
supposes that all attacks always succeed and preferences of arguments can be used to select only the best exten-
sions. By contrast, our framework only considers preferences of arguments to formally define attack relations
amongst arguments, namely, for any argument R and P, an attack relation can be a successful attack iff R
attacks P and R is stronger than its attacker.
Int J Elec Comp Eng, Vol. 12, No. 3, June 2022: 2944–2954
10. Int J Elec Comp Eng ISSN: 2088-8708 ❒ 2953
5. CONCLUSION
The main contribution of the paper is to consider the use of argumentation framework to address
the problem of explaining query answer in prioritized DL-LiteR KBs. More specifically, we proposed an
prioritized argumentation framework, which corresponds to a given prioritized DL-LiteR KB. The advantage
of utilizing argumentation framework is to permits (by considering the support set) to track the provenance
from data sources used to deduce query answers and to see (by considering the attack relations) which pieces
of data are incompatible together. Moreover, we clarified the closed relation between the prioritized DL-LiteR
KB and the proposed argumentation framework. The significant result paves the way for applying algorithms
and argument game proof theories to establish preferred subtheories inferences in the prioritized DL-LiteR KB.
Study of the model-theoretic relations between other semantics of argumentation framework and
inconsistency-tolerant semantics would be open problems for furture works. The study will have a huge impact
on the knowledge representation (KR) and the argumentation theory (AT) community. It shows how KR com-
munity could receive benefits from the results of the argumentation theory and whether AT community could
utilize the outcomes of KR community.
ACKNOWLEDGEMENT
This work was supported by grants from Khon Kaen University via ASEAN and GMS Countries’s
Personnel Programs 2016–2019 and an Interdisciplinary Grant (CSKKU2559) from the Department of Com-
puter Science, Khon Kaen University
REFERENCES
[1] R. Gunawan and K. Mustofa, “Finding knowledge from Indonesian traditional medicine using semantic web rule
language,” International Journal of Electrical and Computer Engineering (IJECE), vol. 7, no. 6, pp. 3674–3682, 12
2017, doi: 10.11591/ijece.v7i6.pp3674-3682.
[2] H. Ahuja and S. R, “Implementation of FOAF, AIISO and DOAP ontologies for creating an academic community
network using semantic frameworks,” International Journal of Electrical and Computer Engineering (IJECE), vol. 9,
no. 5, pp. 4302-4310, 2019, doi: 10.11591/ijece.v9i5.pp4302-4310.
[3] N. Chilagani and S. Sarma, “Blended intelligence of FCA with FLC for knowledge representation from clustered
data in medical analysis,” International Journal of Electrical and Computer Engineering (IJECE), vol. 9, no. 1,
pp. 635-645, 2019, doi: 10.11591/ijece.v9i1.pp635-645.
[4] I. Nadim, Y. Ghayam, and A. Sadiq, “Towards a semantic web of things framework,” IAES International Journal of
Artificial Intelligence (IJ-AI), vol. 8, no. 4, pp. 443-450, 2019, doi: 10.11591/ijai.v8.i4.pp443-450.
[5] D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, “Tractable reasoning and efficient query
answering in description logics: The dl-lite family,” Journal of Automated Reasoning, vol. 39, no. 3, pp. 385–429,
Oct 2007, doi: 10.1007/s10817-007-9078-x.
[6] A. Cali, G. Gottlob, and A. Pieris, “Towards more expressive ontology languages: The query answering problem,”
Artificial Intelligence, vol. 193, pp. 87–128, 2012, doi: 10.1016/j.artint.2012.08.002.
[7] A. Telli, G. Hamdi, and M. N. Omri, “Lexicographic repair under querying prioritized dl-lite knowledge base,”
Journal of King Saud University, vol. 1, pp. 124–130, 01 2021.
[8] A. Telli, S. Benferhat, M. Bourahla, Z. Bouraoui, and K. Tabia, “Polynomial algorithms for computing a single
preferred assertional-based repair,” KIunstliche Intelligenz, vol. 31, no. 1, pp. 15–30, Mar 2017, doi: 10.1007/s13218-
016-0466-4.
[9] G. Brewka, “Preferred subtheories: An extended logical framework for default reasoning,” in IJCAI, 1989,
pp. 1043–1048.
[10] A. Kalyanpur, B. Parsia, E. Sirin, and J. Hendler, “Debugging unsatisfiable classes in owl ontologies,” Journal of Web
Semantics, vol. 3, no. 4, pp. 268-293, 2005, doi: 10.1016/j.websem.2005.09.005.
[11] F. Baader and R. Penaloza, “Axiom pinpointing in general tableaux,” Journal of Logic and Computation, vol. 20,
no. 1, pp. 5–34, 2008, doi: 10.1093/logcom/exn058.
[12] M. Bienvenu, C. Bourgaux, and F. Goasdoue, “Computing and explaining query answers over inconsistent
dl-lite knowledge bases,” Journal of Artificial Intelligence Research, vol. 64, pp. 563–644, Jan. 2019, doi:
10.1613/jair.1.11395
[13] I. I. Ceylan, T. Lukasiewicz, E. Malizia, and A. Vaicenavicius, “Explanations for query answers under existential
rules,” in Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, 2019,
pp. 1639–1646, doi: 10.24963/ijcai.2019/227.
Reasoning in inconsistent prioritized knowledge bases: an argumentative approach (Loan Thi-Thuy Ho)
11. 2954 ❒ ISSN: 2088-8708
[14] A. Arioua, M. Croitoru, and S. Vesic, “Logic-based argumentation with existential rules,” International Journal of
Approximate Reasoning, vol. 90, pp. 76-106, 2017, doi: 10.1016/j.ijar.2017.07.004.
[15] T. Lukasiewicz, E. Malizia, and C. Molinaro, “Explanations for inconsistency-tolerant query answering under exis-
tential rules,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 3, pp. 2909–2916, Apr.
2020, doi: 10.1609/aaai.v34i03.5682.
[16] S. Jabbour, Y. Ma, and B. Raddaoui, “Handling disagreement in ontologies-based reasoning via argumentation,” Int.
Conf. on Web Information Systems Engineering, 2019, pp. 389–406, doi: 10.1007/978-3-030-34223-4-25.
[17] M. Bienvenu, C. Bourgaux, and F. Goasdoue, “Explaining inconsistency-tolerant query answering over description
logic knowledge bases,” in Proceedings of the AAAI Conference on Artificial Intelligence, 2016, pp. 900–906.
[18] P. M. Dung, “On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic pro-
gramming and n-person games,” Artificial Intelligence, vol. 77, no. 2, pp. 321-357, 1995, doi: 10.1016/0004-
3702(94)00041-X.
[19] M. Bienvenu, “A short survey on inconsistency handling in ontology-mediated query answering,” KI-Künstliche
Intelligenz, vol. 43, no. 4, no. 443–451, 2020.
[20] D. Johnson and A. Klug, “Testing containment of conjunctive queries under functional and inclusion dependencies,”
Journal of Computer and System Sciences, vol. 28, no. 1, pp. 167 – 189, 1984, doi: 10.1016/0022-0000(84)90081-3.
[21] L. Amgoud, “Postulates for logic-based argumentation systems,” International Journal of Approximate Reasoning,
vol. 55, no. 9, pp. 2028 – 2048, 2014, doi: 10.1016/j.ijar.2013.10.004.
[22] M. O. Moguillansky and G. R. Simari, “A generalized abstract argumentation framework for inconsistency-tolerant
ontology reasoning,” Expert Systems with Applications, vol. 64, pp. 141-168, 2016, doi: 10.1016/j.eswa.2016.07.027.
[23] A. J. Garcia and G. R. Simari, “Defeasible logic programming: an argumentative approach,” Theory and practice of
logic programming, vol. 4, no. 2, pp. 95–138, Jan. 2004, doi: 10.1017/S1471068403001674.
[24] M. D’Agostino and S. Modgil, “A study of argumentative characterisations of preferred subtheories,” in Proceedings
of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, 2018, pp. 1788–1794.
[25] L. Amgoud and C. Cayrol, “Inferring from inconsistency in preference-based argumentation frameworks,” Journal of
Automated Reasoning, vol. 29, no. 2, pp. 125–169, 2002, doi: 10.1023/A:1021603608656.
[26] M. Croitoru, R. Thomopoulos, and S. Vesic, “Introducing preference-based argumentation to inconsistent ontological
knowledge bases,” in Int. Conf. on Principles and Practice of Multi-Agent Systems, 2015, pp. 594–602.
BIOGRAPHIES OF AUTHORS
Loan Thi-Thuy Ho received the M.S. degree from Hue University of Sciences, Vietnam,
in 2014. She is currently a Ph.D. student in Department of Computer Science, College of Computing,
Khon Kaen University, Thailand. Her research interests are knowledge representation and reasoning,
semantic web, argumentation theory. Email: loanthuyho.cs@gmail.com.
Somjit Arch-int received the Ph.D. degree in computer science from the Asian Institute of
Technology, Thailand in 2002. He is an associate professor in the Department of Computer Science
at Khon Kaen University, Thailand. His previous experiences include the development of several
industry systems and consulting activities. His research interests are knowledge based representation,
semantic information integration, data mining, and semantic Web. He is a member of the IEEE
Computer Society. Email: somjit@kku.ac.th.
Ngamnij Arch-int received the Ph.D. degree in computer science from Chulalongkorn
University, Thailand in 2003. She is an associate professor in the Department of Computer Science
at Khon Kaen University, Thailand. Her research interests are in fields of semantic web, knowledge
based representation and heterogeneous information integration. Email: ngamnij@kku.ac.th.
Int J Elec Comp Eng, Vol. 12, No. 3, June 2022: 2944–2954