Dear all,
The Department of Philosophy at Hokkaido University (Sapporo, Japan)
will hold a two-week summer school in dynamic epistemic logic and its
applications, jointly with two guest lecturers from University of
Auckland and ILLC (University of Amsterdam) from August 20 to August
31 as part of Hokkaido Summer Institute (HSI) 2018.
The following two intensive courses are scheduled to be offered during
the summer school.
Course 1 (20/Aug/2018 - 24/Aug/2018): Introduction to Logic (For details,
see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G093)
Course 2 (27/Aug/2018 - 31/Aug/2018): Dynamic Epistemic Logic and its
Applications (For details,
see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G102)
The main lecturer of Course 1 is Katsuhiko Sano (Department of
Philosophy, Hokkaido University).
The main lecturer of Course 2 is Jeremy Seligman (Faculty of Arts,
School of Humanities, the University of Auckland).
There will be a special live on-line lecture by Johan van Benthem
(University of Amsterdam, Stanford University, and Tsinghua
University) during Course 2.
Tomoyuki Yamada and Yasushi Nomura (Hokkaido University) will also
join the classes to help students follow the lectures, and communicate
with the lecturers.
The courses are intended for graduate students. Course 1 is meant for
students without prior knowledge of logic and will prepare them for
Course 2.
Each course is designed to be independent from the other course. Those
students who have some familiarity with basics of propositional logic,
first-order logic, and modal logic can skip Course 1, and those who
wish to take only Course 1 can learn basics of logic.
An application period for students from universities other than
Hokkaido University is
** from February 1 to February 28 2018.**
For more details about applications, please check the HSI official website:
https://hokkaidosummerinstitute.oia.hokudai.ac.jp/applications/
As the summer in Sapporo is beautiful and pleasant, it's a good idea
to learn logic this summer in Sapporo.
Tomoyuki Yamada
Department of Philosophy
Hokkaido University
(重複で受け取られた方はご容赦ください)
皆様,
秋田大の新屋です.
下記の要領にて,フランスからJacques Sakarovitch先生を東工大にお招きしSeminar および Lecture を実施いたします.
*SeminarとLectureで日時・会場が異なりますのでご注意ください.
Sakarovitch先生は現代のオートマトン理論を牽引する世界的研究者であり,この連続講演会は
計算機科学に携わる多くの方に興味を持っていただけると思います.
参加申し込みなどは不要ですので,どうぞふるってご参加ください.
なお,2月28日(水)のLectureでは,古典的なKleeneの定理(正規表現とオートマトンの表現力の等価性)の
精密化・一般化に関する講義をしてもらいます.
本講義では現代的なオートマトン理論の基礎を説明してもらう予定ですので,学生の皆様もどうぞふるってご参加ください.
また,3月1日(木)のSeminarでは,Sakarovitch先生自身のこれまでの研究成果を中心に講演してもらう予定です.
下記のSeminar概要にて述べられている主結果については,拙著サーベイ論文「オートマトン理論再考」
https://www.jstage.jst.go.jp/article/jssst/34/3/34_3_3/_article/-char/ja/ <https://www.jstage.jst.go.jp/article/jssst/34/3/34_3_3/_article/-char/ja/>
の4.4節でほんの少しだけ解説されていますので,興味のある方はどうぞこちらもご参照ください.
========== Lecture ==========
Time:
15:20 ~ 16:20, February 28, 2018 (Wed.)
Venue:
Room W935, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus)
東京工業大学大岡山キャンパス 西9号館 W935講義室 (西9号館東側(芝生スロープ側)入口を入って階段を1階上がって左側)
Title:
Automata and expressions
Jacques Sakarovitch
CNRS / Paris Diderot University and Telecom ParisTech
Abstract:
Not many results in Computer Science are recognised to be as basic and
fundamental as Kleene Theorem. It states the equality of two sets of
objects that we now call languages.
In this lecture, I propose a slight change of focus on this result and show
how it is mainly the combination of two families of algorithms:
algorithms that transform an automaton into an expression on one hand
and algorithms that build an automaton from an expression on the other.
The first purpose is to compare the results of these algorithms,
in order to understand they are indeed not so different.
And also to devise means to keep these results as small as possible.
The second benefit of isolating this part of Kleene Theorem is to allow
its extension much beyond languages: to subsets of arbitrary monoids
first, and then, with some precaution, to subsets with multiplicity,
that is, to formal power series.
===========================
========== Seminar ==========
Time:
15:20 ~ 16:20, March 1, 2018 (Thu.)
Venue:
Multi-Purpose Digital Hall, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus)
東京工業大学大岡山キャンパス 西9号館 ディジタル多目的ホール (西9号館東側(芝生スロープ側)入口を入ってすぐ)
Title:
Conjugacy and equivalence of weighted automata
Jacques Sakarovitch
CNRS / Paris Diderot University and Telecom ParisTech
Abstract:
As a main thread of this talk, I present the proof of the following result:
If two regular languages $L$ and $K$ have the same generating
functions, that is, for every integer $n$ they have the same number of
words of length $n$, there exists a rational bijection realised by a
letter-to-letter transducer that maps $L$ onto $K$.
This statement is a consequence of a refinement of the decidability of
the equivalence of two automata with multiplicity in $N$. It gives us
the opportunity to review first the basic definitions and results on
weighted finite automata, and second to revisit the `classical' theory
of reduction of automata with two notions borrowed to symbolic
dynamics: conjugacy and the Finite Equivalence Theorem.
===========================
大岡山キャンパスまでの行き方は以下をご覧ください:
https://www.titech.ac.jp/maps/ <https://www.titech.ac.jp/maps/>
西9号館までの行き方は
http://www.dst.titech.ac.jp/outline/facility/hall.html <http://www.dst.titech.ac.jp/outline/facility/hall.html>
の中の地図をご覧ください。
以上,どうぞよろしくお願いします.
秋田大学 数理科学コース 新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:[email protected]>
(共催:東京工業大学 情報理工学院 鹿島亮)
Logic MLの皆様、
国際ワークショップSetVR 2018について、論文締切が延長されましたので、再度ご案内させて頂きます。
Due to many requests, the deadline has been extended.
****************************************************************************
Call for Submissions: SetVR 2018 Workshop @ Diagrams 2018
SetVR 2018
International Workshop on Set Visualization and Reasoning 2018
https://sites.google.com/site/setvr2kn/current-workshop
Conference dates: 18th--22nd June, 2018
Location: Edinburgh, UK
Extended Submission Deadline: 19th February, 2018
****************************************************************************
SetVR 2018 will be the 6th meeting, with the first one held in 2004, previously called the Euler Diagrams Workshop. It aims to promote theoretical, empirical, applied research on visualization and diagrammatic reasoning, especially, about sets (set-theoretical and grouped data). SetVR 2018 welcomes submissions of types: full papers (16 pages) and short papers (8 pages; at least 5 pages). Accepted papers are expected to be published on-line by CEUR Workshop Proceedings (CEUR-WS.org).
SetVR 2018 will run as part of Diagrams 2018 conference, which will be held from June 18th to 22nd in 2018, and is expected to occupy one day during this period. http://www.diagrams-conference.org/2018/
Topics include (but not limited to):
-Information Visualization: diagram/graph drawing and layout, data visualization, ontology visualization, human-computer interaction
-Diagrammatic Logic: formalization, inference system, expressiveness, decidability, computational complexity, automated reasoning, history of notation
-Cognitive Science: efficacy evaluation, cognitive process, cognitive model, educational outcome
-Application of Diagrams: visual modeling, real world reasoning, ontology engineering, data exploration
Organizers
Yuri Sato (University of Brighton, UK)
Zohreh Shams (University of Cambridge, UK)
Program Committee
Bilal Alsallakh (Bosch Research and Technology Center, USA)
Jim Burton (University of Brighton, UK)
Peter Chapman (Edinburgh Napier University, UK)
Renata De Freitas (Universidade Federal Fluminense, Brasil)
Mateja Jamnik (University of Cambridge, UK)
Sven Linker (University of Liverpool, UK)
Luana Micallef (Helsinki Institute for Information Technology HIIT, Finland)
Peter Rodgers (University of Kent, UK)
Gem Stapleton (University of Brighton, UK)