Kisoron-ml

1 participants
589 discussions

Second Call: Logic, Algebra, and Truth Degrees 2012
by Hiroakira Ono 04 Apr '12

04 Apr '12

Logic, Algebra and Truth Degrees 2012 http://www.jaist.ac.jp/rcis/latd12/ Second Call for Papers === Deadline for contributed talks: 22 April 2012 === === Application for grants available === The third official meeting of the EUSFLAT Working Group on Mathematical Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan. The conference is organized by Research Center for Integrated Science [2], Japan Advanced Institute of Science and Technology [3]. Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which studies the notion of comparative truth. The assumption that 'truth comes in degrees' has proved to be very useful in many, both theoretical and applied, areas of Mathematics, Computer Science and Philosophy. The main goal of this meeting is to foster collaboration between researchers in the area of Mathematical Fuzzy Logic, and to promote communication and cooperation with members of neighbouring fields. The featured topics include, but are not limited to, the following: . Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction, tableaux, resolution, computational complexity, etc. . Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras, MV-algebras, Abstract Algebraic Logic, functional representation, etc. . Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc. . First-order fuzzy logics: axiomatizations, arithmetical hierarchy, model theory, etc. . Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory, and formal fuzzy mathematics. . Philosophical issues: connections with vagueness and uncertainty. . Applied fuzzy logical calculi: foundations of logical programming, logic-based reasoning about similarity, description logics, etc. We also welcome contributions on any relevant aspects of related logical systems (such as substructural and quantum logics, and many-valued logics in general). Conference Web Site: http://www.jaist.ac.jp/rcis/latd12/ Important dates: . 22 April 2012: deadline for submissions . 3 June 2012: notifications sent . 10-14 September 2012: conference Programme Committee: . Stefano Aguzzoli (University of Milano, Italy) . Matthias Baaz (Vienna University of Technology, Austria) . Petr Cintula (Academy of Sciences, Czech Republic) . Carles Noguera (CSIC, Spain) . Hiroakira Ono (JAIST, Japan), Chair . James Raftery (University of KwaZulu-Natal, South Africa) . Constantine Tsinakis (Vanderbilt University, USA) Invited Speakers: . Rostislav Horčík (Academy of Sciences, Czech Republic) . Emil Jeřábek (Academy of Sciences, Czech Republic) . Daniele Mundici (University of Florence, Italy) . Greg Restall (University of Melbourne, Australia) . Luca Spada (University of Salerno, Italy) Tutorial: . Felix Bou (University of Barcelona, Spain) If you are interested in presenting a paper, please submit a 2–4 pages abstract at http://www.easychair.org/conferences/?conf=latd2012 Your submission will be confirmed automatically on the e-mail address you provide. The accepted abstracts will be available on-line after the final decision of the program committee. If you have any problems to submit an abstract, please contact us at mail to: latd2012(a)jaist.ac.jp The deadline for contributions is 22 April 2012. The notification of acceptance/rejection will be sent until 3 June 2012. Registration: Registration has not started by now, but we appreciate your email informing us on your participation plans. Registration fee is likewise not determined by now. Grants: There is a limited amount of grants available for participants. Please contact us as soon as possible including the following information: - name, affilitation - amount of money needed - title of your contribution (no grant without presentation) - reason/explanation of need for grant Conference dates: The scientific program will start Monday morning (10 September) and finish Friday noon (14 September). Wednesday afternoon we plan an excursion. Venue: The conference will be held in the city of Kanazawa [4,5,6], located in the Ishikawa prefecture of Japan on the Japan Sea. The venue is the Ishikawa Prefectural Museum of Art [7] in the center of Kanazawa. Local Organizing Committee: . Norbert Preining (JAIST, Japan), Chair . Katsuhiko Sano (JAIST, Japan) . Kazushige Terui (Kyoto University, Japan) . Shunsuke Yatabe (AIST, Japan) For further information please contact: latd2012(a)jaist.ac.jp [1] http://www.mathfuzzlog.org/ [2] http://www.jaist.ac.jp/rcis/en/ [3] http://www.jaist.ac.jp/ [4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa [5] http://www.kanazawa-tourism.com/ [6] http://wikitravel.org/en/Kanazawa [7] http://www.ishibi.pref.ishikawa.jp/index_j.html

1 0

CL&C 2012: deadline extension
by Koji Nakazawa 03 Apr '12

03 Apr '12

