Logic-ml

10 participants
1782 discussions

AWPL 2018 (deadline extended)
by 小野寛晰 29 May '18

29 May '18

********AWPL CALL FOR PAPERS: Deadline Extended to June 10, 2018********** The 4th Asian Workshop on Philosophical Logic (AWPL), 20-21 October, 2018, Beijing Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second and third workshop took place successfully in Guangzhou (2014) and Taipei (2016), respectively. And the two post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer. The Fourth Asian Workshop on Philosophical Logic (AWPL 2018) will be held in Beijing, China, on 20-21 October 2018, organized by the Tsinghua-UvA Joint Research Centre for Logic at Tsinghua University. INVITED SPEAKERS – Bo An (Nanyang Technological University, Singapore) – Sergei Artemov (City University of New York, United States) – Kamal Lodaya (The Institute of Mathematical Sciences, India) – Tomoyuki Yamada (Hokkaido University, Japan) INVITED TUTORIAL – Melvin Fitting (City University of New York, United States) SUBMISSION All submissions should present original works not previously published. Submissions should be typeset in English with single-space and 12pt-size, be prepared as a .pdf file with at most 12 (A4-size) pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2018 <https://easychair.org/conferences/?conf=awpl2018>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series. IMPORTANT DATES – Submission deadline: 10 June 2018, 24:00 (UTC -12:00) – Notification: 10 July 2018 – Workshop: 20-21 October 2018 PROGRAM COMMITTEE – Nick Bezhanishvili, University of Amsterdam – Sujata Ghosh, Indian Statistical Institute – Jiahong Guo, Beijing Normal University – Meiyun Guo, South-West University, China – Fengkui Ju, Beijing Normal University – Kok-Yong Lee, National Chung Cheng University – Beishui Liao, Zhejiang University – Hanti Lin, University of California Davis – Fenrong Liu, Tsinghua University, chair – Hu Liu, Sun Yat-Sen University, China – Xinwen Liu, Chinese Academy of Social Sciences – Minghui Ma, Sun Yat-Sen University, China – Hiroakira Ono, JAIST, chair – Eric Pacuit, University of Maryland – Olivier Roy, University of Bayreuth – Katsuhiko Sano, Hokkaido University – Yi N. Wang, Zhejiang University – Chin-Mu Yang, Taiwan National University – Jiji Zhang, Lingnan University, Hong Kong ORGANIZATION COMMITTEE – Yu Chen, Tsinghua University – Haibin Gui, Tsinghua University – Dazhu Li, Tsinghua University – Junhua Yu, Tsinghua University, chair The AWPL is co-located with the workshop “Tsinghua meets CUNY” that will take place on 19 October 2018, all AWPL participants are invited to join that event too.

1 0

Re: [logic-ml] Project colloquium by Tomoo Yokoyama on 30 May
by Kohei SUENAGA 29 May '18

29 May '18

I'd like to attend the talk, but our polycom room is occupied due to another student seminar. Could someone designate a Google hangout connection for me? Thanks! Best, Kohei 2018年5月28日(月) 8:22 David SPRUNGER <sprunger(a)nii.ac.jp>: > Dear all, > This week, Tomoo Yokoyama will be visiting the Tokyo ERATO MMSD site > from the Kyoto University of Education. He will give our project > colloquium at the usual time, Wednesday (30 May) from 16:30-18:00. The > title and abstract for the talk are given below. > You are all warmly invited to join. > Best regards, > David Sprunger > ERATO MMSD > ----------------------------------------------------------------------- > Wed 30 May 2018, 16:30–18:00 > ERATO MMSD Takebashi Site Common Room 3 > http://group-mmm.org/eratommsd/access.html > Tomoo Yokoyama (Kyoto University of Education), > Topological methods for analyzing two dimensional flows > We introduce new topological methods, called a word representation and > a tree representation, for analyzing 2D flows. Applying the > topological methods to a plate in a time-dependent uniform flow under > mild conditions, we can estimate when the lift-to-drag ratios of the > plate are maximal and can determine the intermediate topologies of the > uniform flow. > Our talk consists of three parts. In fact, first we quickly review > topology and dynamical systems. Second, we present applications of our > methods. Finally we introduce the theoretical background and discuss > the relative works and the relations between topological structures > and data structures (e.g. implementation of representation algorithms, > contour extraction of streamlines from image data, generating all word > representation by an automaton, generating all tree representation by > "regular tree grammar + cyclic order", improvement of industrial > machines, possibilities of analyzing ocean phenomena and medical > phenomena). -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 1

