This paper proposes an original generic hierarchical framework in order to facilitate the modeling stage of complex autonomous robotics mission planning problems with action uncertainties. Such stochastic planning problems can be modeled as Markov Decision Processes [5]. This work is…

In this work we present an approach to model an action-oriented system controlled by BDI agents using a defeasible argumentation formalism to represent its knowledge. Here, our main concern will be modelling the software agents that drive the physical robots.

There are three kinds of uncertainty in the process of fish-disease diagnosis, such as randomicity, fuzzy and imperfection, which affect the veracity of fish-disease diagnostic conclusion. So, it is important to construct a fish-disease diagnostic model to effectively deal with…

Associating the pattern in text data with the pattern with time series data is a novel task. In this paper, an approach that utilizes the features of the time series data and domain knowledge is proposed and used to identify…

Effective document retrieval using domain knowledge and semantics is one of the major challenges in Information Retrieval. Over the last years, there has been a growing interest in ontologies as an artifact for human knowledge representation and a critical component…

In this paper we present an e ective prover for mbC, a minimal inconsistency logic. The mbC logic is a paraconsistent logic of the family of logics of formal inconsistency. Paraconsistent logics have several philosophical motivations as well as many…

In the past, numerous approaches have been formulated either for approximating Pareto-optimal alternatives or supporting the decision making process with an interactive multi criteria decision aiding methodology. The article on the other hand presents an integrated system for the resolution…

Classical methods for representing and reasoning with knowledge rely on the assumption that the available information is complete, certain and consistent. In real-world problems this is usually not the case, and Al has long dealt with the issue of finding…

In the restricted single-machine common due date problem the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties, while for the weighted tardiness problem the goal is to find…

Evolutionary algorithms (EAs) are merely blind search algorithms, which only make use of the relative fitness of solutions, but completely ignore the nature of the problem. Their performance can be improved by using new multirecombinative approaches, which provide a good…