This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argued consequence relation, taking into account the existence of consistent arguments in favour of a conclusion and the absence of consistent arguments in favour of its contrary, is particularly investigated. Flat knowledge bases, i.e., without any priority between their elements, are studied under different inconsistency-tolerant consequence relations, namely the so-called argumentative, free, universal, existential, cardinality-based, and paraconsistent consequence relations. The syntax-sensitivity of these consequence relations is (...) studied. A companion paper is devoted to the case where priorities exist between the pieces of information in the knowledge base. (shrink)

This paper first provides a brief survey of a possibilistic handling of default rules. A set of default rules of the form, "generally, from α deduce β", is viewed as the family of possibility distributions satisfying constraints expressing that the situation where α and β is true has a greater plausibility than the one where α and ⇁β is true. When considering only the subset of linear possibility distributions, the well-known System P of postulates proposed by Kraus, Lehmann and Magidor, (...) has been obtained. We also present two rational extensions: one based on the minimum specificity principle and the other is based on the lexicographic ordering. The second part of the paper presents an empirical study of three desirable properties for a consequence relation that capture default reasoning: Rationality, Property Inheritance and Ambiguity Preservation. An experiment is conducted to investigate 13 patterns of inference for the test of these properties. Our experimental apparatus confirms previous results on the relevance of System P, and enforces the psychological relevance of the studied properties. (shrink)

This paper investigates simple syntactic methods for revising prioritized belief bases, that are semantically meaningful in the frameworks of possibility theory and of Spohn''s ordinal conditional functions. Here, revising prioritized belief bases amounts to conditioning a distribution function on interpretations. The input information leading to the revision of a knowledge base can be sure or uncertain. Different types of scales for priorities are allowed: finite vs. infinite, numerical vs. ordinal. Syntactic revision is envisaged here as a process which transforms a (...) prioritized belief bases into a new prioritized belief base, and thus allows a subsequent iteration. (shrink)

. This paper first provides a brief survey of a possibilistic handling of default rules. A set of default rules of the form, “generally, from α deduce β”, is viewed as the family of possibility distributions satisfying constraints expressing that the situation where α and β is true has a greater plausibility than the one where a and - β is true. When considering only the subset of linear possibility distributions, the well-known System P of postulates proposed by Kraus, Lehmann (...) and Magidor, has been obtained. We also present two rational extensions: one based on the minimum specificity principle and the other is based on the lexicographic ordering. The second part of the paper presents an empirical study of three desirable properties for a consequence relation that capture default reasoning: Rationality, Property Inheritance and Ambiguity Preservation. An experiment is conducted to investigate 13 patterns of inference for the test of these properties. Our experimental apparatus confirms previous results on the relevance of System P, and enforces the psychological relevance of the studied properties. (shrink)

1. Real-world applications, such as monitoring urban wastewater networks, commonly process large volumes of multi-source, heterogeneous data to support reasoning, query answering and decision-makin...

One of the major problems of intrusion detection concerns the large amount of alerts that intrusion detection systems (IDS) produce. Security operator who analyzes alerts and takes decisions, is often submerged by the high number of alerts to analyze. In this paper, we present a new alert correlation approach based on knowledge and preferences of security operators. This approach, which is complementary to existing ones, allows to rank-order produced alerts on the basis of a security operator knowledge about the system, (...) used IDS and his preferences about alerts that he wants to analyze or to ignore. Our approach is based on the development of a new non-classical logic for representing preferences, called FO-MQCL (First Order - Minimal Qualitative Choice Logic). Our logic extends a fragment of the first order logic by adding a new logical connective. The general idea is to present only alerts that fully fit security operator's preferences and knowledge. And if needed, less preferred alerts can also be presented. (shrink)

One of the major problems of intrusion detection concerns the large amount of alerts that intrusion detection systems (IDS) produce. Security operator who analyzes alerts and takes decisions, is often submerged by the high number of alerts to analyze. In this paper, we present a new alert correlation approach based on knowledge and preferences of security operators. This approach, which is complementary to existing ones, allows to rank-order produced alerts on the basis of a security operator knowledge about the system, (...) used IDS and his preferences about alerts that he wants to analyze or to ignore. Our approach is based on the development of a new non-classical logic for representing preferences, called FO-MQCL (First Order - Minimal Qualitative Choice Logic). Our logic extends a fragment of the first order logic by adding a new logical connective. The general idea is to present only alerts that fully fit security operator's preferences and knowledge. And if needed, less preferred alerts can also be presented. (shrink)

The two-volume set LNCS 10350 and 10351 constitutes the thoroughly refereed proceedings of the 30th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2017, held in Arras, France, in June 2017. The 70 revised full papers presented together with 45 short papers and 3 invited talks were carefully reviewed and selected from 180 submissions. They are organized in topical sections: constraints, planning, and optimization; data mining and machine learning; sensors, signal processing, and data fusion; recommender (...) systems; decision support systems; knowledge representation and reasoning; navigation, control, and autonome agents; sentiment analysis and social media; games, computer vision; and animation; uncertainty management; graphical models: from theory to applications; anomaly detection; agronomy and artificial intelligence; applications of argumentation; intelligent systems in healthcare and mhealth for health outcomes; and innovative applications of textual analysis based on AI. (shrink)

The problem of merging multiple sources information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, expert opinion pooling, etc. Recently, several approaches have been proposed to merge classical propositional bases, or sets of (non-prioritized) goals. These approaches are in general semantically defined. Like in belief revision, they use priorities, generally based on Dalal's distance, for merging the classical bases and return a new classical base as a result. An immediate consequence of the (...) generation of a classical base is the impossibility of iterating the fusion process in a coherent way w.r.t. priorities since the underlying ordering is lost. This paper presents a general approach for fusing prioritized bases, both semantically and syntactically, when priorities are represented in the possibilistic logic framework. Different classes of merging operators are considered including conjunctive, disjunctive, reinforcement and adaptive operators. We show that the approaches which have been recently proposed for merging classical propositional bases can be embedded in this setting. The result is then a prioritized base, and hence the process can be coherently iterated. Moreover, we also provide a syntactic counterpart for the fusion of classical bases. (shrink)

This paper investigates the idea of reasoning, in a local (or contextual) way, under prioritized and possibly inconsistent knowledge bases. Priorities are not supposed to be given globally between all the beliefs in the knowledge base, but locally inside sets of pieces of information responsible for inconsistencies. This local stratification offers more flexibility for representing priorities between beliefs. Given this local ordering, we discuss five basic definitions of influence relations between conflicts. These elementary notions of influence between two conflicts A (...) and B exhaustively explore the situations where solving A leads to solve B. Then we propose natural approaches to restore the coherence of a knowledge base on the basis of influence relations between locally-stratified conflicts. (shrink)

In the framework of quantitative possibility theory, two representation modes were developed: logical-based representation in terms of quantitative possibilistic bases and graphical-based representation in terms of product-based possibilistic networks. This paper deals with logical and graphical representations of uncertain information using a quantitative possibility theory framework. We first provide a deep analysis of the relationships between these two forms of representational frameworks. Then, in the logical setting, we develop syntactic relations between penalty logic and quantitative possibilistic logic. These translations are (...) useful for different applications and are interesting for taking advantage of each format at the inferential level. We also provide an algorithm for reasoning with quantitative possibilistic logic. The algorithm takes inspiration from the syntactic relations between quantitative possibilistic logic bases and penalty logic. Finally, we provide experimental results that compar.. (shrink)