Search

Your search keyword '"BANERJEE, MOHUA"' showing total 19 results
Start Over Author "BANERJEE, MOHUA" Topic modal logic

Refine your results

more »

more »

19 results on '"BANERJEE, MOHUA"'

2. Possibilistic vs. Relational Semantics for Logics of Incomplete Information

Author

Banerjee, Mohua, Dubois, Didier, Godo, Lluis, Junqueira Barbosa, Simone Diniz, editor, Chen, Phoebe, editor, Cuzzocrea, Alfredo, editor, Du, Xiaoyong, editor, Filipe, Joaquim, editor, Kara, Orhun, editor, Kotenko, Igor, editor, Sivalingam, Krishna M., editor, Ślęzak, Dominik, editor, Washio, Takashi, editor, Yang, Xiaokang, editor, Laurent, Anne, editor, Strauss, Olivier, editor, Bouchon-Meunier, Bernadette, editor, and Yager, Ronald R., editor

Published
2014
Full Text
View/download PDF

3. A Logic for Complete Information Systems

Author

Khan, Md. Aquil, Banerjee, Mohua, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Sossai, Claudio, editor, and Chemello, Gaetano, editor

Published
2009
Full Text
View/download PDF

4. A Simple Modal Logic for Reasoning about Revealed Beliefs

Author

Banerjee, Mohua, Dubois, Didier, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Sossai, Claudio, editor, and Chemello, Gaetano, editor

Published
2009
Full Text
View/download PDF

5. Propositional Logics from Rough Set Theory

Author

Banerjee, Mohua, Khan, Md. Aquil, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Peters, James F., editor, Skowron, Andrzej, editor, Düntsch, Ivo, editor, Grzymała-Busse, Jerzy, editor, Orłowska, Ewa, editor, and Polkowski, Lech, editor

Published
2007
Full Text
View/download PDF

7. Logics for Temporal Information Systems in Rough Set Theory.

Author

KHAN, MD. AQUIL, BANERJEE, MOHUA, and PANDA, SIBSANKAR

Subjects
INFORMATION storage & retrieval systems, LOGIC, ROUGH sets, MODAL logic
Abstract

The article discusses temporal information systems (TISs) that add the dimension of time to complete or incomplete information systems. Through TISs, one can accommodate the possibility of domains or attribute values for objects changing with time or the availability of currently missing information with time. Different patterns of flow of information give different TISs. The corresponding logics with sound and complete axiomatization are presented. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

8. A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts.

Author

Howlader, Prosenjit and Banerjee, Mohua

Subjects
*KRIPKE semantics, *MODAL logic, *ROUGH sets, *BOOLEAN algebra, *OPERATOR algebras, *NEGATION (Logic)
Abstract

A non-distributive two-sorted hypersequent calculus PDBL and its modal extension MPDBL are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational semantics for PDBL is next proposed, where any formula is interpreted as a semiconcept of a context. For MPDBL , the relational semantics is based on Kripke contexts, and a formula is interpreted as a semiconcept of the underlying context. The systems are shown to be sound and complete with respect to the relational semantics. Adding appropriate sequents to MPDBL results in logics with semantics based on reflexive, symmetric or transitive Kripke contexts. In particular, one gets the logics MPDBL4 and MPDBL5 with semantics respectively based on reflexive, transitive Kripke contexts and reflexive, symmetric and transitive Kripke contexts. MPDBL4 also happens to be the logic for topological pure double Boolean algebra. It is demonstrated that, using PDBL , the basic notions and relations of conceptual knowledge can be expressed and inferences involving negations can be obtained. Further, drawing a connection with rough set theory, lower and upper approximations of semiconcepts of a context are defined. It is then shown that, using the formulae and sequents involving modal operators in MPDBL5 , these approximation operators and their properties can be captured. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

9. On the Relation between Possibilistic Logic and Modal Logics of Belief

Author

Banerjee, Mohua, Dubois, Didier, Godo, Lluis, and Prade, Henri

Subjects
epistemic logic, Modal logic, rough sets, possibility theory
Abstract

