The Experts below are selected from a list of 171 Experts worldwide ranked by ideXlab platform
Jan Treur - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of multi-interpretable ecological monitoring information
Applied Artificial Intelligence, 2002Co-Authors: Frances M. T. Brazier, Joeri Engelfriet, Jan TreurAbstract:In this paper logical techniques developed to formalize the analysis of multi-interpretable information, in particular belief Set Operators and selection Operators, are applied to an ecological domain. A knowledge-based decision support system is described that determines the abiotic (chemical and physical) characteristics of a site on the basis of samples of plant species that are observed. The logical foundation of this system is described in terms of a belief Set Operator and a selection Operator.
-
nonmonotonic reasoning with multiple belief Sets
Annals of Mathematics and Artificial Intelligence, 1998Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In complex reasoning tasks it is often the case that there is no single, correct Set of conclusions given some initial information. Instead, there may be several such conclusion Sets, which we will call belief Sets. In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze structural aspects of reasoning with multiple belief Sets. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selection Operators connected to belief Set Operators, which are used to choose some of the possible belief Sets.
-
Applications of Uncertainty Formalisms - Analysis of multi-interpretable ecological monitoring information
Applications of Uncertainty Formalisms, 1998Co-Authors: Frances M. T. Brazier, Joeri Engelfriet, Jan TreurAbstract:In this paper logical techniques developed to formalize the analysis of multiinterpretable information, in particular belief Set Operators and selection Operators, are applied to an ecological domain. A knowledge-based decision support system i s described that determines the abiotic (chemical and physical) characteristics of a site on the basis of samples of plant species that are observed. The logical foundation of this system is described in terms of a belief Set Operator and a selection Operator. Moreover, it is shown how the belief Set Operator that corresponds to the system can be represented by a normal default theory.
-
nonmonotonic reasoning with multiple belief Sets
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning, 1996Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze multiple belief Sets in an abstract Setting. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selective inference operations connected to belief Set Operators and which are used to choose one of the possible views.
-
FAPR - Nonmonotonic Reasoning with Multiple Belief Sets
Practical Reasoning, 1996Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze multiple belief Sets in an abstract Setting. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selective inference operations connected to belief Set Operators and which are used to choose one of the possible views.
Christian Ronse - One of the best experts on this subject based on the ideXlab platform.
-
Closures on partial partitions from closures on Sets
Mathematica Slovaca, 2013Co-Authors: Christian RonseAbstract:Jordens and Sturm investigated the link between closure systems on Sets and closure systems on partitions. We extend that study to the wider framework of partial partitions, and highlight better the relation between these two families of closure systems. Then we consider the construction of a closure Operator on partial partitions by the iterated application a Set Operator to the blocks of a partial partition; the resulting closure system fits into our framework.
-
Adjunctions on the lattices of partitions and of partial partitions
Applicable Algebra in Engineering Communication and Computing, 2010Co-Authors: Christian RonseAbstract:The complete lattice Π( E ) of partitions of a space E has been extended into Π*( E ), the one of partial partitions of E (where the space covering axiom is removed). We recall the main properties of Π*( E ), and exhibit two adjunctions (residuations) between Π( E ) and Π*( E ). Given two spaces E _1 and E _2 (distinct or equal), we analyse adjunctions between Π*( E _1) and Π*( E _2), in particular those where the lower adjoint applies a Set Operator to each block of the partial partition; we also show how to build such adjunctions from adjunctions between $${\mathcal{P}(E_2)}$$ and $${\mathcal{P}(E_2)}$$ (the complete lattices of subSets of E _1 and E _2). They are then extended to adjunctions between Π( E _1) and Π( E _2). We obtain as particular case the adjunction on Π( E ) that was defined by Serra (for the upper adjoint) and Ronse (for the lower adjoint). We also study dilations from Π*( E _1) to an arbitrary complete lattice L ; a particular case is given, for $${L \subSeteq [0,+\infty]}$$ , by ultrametrics; then the adjoint erosion provides the corresponding hierarchy. We briefly discuss possible applications in image processing and in data clustering.
-
Adjunctions on the lattices of partitions and of partial partitions
Applicable Algebra in Engineering Communication and Computing, 2010Co-Authors: Christian RonseAbstract:The complete lattice Π(E) of partitions of a space E has been extended into Π * (E), the one of partial partitions of E (where the space covering axiom is removed). We recall the main properties of Π * (E), and exhibit two adjunctions (residuations) between Π(E) and Π * (E). Given two spaces E 1 and E 2 (distinct or equal), we analyse adjunctions between Π * (E 1) and Π * (E 2), in particular those where the lower adjoint applies a Set Operator to each block of the partial partition; we also show how to build such adjunctions from adjunctions between P(E 1) and P(E 2) (the complete lattices of subSets of E 1 and E 2). They are then extended to adjunctions between Π(E 1) and Π(E 2). We obtain as particular case the adjunction on Π(E) that was defined by Serra (for the upper adjoint) and Ronse (for the lower adjoint). We also study dilations from Π * (E 1) to an arbitrary complete lattice L; a particular case is given, for L ⊆ [0, +∞], by ultrametrics; then the adjoint erosion provides the corresponding hierarchy. We briefly discuss possible applications in image processing and in data clustering.
-
Anamorphoses and Flat Morphological Operators on Power Lattices
Acta Applicandae Mathematicae, 2008Co-Authors: Christian RonseAbstract:Flat morphological Operators are Operators on grey-level images derived from increasing Set Operators by a combination of thresholding and stacking . For analog grey-levels, they commute with anamorphoses or contrast mappings , that is, continuous increasing grey-level transformations; when the underlying Set Operator is upper semi-continuous , they also commute with thresholding. For bounded discrete grey-levels, commutation with increasing grey-level transformations and with thresholding is guaranteed, without any continuity conditions. In this paper we consider flat Operators for images defined on an arbitrary space of points and taking their values in an arbitrary complete lattice. We study their commutation with increasing transformations of values. This requires some continuity requirements on the transformations of values or on the underlying Set Operator, which are expressed in terms of the lattice of values. We obtain as particular cases the known conditions for analog and discrete grey-levels, and also new conditions for other examples of values: multivalued vectors or any finite Set of values.
-
Anamorphoses and Flat Morphological Operators on Power Lattices
Acta Applicandae Mathematicae, 2008Co-Authors: Christian RonseAbstract:Flat morphological Operators are Operators on grey-level images derived from increasing Set Operators by a combination of thresholding and stacking. For analog grey-levels, they commute with anamorphoses or contrast mappings, that is, continuous increasing grey-level transformations; when the underlying Set Operator is upper semi-continuous, they also commute with thresholding. For bounded discrete grey-levels, commutation with increasing grey-level transformations and with thresholding is guaranteed, without any continuity conditions.
Niu Dong-xiao - One of the best experts on this subject based on the ideXlab platform.
-
Application of Mining Default Rules Based on Rough Set in Power System Short-Term Load Forecasting
Power system technology, 2006Co-Authors: Niu Dong-xiaoAbstract:Here, the mining default rules based on rough Set (MDRBR) is applied to power system short-term load forecasting. First, the conditional attributes such as temperature and humidity that affect load characteristics are discretized by rough Set discretization algorithm based on Gini index, and the consideration is given to both conditional attributes and decision-making attributes. On this basis, through computing the confidence and support of rules the network rules Set in different levels, which is accompanied with rough Set Operator and conforms to originally specified threshold, is generated, so the redundant rules brought about by the influence of noise can be reduced, so that the generated classification rules Set can be evidently minified and the efficiency of retrieving rules can be improved while the rules are used. During the load forecasting the rules Set is searched layer by layer from the top to the bottom until the rules that match with the information are found out. The rough Set Operator reflects the significance level of the rule, so it is used as the standard to choose rules. Case applications show that the presented method can effectively remove noise and improve the efficiency of mining default rules, therefore the accuracy of load forecasting can be improved.
Joeri Engelfriet - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of multi-interpretable ecological monitoring information
Applied Artificial Intelligence, 2002Co-Authors: Frances M. T. Brazier, Joeri Engelfriet, Jan TreurAbstract:In this paper logical techniques developed to formalize the analysis of multi-interpretable information, in particular belief Set Operators and selection Operators, are applied to an ecological domain. A knowledge-based decision support system is described that determines the abiotic (chemical and physical) characteristics of a site on the basis of samples of plant species that are observed. The logical foundation of this system is described in terms of a belief Set Operator and a selection Operator.
-
nonmonotonic reasoning with multiple belief Sets
Annals of Mathematics and Artificial Intelligence, 1998Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In complex reasoning tasks it is often the case that there is no single, correct Set of conclusions given some initial information. Instead, there may be several such conclusion Sets, which we will call belief Sets. In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze structural aspects of reasoning with multiple belief Sets. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selection Operators connected to belief Set Operators, which are used to choose some of the possible belief Sets.
-
Applications of Uncertainty Formalisms - Analysis of multi-interpretable ecological monitoring information
Applications of Uncertainty Formalisms, 1998Co-Authors: Frances M. T. Brazier, Joeri Engelfriet, Jan TreurAbstract:In this paper logical techniques developed to formalize the analysis of multiinterpretable information, in particular belief Set Operators and selection Operators, are applied to an ecological domain. A knowledge-based decision support system i s described that determines the abiotic (chemical and physical) characteristics of a site on the basis of samples of plant species that are observed. The logical foundation of this system is described in terms of a belief Set Operator and a selection Operator. Moreover, it is shown how the belief Set Operator that corresponds to the system can be represented by a normal default theory.
-
nonmonotonic reasoning with multiple belief Sets
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning, 1996Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze multiple belief Sets in an abstract Setting. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selective inference operations connected to belief Set Operators and which are used to choose one of the possible views.
-
FAPR - Nonmonotonic Reasoning with Multiple Belief Sets
Practical Reasoning, 1996Co-Authors: Joeri Engelfriet, Heinrich Herre, Jan TreurAbstract:In the present paper we introduce nonmonotonic belief Set Operators and selection Operators to formalize and to analyze multiple belief Sets in an abstract Setting. We define and investigate formal properties of belief Set Operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief Set Operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selective inference operations connected to belief Set Operators and which are used to choose one of the possible views.
Sonja Smets - One of the best experts on this subject based on the ideXlab platform.
-
A Topological Approach to Full Belief
Journal of Philosophical Logic, 2019Co-Authors: Alexandru Baltag, Nick Bezhanishvili, Aybüke Özgün, Sonja SmetsAbstract:Stalnaker ( Philosophical Studies, 128 (1), 169–199 2006 ) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior Operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge (as the interior Operator) with a new topological semantics for belief. We prove that the belief logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological Setting in which belief is interpreted in terms of the derived Set Operator. We also study (static) belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our Setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces , and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic.