特任研究員の募集
by koba＠kb.is.s.u-tokyo.ac.jp 28 May '18

28 May '18

＃複数受け取られましたらご容赦ください．東京大学の小林と申します．当研究室では現在，高階モデル検査（高階再帰スキームのモデル検査）とそのプログラム検証などへの応用をテーマとした研究を精力的に進めており，プロジェクトに携わる特任研究員を探しております．身近にご興味のある方がいらっしゃいましたら，10月20日までに小林 (koba(a)is.s.u-tokyo.ac.jp) までメールでお知らせいただければ幸いです。その際、できれば略歴および論文リスト（フォーマット自由）もメールに添えるかまたは郵送でお送りください。（後日、さらに詳細な資料をお願いする可能性があります）．募集の条件は概ね以下のとおりです。 ================ 着任時期：2018年4月（数ヵ月の前後は応相談）任期：年度単位の更新で、業績により最長2020年3月まで延長可能給与：月額38～45万円　　（大学の規定および本人の実績による．細かい条件は応相談.）研究テーマ：高階モデル検査（高階再帰スキームのモデル検査）および、そのプログラム検証やデータ圧縮、知識発見などへの応用。高階モデル検査については，プロジェクトのページ　　　http://www-kb.is.s.u-tokyo.ac.jp/~koba/hmc/ および下の参考文献をご覧ください。　　本プロジェクトは科学研究費補助金基盤研究(S)：　　　課題名：高階モデル検査の深化と発展　　　研究代表者：小林直樹（東京大学）　　　研究分担者：五十嵐淳（京都大学）、篠原歩（東北大学）　　の支援をいただいており、その補助金で研究員を雇用する予定です。条件： - 着任時に博士号を取得していること - 理論計算機科学全般に明るいこと． - 以下の中の１つ以上のトピックに詳しくプログラミング能力が高いか、　　　２つ以上のトピックに詳しいことモデル検査（特にソフトウェアモデル検査）型システムプログラム意味論プログラム解析・検証・変換オートマトンと形式言語理論自動定理証明　　　　　計算量理論 (可逆)データ圧縮技術自然言語処理ゲノムデータ解析問い合わせ先：　　小林直樹　　東京大学大学院情報理工学系研究科コンピュータ科学専攻　　〒113-0033 東京都文京区本郷7-3-1 　　Phone: 03-5841-4124 　　Fax: 03-5841-4114 　　email: koba(a)is.s.u-tokyo.ac.jp 参考文献の抜粋 ------------- 高階モデル検査の概要： Naoki Kobayashi, "Model Checking Higher-Order Programs", Journal of the ACM, 60(3), 2013. Naoki Kobayashi, "Higher-Order Model Checking: From Theory to Practice", Invited paper in Proceedings of LICS 2011. (A very brief survery of the field) 高階モデル検査/高階言語の理論： Naoki Kobayashi, Etienne Lozes, Florian Bruse, "On the relationship between higher-order recursion schemes and higher-order fixpoint logic", POPL 2017, pp.246-259, 2017 Kazuyuki Asada, Naoki Kobayashi, "Pumping Lemma for Higher-order Languages", ICALP 2017, 97:1-97:14, 2017. Ryoma Sinya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada, "Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence", FoSSaCS 2017, pp.53-68 プログラム検証への応用: Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno, "Predicate Abstraction and CEGAR for Higher-Order Model Checking", Proceedings of PLDI 2011, pp.222-233, 2011. Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno, "Temporal verification of higher-order functional programs", POPL 2016, pp.57-68 データ圧縮への応用: Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi, "Functional Programs as Compressed Data", Higher-Order and Symbolic Computation, 2(1), pp.39-84, 2012.

1 1

SAML 2018 / Takeuti Memorial Symposium 講演募集
by Teruyuki YORIOKA 21 May '18

21 May '18

皆様，静岡大学の依岡です。先日 logic-ml と kisoron-ml でお送りしました案内と同様のものです。竹内外史先生を追悼するシンポジウムを以下の要領で開催しますのでお知らせします。多くの方々の講演をお待ちしております。レセプションとバンケットを企画しておりますので、参加ご希望の方は申し込みをしてください。よろしくお願いします。 SAML 2018 / Takeuti Memorial Symposium Symposium on Advances in Mathematical Logic 2018 Dedicated to the Memory of Professor Gaisi Takeuti (1926-2017) http://www2.kobe-u.ac.jp/~mkikuchi/saml2018/ 日時：2018年9月18日（火）から20日（木）まで場所：神戸大学六甲台第2キャンパス内瀧川記念学術交流会館プログラム委員：新井敏康，岡田光弘，菊池誠，黒田覚，依岡輝幸言語：英語招待講演者：S. Buss, J.-Y. Girard, W. Sieg, M, Yasugi （他の招待講演者は後にお知らせします）一般講演：領域：数学基礎論のすべての領域（理論計算機科学および哲学を含む）講演時間：30分程度を予定（申込数に応じて変更します）講義録：原則として一般講演に基づく，査読付き論文からなる講義録をシンポジウム後に Springer Proceedings in Mathematics and Statistics から出版します。投稿締切：2019年3月31日，出版：2020年春の予定．詳細は一般講演者にお伝えします。懇親会：レセプション：2018年9月18日夜，会場：瀧川記念交流会館内，会費：4,000円程度バンケット（新井敏康教授還暦祝）：2018年9月19日夜，会場：未定，会費：12,000円程度参加ご希望の方は以下の情報を2018年7月31日までに件名を「SAML2018」として email で依岡輝幸 yorioka(a)shizuoka.ac.jp までお送りください。みなさまのご参加をお待ちしております。 ---ここから--- 氏名：所属：連絡先 (email)：一般講演の希望：有・無（希望有の場合）講演題目：アブストラクト（5行から10行程度）：懇親会：レセプション（参加・不参加），バンケット（参加・不参加） ---ここまで--- 連絡先：会場および懇親会について：菊池誠 mkikuchi(a)kobe-u.ac.jp 講演参加申込およびプログラムについて：依岡輝幸 yorioka(a)shizuoka.ac.jp

1 0

Announcement on SAML 2018 / Takeuti Memorial Symposium
by Teruyuki YORIOKA 17 May '18

17 May '18

Dear all, We are pleased to announce the international conference SAML 2018 / Takeuti Memorial Symposium Symposium on Advances in Mathematical Logic 2018 Dedicated to the Memory of Professor Gaisi Takeuti (1926-2017) http://www2.kobe-u.ac.jp/~mkikuchi/saml2018/ This will take place from September 18th to 20th, 2018, at the Takigawa Memorial Hall, Rokkodai Campus, Kobe University, in Japan. Program comittee: Toshiyasu Arai (Chiba) Makoto Kikuchi (Kobe) Satoru Kuroda (Gunma Prefectural Women’s University) Mitsuhiro Okada (Keio University) Teruyuki Yorioka (Shizuoka) Confirmed invited speakers: Samuel R. Buss (San Diego) Wilfried Sieg (CMU) Mariko Yasugi (Kyoto) (Other invited speakers will be announced later.) Scope: Mathematical logic and related areas including (but not restricted to) proof theory, set theory, computability theory, model theory, philosophical logic, theoretical computer science, philosophy of mathematics. Contributed talks: Each contributed talk is planned to be approx. 30 min (this may change according to the number of talks). Proceedings Volume: The proceedings volume of selected and revised papers based on the talks will be published after the symposium. Important Dates (tentative): Deadline of abstracts for contributed talks: July 31, 2018 Symposium: September 18-20, 2018 Deadline of full papers for the proceedings volume: March, 2019 Publication of the proceedings volume: December 2019 Parties: The reception will be held on September 18th evening at Takigawa Memorial Hall (conference venue). It will cost 4,000JPY (tentative). The banquet (Toshiyasu Arai 60th birthday celebration) will be held on September 19th evening. It will cost 12,000JPY (tentative). The place will be announced later. Registration: Send to Teruyuki Yorioka yorioka(a)shizuoka.ac.jp with subject "SAML2018", and please provide the following information. The deadline of the registration is July 31st, 2018. Name: Affiliation: E-mail: Contributed talk: (yes/no) if yes, please attach title and abstract (about 5 to 10 lines) Parties: Reception (yes/no), Banquet (yes/no) For any inquiry concerning the workshop, please contact for parties: Makoto Kikuchi mkikuchi(a)kobe-u.ac.jp for registration or program: Teruyuki Yorioka yorioka(a)shizuoka.ac.jp