（重複の場合はご容赦ください） 7月にWarwickで開催される古典論理と計算に関するワークショップの論文募集です．締切りが大幅に延長されておりますので，是非，投稿をご検討ください．中澤 International Workshop on Classical Logic and Computation (CL&C'12) http://www.doc.ic.ac.uk/~svb/CLaC12 July, 8 2012 Warwick, England CL&C'12 is a satellite workshop of ICALP'12. IMPORTANT DATES Abstract submission (canceled) Deadline for submission: April, 23, 2012 (new) Notification of acceptance: June, 18, 2012 (new) Final version due: June, 28, 2012 (new) Workshop date: July, 8, 2012 INTRODUCTION CL&C'12 is the fourth of a conference series on Classical Logic and Computation. It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as satellite workshop of ICALP'12 in Warwick: http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/ CL&C is focused on the interplay between program extraction from classical the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic; - design of programming languages inspired by classical logic; - cut-elimination for classical systems; - proof representation and proof search for classical logic; - translations of classical to intuitionistic proofs; - constructive interpretation of non-constructive principles; - witness extraction from classical proofs; - constructive semantics for classical logic (e.g. game semantics); - case studies (for any of the previous points). SUBMISSION AND PUBLICATION. This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic / position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. All submitted papers will be reviewed to normal standards. The PC recognises two kinds of papers: it will distinguish between accepted (full) papers that contain unpublished results not submitted elsewhere, and presentations of (short) papers about work in progress. The accepted papers will appear in EPTCS. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at https://www.easychair.org/conferences/?conf=clc2012 A participants' proceedings will be distributed at the workshop. PROGRAMME COMMITTEE * Herman Geuvers (Nijmegen) - chair * Stefano Berardi (Turin) * Steffen van Bakel (Imperial College London) * Silvia Ghilezan (Novi Sad) * Koji Nakazawa (Kyoto Univeristy) * Ugo de'Liguoro (Turin) CONTACT deligu(a)di.unito.it

1 0

seminar announcement
by Hiroakira Ono 03 Apr '12

03 Apr '12

東北大学の赤間陽二さんの依頼により投稿します。　　小野寛晰 ---------------------------------------------------------------------------------------------- 　　　　　　Seminar Announcement Anyone can come! Speaker: Norbert Preining (JAIST) Title: Goedel Logics, Continuous Embeddability and Fraisse's Conjecture Date: Wednesday, 4 April, 16:00---17:40 Venue: 802, Rigaku Sogo-to (Godo-to), 8F, Science Campus, Tohoku University Key words: many-valued logic, order theory, semantics In this talk we present a family of many-valued logics introduced by Kurt Goedel to approximate Intuitionistic Logic. Later on these were extended to first order and have exhibited connections to temporal logics, Kripke frames based logics, fuzzy logics in the sense of Hajek (t-norm based logics). These logics are based on selecting a closed subset of the real interval [0,1], and collecting all formulas evaluating to true for all valuations into this truth value set. Due to the specific truth functions different truth values sets might generate the same logics (as sets of formulas). During the search for the total number of logics we took up old conjecture of Fraisse (theorem of Laver) on the behaviour of scattered linear orderings. We consider continuous embeddability in the reals and prove a generalized Fraisse conjecture stating the the closed subsets of the real [0,1] interval with continuous embeddability are better-quasi-ordered. Using this result we can show that surprisingly the total number of different Goedel logics is countable. This discrepancy - on the one hand uncountable many equivalence classes of the above mentioned ordering, and countable many Goedel logics on the other hand - leaves us still without an "intensional definition" of Goedel logics in the sense that if two semantical objects (to be found or defined) are different, then the respective logics are different, too. This does not hold for equality of the truth value sets, since there are different truth value sets creating the same logic, as well as for the above mentioned continuous embeddability induced equivalence. ======================================== Short biography of Norbert Preining * Graduated from Vienna University of Technology under the auspicies of the president of the Republic of Austria in 2003 * Postdoc in Siena, Italy as European Community Marie Curie Fellow * Project leader of a research project of the Austrian Research Fund (FWF) (paralleling the JSPS) * Currently Associate Professor at the JAIST * Secretary of the Kurt Goedel Society, responsible for the Kurt Goedel Research Prize Fellowship * Spare time activities are montaineering, typography, TeX, and Debian Contact: Yohji Akama (Mathematical Institute, Tohoku University) akama(a)m.tohoku.ac.jp, 022-795-7708 For the access, See map on http://www.math.tohoku.ac.jp/access/index.html or http://www.math.tohoku.ac.jp/english/access-e.html　（english). For the building of the venue, see map on http://www.math.tohoku.ac.jp/map/ http://www.math.tohoku.ac.jp/english/campus-e.html (english)

1 0

TARK 2013 Call for Papers
by Suzuki, Nobu-Yuki 02 Apr '12

02 Apr '12

*Call for Papers* TARK 2013 14. Conference on Theoretical Aspects of Rationality and Knowledge January 7-9, 2013 Institute of Mathematical Sciences, Chennai, India Conference website: http://www.imsc.res.in/tark/ About the Conference The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, awareness and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, epistemic game theory, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems. Submissions are now invited to TARK 2013. Extended Abstracts can be submitted here: https://www.easychair.org/conferences/?conf=tark2013 Strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and papers should be accessible to such an audience. Papers will be held to the usual high standards of research publications. In particular, they should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the significance of the work -- its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Abstracts should be no longer than ten double-spaced pages (4,000 words). Optional technical details such as proofs may be included in an appendix. An email address of the contact author should be included. Papers arriving late or departing significantly from these guidelines risk immediate rejection. One author of each accepted paper will be expected to present the paper at the conference. Economists should be aware that special arrangements have been made with certain economics journals (in particular, with International Journal of Game Theory, Games and Economic Behavior, Journal of Economic Theory, and Mathematical Social Sciences, so that publication of an extended abstract in TARK will not prejudice publication of a full journal version. TARK 2013 will precede the Indian Conference on Logics and Applications (ICLA) held from January 10 - 12, 2013, also at the Institute of Mathematical Sciences in Chennai, India. TARK 2013 is the 14th conference of the TARK conference series. Previous conferences have been held bi-annually around the world. The most recent conference was held 2011 at the University of Groningen, Netherlands, see http://www.philos.rug.nl/TARK2011/. The proceedings of all previous TARK conferences can be accessed here http://www.tark.org/ TARK 2013 is the first TARK conference to be held in India. It is also the first TARK conference to be held in January. Key Dates for TARK 2013 Submission of abstracts: September 3, 2012 Notification of authors: October 29, 2012 Camera ready copy of accepted papers: November 30, 2012 Conference: January 7 - 9, 2013, Institute of Mathematical Sciences, Chennai, India Program Committee Samson Abramsky, Oxford University Thomas Agotnes, Universitetet i Bergen Hans van Ditmarsch, Universidad de Sevilla Amanda Friedenberg, Arizona State University Aviad Heifetz, The Open University of Israel Jerome Lang, Université Paris-Dauphine and Université Paul Sabatier Fenrong Liu, Tsinghua University Larry Moss, Indiana University, Bloomington Antonio Penta, University of Wisconsin-Madison Andres Perea, Maastricht University R. Ramanujam, Institute for Mathematical Sciences, Chennai Oliver Roy, Ludwig-Maximilians Universität München Burkhard C. Schipper, University of California, Davis Marciano Siniscalchi, Northwestern University Giacomo Sillari, Scuola Normale Superiore, Pisa Nobuyuki Suzuki,Shizuoka University Jonathan Zvesper, London Program Chair Burkhard C. Schipper University of California, Davis Department of Economics One Shields Avenue Davis, CA 95616, USA Email: bcschipper ad ucdavis dot edu Local Organizing Chair R. Ramanujam Institute of Mathematical Sciences CIT Campus, Taramani Chennai 600 113, India Email: tark2013org at gmail dot com Chair of the TARK Conference Series Joe Halpern Cornell University Computer Science Department

1 0

Prof. Dieter Spreen Lecture at NII Logic Seminar
by Makoto Tatsuta 27 Mar '12

27 Mar '12

Prof. Dieter Spreen Lecture at NII Logic Seminar Date: April 4, 2012, 13:30--15:30 Place: National Institute of Informatics, Room 1213 (12th floor) 場所: 国立情報学研究所 12階 1213室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/introduce/access1-j.shtml) Speaker: Prof. Dieter Spreen (University of Siegen) Title: A refined model construction for the polymorphic lambda calculus Abstract: We present and discuss a stable model for the polymorphic lambda calculus. The domains are enriched by an approximation structure. This allows to put additional requirements on the morphisms of the underlying category. Moreover, a totality notion can be introduced such that in the induced model the polymorphic booleans are interpreted by the two-element set {True, False}. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