Possibility theory and modal logic are two knowledge representation frameworks that share some common features, such as the duality between possibility and necessity, as well as some obvious di?erences since possibility theory is graded but is not primarily a logical setting. In the last thirty years there have been a series of attempts, reviewed in this paper, for bridging the two frameworks in one way or another. Possibility theory relies on possibility distributions and modal logic on accessibility relations, at the semantic level. Beyond the observation that many properties of possibility theory have qualitative counterparts in terms of axioms of well-known modal logic systems, the first works have looked for (graded) accessibility relations that can account for the behavior of possibility and necessity measures. More recently, another view has emerged from the study of logics of incomplete information, which is no longer based on Kripke-like models. On the one hand, possibilistic logic, closely related to possibility theory, mainly handles beliefs having various strength. On the other hand, in the so-called meta-epistemic logic (MEL) an agent can express both beliefs and explicitly ignored facts (both without strength), by only using modal formulas of depth 1, and no objective ones; its semantics is based on epistemic states. The system MEL+ is an extension of MEL having the syntax of S5. Generalized possibilistic logic (GPL) extends both possibilistic logic and MEL, and has a semantics in terms of sets of possibility distributions. After a survey of these di?erent attempts, the paper presents GPL+, a graded counterpart of MEL+ that extends MEL by allowing objective (sub)formulas. The axioms of GPL+ are graded counterparts of those of S5 modal system, the semantics being based on pairs made of an interpretation (representing the real state of facts) and a possibility distribution (representing an epistemic state). Soundness and completeness are established. The paper also discusses the diference with S5 used as a logic for rough sets that accounts for indiscernibility rather than incomplete information, using also the square of opposition as a common structure underlying modal logic, possibility theory, and rough set theory.

Published
2016

10. On the relation between possibilistic logic and modal logics of belief and knowledge.

Author

Banerjee, Mohua, Dubois, Didier, Godo, Lluis, and Prade, Henri

Subjects
MODAL logic, DUALITY (Logic), SEMANTICS methodology, EPISTEMIC logic, ROUGH sets
Abstract

Possibilistic logic and modal logic are knowledge representation frameworks sharing some common features, such as the duality between possibility and necessity, and the decomposability of necessity for conjunctions, as well as some obvious differences since possibility theory is graded. At the semantic level, possibilistic logic relies on possibility distributions and modal logic on accessibility relations. In the last 30 years, there have been a series of attempts for bridging the two frameworks in one way or another. In this paper, we compare the relational semantics of epistemic logics (such as KD45 and S5) with simpler possibilistic semantics of a fragment of such logics that only uses modal formulas of depth 1. This minimal epistemic logic handles both all-or-nothing beliefs and explicitly ignored facts. We also contrast epistemic logic with the S5-based rough set logic. Finally, this paper presents extensions of generalized possibilistic logic with objective and non-nested multimodal formulas, in the style of modal logics KD45 and S5. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

11. Logics for some dynamic spaces-I.

Author

KHAN, AQUIL and BANERJEE, MOHUA

Subjects
KRIPKE semantics, MATHEMATICAL logic, SET theory, SEMANTICS, MODAL logic
Abstract

We study a collection of logics L(T,I) withmodels based on 'dynamic I spaces', which are finite sequences of Kripke I frames with a common domain, I being any of the normal modal systems K, K4, T, B, S4, KTB, KB4 and S5. The language of L(T,I) has modal connectives for 'possibility' and 'necessity', as well as temporal connectives. The semantics of L(T,I) can be determined through a kind of fibring over a combination of temporal and Kripke I frames corresponding to the modal system I. This article presents, in a schematic manner, tableau-based proof procedures for this class of logics. Comparisons with closely related systems are made. We briefly look at possible applications of the logics as well. The study, in fact, generalizes the work on the logic temporal rough logic (TRL) by Banerjee and Khan [2] for Pawlak's rough set theory (RST), models of which are based on dynamic S5 spaces. The motivation behind TRL was to capture reasoning with rough sets in the scenario of a knowledge base evolving with time, when the latter is represented by a partition on the domain of discourse. RST has been generalized in many ways over the years, in particular to situations when the knowledge base is not necessarily represented by an equivalence relation, but, for instance, by tolerances or pre-orders. The logics presented here enable one to address reasoning with concepts in the context of such generalized knowledge bases evolving with time. [ABSTRACT FROM AUTHOR]

Published
2015
Full Text
View/download PDF

12. Logics for Information Systems and Their Dynamic Extensions.

Author

KHAN, MD. AQUIL and BANERJEE, MOHUA

Subjects
MATHEMATICAL logic, INFORMATION science, MODAL analysis, OPERATOR theory, DECIDABILITY (Mathematical logic), ROUGH sets, APPROXIMATION theory
Abstract

The article proposes logics for information systems, which provide information about a set of objects regarding a set of attributes. Both "complete" and "incomplete" information systems are dealt with. The language of these logics contains modal operators, and constants corresponding to attributes and attribute values. Sound and complete deductive systems for these logics are presented, and the problem of decidability is addressed. Furthermore, notions of information and information update are defined, and dynamic extensions of the above logics are presented to accommodate these notions. A set of reduction axioms enables us to obtain a complete axiomatization of the dynamic logics. [ABSTRACT FROM AUTHOR]

Published
2011
Full Text
View/download PDF

13. An update logic for information systems.

Author

Khan, Md. Aquil, Banerjee, Mohua, and Rieke, Roland

Subjects
*INFORMATION storage & retrieval systems, *KNOWLEDGE base, *ROUGH sets, *APPROXIMATION theory, *DECIDABILITY (Mathematical logic), *MODAL logic
Abstract

Updates in a knowledge base, given as an information system in rough set theory, may need to be made due to changes in (i) the set of attributes, (ii) attribute-values, or (iii) the set of objects (instances). In this article, we propose a logic for information systems which incorporates all these three aspects of updates. The logic can capture the flow of information as well as its effects on the approximations of concepts. A sound and complete deductive system for the logic is presented. The decidability issue is also discussed. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

14. Formal reasoning with rough sets in multiple-source approximation systems

Author

Khan, Md. Aquil and Banerjee, Mohua

Subjects
*APPROXIMATION theory, *FUNCTIONAL analysis, *ROUGH sets, *SET theory
Abstract

Abstract: We focus on families of Pawlak approximation spaces, called multiple-source approximation systems (MSASs). These reflect the situation where information arrives from multiple sources. The behaviour of rough sets in MSASs is investigated – different notions of lower and upper approximations, and definability of a set in a MSAS are introduced. In this context, a generalized version of an information system, viz. multiple-source knowledge representation (KR)-system, is discussed. Apart from the indiscernibility relation which can be defined on a multiple-source KR-system, two other relations, viz. similarity and inclusion are considered. To facilitate formal reasoning with rough sets in MSASs, a quantified propositional modal logic LMSAS is proposed. Interpretations for sets of well-formed formulae (wffs) of LMSAS are defined on MSASs, and the various properties of rough sets in MSASs translate into logically valid wffs of the system. LMSAS is shown to be sound and complete with respect to this semantics. Some decidable problems are addressed. In particular, it is shown that for any LMSAS-wff , it is possible to check whether is satisfiable in a certain class of interpretations with MSASs of a given finite cardinality. Moreover, it is also decidable whether any wff is satisfiable in the class of all interpretations with MSASs having domain of a given finite cardinality. [Copyright &y& Elsevier]

Published
2008
Full Text
View/download PDF

15. Modal Logic of Generalized Separated Topological Spaces

Author

Chen, Qian, Ma, Minghui, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Banerjee, Mohua, editor, and Sreejith, A. V., editor

Published
2023
Full Text
View/download PDF

16. Quasi-Boolean Based Models in Rough Set Theory: A Case of Covering

Author

Sardar, Masiur Rahaman, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Banerjee, Mohua, editor, and Sreejith, A. V., editor

Published
2023
Full Text
View/download PDF

17. The Relevance of Relevance to Relevance Logic

Author

Dunn, J. Michael, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Banerjee, Mohua, editor, and Krishna, Shankara Narayanan, editor

Published
2015
Full Text
View/download PDF

18. A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity

Author

Doberkat, Ernst-Erich, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Banerjee, Mohua, editor, and Seth, Anil, editor

Published
2011
Full Text
View/download PDF

19. A Modal Logic for Multiple-Source Tolerance Approximation Spaces

Author

Khan, Md. Aquil, Ma, Minghui, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Banerjee, Mohua, editor, and Seth, Anil, editor

Published
2011
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results