Soma Dutta
University of Warsaw
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Soma Dutta.
Indian Conference on Logic and Its Applications | 2013
Soma Dutta; Sanjukta Basu; Mihir K. Chakraborty
In this paper a comparative study of many-valued logics, fuzzy logics and the theory of graded consequence has been made focussing on consequence, inconsistency and sorites paradox.
Archive | 2016
Andrzej Skowron; Andrzej Jankowski; Soma Dutta
Nowadays efficient methods for dealing with Big Data are urgently needed for many real-life applications. Big Data is often distributed over networks of agents involved in complex interactions. Decision support for users, to solve problems using Big Data, requires to develop relevant computation models for the agents as well as methods for incorporating changes in the reasoning of the computation models themselves; these requirements would enable agents to control computations for achieving the target goals. It is to be noted that users are also agents. Agents are performing computations on complex objects of very different natures (e.g., (behavioral) patterns, classifiers, clusters, structural objects, sets of rules, aggregation operations, reasoning schemes etc.). One of the challenges for systems based on Big Data is to provide the systems with high-level primitives of users for composing and building complex analytical pipelines over Big Data. Such primitives are very often expressed in natural language, and they should be approximated using low-level primitives, accessible from raw data. In Granular Computing (GrC), all such constructed and/or induced objects are called granules. To model interactive computations, performed by the agent in complex systems based on Big Data, we extend the existing approach to GrC by introducing complex granules (c-granules or granules, for short). Many advanced tasks, concerning complex systems based on Big Data may be classified as control tasks performed by agents aiming at achieving the high quality trajectories (defined by computations) relative to the considered target tasks and quality measures. Here, new challenges are to develop strategies to control, predict, and bound the behavior of the system based on Big Data at scale. We propose to investigate these challenges using the GrC framework. The reasoning, which aims at controlling the computational schemes from time-to-time, in order to achieve the required target, is called an adaptive judgement. This reasoning deals with granules and computations over them. Adaptive judgement is more than a mixture of reasoning based on deduction, induction and abduction. Due to the uncertainty the agents generally cannot predict exactly the results of actions (or plans). Moreover, the approximations of the complex vague concepts initiating actions (or plans) are drifting with time. Hence, adaptive strategies for evolving approximation of concepts with respect to time are needed. In particular, the adaptive judgement is very much needed in the efficiency management of granular computations, carried out by agents, for risk assessment, risk treatment, cost/benefit analysis. The approach, discussed in this paper, is a step towards realization of the Wisdom Technology (WisTech) program [2, 3], and is developed over years of experiences, based on the work on different real-life projects.
Archive | 2017
Andrzej Skowron; Soma Dutta
In this chapter we propose a departure from classical notion of information systems. We propose to bring in the background of agent’s interaction with physical reality in arriving at a specific information system. The proposals for generalizing the notion of information systems are made from two aspects. In the first aspect, we talk about incorporating relational structures over the value sets from where objects assumes values with respect to a set of attributes. In the second aspect, we introduce interaction with physical reality within the formal definition of information systems, and call them as interactive information systems.
Indian Conference on Logic and Its Applications | 2015
Soma Dutta; Benjamín R. C. Bedregal; Mihir Kr. Chakraborty
This paper proposes some instances of graded consequence relation where the object language formulae are interpreted by sub-intervals of [0, 1]. These instances represent different attitudes of decision making that may be called conservative, liberal, and moderate.
Conference of the Spanish Association for Artificial Intelligence | 2016
Soma Dutta; Francesc Esteva; Lluís Godo
In this paper, the meaning of a vague concept \(\alpha \) is assumed to be rendered through two (mutually exclusive) finite sets of prototypes and counterexamples. In the remaining set of situations the concept is assumed to be applied only partially. A logical model for this setting can be fit into the three-valued Łukasiewicz’s logic Ł\(_3\) set up by considering, besides the usual notion of logical consequence \(\models \) (based on the truth preservation), the logical consequence \(\models ^\le \) based on the preservation of all truth-degrees as well. Moreover, we go one step further by considering a relaxed notion of consequence to some degree \(a \in [0, 1]\), by allowing the prototypes (counterexamples) of the premise (conclusion) be a-similar to the prototypes (counterexamples) of the conclusion (premise). We present a semantical characterization as well as an axiomatization.
pattern recognition and machine intelligence | 2015
Soma Dutta; Piotr Wasilewski
This paper is a preliminary step towards proposing a scheme for synthesis of a concept out of a set of concepts focusing on the following aspects. The first is that the semantics of a set of simple (or independent) concepts would be understood in terms of its prototypes and counterexamples, where these instances of positive and negative cases may vary with the change of the context, i.e., a set of situations which works as a precursor of an information system. Secondly, based on the classification of a concept in terms of the situations where it strictly applies and where not, a degree of application of the concept to some new situation/world would be determined. This layer of reasoning is named as logic of prototypes and counterexamples. In the next layer the method of concept synthesis would be designed as a graded concept based on the already developed degree based approach for logic of prototypes and counterexamples.
Logica Universalis | 2011
Soma Dutta; Mihir K. Chakraborty
Does there exist any equivalence between the notions of inconsistency and consequence in paraconsistent logics as is present in the classical two valued logic? This is the key issue of this paper. Starting with a language where negation (
international joint conference on rough sets | 2018
Dominik Ślęzak; Soma Dutta
international joint conference on rough sets | 2018
Soma Dutta; Andrzej Skowron
{\neg}
international joint conference on rough sets | 2018
Andrzej Skowron; Soma Dutta