数学・数理科学のためのキャリアパスセミナー
by KASHIMA Ryo 20 Mar '12

20 Mar '12

日本数学会数学基礎論および歴史分科会会員の皆様、数学会理事長からの連絡を転送します。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp ＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝数学会会員各位東京理科大で開催される本年度数学会年会の３日目、３月２８日（水）13:00 - 17:00 に、ドクターの学生と企業との相互理解を深めることを目的として、『数学・数理科学のためのキャリアパスセミナー』が開催されます。研究開発に力をいれている１７の企業が参加します。企業との良好な関係を築き、数学を学んだ方々の進路を広げるためにも、できるだけ多くの数学関係者に参加していただきたいと考えております。大学院生、研究生など、関係しそうな方に、ぜひ参加するよう、広く呼びかけていただければ幸いです。同セミナーの詳細につきましては、数学会のウェブページ http://mathsoc.jp/meeting/tus12mar/career2012.html を御覧ください。日本数学会理事長　宮岡　洋一

1 0

数学会年会
by KASHIMA Ryo 20 Mar '12

20 Mar '12

日本数学会数学基礎論および歴史分科会会員の皆様、来週26日(月)から東京理科大学にて春の学会（年会）が開催されます。当分科会は　26日(月)：一般講演，歴史部門懇談会．　27日(火)：一般講演，特別講演，分科会総会．を行います。皆様のご参加をお待ちしています。 ----- 鹿島亮（今回の年会の準備までを評議員として担当しています）東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 0

2012LLS
by Toshihiko Kurata 29 Feb '12

29 Feb '12

kisoron-ml，logic-mlの皆様，以前ご案内させて頂きました「ラムダと論理の研究会」ですが，セミナーハウスでの宿泊について学生部屋に限りまだ余裕があるとのことです．折角の機会ですので，再度ご案内させて頂きます．関心のあります学生さんは倉田（法政大学，kurata(a)hosei.ac.jp) まで遠慮なく御問合わせ下さい．なお，セミナー自体の参加希望は直前まで可能です．詳細情報は http://www.i.hosei.ac.jp/~kurata/2012LLS/ にありますので，よろしくお願いいたします． ---- Toshihiko Kurata, Hosei University e-mail kurata(a)hosei.ac.jp

1 0

2012LLS
by Toshihiko Kurata 12 Feb '12

12 Feb '12

kisoron-ml，logic-mlの皆様，昨年の夏休み期間に行われました「ラムダと論理の研究会」ですが，春休みにも同様に行うこととなりました．詳しい情報は http://www.i.hosei.ac.jp/~kurata/2012LLS/ にありますので気軽に参加を検討いただけますと幸いです．過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関して，成果発表の場というよりは成果をあげる場となっていまして，講演件数を抑え，残りの時間は個人やグループで柔軟に計画してもらうようになっています．色々な方と交流を持つためにも丁度よいと思います．（こうした形式のセミナーは主に海外で行われているらしく，それを取り入れた古森先生の研究室の下で継続的に実施されています．） ---- Toshihiko Kurata, Hosei University e-mail kurata(a)hosei.ac.jp ---------------------------------------------------------------------- 日時：　2012年3月18日(日)午後5時から3月22日(木)正午まで場所：　国立大学草津セミナーハウス参加申込：　昨夏と同様に事務的なことは倉田（法政大学）が窓口となっています．講演や参加を希望されます方は以下の項目を kurata(a)hosei.ac.jp までメイル下さい．会議室確保の都合がありまして，参加のみ希望されます方も予め御連絡頂けますと幸いです． -------------------------- 参加申込 -------------------------- 氏名：所属：連絡先 (e-mail): 参加期間：講演希望：有・無題目：希望時間：その他： -------------------------------------------------------------- また，セミナーに参加される方の中で特にセミナーハウスでの宿泊を希望される方は 2月20日までに宿泊申込を倉田（上記e-mailアドレス）までメイル下さい．宿泊定員の関係でこちらの締切は早くなっています．（確保した部屋が一杯になったら締切内に申し込んでも部屋が確保できない可能性がありますので御了承下さい．）他の情報は後から送って頂いて構いませんので，よろしくお願いいたします． ------------------- セミナーハウス宿泊申込 ------------------- セミナーハウスの宿泊の申込をします。部屋タイプの希望（教員は選択可，学生は学生部屋となります）：　　　　教員用, 学生用, どちらでもよい宿泊・食事の希望（希望しない部分を消去して下さい）：　　　　18日　　夕食　宿泊　　　　19日　　朝食　夕食　宿泊　　　　20日　　朝食　夕食　宿泊　　　　21日　　朝食　夕食　宿泊　　　　22日　　朝食 --------------------------------------------------------------

1 0

NII Type Theory Workshop
by Makoto Tatsuta 01 Feb '12

01 Feb '12

Seventh NII Type Theory Workshop Date: February 6, 2012, 13:00--17:00 Place: National Institute of Informatics, Room 2005 (20th floor) 場所: 国立情報学研究所 20階 2005室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/introduce/access1-j.shtml) Program: 13:00--13:30 Daisuke Kimura (National Institute of Informatics) Title: A generalized modal lambda calculus 13:30--14:00 Kazuyuki Asada (National Institute of Informatics) Title: Semantics of Multi-rooted Graph with Ordered Branch 14:00--14:20 Tea Break 14:20--15:00 Makoto Tatsuta (National Institute of Informatics) Title: Type Inference for Bimorphic Recursion 15:00--15:40 Yukiyoshi Kameyama (University of Tsukuba) Title: Pseudo-Classical Modal Logic for Staged Computation 15:40--16:00 Tea Break 16:00--17:00 Stefano Berardi (Torino University) Title: A Game Semantic for various Subclassical Logics Abstracts: ---------------------------------------------------------------------- Daisuke Kimura (National Institute of Informatics) Title: A generalized modal lambda calculus Abstract: In this talk, we introduce a lambda calculus with modal types. The types of this system contain information of possible worlds explicitly. This information can be considered as a position which is an abstraction of time or place. The feature of our calculus is that we can change the property of modalities by changing information about the relationship between positions. The aim of our research is the following: (1) To clarify the computational meaning of necessity and possibility modal operators. (2) To give a uniform framework that can treat several calculi with modal types. ---------------------------------------------------------------------- Kazuyuki Asada (National Institute of Informatics) Title: Semantics of Multi-rooted Graph with Ordered Branch Abstract: Buneman et al. introduced a graph transformation language UnCAL, where graph has bisimilarity semantics. There structural recursion plays an important role, and in order to define it, they introduced multi-rooted graph and its algebraic representation. In this talk we give coalgebraic semantics for multi-rooted graph, and see that such final coalgebras has some call-by-value structure. Then we introduce a CBV equational theory. Next we modify the results of graph with un-ordered branch to that with ordered branch, which is important for application to XML. For this ordered graphs, bisimilarity is defined in some subtle way, but we can use the ordered version of above CBV equational theory for reasoning of the bisimilarity between ordered graphs. ---------------------------------------------------------------------- Makoto Tatsuta (National Institute of Informatics) Title: Type Inference for Bimorphic Recursion Abstract: This talk proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a recursively defined function: one is for its recursive calls and the other is for its calls outside its definition. Bimorphic recursion in this talk can be nested. This talk shows bimorphic recursion has principal types and decidable type inference. Hence bimorphic recursion gives us flexible typing for recursion with decidable type inference. This talk also shows that its typability becomes undecidable because of nesting of recursions when one removes the instantiation property from the bimorphic recursion. This is a joint work with Ferruccio Damiani. ---------------------------------------------------------------------- Yukiyoshi Kameyama (University of Tsukuba) Title: Pseudo-Classical Modal Logic for Staged Computation Abstract: In this talk, we study a pseudo-classical modal logic, which corresponds to the staged calculus with control operators introduced by our earlier work. Staged computation is a means for run-time code generation, and has been proved useful in improving efficiency and maintainability of software. We are interested in the use of control operators in staged computation, since they play an essential role to avoid the code duplication problem. Combining a staged calculus with control operators in a naive way results in an unsound calculus, and we need a restriction on the typing rule for lambda. We show that this restriction has a logical counterpart similar to Nakano's catch/throw calculus. ---------------------------------------------------------------------- Stefano Berardi (Torino University) Title: A Game Semantic for various Subclassical Logics Abstract: In this talk we describe the state of the art of game semantics for Logic and lambda-calculus, and the motivations for having a game semantics. Then we define a game semantic for Intuitionism extending both Coquands and Hyland-Ongs game semantics. The semantics refines a paper of TLCA 2007. We have two kind of results: (1) (Soundness and Completeness) The recursive winning strategy of our game semantics are isomorphic to the cut-free proofs of some variant of HA-omega (Infinitary Intuitionistic Arithmetic) (2) (Cut Elimination) Any debate between two terminating strategies terminates. This is an ongoing joint work with M. Tatsuta. ---------------------------------------------------------------------- 連絡先龍田真 (国立情報学研究所)

1 0

← Newer
1
...
52
53
54
55
56
57
58
59
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml