研究者データベース

研究者情報

マスター

アカウント(マスター)

  • 氏名

    佐野 勝彦(サノ カツヒコ), サノ カツヒコ

所属(マスター)

  • 文学研究院 人文学部門 哲学宗教学分野

所属(マスター)

  • 文学研究院 人文学部門 哲学宗教学分野

独自項目

syllabus

  • 2020, 哲学特殊講義, Philosophy (Lecture), 修士課程, 文学院, 認識論理、認識論、KKテーゼ、論理的全知、閉包原理、高階の知識、知識に関わるパラドックス
  • 2020, 現代哲学特殊講義, Contemporary Philosophy (Lecture), 修士課程, 文学研究科, 認識論理、認識論、KKテーゼ、論理的全知、閉包原理、高階の知識、知識に関わるパラドックス
  • 2020, 論理学特別演習, Logic (Seminar), 修士課程, 文学院, 非古典論理 条件法論理 多値論理 直観主義論理 部分構造論理 排中律 爆発律 帰結関係の単調性
  • 2020, 論理学特殊講義, Logic (Lecture), 修士課程, 文学研究科, 非古典論理 条件法論理 多値論理 直観主義論理 部分構造論理 排中律 爆発律 帰結関係の単調性
  • 2020, 大学院共通授業科目(教育プログラム):人間知・脳・AI教育プログラム, Inter-Graduate School Classes(Educational Program):CHAIN Education Program, 修士課程, 大学院共通科目, 人文科学 社会科学 神経科学 人工知能 脳 人間 機械学習 統計学
  • 2020, 大学院共通授業科目(教育プログラム):人間知・脳・AI教育プログラム大学院共通授業科目(教育プログラム, Inter-Graduate School Classes(Educational Program):CHAIN Education Program, 修士課程, 大学院共通科目, 人文科学 社会科学 神経科学 人工知能 脳 人間 機械学習 統計学
  • 2020, 哲学, Philosophy, 学士課程, 文学部, 実効的・機械的手続き チャーチ・チューリングのテーゼ 学習機械 チューリングテスト
  • 2020, 哲学演習, Philosophy (seminar), 学士課程, 文学部, 計算論理 人間による思考 人工知能, エージェント、論理プログラム
  • 2020, 哲学演習, Philosophy (seminar), 学士課程, 文学部, 様相演算子 クリプキ意味論 到達可能性関係 構文論 意味論 証明論 健全性 意味論的完全性 有限モデル性 決定可能性 必然化則
  • 2020, 歴史・文化モジュール特殊科目B, History-Culture Module Special Subjects B, 学士課程, 現代日本学プログラム課程, 実効的・機械的手続き チャーチ・チューリングのテーゼ 学習機械 チューリングテスト
  • 2020, 歴史・文化モジュール特殊科目B, History-Culture Module Special Subjects B, 学士課程, 現代日本学プログラム課程, 構文論 証明論 意味論 トートロジー 証明可能性 完全性定理 妥当性 対象言語 メタ言語 帰結関係
  • 2020, 歴史・文化モジュール特殊科目B, History-Culture Module Special Subjects B, 学士課程, 現代日本学プログラム課程, 計算論理 人間による思考 人工知能, エージェント、論理プログラム
  • 2020, 歴史・文化モジュール特殊科目B, History-Culture Module Special Subjects B, 学士課程, 現代日本学プログラム課程, 様相演算子 クリプキ意味論 到達可能性関係 構文論 意味論 証明論 健全性 意味論的完全性 有限モデル性 決定可能性 必然化則
  • 2020, 英語演習, English Seminar, 学士課程, 全学教育, ライプニッツ フレーゲ カントール ヒルベルト ゲーデル チューリング チューリング機械 万能計算機 決定可能性 完全性 無矛盾性 人工知能 チューリングテスト
  • 2020, 論理学, Logic, 学士課程, 文学部, 構文論 証明論 意味論 トートロジー 証明可能性 完全性定理 妥当性 対象言語 メタ言語 帰結関係

timetable

  • 修士課程, 文学研究科, 2020, 修士論文
  • 修士課程, 文学研究科, 2020, 修士論文・特定課題指導特殊演習
  • 修士課程, 文学院, 2020, 修士論文
  • 修士課程, 文学院, 2020, 修士論文・特定課題指導特殊演習
  • 博士後期課程, 文学研究科, 2020, 博士論文指導特殊演習
  • 博士後期課程, 文学院, 2020, 博士論文指導特殊演習Ⅰ
  • 博士後期課程, 文学院, 2020, 博士論文指導特殊演習Ⅱ
  • 学士課程, 文学部, 2020, 卒業論文

researchmap

プロフィール情報

学位

  • 修士(文学)(2003年03月 京都大学)
  • 博士(文学)(2010年01月 京都大学)

プロフィール情報

  • 佐野, サノ
  • 勝彦, カツヒコ

対象リソース

業績リスト

研究キーワード

  • ハイブリッド論理   動的認識論理   アラン・チューリング   非古典論理   様相論理   

研究分野

  • 情報通信 / 知能情報学
  • 情報通信 / 情報学基礎論
  • 人文・社会 / 哲学、倫理学

経歴

  • 2019年04月 - 現在 北海道大学 大学院文学研究院 准教授
  • 2016年09月 - 2019年03月 北海道大学 大学院文学研究科 准教授
  • 2011年07月 - 2016年09月 北陸先端科学技術大学院大学 情報科学研究科 助教
  • 2011年04月 - 2011年07月 京都大学大学院 文学研究科 研究員(最先端戦略強化)
  • 2008年04月 - 2011年03月 日本学術振興会 特別研究員(PD、京都大学、受入研究者:林晋教授)
  • 2007年07月 - 2008年03月 京都大学大学院 文学研究科 研究員(産官学連携研究員)
  • 2007年04月 - 2007年06月 京都大学大学院 文学研究科 研究員(学術支援)
  • 2006年04月 - 2007年03月 京都大学大学院 文学研究科 研究員(COE)

学歴

  • 2003年04月 - 2006年03月   京都大学大学院   文学研究科 現代文化学専攻科学哲学科学史専修   博士後期課程
  • 2000年04月 - 2003年03月   京都大学大学院   文学研究科 現代文化学専攻科学哲学科学史専修   博士前期課程
  • 1995年04月 - 2000年03月   京都大学   文学部   人文学科基礎現代文化学系 科学哲学科学史専修

論文

  • Youan Su, Ryo Murai, Katsuhiko Sano
    216 - 231 2021年10月 [査読有り]
  • Giulia Sindoni, Katsuhiko Sano, John G. Stell
    Journal of Logical and Algebraic Methods in Programming 100682 - 100682 2021年04月 [査読有り]
  • Ryo Hatano, Katsuhiko Sano
    Studia Logica 109 1 95 - 124 2021年02月 [査読有り]
  • Takahiro Sawasaki, Katsuhiko Sano
    Journal of Logic and Computation 2020年12月26日 [査読有り]
     
    Abstract The paper presents semantically complete Hilbert-style systems for some variants of common sense modal predicate logic proposed by van Benthem and further developed by Seligman. The paper also investigates frame definability in the logics and shows what axiom schema is canonical in the logics. In addition to these semantic investigations on the logics, the paper provides the sequent calculi for some of the logics which enjoy cut elimination theorem.
  • Ryo Hatano, Katsuhiko Sano
    Lecture Notes in Computer Science 137 - 154 2020年12月 [査読有り]
  • Katsuhiko Sano, Sakiko Yamasaki
    Short Papers of Advances in Modal Logic (AiML 2020) 97 - 101 2020年08月 [査読有り][通常論文]
  • Takahiro Sawasaki, Katsuhiko Sano
    Context, Conflict and Reasoning 127 - 138 2020年08月 [査読有り][通常論文]
  • Izumi Takeuti, Katsuhiko Sano
    Context, Conflict and Reasoning 115 - 126 2020年08月 [査読有り][通常論文]
  • Katsuhiko Sano
    Advances in Modal Logic 13 541 - 560 2020年07月 [査読有り][通常論文]
  • Youan Su, Katsuhiko Sano
    Knowledge, Proof and Dynamics. Logic in Asia: Studia Logica Library 51 - 72 Springer 2020年03月 [査読有り][通常論文]
  • Shoshin Nomura, Hiroakira Ono, Katsuhiko Sano
    J. Log. Comput. 30 1 321 - 348 2020年 [査読有り][通常論文]
  • Ryo Murai, Katsuhiko Sano
    211 - 221 2020年 [査読有り][通常論文]
  • Youan Su, Katsuhiko Sano
    Logic, Rationality, and Interaction - 7th International Workshop, LORI 2019, Chongqing, China, October 18-21, 2019, Proceedings 326 - 339 Springer 2019年 [査読有り][通常論文]
  • Takahiro Sawasaki, Katsuhiko Sano, Tomoyuki Yamada
    Logic, Rationality, and Interaction - 7th International Workshop, LORI 2019, Chongqing, China, October 18-21, 2019, Proceedings 244 - 258 2019年 [査読有り][通常論文]
  • Katsuhiko Sano, Jonni Virtema
    Ann. Pure Appl. Logic 170 9 1100 - 1127 2019年 [査読有り][通常論文]
  • Katsuhiko Sano, Minghui Ma
    Logic and Its Applications - 8th Indian Conference, ICLA 2019, Delhi, India, March 1-5, 2019, Proceedings 132 - 143 Springer 2019年 [査読有り][通常論文]
  • Relation Changers are Bounded Morphisms
    Ryo Hatano, Katsuhiko Sano
    Proceedings of the 4th Asian Workshop on Philosophical Logic 138 - 150 2018年10月 [査読有り][通常論文]
  • Minghui Ma, Katsuhiko Sano
    J. Log. Comput. 28 8 1781 - 1804 2018年 [査読有り][通常論文]
  • Giulia Sindoni, Katsuhiko Sano, John G. Stell
    Relational and Algebraic Methods in Computer Science - 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 - November 1, 2018, Proceedings 113 - 130 Springer 2018年 [査読有り][通常論文]
  • Ryo Hatano, Katsuhiko Sano, Satoshi Tojo
    Philosophical Logic: Current Trends in Asia. Logic in Asia:Studia Logica Library 153 - 180 2017年11月 [査読有り][通常論文]
  • Pimolluck Jirakunkanok, Katsuhiko Sano, Satoshi Tojo
    Artificial Intelligence and Law 26 3 1 - 49 2017年08月02日 [査読有り][通常論文]
     
    This study realizes belief/reliability change of a judge in a legal judgment by dynamic epistemic logic (DEL). A key feature of DEL is that possibilities in an agent’s belief can be represented by a Kripke model. This study addresses two difficulties in applying DEL to a legal case. First, since there are several methods for constructing a Kripke model, our question is how we can construct the model from a legal case. Second, since this study employs several dynamic operators, our question is how we can decide which operators are to be applied for belief/reliability change of a judge. In order to solve these difficulties, we have implemented a computer system which provides two functions. First, the system can generate a Kripke model from a legal case. Second, the system provides an inconsistency solving algorithm which can automatically perform several operations in order to reduce the effort needed to decide which operators are to be applied. By our implementation, the above questions can be adequately solved. With our analysis method, six legal cases are analyzed to demonstrate our implementation.
  • Katsuhiko Sano, John G. Stell
    Electronic Proceedings in Theoretical Computer Science, EPTCS 243 105 - 121 2017年03月06日 [査読有り][通常論文]
     
    Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order. BIST logics are extensions of a logic, BiSKt, which arose in the semantic context of hypergraphs, since a special case of the pre-order can represent the incidence structure of a hypergraph. In this paper we provide, for the first time, a Hilbert-style axiomatisation of BISKt and prove the strong completeness of BiSKt. We go on to prove strong completeness of a class of BIST logics obtained by extending BiSKt by formulas of a certain form. Moreover we show that the finite model property and the decidability hold for a class of BIST logics.
  • Ryo Hatano, Katsuhiko Sano, Satoshi Tojo
    FLAP 4 1 2017年 [査読有り][通常論文]
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder
    Logical Methods in Computer Science, Volume 14, Issue 1 (March 20, 2018) lmcs:4390 2017年01月 [査読有り][通常論文]
     
    We propose a generalization of first-order logic originating in a neglected
    work by C.C. Chang: a natural and generic correspondence language for any types
    of structures which can be recast as Set-coalgebras. We discuss axiomatization
    and completeness results for several natural classes of such logics. Moreover,
    we show that an entirely general completeness result is not possible. We study
    the expressive power of our language, both in comparison with coalgebraic
    hybrid logics and with existing first-order proposals for special classes of
    Set-coalgebras (apart from relational structures, also neighbourhood frames and
    topological spaces). Basic model-theoretic constructions and results, in
    particular ultraproducts, obtain for the two classes that allow
    completeness---and in some cases beyond that. Finally, we discuss a basic
    sequent system, for which we establish a syntactic cut-elimination result.
  • Katsuhiko Sano, Mai Sugimoto
    Advanced Information and Knowledge Processing 9783319590899 101 - 130 2017年 [査読無し][招待有り]
     
    © Springer International Publishing AG 2017. The most famous academic contributions of Alan Turing are on Turing machines in 1936 and on the Turing test in 1950. While the motivations of these two works are apparently quite different, this chapter tracks Turing’s chronological development between these two contributions and points out how conceptual continuity can be found in Turing’s thought on machines.
  • Katsuhiko Sano
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10445 224 - 239 2017年 [査読有り][通常論文]
     
    This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus for modal logic. Then we translate a tree sequent into an ordinary formula to specify a Hilbert system of EFL and finally show that our Hilbert system is sound and complete for an intended two-dimensional semantics.
  • Sujata Ghosh, Katsuhiko Sano
    ICAART: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2 615 - 623 2017年 [査読有り][通常論文]
     
    Deliberation often leads to changes in preferences and beliefs of an agent, influenced by the opinions of others, depending on how reliable these agents are according to the agent under consideration. Sometimes, it also leads to changes in the opposite direction, that is, reliability over agents gets updated depending on their preferences and/or beliefs. There are various formal studies of preference and belief change based on reliability and/or trust, but not the other way around - this work contributes to the formal study of the latter aspect, that is, on reliability change based on agent preferences. In process, some policies of preference change based on agent reliabilities are also discussed. A two-dimensional hybrid language is proposed to describe such processes, and axiomatisations and decidability are discussed.
  • Shoshin Nomura, Katsuhiko Sano, Satoshi Tojo
    STRUCTURAL ANALYSIS OF NON-CLASSICAL LOGICS 131 - 157 2016年 [査読有り][通常論文]
     
    We first show that a labelled sequent calculus G3PAL for Public Announcement Logic (PAL) by Maffezioli and Negri (2011) has been lacking rules for deriving an axiom of Hilbert-style axiomatization of PAL. Then, we provide our revised calculus GPAL to show that all the formulas provable in Hilbert-style axiomatization of PAL are also provable in GPAL together with the cut rule. We also establish that our calculus enjoys cut elimination theorem. Moreover, we show the soundness of our calculus for Kripke semantics with the notion of surviveness of possible worlds in a restricted domain. Finally, we provide a direct proof of the semantic completeness of GPAL for the link-cutting semantics of PAL.
  • Katsuhiko Sano, Jonni Virtema
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION 9803 392 - 409 2016年 [査読有り][通常論文]
     
    Let ML([u]<^>+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterise the relative definability of ML([u]<^> +) relative to finite transitive frames in the spirit of the well-known GoldblattThomason theorem. We show that a class F of finite transitive frames is definable in ML([u]<^>+) relative to finite transitive frames if and only if F is closed under taking generated subframes and bounded morphic images. In addition, we study modal definability in team-based logics. We study (extended) modal dependence logic, (extended) modal inclusion logic, and modal team logic. With respect to global model definability we obtain a trichotomy and with respect to frame definability a dichotomy. As a corollary we obtain relative Goldblatt-Thomason-style theorems for each of the logics listed above.
  • Shoshin Nomura, Hiroakira Ono, Katsuhiko Sano
    LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016) 9537 283 - 298 2016年 [査読有り][通常論文]
     
    Dynamic Epistemic Logic is a logic that is aimed at formally expressing how a person's knowledge changes. We provide a cut-free labelled sequent calculus (GDEL) on the background of existing studies of Hilbert-style axiomatization HDEL by Baltag et al. (1989) and labelled calculi for Public Announcement Logic by Maffezioli et al. (2011) and Nomura et al. (2015). We first show that the cut rule is admissible in GDEL. Then we show GDEL is sound and complete for Kripke semantics. Lastly, we touch briefly on our on-going work of an automated theorem prover of GDEL.
  • Hitoshi Omori, Katsuhiko Sano
    STUDIA LOGICA 103 5 883 - 917 2015年10月 [査読有り][通常論文]
     
    One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn's discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, which gives us intuitive readings of connectives, out of truth tables. Then, we revisit the notion of functional completeness, which is one of the key notions in many-valued logic, in view of Dunn's idea. More concretely, we introduce a generalized notion of functional completeness which naturally arises in the spirit of Dunn's idea, and prove some fundamental results corresponding to the classical results proved by Post and Supecki.
  • Katsuhiko Sano, Jonni Virtema
    Leibniz International Proceedings in Informatics, LIPIcs 41 292 - 307 2015年09月01日 [査読有り][通常論文]
     
    We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled calculi.
  • Katsuhiko Sano
    MODALITY, SEMANTICS AND INTERPRETATIONS: THE SECOND ASIAN WORKSHOP ON PHILOSOPHICAL LOGIC 107 - 120 2015年 [査読有り][通常論文]
     
    In nonradical inquisitive semantics, an intuitionistic Kripke model captures how group knowledge increases throughout a conversation and allows the inquisitive meaning of a sentence to be derived from its classical meaning. In radical inquisitive semantics, as proposed by Groenendijk and Roelofsen, positive and negative ways of reacting to a proposal are captured by the positive and negative inquisitive meanings of a sentence, respectively, which are inductively defined without employing any Kripke-type semantics. This paper demonstrates that, in principle, it is impossible to provide any natural Kripke-type semantics under radical inquisitive semantics. Moreover, an alternative way to establish the semantics is proposed that avoids this negative result.
  • Pimolluck Jirakunkanok, Katsuhiko Sano, Satoshi Tojo
    NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE, JSAI-ISAI 2014 9067 274 - 290 2015年 [査読有り][通常論文]
     
    Reliability among agents plays a significant role in both human and agent communications. An agent may change her reliability for the other agents, when she receives a new piece of information from one of them. In order to analyze such reliability change, this paper proposes a logical formalization with two dynamic operators, i.e., downgrade and upgrade operators. The downgrade operator allows an agent to downgrade some specified agents to be less reliable in terms of the degree of reliability, while the upgrade operator allows the agent to upgrade them to be more reliable. Furthermore, we demonstrate our formalization by a legal case from Thailand.
  • Katsuhiko Sano, Jonni Virtema
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2015 9160 140 - 155 2015年 [査読有り][通常論文]
     
    Let ML(u(+)) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the definability of ML(u(+)) in the spirit of the well-known Goldblatt-Thomason theorem. We show that an elementary class F of Kripke frames is definable in ML(u(+)) if and only if F is closed under taking generated subframes and bounded morphic images, and reflects ultrafilter extensions and finitely generated subframes. In addition, we initiate the study of modal frame definability in team-based logics. We show that, with respect to frame definability, the logics ML(u(+)), modal logic with intuitionistic disjunction, and (extended) modal dependence logic all coincide. Thus we obtain Goldblatt-Thomason -style theorems for each of the logics listed above.
  • Shoshin Nomura, Katsuhiko Sano, Satoshi Tojo
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015) 9450 187 - 202 2015年 [査読有り][通常論文]
     
    Intuitionistic Public Announcement Logic (IntPAL) proposed by Ma et al. (2014) aims at formalizing changes of an agent's knowledge in a constructive manner. IntPAL can be regarded as an intuitionistic generalization of Public Announcement Logic (PAL) whose modal basis is the intuitionistic modal logic IK by Fischer Servi (1984) and Simpson (1994). We also refer to IK for the basis of this paper. Meanwhile, Nomura et al. (2015) provided a cut-free labelled sequent calculus based on the study of Maffezioli et al. (2010). In this paper, we introduce a labelled sequent calculus for IntPAL (we call it GIntPAL) as both an intuitionistic variant of GPAL and a public announcement extension of Simpson's labelled calculus, and show that all theorems of the Hilbert axiomatization of IntPAL are also derivable in GIntPAL with the cut rule. Then we prove the admissibility of the cut rule in GIntPAL and also the soundness result for birelational Kripke semantics. Finally, we derive the semantic completeness of GIntPAL as a corollary of these theorems.
  • Katsuhiko Sano, Satoshi Tojo
    2015 Seventh International Conference on Knowledge and Systems Engineering (KSE) 256 - 261 2015年 [査読有り][通常論文]
     
    This paper proposes a logical formalization of agents' beliefs which admits an agent's misinterpretation of the other agents' actions to her. Most of the previous logical studies on dynamic changes of knowledge and belief often assume that agents are idealistic or logical omniscient in the sense that they will not make a mistake in reasoning and in reacting to the other agent's action. However, our human agents are often lazy and also sometimes make a mistake in these aspects. Our logical framework for agents' beliefs focuses on two actions of command and permission, but allows agents to make a mistake in interpreting an action from one of the other agents. Moreover, we also propose two dynamic operators capturing the process of changing an agent's interpretation of the other agents' command and permission. Finally, we applied our formal tool to describe types of agent in virtual football game. Technical contributions of this paper are to provide sound and complete axiomatizations of all of three logics of belief with agent communication allowing misinterpretations.
  • Pimolluck Jirakunkanok, Katsuhiko Sano, Satoshi Tojo
    2015 Seventh International Conference on Knowledge and Systems Engineering (KSE) 228 - 233 2015年 [査読有り][通常論文]
     
    The connection between belief change and reliability change is an important aspect of agent communication. That is, an agent can change his/her belief when he/she considers that the received information is unreliable. In order to capture both belief change and reliability change, several dynamic operators were proposed in terms of dynamic epistemic logic. Belief change can be handled by commitment and permission. The first operator is used to remove some beliefs, while the second operator is used to restore the former beliefs. For analyzing reliability change, this study introduces a joint downgrade operator to allow an agent to downgrade the agents in a specific group to be equally reliable and less reliable than the other agents. Based on these dynamic operators, this study proposes to analyze an agent's belief re-revision based on a consideration of reliability change in a legal case from Canada.
  • Minghui Ma, Katsuhiko Sano, Francois Schwarzentruber, Fernando R. Velazquez-Quesada
    LOGIC AND ITS APPLICATIONS, ICLA 2015 8923 132 - 145 2015年 [査読有り][通常論文]
     
    This paper presents a tableau calculus for two semantic interpretations of public announcements over monotone neighbourhood models: the intersection and the subset semantics, developed by Ma and Sano. We show that both calculi are sound and complete with respect to their corresponding semantic interpretations and, moreover, we establish that the satisfiability problem of this public announcement extensions is NP-complete in both cases. The tableau calculi has been implemented in Lotrecscheme.
  • Ryo Hatano, Katsuhiko Sano, Satoshi Tojo
    ICAART 2015 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 1, Lisbon, Portugal, 10-12 January, 2015. 174 - 181 SciTePress 2015年 [査読有り][通常論文]
  • Katsuhiko Sano, Minghui Ma
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8984 257 - 275 2015年 [査読有り][通常論文]
     
    Visser’s basic propositional logic BPL is the subintuitionistic logic determined by the class of all transitive Kripke frames, and his formal provability logic FPL, an extension of BPL, is determined by the class of all irreflexive and transitive finite Kripke frames. While Visser showed that FPL is embeddable into the modal logic GL, we first show that BPL is embeddable into the modal logic wK4, which is determined by the class of all weakly transitive Kripke frames, and we also show that BPL is characterized by the same frame class. Second, we introduce the proper successor semantics under which we prove that BPL is characterized by the class of weakly transitive frames, transitive frames, pre-ordered frames, and partially ordered frames. Third, we introduce topological semantics by interpreting implication in terms of the co-derived set operator and prove that BPL is characterized by the class of all topological spaces, T< inf> 0< /inf> -spaces and Td-spaces. Finally, we establish the topological completeness of FPL with respect to the class of scattered spaces.
  • Katsuhiko Sano, Hitoshi Omori
    LOGIC JOURNAL OF THE IGPL 22 3 458 - 481 2014年06月 [査読有り][通常論文]
     
    This article proposes to expand first-order Belnap-Dunn logic with a new operator, whose intuitive meaning is '-is designated' or '-has designated values'. It amounts to considering all of D'Ottaviano's possibility connective of J(3), Baaz's Delta operator of infinite-valued Godel logic and Kachi's determinate operator, in the different context of Belnap-Dunn logic. As for proof theory, we employ a natural deduction calculus with a slot for weakly definable connectives. Our main theorem is a general completeness result with respect to P({0,1})-valued semantics, which enables us to derive new completeness results for first-order extensions of Kachi's SPL and Omori and Waragai's BS4 and the known completeness results of D'Ottaviano and da Costa's J(3) and Carnielli, Marcos and de Amo's LFI1.
  • Hitoshi Omori, Katsuhiko Sano
    RECENT TRENDS IN PHILOSOPHICAL LOGIC 41 145 - 166 2014年 [査読有り][通常論文]
     
    There are various approaches to develop a system of paraconsistent logic, and those we focus on in this paper are approaches of da Costa, Belnap, and Nelson. Our main focus is da Costa, and we deal with a system that reflects the idea of da Costa. We understand that the main idea of da Costa is to make explicit, within the system, the area in which you can infer classically. The aim of the paper is threefold. First, we introduce and present some results on a classicality operator which generalizes the consistency operator of Logics of Formal Inconsistency. Second, we show that we can introduce the classicality operator to the systems of Belnap. Third, we demonstrate that we can generalize the classicality operator above to the system of Nelson. The paper presents both the proof theory and semantics for the systems to be introduced, and also establishes some completeness theorems.
  • Conditional independence and biscuit conditional questions in dynamic semantics
    Katsuhiko Sano, Yurie Hara
    Proceedings of SALT 24 84 - 101 2014年 [査読有り][通常論文]
  • Pimolluck Jirakunkanok, Shinya Hirose, Katsuhiko Sano, Satoshi Tojo
    NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE (JSAI-ISAI 2013) 8417 230 - 245 2014年 [査読有り][通常論文]
     
    We propose a formalization of legal judgment revision in terms of dynamic epistemic logic, with two dynamic operators; commitment and permission. Each of these operations changes the accessibility to possible worlds, restricting to personal belief as local announcement. The commitment operator removes some accessible links for an agent to come to believe an announced proposition, while the permission operator restores them to tolerate former belief state. In order to demonstrate our formalization, we analyze judge's belief change in Chivalry Case in which a self-defense causes a misconception. Furthermore, we show an implementation of our logical formalization to demonstrate that it can be used in a practical way.
  • Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema
    Advances in Modal Logic 10, invited and contributed papers from the tenth conference on "Advances in Modal Logic," held in Groningen, The Netherlands, August 5-8, 2014 294 - 312 College Publications 2014年 [査読有り][通常論文]
  • Takashi Koga, Katsuhiko Sano, Satoshi Tojo
    Computer Software 30 152 - 163 2013年02月01日 [査読無し][通常論文]
     
    In this paper, we present an interval tense logic with the inclusion modality, together with the precedence modality. We show that our interval tense logics are decidable. We also investigate the fundamental features of logic to represent realistic temporal intervals, and among them we propose the notion of embeddability of a frame into the time axis, by which all the intervals are mapped into the time axis. Although the class of embeddable frames is not modally definable, we show a decision procedure whether given finite frames are embeddable.
  • Minghui Ma, Katsuhiko Sano
    Proceedings of the 13th Asian Logic Conference, ALC 2013 170 - 200 2013年01月 [査読有り][通常論文]
     
    © 2015 by World Scientific Publishing Co. Pte. Ltd.Extensions of Visser’s basic propositional logic (BPL) are explored. We present the lattice of extensions of BPL: the lattice of superbasic logics. From a uniform perspective, we establish logical properties of superbasic logics, including strong completeness, finite model property, disjunction property, Post completeness, and two constant property. Moreover, the embedding of superbasic logics into normal modal logics by Gödel-McKinsey-Tarski style translations is revisited.
  • Minghui Ma, Katsuhiko Sano
    LOGIC, RATIONALITY, AND INTERACTION (LORI 2013) 8196 204 - 217 2013年 [査読有り][通常論文]
     
    This paper studies two ways of updating neighborhood models: update by taking the intersection of the neighborhoods with the announced proposition, and update by selecting all the neighborhoods that can entail the announced proposition. For each of these two ways, we establish reduction axioms and some basic model-theoretic results on public announcement logic and dynamic epistemic logic of product update. We also study various notions of group knowledge such as common and distributed knowledge over neighborhood models.
  • Katsuhiko Sano, Satoshi Tojo
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7750 109 - 120 2013年 [査読有り][通常論文]
     
    This paper studies channel-based agent communication in terms of dynamic epistemic logic. First, we set up two sorted syntax which can deal with not only each agent's belief but also agents and channels between them. Second, we propose a context-sensitive 'inform'-action operator whose effectivity always assumes the existence of channel between agents. Its context-sensitivity can be achieved by downarrow binder from hybrid logic. Third, we provide complete Hilbert-style axiomatizations for both static and dynamic parts of our logic. © 2013 Springer-Verlag Berlin Heidelberg.
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7758 257 - 276 2013年 [査読有り][通常論文]
     
    The recently introduced Coalgebraic Predicate Logic (CPL) provides a general first-order syntax together with extra modal-like operators that are interpreted in a coalgebraic setting. The universality of the coalgebraic approach allows us to instantiate the framework to a wide variety of situations, including probabilistic logic, coalition logic or the logic of neighbourhood frames. The last case generalises a logical setup proposed by C.C. Chang in early 1970's. We provide further evidence of the naturality of this framework. We identify syntactically the fragments of CPL corresponding to extended modal formalisms and show that the full CPL is equipollent with coalgebraic hybrid logic with the downarrow binder and the universal modality. Furthermore, we initiate the study of structural proof theory for CPL by providing a sequent calculus and a cut-elimination result. © 2013 Springer-Verlag.
  • Misconception in Legal Cases From Dynamic Logical Viewpoints
    Katsuhiko Sano, Ryo Hatano, Satoshi Tojo
    The 6th International Workshop on Juris-informatics (JURISIN 2012) 2012年11月 [査読有り][通常論文]
  • Katsuhiko Sano, Shingo Hagiwara, Satoshi Tojo
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7258 170 - 183 2012年 [査読有り][通常論文]
     
    This paper studies the prerequisite-effect structures in legal documents from a logical viewpoint. First, we distinguish a written prerequisite-effect structure in legal documents and an application-instance of the written structure to a particular case, and formalize the latter as . Second, we specify its semantics as 'immediately after' on intuitionistic Kripke model. Third, we establish semantic properties of including the undefinability of in intuitionistic logic, and provide a cut-free and complete labelled sequent calculus with the intuitionistic logic with . Finally, we illustrate a formal representation of Articles 7 and 9 of Japanese Income Tax Act with the help of . © 2012 Springer-Verlag.
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schroder
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II 7392 299 - 311 2012年 [査読有り][通常論文]
     
    We propose a generalization of first-order logic originating in a neglected work by C. C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for two natural classes of such logics. Moreover, we show that an entirely general completeness result is not possible. We study the expressive power of our language, contrasting it with both coalgebraic modal logic and existing first-order proposals for special classes of Set-coalgebras (apart for relational structures, also neighbourhood frames and topological spaces). The semantic characterization of expressivity is based on the fact that our language inherits a coalgebraic variant of the Van Benthem-Rosen Theorem. Basic model-theoretic constructions and results, in particular ultraproducts, obtain for the two classes which allow for completeness-and in some cases beyond that.
  • Katsuhiko Sano
    Electronic Notes in Theoretical Computer Science 273 1 51 - 67 2011年07月08日 [査読有り][通常論文]
     
    The main aim of this paper is to propose a robust way to combine two monotone hybrid logics. This work can be regarded as a further extension of both topological semantics for hybrid logic (Ten Cate and Litak 2007) and bi-hybrid logic of products of Kripke frames (Sano 2010). First, we generalize the notion of product of topologies (Van Benthem, et al 2006) to the monotone neighborhood frames and introduce two kinds of nominals: i (e.g. for a moment of time) and a (e.g. for a spatial point), and the corresponding satisfaction operators: ati and ata to describe a product of monotone neighborhood frames. Second, we give five interaction axioms and establish a general completeness result called pure completeness of bi-hybrid logic of monotone neighborhood frames. By extending this, we also establish a pure completeness result of bi-hybrid logic of products of topologies. © 2011 Elsevier B.V. All rights reserved.
  • Katsuhiko Sano
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6521 147 - 161 2011年 [査読有り][通常論文]
     
    We introduce two different calculi for a first-order extension of inquisitive pair semantics (Groenendijk 2008): Hilbert-style calculus and Tree-sequent calculus. These are first-order generalizations of (Mascarenhas 2009) and (Sano 2009), respectively. First, we show the strong completeness of our Hilbert-style calculus via canonical models. Second, we establish the completeness and soundness of our Tree-sequent calculus. As a corollary of the results, we semantically establish that our Tree-sequent calculus enjoys a cut-elimination theorem. © 2011 Springer-Verlag.
  • Katsuhiko Sano
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6859 329 - 343 2011年 [査読有り][通常論文]
     
    This paper proposes a modular method, called generalized product, of combining two coalgebraic hybrid logics in a parallel but non-compositional way. This is a coalgebraic generalization of a hybrid extension of product of modal logics. Our method, however, covers not only the combination of the same-type logics but also the combination of two different-type logics, e.g., graded hybrid logic and non-monotone hybrid logic. Moreover, we provide general strong completeness results for generalized products of coalgebraic hybrid logics with generic criteria. © 2011 Springer-Verlag.
  • Katsuhiko Sano
    JOURNAL OF APPLIED LOGIC 8 4 459 - 474 2010年12月 [査読有り][通常論文]
     
    The aim of this paper is to propose a two-dimensional hybrid logic in order to formalize inferences containing both spatial and temporal propositions. The semantic idea behind the proposal is to name both horizontal and vertical lines in a 2D-plane by two kinds of nominals. This is a generalization of the idea of naming a point in one-dimensional hybrid logic. I give an axiomatization of the proposed two-dimensional hybrid logic and show that it enjoys a general completeness result (called pure completeness) with respect to product Kripke frames. Moreover, in order to capture T x W-frames studied by R.H. Thomason (1984), I introduce the notion of a dependent product frame, which enables us to represent the dependence of space over time. I also give a complete axiomatization of this dependent two-dimensional hybrid logic, and, as a corollary, reveal that a hybridization of T x W-logic enjoys strong completeness. (C) 2010 Elsevier B.V. All rights reserved.
  • Katsuhiko Sano, Minghui Ma
    Advances in Modal Logic 8, papers from the eighth conference on "Advances in Modal Logic," held in Moscow, Russia, 24-27 August 2010 330 - 349 College Publications 2010年 [査読有り][通常論文]
  • Katsuhiko Sano
    Journal of Logic, Language and Information 18 4 515 - 539 2009年09月 [査読有り][通常論文]
     
    The purpose of this paper is to argue that the hybrid formalism fits naturally in the context of David Lewis's counterfactual logic and that its introduction into this framework is desirable. This hybridization enables us to regard the inference "The pig is Mary Mary is pregnant therefore the pig is pregnant" as a process of updating local information (which depends on the given situation) by using global information (independent of the situation). Our hybridization also has the following technical advantages: (i) it preserves the completeness and decidability of Lewis's logic (ii) it allows us to characterize the Limit Assumption as a proof-rule with some side-conditions and (iii) it enables us to establish a general Kripke completeness result by using the proof-rule corresponding to the Limit Assumption. © Springer Science+Business Media B.V. 2009.
  • Katsuhiko Sano
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION 5514 365 - 378 2009年 [査読有り][通常論文]
     
    We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish that (i) our tree-sequent calculus is sound and complete with respect to Groenendijk's inquisitive semantics and that (ii) our tree-sequent calculus is decidable and enjoys cut-elimination theorem. (ii) is semantically revealed by our argument for (i). The key idea which allows us to obtain these results is as follows: In Groenendijk's inquisitive semantics, a formula of propositional logic is evaluated against a pair of worlds on a model. Given the appropriate pre-order on the set of such pairs, any inquisitive model can be regarded as a Kripke model for intuitionistic logic. This representation enables us to connect inquisitive semantics with the tree-sequent technique for non-classical logics (Kashima 1999).
  • Katsuhiko Sano
    Proceedings of the 16th Amsterdam Colloquium 187 - 192 2007年12月 [査読有り][通常論文]
  • Sano Katsuhiko
    Electronic Notes in Theoretical Computer Science 174 6 95 - 111 2007年06月03日 [査読有り][通常論文]
     
    This paper discusses a bimodal hybrid language with a sub-modality (called the irreflexive modality) associated with the intersection of the accessibility relation R and the inequality ≠. First, we provide the Hilbert-style axiomatizations (with and without the COV-rule) for logics of our language, and prove the Kripke completeness and the finite frame property for them. Second, with respect to the frame expressive power, we compare our language containing the irreflexive modality with the hybrid languages H and H (E). Finally, we establish the Goldblatt-Thomason-style characterization for our language. © 2007 Elsevier B.V. All rights reserved.
  • Katsuhiko Sano, Kentaro Sato
    Notre Dame Journal of Formal Logic 48 2 205 - 228 2007年 [査読有り][通常論文]
     
    This paper deals with two main topics: One is a semantical investigation for a bimodal language with a modal operator ■ associated with the intersection of the accessibility relation R and the inequality ≠. The other is a generalization of some of the former results to general extended languages with modal operators. First, for our language L□ ■, we prove that Segerberg's theorem (equivalence between finite frame property and finite model property) fails and establish both van Benthem-style and Goldblatt-Thomason- style characterizations. We extract the notion of ■-realizer (a generalization of bulldozing) as an essence from the proofs of our results. Second we generalize the notion of ■-realizer and prove quite general versions of these semantical characterization results. The known and previously unknown characterization results for almost all of the languages extended with modal operators already proposed will be immediate corollaries. © 2007 University of Notre Dame.

書籍等出版物

所属学協会

  • 応用哲学会   日本数学会   科学基礎論学会   日本科学哲学会   

共同研究・競争的資金等の研究課題

  • 命題・様相チーム意味論による確率論理のモデル論・証明論研究
    日本学術振興会:科学研究費助成事業 特別研究員奨励費
    研究期間 : 2019年11月 -2022年03月 
    代表者 : 佐野 勝彦, VIRTEMA JONNI
  • 日本学術振興会:科学研究費助成事業 基盤研究(C)
    研究期間 : 2019年04月 -2022年03月 
    代表者 : 佐野 勝彦
  • 日本学術振興会:科学研究費助成事業 基盤研究(B)
    研究期間 : 2017年04月 -2022年03月 
    代表者 : 山田 友幸, 佐野 勝彦, 金子 守, 東条 敏
     
    山田は、Austin の論じた発語内行為の慣習的効果(conventional effect)を、Searle の地位機能(status function)として捉えなおすことにより、Searle の社会制度理論のうちに Austin の洞察を位置づけることが可能になることを示すとともに、文脈 C において X が Y として通用する(count-as)という構成的規則の階層的体系が Barwaise と Seligman のチャンネル理論のもとで適切に定式化できることを示した。 佐野は、条件法論理にアップデート演算を入れた Normal Update Logic の証明論の構築と、離散空間上での連結関係について語るための双直観主義様相論理の拡張の証明論の特定を行うとともに、動的認識論理の一種である Relation Changer 付き動的論理に、モデルを書き換えない意味論を与えて、その意味論に基づくラベル付き計算体系を構築した。 また山田と佐野は研究協力者澤崎(大学院博士課程学生)と共同で、昨年度開始した Seligman の常識的様相述語算の研究を進め、義務様相を導入する拡張を行ったほか、ターム様相論理の手法を取り入れる研究を開始し、タームの列を扱うための拡張を行った。 金子は、限定合理性の立場から、認識論理体系と期待効用理論を再構成することを重点的に研究し、これらの理論を大きく発展させることに成功した。 東条は Awareness Logic を法律の予見可能性に応用し,旧来の DEMO というシステムに awareness を加えた実装を行った。また、様相論理においてアクセス関係を増やし疑わしい知識を含む論理を構築した。さらに,エージェントコミュニケーションにおいて情報の中身の真偽のほかに情報が読み出せるかどうかを考慮した四値論理を提案した。
  • 日本学術振興会:科学研究費助成事業 若手研究(B)
    研究期間 : 2015年04月 -2019年03月 
    代表者 : 佐野 勝彦
     
    本研究では、人間やエージェントが環境と相互作用しながらどのように知識・信念を形成するのかを、どのような情報が伝わったのか、どのように情報が伝わったのか、の二つの観点から探求した。第一に、エージェント間構造とエージェントの選好が相互作用しながらどう変化するのかを分析する論理的枠組みを提案した。第二に、情報告知の際に誤った信念を抱くことを許す推論システムを提案し、不確実性下での推論を扱うための意味論的枠組みの理論的基盤を整備した。第三に、公開告知行為による信念・知識の変化を扱う論理の既存研究の不備を正した推論システムを提案し、その発想をさらに他の情報告知行為をもつ論理へも応用した。
  • 日本学術振興会:科学研究費助成事業 若手研究(B)
    研究期間 : 2012年04月 -2015年03月 
    代表者 : 佐野 勝彦
     
    本研究ではエージェントの相互作用を捉えるために,マルチエージェントシステムと動的認識論理の両方に対して多次元的視点から論理的基盤を研究した.本研究の成果は次の三つである.第一に,命令・許可概念を含むエージェントの信念のための論理を提案した.第二に,エージェント間のチャネル概念とチャネルを通じたエージェント通信の概念を多次元ハイブリッド論理の設定で形式化した.第三に,多次元設定での論理的推論を捉えるため,好ましい形式的性質(カット除去定理)をもつラベル付き式計算体系を構築した.
  • 拡張様相概念を基盤とした空間的論理の研究
    日本学術振興会:科学研究費助成事業 特別研究員奨励費
    研究期間 : 2008年 -2010年 
    代表者 : 佐野 勝彦
     
    本年度は、一昨年度に洞察を得て昨年度に論文を仕上げた、世界や時間や個体といった複数次元を一挙同時に扱うことが可能な多次元版ハイブリッド論理の研究をさらに進め、複数の学会で研究発表を行い、論文執筆を行った。昨年度に得た位相空間に対する多次元ハイブリッド論理の完全性定理と、この結果の近傍フレームへの一般化、に関して論文を執筆し、国際会議Hylo 2010で発表を行い、Post-proceedings of Hylo 2010に論文が採択された。さらに、レスター大学滞在時に、多次元版ハイブリッド論理を余代数的意味論(余代数とはクリプキ構造・位相空間等を一般化した数学的構造)へと一般化できることを明らかにし、レスター大学で研究発表を行ったうえで、論文執筆を行い、余代数・代数研究における国際会議であるInternational Conference on Algebra and Coalgebra in Computer Scienceに投稿した。こういった成果からわかるのは、ハイブリッド論理の多次元化というアイデアのもつ数学的一般性である。一昨年に成果を上げた反事実条件法のハイブリッド論理に関しては、アムステルダム大学滞在時に、Dynamic Epistemic Logicとの興味深い関連を見出し、それに関して研究発表および論文執筆を行った。位相空間上の導集合演算や閉包演算と似た振る舞いを示すグレード付き様相論理(Graded modal logic)に関しては、昨年度にMinghui Ma (Tsinghua University)を共同で論文を仕上げたが、投稿中であった該当論文が国際会議Advances in Modal Logicに採択された。最後に、昨年度国際会議Wollic2009に採択された、疑問文の形式意味論inquisitive pair semanticsについての成果を、述語論理へと拡張し(ヒルベルト流公理系とゲンツェン流のラベル付きシークェント計算体系を与えた)、この成果をまとめた論文が、国際会議ICLA 2011に採択された。


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.