1 0

Announcement on SAML 2018 / Takeuti Memorial Symposium
by Teruyuki YORIOKA 17 May '18

17 May '18

1 0

SLACS 2018 (8月8-9日) 講演募集のお知らせ
by Katsuhiko Sano 15 May '18

15 May '18

皆様（複数のメイリングリストに送信しています。重複して受信の際はどうぞご容赦ください。） SLACS 2018（記号論理と情報科学）幹事の北海道大学の佐野勝彦です。今年度の講演募集を以下のとおり行います。ご検討よろしくお願いいたします。 SLACS 2018（記号論理と情報科学） https://sites.google.com/view/slacs-2018/home 日時 2018年8月8日（水）（午後1時頃開始）から2018年8月9日（木）場所〒060-0810 北海道札幌市北区北10条西7丁目　北海道大学人文・社会科学総合研究教育棟（W棟）5階 W517教室参加費無料。ただし、懇親会費は別途徴収します（懇親会は初日夕方に開催予定）。幹事北海道大学文学研究科佐野勝彦連絡先 katsuhiko.sano(a)gmail.com SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。　SLACS 2017 (千葉工業大学) 　http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/index.html SLACS 2016 (名古屋大学) http://www.st.nanzan-u.ac.jp/info/sasaki/2016slacs/SLACS2016.html SLACS 2015 (南山大学) https://sites.google.com/site/ptslacs2015/ SLACS 2014 (東京工業大学) http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ 講演・懇親会申込方法：講演を希望される方は、幹事に連絡をお願いいたします。その際、以下について回答をお願いいたします。Subject を「SLACS2018講演申込」にしておいていただけるとありがたいです。講演申込期限は **2018年7月24日** としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。講演時間は原則40分を予定しています。 ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 氏名：（例）佐野勝彦所属：（例）北海道大学文学研究科 e-mail アドレス: 区分：一般/学生 ← プログラム作成・懇親会費設定に利用する場合があります題目：（例）TBA 概要：簡単で結構です。懇親会：参加する/追って連絡する/参加できない要望等：（例）初日しか参加できませんので初日の枠に入れてください ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 講演を伴わない聴講のみを希望される場合、事前連絡は不要です。当日、会場に直接お越しください。

1 0

Tutorial by William Byrd at Kyoto Univ.
by Atsushi Igarashi 09 May '18

09 May '18

皆様，京都大学の五十嵐です．現在FLOPS2018で来日中の William E. Byrd さんに，来週の水・木の二日間にわたって，京大で relational programming のチュートリアルをして頂くことになりました． Dr. Racket をインストールしたノートＰＣを持ってくると，より楽しめるとのことです :-) 二日間にわたっていますが，二日目も最初に復習から入るようにお願いしました．一部だけでもどうぞ．ふるってご参加ください． ========================================================================== 日時: 5/16(水) 10:30〜15:30 (途中昼休みあり) 5/17(木) 10:30〜15:30 (途中昼休みあり) 会場: 京都大学吉田キャンパス総合研究７号館会議室(１階１２３号室) William E. Byrd Department of Computer Science & Hugh Kaul Precision Medicine Institute University of Alabama at Birmingham Tutorial Title: Relational Programming in miniKanren: an Interactive Tutorial Abstract: Relational Programming is a paradigm in which programs represent mathematical relations (in contrast to functional programming, in which programs represent mathematical functions). Unlike traditional programs, relational programs do not distinguish between inputs and outputs. Instead, *any* argument to a relational program can be treated as either an input or an output. This unusual property makes relational programs extremely flexible, and able to automatically perform tasks that would be complicated to implement using standard techniques. For example, an interpreter written as a relation is able to perform *program synthesis*, automatically generating programs from input/output examples. In this in-depth, interactive, two day tutorial, we will explore the world of relational programming using miniKanren, a language specifically designed for writing interesting programs as relations. Together we will implement the core of the miniKanren relational programming language. We will also implement an interpreter for a subset of Racket, written as a miniKanren relation. We will then use this "relational interpreter" to perform simple program synthesis, and discuss techniques that can speed up synthesis by many orders of magnitude. The tutorial will be highly interactive. We will implement all the code together, using the Racket programming language (a variant of Scheme). We will begin with a short introduction to basics of the Racket language, which can be learned in a few minutes. If you would like to implement all the code yourself, please bring a laptop with DrRacket installed (https://racket-lang.org/). If you don't want to implement the code yourself, you can participate by helping me as I write the code at the projector! :) Topics we will cover in the tutorial: * fundamental concepts of relational programming * a brief introduction to the Racket programming language * introduction to the miniKanren relational programming language * writing recursive relations in miniKanren * writing a simple Racket interpreter as a function in Racket * writing a simple Racket interpreter as a relation in miniKanren * using the relational Racket interpreter to perform simple program synthesis * optimizations and extensions to the relational Racket interpreter * implementing the core of miniKanren (microKanren) * open research problems in relational programming * lots of other interesting related topics -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/

1 0

Talk by Soichiro Fujii (10 May, 11.00-, at Kyoto University)
by Kazushige TERUI 06 May '18

06 May '18

皆様今週木曜日に、京都大学にて藤井宗一郎さんのご講演があります。詳細は以下のとおりです。どうぞお気軽にご参加ください。京都大学数理解析研究所照井一成 ==================== Time: 11:00-12:00, 10 May, 2018 Place: Rm 478, Research Building 2, Main Campus, Kyoto University 京都大学本部構内総合研究2号館 4階478号室 http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34) Speaker: 藤井宗一郎 Soichiro Fujii (U Tokyo) Title: A unified framework for notions of algebraic theory Abstract: Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or (abstract) clones. The ubiquity of algebraic structures in mathematics has also given rise to several variants of universal algebra, such as symmetric and non-symmetric operads, clubs, and monads. In this talk, I will present a unified framework for these cousins of universal algebra, or notions of algebraic theory. First I will explain how each notion of algebraic theory can be identified with a certain monoidal category, in such a way that theories correspond to monoids. Then I will introduce a categorical structure underlying the definition of models of theories. In specific examples, it often arises in the form of oplax action or enrichment. Finally I will uniformly characterize categories of models for various notions of algebraic theory, by a double-categorical universal property in the pseudo-double category of profunctors.

1 0

Project colloquium talk by Paolo Arcaini on 9 May
by urabenatsuki＠is.s.u-tokyo.ac.jp 05 May '18

05 May '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Paolo Arcaini on 9th May, 16:30-. 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 ----- Wed 9 May 2018, 16:30–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html Paolo Arcaini (National Institute of Informatics <http://www.nii.ac.jp/>), Decomposition-Based Approach for Model-Based Test Generation Model-based test generation by model checking is a well-known testing technique that, however, suffers from the state explosion problem of model checking and it is, therefore, not always applicable. In this talk, I present an approach that addresses this issue by decomposing a system model into suitable subsystem models separately analyzable. The technique consists in decomposing that portion of a system model that is of interest for a given testing requirement, into a tree of subsystems by exploiting information on model variable dependency. The technique generates tests for the whole system model by merging tests built from those subsystems. Effectiveness and efficiency of the proposed decomposition-based test generation approach are measured both in terms of coverage and time.

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml