Logic-ml

logic-ml@fos.kuis.kyoto-u.ac.jp

7 participants
1772 discussions

QIT38のご案内
by NISHIMURA Harumichi 07 Mar '18

07 Mar '18

logic-mlの皆さま名古屋大学の西村です．第38回量子情報技術研究会(QIT38)の会告を代理投稿させていただきます．どうぞ宜しくお願いいたします．名古屋大学大学院情報学研究科西村治道 ------------------ QIT38会告文 ------------------------------- 第38回量子情報技術研究会(QIT38) 研究会の内容：情報科学と量子力学を融合させた新しい分野、量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．第38回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．なお本研究会から学生発表賞を創設いたしました．応募方法等詳細は下記QITウェブサイトをご確認下さい．日時: 2018年6月4日(月)-5日(火) 会場: 広島国際会議場小会議室ラン (〒730-0811広島市中区中島町1-5 <https://maps.google.com/?q=730-0811%E5%BA%83%E5%B3%B6%E5%B8%82%E4%B8%AD%E5%…> 平和記念公園内) 発表募集分野 (申し込み状況によっては査読の可能性あり)：量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．定員: 150名参加費: 事前振込み一般4,000円，学生3,000円 (当日会場払いは一般5,000円，学生4,000円) (懇親会は別途) 研究会参加申込要領：参加申込は下記 Web にて受付けます： http://staff.aist.go.jp/s-kawabata/qit/ 講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，電子情報通信学会の Web システムを使用する予定．【口頭講演申込締切】2018年4月6日(金) 【ポスター講演申込締切】2018年4月20日(金) 【予稿原稿提出締切】2018年4月25日(水) 【参加申込締切】2018年5月7日(火) 【問合せ先】飯沼昌隆(広島大学先端物質科学研究科) 石坂智(広島大学総合科学研究科) 廣川真男(広島大学工学研究科) ホフマンホルガ(広島大学先端物質研究科) Email: qit38(a)ml.hiroshima-u.ac.jp 主催: 量子情報技術特別研究専門委員会 (委員長: 竹内繁樹(京都大学)) 共催: 応用物理学会量子エレクトロニクス研究会助成: 中国電力技術研究財団 ------------------------------------------------------------ -------------------------------

1 0

Int. Workshop on External and Internal Calculi for Non Classical Logics (EICNCL 2018, Deadline for submission: 23 April 2018)
by Katsuhiko Sano 07 Mar '18

07 Mar '18

-------------------------------------------------------------------------------------- Call For Papers Int. Workshop on External and Internal Calculi for Non Classical Logics (EICNCL 2018) Oxford, UK, 19 July 2018 (affiliated with IJCAR 2018 in FLOC 2018) http://weic2018.loria.fr/ Deadline for submission: 23 April 2018 ---------------------------------------------------------------------- ------------------- A one day workshop on External and Internal Calculi for Non Classical Logics will be held the 19 July 2018 in conjunction with the IJCAR 2018 Conference during FLOC 2018 in Oxford, UK. The purpose of this workshop would be to discuss recent results on analytic (external or internal) calculi for non-classical logics like intuitionistic, modal, epistemic logics, conditional logics, substructural, resouce logics, and other logical systems. Among some key points we can mention the relationships between internal and external calculi for such logics and also their use for studying proof-search, automated deduction (proof-theory and implementation) and also logical properties like decidability, conservativity, axiomatisations and interpolation. The workshop is intended to provide a forum for discussion between researchers interested in topics including, but not limited to, the following areas: - External and internal calculi for non-classical logics - Relationships and embeddings (translations) between calculi, interactions between syntax and semantics - New calculi for studying problems like decidability, conservativity and interpolation - Proof-search and countermodel generation - Methodologies and tools for translations between calculi - Implementations of analytic calculi, proof assistants We envisage a range of perspectives: proof-theoretic foundations, including decidability and complexity; model-theoretic, including semantic foundations (e.g., new semantics), modelling and verification of programs and systems. SUBMISSIONS Researchers interested in presenting their works are invited to submit an extended abstract (up to 10 pages) through Easychair : https://easychair.org/conferences/?conf=eicncl2018 by 23 April 2018. Papers will be reviewed by peers, typically members of the Programme Committee. A Special Issue of a Journal on these topics is expected after the workshop. PROGRAM COMMITTEE J. Brotherston (University College, London, UK) A. Ciabattoni (TU Vienna, Austria - co-chair) D. Galmiche (Lorraine University, CNRS, LORIA, France - co-chair) R. Goré (Australian National University, Australia) D. Larchey-Wendling (Lorraine University, CNRS, LORIA, France) G. Metcalfe (University of Bern, Switzerland) S. Negri (University of Helsinki, Finland) N. Olivetti (LSIS, Aix-Marseille University, France - co-chair) J. Otten (University of Oslo, Norway) V. de Paiva (Nuance communications, USA) R. Ramanayake (TU Vienna, Austria - co-chair) K. Sano (Hokkaido University, Japan) L. Santocanale (LIF, Aix-Marseille University, France) S. Smets (ILLC, Amsterdam University, Netherlands) L. Vigano (King's College London, UK) IMPORTANT DATES Submission deadline: 23 April 2018 Notification to authors: 9 May 2018 Final versions due: 21 May 2018 Workshop date: 19 July 2018 Additional information will be available through WWW address: http://weic2018.loria.fr/ The workshop is co-organized by A. Ciabattoni, R. Ramanayake (TU Vienna), N. Olivetti (LSIS, Aix-marseille University) and D. Galmiche (LORIA - Lorraine University)

1 0

名古屋ロジックセミナー (3/9) のお知らせ
by Takayuki Kihara 05 Mar '18

05 Mar '18

皆様名古屋大学の木原貴行です．以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：3月9日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：薄葉季路 (早稲田大学)　題目： Extendible cardinals and the mantle アブストラクト： Mantle は V のすべての ground model の共通部分として定義される inner model であるが、mantle 自身は ground model である必要はない。一方で、ある超巨大基数が存在するならば mantle 自身が ground model になることが知られている。本講演では、巨大基数の仮定を弱めて、 extendible cardinal の存在から mantle が ground model になることを証明する。 -------- Takayuki Kihara Graduate School of Informatics, Nagoya University, Japan URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/index-j,html Email: kihara(a)i.nagoya-u.ac.jp

1 0

25th WoLLIC 2018 (Bogotá, Colombia) - DEADLINE APPROACHING
by 小野寛晰 05 Mar '18

05 Mar '18

[Apologies for multiple copies.] DEADLINE APPROACHING WoLLIC 2018 25th Workshop on Logic, Language, Information and Computation July 24th to 27th, 2018 Bogotá, Colombia SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) ORGANISATION Departamento de Matemáticas, Universidad de los Andes, Colombia Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Departamento de Matemáticas, Universidad de los Andes, Colombia CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at the Departamento de Matemáticas of the Universidad de los Andes, Bogotá, Colombia, from July 24th to 27th, 2018. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2018 EasyChair website. (Please go to http://wollic.org/wollic2018/instructions.html <http://wollic.org/wollic2018/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 11, 2018, and the full paper by Mar 18, 2018 (firm date). Notifications are expected by Apr 15, 2018, and final papers for the proceedings will be due by Apr 22, 2018 (firm date). PROCEEDINGS The proceedings of WoLLIC 2018, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2018 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Katalin Bimbo (Univ of Alberta, Canada) Xavier Caicedo (Univ de Los Andes, Colombia) José Meseguer (Univ of Illinois, Urbana-Champaign, USA) Elaine Pimentel (Univ Federal do Rio Grande do Norte, Brazil) Guillermo Simari (Univ Nacional del Sur, Argentina) Renata Wassermann (Univ de São Paulo, Brazil) SPECIAL SCREENING - A TRIBUTE TO THE MEMORY AND LEGACY OF RAYMOND SMULLYAN As a tribute to the memory and legacy of the late Raymond Smullyan, who passed away in February 2017, there will be a special session with a screening of the documentary film "This Film Needs No Title: A Portrait of Raymond Smullyan" (Dir. Tao Ruspoli, 2006, 30min), as well as short testimonies by experts. STUDENT GRANTS ASL sponsorship of WoLLIC 2018 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2018). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 11, 2018: Paper title and abstract deadline Mar 18, 2018: Full paper deadline Apr 15, 2018: Author notification Apr 22, 2018: Final version deadline (firm) PROGRAMME COMMITTEE Siddharth Bhaskar (Haverford College, USA) Torben Braüner (Roskilde University, Denmark) Hazel Brickhill (University of Bristol, UK) Michael Detlefsen (University of Notre Dame, USA) Juliette Kennedy (University of Helsinki, Finland) Sophia Knight (Uppsala University, Sweden) Alex Kruckman (Indiana University, USA) Maricarmen Martinez Baldares (Universidad de los Andes, Colombia) Frederike Moltmann (CNRS, France) Lawrence Moss (Indiana University, USA) (CHAIR) Cláudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Nuance Comms, USA, and University of Birmingham, UK) Sophie Pinchinat (IRISA Rennes, France) David Pym (University College London, UK) Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) Revantha Ramanayake (Vienna University of Technology, Austria) Giselle Reis (Carnegie Mellon University, Qatar) Jeremy Seligman (The University of Auckland, New Zealand) Yanjing Wang (Peking University, China) Fan Yang (Delft University of Technology, The Netherlands) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Jaime A. Bohórquez (Escuela Colombiana de Ingeniería, Bogotá, Colombia) Xavier Caicedo (Universidad de los Andes, Colombia) (Local co-chair) Nicolás Cardozo (Universidad de los Andes, Bogotá, Colombia) Maricarmen Martínez (Universidad de los Andes, Colombia) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) Camilo Rocha (Universidad Javeriana, Cali, Colombia) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2018/ <http://wollic.org/wollic2018/>

1 0

CFP: Workshop on Mathematically Structured Functional Programming
by Shinya KATSUMATA 03 Mar '18

03 Mar '18

国立情報学研究所の勝股です。数学的構造に基づく関数型プログラミング研究のワークショップ MSFP に関してご案内いたします。今回は、6月に開催されるFSCDに併設される形で行われます。ぜひ投稿をご検討ください。 Seventh Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING Sunday 8th July 2018, Oxford, UK A satellite workshop of FSCD 2018 http://msfp2018.bentnib.org/ ** New this time: additional talk proposal category ** ** Deadline: 5th April (abstract), 12th April (paper) ** The seventh workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The fifth workshop was held in Grenoble, France, as part of ETAPS 2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven, Netherlands, just after ETAPS 2016. Important Dates: ================ Abstract deadline: 5th April (Thursday) Paper deadline: 12th April (Thursday) Notification: 17th May (Thursday) Final version: 14th June (Thursday) Workshop: 8th July (Sunday) Invited Speakers: ================= - Tamara von Glehn, University of Cambridge, UK - Didier Remy, INRIA, France Program Committee: ================== Andreas Abel - Chalmers, Sweden Danel Ahman - INRIA Paris, France Robert Atkey - University of Strathclyde, UK (co-chair) Jeremy Gibbons - University of Oxford, UK Jennifer Hackett - University of Nottingham, UK Mauro Jaskelioff - Universidad Nacional de Rosario, Argentina Shin-ya Katsumata - National Institute of Informatics, Japan Sam Lindley - University of Edinburgh, UK (co-chair) Clare Martin - Oxford Brookes University, UK Shin-Cheng Mu - Academia Sinica, Taiwan Valeria de Paiva - Nuance Communications, US Alexandra Silva - University College London, UK Submission: =========== Submissions are welcomed on, but by no means restricted to, topics such as: structured effectful computation structured recursion structured corecursion structured tree and graph operations structured syntax with variable binding structured datatype-genericity structured search structured representations of functions structured quantum computation structure directed optimizations structured types structure derived from programs and data Please contact the programme chairs Robert Atkey and Sam Lindley if you have any questions about the scope of the workshop. (New this time) We accept two categories of submission: full papers of no more than 15 pages that will appear in the proceedings, and extended abstracts of no more than 2 pages which we will post on the website, but which do not constitute formal publications and will not appear in the proceedings. References and appendices are not included in page limits. Appendices may not be read by reviewers. Full papers (not two page talk abstracts) must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers and talks must be presented at the workshop by at least one of the authors. The proceedings will be published under the auspices of EPTCS with a Creative Commons license. We are using EasyChair to manage submissions. To submit a paper, use this link: https://easychair.org/conferences/?conf=msfp2018.

1 0

Re: [logic-ml] 「ラムダ計算と論理の早春セミナー」開催のお知らせ(3/22~3/25@TUFS田沢湖ロッジ)
by "新屋良磨(秋田大)" 02 Mar '18

02 Mar '18

皆様，秋田大の新屋です．下記の要項で開催する「ラムダ計算と論理の早春セミナー」ですが，まだ田沢湖ロッジでの宿泊人数に余裕があるため，宿泊申し込みを3月9日(金)まで延長したいと思います．参加のご検討のほど，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 > On Feb 1, 2018, at 14:41, Ryoma Sin'ya <ryoma(a)math.akita-u.ac.jp> wrote: > > 皆様， > > 秋田大の新屋です． > > 3月22日(木)〜3月25日(日)の期間で田沢湖にて，恒例の「ラムダ計算と論理の早春セミナー」を行うこととなりました． > > 過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関してなごやかな雰囲気で議論できる場としたいと思っております． > 本セミナーは成果発表の場というより成果を挙げる場となっており，講演件数を抑え，残りの時間は個人やグループで柔軟に研究計画をしてもらうようになっています． > 色々な方と交流を持つためにも丁度よいと思いますので，形式等はあまり気にせず，気軽に参加いただけますと幸いです． > > 会場詳細や参加申し込みの方法は以下のWebページを御覧ください． > http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/ <http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/> > > どうぞ，よろしくお願いします． > > 秋田大学数理科学コース新屋良磨

1 0

IWC 2018 (Part of FLoC 2018 at Oxford)
by KIKUCHI Kentaro 02 Mar '18

02 Mar '18

皆様、東北大学の菊池健太郎です。7月にOxfordで開催される合流性に関する国際ワークショップIWC 2018のご案内をさせていただきます。どうぞよろしくお願いいたします。 ----- (* Apologies for any cross-postings. *) ===================================================================== Call for Papers IWC 2018 7th International Workshop on Confluence July 7th, 2018, Oxford, United Kingdom Collocated with FSCD 2018 Part of FLoC 2018 http://cl-informatik.uibk.ac.at/events/iwc-2018/ ===================================================================== Confluence provides a general notion of determinism and is widely viewed as one of the central properties of rewriting. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and has been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The International Workshop on Confluence (IWC) aims at promoting further research in confluence and related properties. IWC 2018 is collocated with FSCD 2017. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), Obergurgl (2016), and Oxford (2017). IMPORTANT DATES: * submission Sunday, April 15th, 2018 * notification Tuesday, May 15th, 2018 * final version Tuesday, May 29th, 2018 * workshop Saturday, July 7th, 2018 (deadlines are AoE) TOPICS: Specific topics of interest include: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: tba PROGRAM COMMITTEE: * Bertram Felgenhauer (University of Innsbruck) * Jeroen Ketema (TNO-ESI) * Kentaro Kikuchi (Tohoku University) * Samuel Mimram (LIX laboratory, École Polytechnique) * Julian Nagele (Queen Mary University of London) * Jakob Grue Simonsen (University of Copenhagen) SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=iwc2018 EasyChair style: http://easychair.org/publications/for_authors

1 0

リマインダー：Sakarovitch先生講演会
by "新屋良磨(秋田大)" 27 Feb '18

27 Feb '18

【明日，明後日および明々後日の講演会のリマインダーです】皆様， 2月28日(水)~3月1日(木)，東工大にて両日16:30からSakarovitch先生による連続講演会があります．水曜と木曜で会場が異なりますのでご注意ください． 3月2日(金)にも東大にて13:30からSakarovitch先生の講演会が開催されます．参加のご検討，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 > On Feb 9, 2018, at 9:04, 新屋良磨(秋田大) <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>> wrote: > > (重複で受け取られた方はご容赦ください) > 皆様， > > 秋田大の新屋です． > > 2月28日〜3月1日の東工大でのJacques Sakarovitch先生の連続講演会について，開催時間が変更されましたので， > 概要を改めて再通知させていただきます． > > 同日に東工大にて行われるプログラミング研究会と時間が重なっていたため，開始時刻を遅らせて > Lecture/Seminar ともに16:30からの開始とさせていただきました．＊会場は変更ありません． > > > ========== Lecture ========== > Time: > 16:30 ~ 17:30, 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: > 16:30 ~ 17:30, 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:ryoma@math.akita-u.ac.jp> > (共催：東京工業大学情報理工学院鹿島亮) > Begin forwarded message: > > From: "新屋良磨(秋田大)" <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>> > Subject: [jssst-ppl] Talk by Prof. Jacques Sakarovitch (March 2, 2018) > Date: February 16, 2018 12:14:47 JST > To: logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:logic-ml@fos.kuis.kyoto-u.ac.jp>, jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp> > > (重複で受け取られた方はご容赦ください) > 皆様， > > 秋田大学の新屋です． > > 以下の要領で3/2(金)に東大にてJacques Sakarovitch先生の講演会が開催されます． > > なお，前日(2/28~3/1)の東工大でのSakarovitch先生の連続講演会とは講演内容が別の > 新規なものとなっております．どうぞふるってご参加ください． > > 秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp> > > ========== > Time: > 1:30pm, March. 2, 2018 > > > Venue: > Room 236, East Building of Department of Chemistry, Faculty of Science(化学東館), University of Tokyo > > > Title: > Mysteries and marvels of rational base numeration systems > > Jacques Sakarovitch > CNRS / Paris Diderot University and Telecom ParisTech > > > Abstract: > The definition of numeration systems with rational base, in a joint > work with S. Akiyama and Ch. Frougny (Israel J. Math., 2008), > has allowed to make some progress in a number theoretic problem, > by means of automata theory and combinatorics of words. > At the same time, it raised the problem of understanding the > structure of the sets of the representations of the integers in these > systems from the point of view of formal language theory. > > At first sight, these sets look rather chaotic and do not fit well > in the classical Chomsky hierarchy of languages. They all enjoy a > property that makes them defeat, so to speak, any kind of iteration > lemma. On the other hand, these sets also exhibit remarkable > regularity properties. > > During the recent years, these regularities have been studied in a > series of joint papers with my student V. Marsault. In particular, we > have shown that periodic signatures are characteristic of the > representation languages in rational base numeration systems and > studied, jointly with S. Akiyama, a kind of autosimilarity property > that also leads to the construction of Cantor-like sets. > > These languages still keep most of their mystery. The partial results > which will be presented call for further investigations on the subject > even stronger. > ========== > _______________________________________________ > jssst-ppl mailing list > jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp> > http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl>

1 0

ワークショップのお知らせ(3/26~3/29@秋田大)
by Ryoma Sin'ya 26 Feb '18

26 Feb '18

(重複で受け取られた方はご容赦ください) 皆様，秋田大の新屋です．以下の要項で3月末に秋田大にてワークショップを開催いたします．参加申し込みなどは不要ですので，どうぞお気軽にご参加ください．期間： 3月26日のお昼後から3月29日のお昼前まで会場：〒010-8502 秋田市手形学園町1番1号秋田大学手形キャンパス総合研究棟 1階講義室 (学内地図 http://www.akita-u.ac.jp/honbu/info/magazine/outline/pdf/2011/46.pdf <http://www.akita-u.ac.jp/honbu/info/magazine/outline/pdf/2011/46.pdf> ) 講演予定者リスト(敬称略，決定順)：　　根元多佳子 (JAIST)，石原哉 (JAIST)，木原貴行 (名古屋大)，鹿島亮 (東工大)，照井一成 (京大)，　　薄葉季路 (早稲田大)，坪井明人 (筑波大)，金沢誠 (NII)，中野圭介 (電通大) 講演予定者リストは今後更新される可能性があります．また，若干名ですが学生さんにも講演を依頼しているところです． 2月中旬にワークショップのWebページと仮プログラムを公開したいと思います．また，本ワークショップの前日(3/22~3/25)までには秋田県仙北市田沢湖にて「ラムダ計算と論理の早春セミナー」も開催されますので，そちらへのご参加もご一考ください．以上，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>

1 1

Project colloquium talk by Étienne André and Bart Jacobs on 1 March
by urabenatsuki＠is.s.u-tokyo.ac.jp 26 Feb '18

26 Feb '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Étienne André and Bart Jacobs on 1 March, 16:00-. Please find the title and the abstract below. You are all invited. Sincerely, -- Natsuki Urabe urabenatsuki(a)is.s.u-tokyo.ac.jp The University of Tokyo, ERATO MMSD ---- Thu 1 March 2018, 16:00–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html 16:00–17:00 Étienne André (University Paris 13), Parametric timed automata: theory and applications Critical real-time systems must be formally verified to prevent any undesired behavior. When some timing constants are known with only a limited precision, traditional timed model-checking techniques may not apply anymore. We use here the formalism of parametric timed automata. Parametric timed automata are very expressive, and decision problems are notoriously very hard (in fact most interesting decision problems are undecidable). On the one hand, we review decidability results, and propose new decidable subclasses. On the other hand, we adopt a more pragmatic approach, and show that parametric timed automata allow us to model and verify distributed real-time systems; using the IMITATOR software, we derive best- and worst-case execution times for a real-time system designed by Thales, and subject to uncertainty in some tasks periods. We also briefly report on recent techniques to speed-up the verification time using abstractions, and on distributed parametric model checking. 17:00–18:00 Bart Jacobs (Radboud University), Privacy and Security in Identity Management and Medical Research This talk will given an overview of the ideas behind two practically oriented security and privacy projects at Nijmegen, NL: 1. Attribute-based identity management via the IRMA platform, see https://privacybydesign.foundation/en/ If interested, you can before the talk already install the IRMA app on your (Android or iOS) phone and collect some attributes yourself. 2. Polymorphic encryption and Pseudonymisation for a large scale Parkinson research study, see: https://pep.cs.ru.nl/

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml