Logic-ml January 2015

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

14 participants
18 discussions

セミナー案内
by KASHIMA Ryo 17 Nov '15

17 Nov '15

数理論理学セミナーのお知らせ日時：1月23日(金) 16:00から場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 話者：鈴木信行（静岡大学）題目：中間述語論理におけるExistence Propertyに関する話題 --- 小野の問題P52とその周辺 --- 概要：始めに中間述語論理の簡単な紹介をします。ざっくり言うと、中間述語論理とは、直観主義述語論理と古典述語論理の「中間」にある述語論理です。つぎに、existence property と disjunction property と言う性質を考えます。これらは、直観主義論理の構成性(constructivity)を示す顕著な性質として知られています。中間述語論理の枠組みでこれらを考察してみると、この2つの性質が独立であることが解ります。これは、小野の問題P52として知られる問題に否定的解決を与えます。今回は、これにまつわる若干のことがらも報告したいと思います。 ------ 本セミナーは定期的に東工大で開催しているものです。初めて参加を希望される方はご一報ください。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 3

JAIST Logic Workshop Series 2015
by Hajime Ishihara 03 Feb '15

03 Feb '15

皆様来年3月に金沢で開催されるJAIST Logic Workshop Series 2015のお知らせです。ふるってご投稿・ご参加ください。問合せ先：石原　哉・木原貴行・根元多佳子・横山啓太北陸先端科学技術大学院大学情報科学研究科 e-mail: jlws2015(a)jaist.ac.jp -------------------------------------------------------- *Call for Abstracts* JAIST LOGIC WORKSHOP SERIES 2015 Constructivism and Computability 2 March 2015 – 6 March 2015 Shiinoki Cultural Complex, Kanazawa, Japan http://www.jaist.ac.jp/is/labs/ishihara-lab/jlws2015/ -------------------------------------------------------- IMPORTANT DATES November 30 - deadline for abstract submissions December 25 - notification of accepted contributions February 15 - deadline for registrations March 2-6 - Constructivism and Computability workshop TUTORIALS * Giovanni Sambin (University of Padova) * Hideki Tsuiki (Kyoto University) * Stanley Wainer (University of Leeds) INVITED SPEAKERS * Ulrich Berger (Swansea University) * Takayuki Kihara (JAIST) * Graham Leigh (Vienna University of Technology) * Michael Rathjen (University of Leeds) * Masahiko Sato (Kyoto University) * Makoto Tatsuta (National Institute of Informatics) PROGRAM COMMITTEE * Toshiyasu Arai (Chiba University) * Andrej Bauer (University of Ljubljana) * Ulrich Berger (Swansea University) * Hajime Ishihara (co-chair, JAIST) * Masahiro Kumabe (Open University of Japan) * Erik Palmgren (Stockholm University) * Peter Schuster (University of Leeds) * Helmut Schwichtenberg (co-chair, LMU Munich) * Dieter Spreen (University of Siegen, UNISA Pretoria) * Kazuyuki Tanaka (Tohoku University) SUBMISSIONS Submissions of short abstracts (1 page in PDF format) are accepted through easychair.org, see https://easychair.org/conferences/?conf=jlws2015 DESCRIPTION JAIST Logic Workshop Series is a workshop series bringing together researchers from mathematical logic and its application, especially to artificial intelligence and software science. Each workshop has its own focus on a specific area of research in mathematical logic and its application. Previous workshops have been held in Kanazawa 2013, 2014 and 2014: http://www.jaist.ac.jp/~hirokawa/pr2013/ http://www.jaist.ac.jp/~preining/wpp/ http://www.jaist.ac.jp/~v-sano/jw2014/index.html In 2015, JAIST Logic Workshop Series focuses on “Constructivism and Computability” aiming at interaction and knowledge transfer between constructive mathematics and computability theory. The workshop is held being affiliated with EU FP7 Marie Curie Actions IRSES projects COMPUTAL (http://computal.uni-trier.de/) and CORCON (http://corcon.net/), but is open to all researchers in the areas. SCOPE Constructive mathematics and computability, and related areas including but not limited to: intuitionistic logic and type theory, proof theory, constructive analysis and topology, program extraction from proofs, recursion theory, computable analysis and topology, classical/constructive reverse mathematics, algorithmic randomness, real number computation etc. LOCAL ORGANIZERS * Hajime Ishihara (JAIST) * Takayuki Kihara (JAIST) * Takako Nemoto (JAIST) * Keita Yokoyama (JAIST) The workshop is supported by: * Japan Advanced Institute of Science and Technology (JAIST) CO-LOCATED WORKSHOP * JSPS-NUS Joint Workshop in Mathematica Logic and Foundations of Mathematics (6-7 March 2015, at the same venue)

1 2

ICALP 2015 CfP
by Shinya Katsumata 28 Jan '15

28 Jan '15

京都大学の勝股です。投稿締切まで３週間となりましたICALP2015のご案内です。 ---------- ICALP 2015 http://www.kurims.kyoto-u.ac.jp/icalp2015/ Second Call for Papers ====================== The 42nd International Colloquium on Automata, Languages, and Programming (ICALP) will take place in the period 6-10 July 2015 in Kyoto, Japan. The conference will co-locate with LICS 2015, the 30th ACM/IEEE Symposium on Logic in Computer Science. The ICALP 2015 conference chair is Kazuo Iwama (Kyoto University). ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, the main conference will be preceded and/or followed by a series of workshops. Important dates --------------- Submission deadline: Tuesday, 17 February 2015, 23:59 PST (Pacific Standard Time, UTC-8) Author notification: 15 April 2015 Final manuscript due: 30 April 2015 Deadlines are firm; late submissions will not be considered. Proceedings ----------- ICALP proceedings are published in the Springer-Verlag ARCoSS (Advanced Research in Computing and Software Science) subseries of LNCS (Lecture Notes in Computer Science). Invited Speakers ================= Ken Kawarabayashi, NII, Japan Valerie King, University of Victoria, Canada Thomas Moscibroda, MSR Asia, China Anca Muscholl, Universite Bordeaux, France (Joint with LICS) Peter O'Hearn, Facebook, UK (Joint with LICS) Invited Tutorial Speakers (Joint with LICS) ------------------------------------------- Piotr Indyk, MIT, USA Andrew Pitts, University of Cambridge, UK Geoffrey Smith, Florida International University, USA Masterclass speaker ------------------- Ryuhei Uehara, JAIST, Japan Topics ====== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------- * Algorithmic Game Theory * Approximation Algorithms * Combinatorial Optimization * Combinatorics in Computer Science * Computational Biology * Computational Complexity * Computational Geometry * Cryptography * Data Structures * Design and Analysis of Algorithms * Machine Learning * Parallel, Distributed and External Memory Computing * Randomness in Computation * Quantum Computing Track B: Logic, Semantics, Automata and Theory of Programming ------------------------------------------------------------- * Algebraic and Categorical Models * Automata, Games, and Formal Languages * Emerging and Non-standard Models of Computation * Databases, Semi-Structured Data and Finite Model Theory * Principles and Semantics of Programming Languages * Logic in Computer Science, Theorem Proving and Model Checking * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid and Stochastic Systems * Program Analysis and Transformation * Specification, Refinement, Verification and Synthesis * Type Systems and Theory, Typed Calculi Track C: Foundations of Networked Computation: Models, Algorithms and Information Management ------------------------------------------------------ * Algorithmic Aspects of Networks and Networking * Formal Methods for Network Information Management * Foundations of Privacy, Trust and Reputation in Networks * Mobile and Wireless Networks and Communication * Network Economics and Incentive-Based Computing Related to Networks * Networks of Low Capability Devices * Network Mining and Analysis * Overlay Networks and P2P Systems * Specification, Semantics, Synchronization of Networked Systems * Theory of Security in Networks Submission Guidelines -------------------- Authors are invited to submit an extended abstract of no more than 12 pages, including references, in LNCS style presenting original research on the theory of Computer Science. All submissions will be electronic via the EasyChair page for the conference, with three tracks (A, B and C): https://easychair.org/conferences/?conf=icalp2015 Submissions should be made to the appropriate track of the conference. No prior publication or simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Submissions must adhere to the specified format and length. Submissions that are too long or formatted incorrectly may be rejected immediately. All the technical details that are necessary for a proper scientific evaluation of a submission must be included in a clearly-labelled appendix, to be consulted at the discretion of program committee members. This includes, in particular, the proofs of all the key theorems in a paper. Should I submit my paper to Track A or Track C? ------------------------------------------------ While the scope of Tracks A and B are generally well understood given their long history, the situation for Track C may be less obvious. In particular, some clarifications may be helpful regarding areas of potential overlap, especially between Tracks A and C. The aim for Track C is to be the leading venue for theory papers truly motivated by networking applications, and/or proposing theoretical results relevant to real networking, certified analytically, but not necessarily tested practically. The motivation for the track was the lack of good venues for theory papers motivated by applications in networking. On the one hand, the good networking conferences typically ask for extended experiments and/or simulations, while the TCS community is hardly able to do such experiments or simulations. On the other hand, the good conferences on algorithms tend to judge a paper based only on its technical difficulty and on its significance from an algorithmic perspective, which may not be the same as when judging the paper from the perspective of impact on networks. Several areas of algorithmic study of interest to track C have a broad overlap with track A. Graph algorithmics can belong in either, though if the work is not linked to networking, it is more appropriate in track A. Algorithmic game theory is another area of major overlap. Aspects involving complexity, the computation of equilibria and approximations, belong more in Track A, while results with applications in auctions, networks and some aspects of mechanism design belong in Track C. Finally, it should be noted that algorithms and complexity of message-passing based distributed computing belong squarely in track C, while certain other aspects of distributed computing do not fall under its scope. Best Paper Awards ----------------- As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Committees ========== Track A: Algorithms, complexity, and games ------------------------------------------ Peyman Afshani, Aarhus University, Denmark Hee-Kap Ahn, POSTECH, South Korea Hans Bodlaender Utrecht University, The Netherlands Karl Bringmann, Max-Planck Institut für Informatik, Germany Sergio Cabello, University of Ljubljana, Slovenia Ken Clarkson, IBM Almaden Research Center, USA Eric Colin de Verdiere, École Normale Supérieure Paris, France Stefan Dziembowski, University of Warsaw, Poland David Eppstein, University of California at Irvine, USA Dimitris Fotakis, National Technical University of Athens, Greece Paul Goldberg, University of Oxford, UK MohammadTaghi Hajiaghayi, University of Maryland at College Park, USA Jesper Jansson, Kyoto University, Japan Andrei Krokhin, Durham University, UK Asaf Levin, Technion, Israel Inge Li Gortz, Technical University of Denmark, Denmark Pinyan Lu, Microsoft Research Asia, China Frederic Magniez, Universite Paris Diderot, France Kazuhisa Makino, Kyoto University, Japan Elvira Mayordomo, Universidad de Zaragoza, Spain Ulrich Meyer, Goethe University Frankfurt am Main, Germany Wolfgang Mulzer, Free University Berlin, Germany Viswanath Nagarajan, University of Michigan, USA Vicky Papadopoulou, European University Cyprus, Cyprus Michal Pilipczuk, University of Bergen, Norway Liam Roditty, Bar-Ilan University, Israel Ignaz Rutter, Karlsruhe Institute of Technology, Germany Rocco Servedio, Columbia University, USA Jens Schmidt, TU Ilmenau, Germany Bettina Speckmann (chair), TU Eindhoven, The Netherlands Csaba D. Toth, California State University Northridge, USA Takeaki Uno, National Institute of Informatics, Japan Erik Jan van Leeuwen, Max-Planck Institut für Informatik, Germany Rob van Stee, University of Leicester, UK Ivan Visconti, University of Salerno, Italy Track B: Logic, semantics, automata and theory of Programming ------------------------------------------------------------- Andreas Abel, Chalmers and Gothenburg University, Sweden Albert Atserias, Universitat Politècnica de Catalunya, Spain Christel Baier, TU Dresden, Germany Lars Birkedal, Aarhus University, Denmark, Luis Caires, Universidade Nova de Lisboa, Portugal James Cheney, University of Edinburgh, UK Wei Ngan Chin, National University of Singapore, Singapore Ugo Dal Lago, University of Bologna, Italy Thomas Ehrhard, CNRS, Université Paris Diderot, France Zoltan Esik, University of Szeged, Hungary Xinyu Feng, University of Science and Technology of China, China Wan Fokkink, VU University Amsterdam, The Netherlands Shin-ya Katsumata, Kyoto University, Japan Naoki Kobayashi (chair), The University of Tokyo, Japan Eric Koskinen, New York University, USA Antonín Kucera, Masaryk University, Czech Republic Orna Kupferman, Hebrew University, Israel Annabelle Mclver, Macquarie University, Australia Dale Miller, INRIA Saclay, France Markus Mueller-Olm, University of Münster, Germany Andrzej Murawski, Univeristy of Warwick, UK Joel Ouaknine, Univeristy of Oxford, UK Prakash Panangaden, McGill University, Canada Pawel Parys, University. of Warsaw, Poland Reinhard Pichler, TU Vienna, Austria Simona Ronchi Della Rocca, University of Torino, Italy Jeremy Siek, Indiana University, USA Track C: Foundations of networked computation: Models, algorithms and information management ------------------------------------------------------ Ioannis Caragiannis, Univ. Patras, Greece Katarina Cechlarova, Pavol Jozef Safarik Univ., Slovakia Shiri Chechik, Tel Aviv Univ., Israel Yuval Emek, Technion, Israel Sandor Fekete, TU Braunschweig, Germany Pierre Fraigniaud, CNRS and Paris Diderot, France Leszek Gasieniec, Univ. Liverpool, UK Aristides Gionis, Aalto Univ., Finland Magnus M. Halldorsson (chair), Reykjavik Univ, Iceland Monika Henzinger, Univ. Wien, Austria Bhaskar Krishnamachari, USC, USAL Fabian Kuhn, Freiburg, Germany Michael Mitzenmacher, Harvard Univ, USA Massimo Merro, Univ. Verona, Italy Gopal Pandurangan, Univ. Houston, USA Pino Persiano, Salerno, Italy R. Ravi, CMU, USA Ymir Vigfusson, Emory Univ., USA Roger Wattenhofer, ETH Zurich, Switzerland Masafumi Yamashita, Kyushu Univ., Japan

1 0

Kobe Colloquium on Logic, Statistics and Informatics, January 27 (Monroe Eskew)
by Joerg Brendle 25 Jan '15

25 Jan '15

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2014年1月27日（火）13:20-14:50 講演者：Monroe Eskew （筑波大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： A global version of Chang’s conjecture アブストラクト： In the 80s, Foreman showed the consistency of (aleph_{n+1},aleph_n) —>> (aleph_{m+1},aleph_m) holding simultaneously for all natural numbers n > m, starting from a 2-huge cardinal. He asked whether a global version of Chang’s conjecture is consistent. We answer this, showing that it is consistent from the same hypothesis that for all pairs of regular cardinals mu < kappa, (kappa^+,kappa) —>> (mu^+,mu). The method uses a relatively simple forcing iteration, and it answers some technical questions raised by Shioya. We also discuss some related issues about singular cardinals. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

JSPS-NUS Joint Workshop in Logic
by Tanaka Kazuyuki 25 Jan '15

25 Jan '15

JSPS-NUS二国間共同研究のロジック・ワークショップのご案内シンガポールとの二国間交流事業（代表：田中、Chong）の一環として下記の研究会を開催致します。 Workshop in Mathematical Logic and Foundations of Mathematics 日程：2015年3月6日(金) から3月8日(日) まで場所：金沢しいのき迎賓館および金沢東急ホテルこのワークショップは主に共同研究のメンバーによって行われるものですが、ご関心のある方は一般からもご参加いただけます。但し、会場準備の都合上事前登録者に限りますので参加希望の方は SendaiLogic[at]math.tohoku.ac.jp （締切２月８日）までご連絡ください。下記のページで＜英語＞でもご案内しております。 http://www.math.tohoku.ac.jp/~tanaka/kanazawa2015.html よろしくお願いします。　東北大学　田中一之コンタクト：　SendaiLogic[at]math.tohoku.ac.jp

1 0

『第２回山陰基礎論・解析学研究集会』の御案内
by Horihata Yoshihiro 23 Jan '15

23 Jan '15

皆様米子高専の堀畑です．明日と明後日に米子で件名の研究会を開きます．ホームページ https://sites.google.com/site/yonagonctmath/slas2015 参加自由です．よろしくお願いいたします．参加者リスト阿部吉弘（神奈川大学）池上大祐（神戸大学）薄葉季路（神戸大学）嘉田勝（大阪府立大学）木原貴行（ＪＡＩＳＴ）熊本真一郎（金沢大学）倉橋太志（木更津高専）古清水大直（米子高専）小林玉青（米子高専）小浪吉史（島根大学）静間荘司（大阪府立大学）柴田孝祐（米子高専，建築学科５年）高木啓行（信州大学）竹内耕太（筑波大学）根元多佳子（ＪＡＩＳＴ）濱田裕康（佐世保高専）樋口幸治郎（千葉大学）吉居啓輔（沖縄高専）吉田聡（鳥取環境大学）米子高専・数学同好会学生３人世話人：堀畑佳宏 -- 米子工業高等専門学校教養教育科・数学〒683-8502 鳥取県米子市彦名町4448 Tel: 0859-24-5075 E-mail: horihata(a)yonago-k.ac.jp

1 0

Re: [logic-ml] メーリングリストへの配信願い
by Atsushi Igarashi 21 Jan '15

21 Jan '15

logic-ml のみなさま，五十嵐＠logic-ml管理人です．成蹊大学・理工学部・情報科学科の山本様からの依頼での代理投稿です． ---------------------------------------------------------- logic-ml の皆様，成蹊大学・理工学部・情報科学科の山本と申すものです．以下のように，当学科で助教の公募を行っています．募集期間が短く申し訳ありませんが，ご関心のある方々の応募をお待ちしております． 1. 募集人員：助教１名 (任期付き) 2. 所属：理工学部情報科学科 3. 専門分野：計算機科学・情報科学における理論分野全般 4. 着任時期：２０１５年５月１日（金） 5. 応募締切：２０１５年２月１４日（土）（必着）詳細は，下記 URL をご参照下さい． http://www.seikei.ac.jp/gakuen/recruit/teacher/university.html 以上．

1 0

PPL2015参加登録開始がご案内：第17回プログラミングおよびプログラミング言語ワークショップ
by Kazutaka Matsuda 16 Jan '15

16 Jan '15

logic-ml関係者の皆様，東京大学の松田です．複数受け取られた場合はご容赦ください． 3月4日（水）から3月6日（金）に道後温泉で開催される第17回プログラミングおよびプログラミング言語ワークショップ (PPL2015) の参加登録を開始いたしましたで，そのご案内をお届けいたします．今回は， * 橋本和幸 (NVIDIA. 元日本シンボリックス株式会社) 「1980年代のLispマシンSymbolicsとその開発環境Genera 付属：NVIDIA GPUによる超並列コンピューティング」 * Chung-Kil Hur (Seoul National University) 「Formal C semantics and LLVM compiler validation」の二件の招待講演を予定しております．多くの方々のご参加をお待ちしております．参加登録の案内ページは http://www-kb.is.s.u-tokyo.ac.jp/ppl2015/registration/ です．参加登録の締切は2月17日（火）です．どうぞお早めのご登録をお願い致します．今年は昨年と異なり，*三日目は全日開催*となります．ご注意ください．また，カテゴリ2（国外既発表論文），4（サーベイ・チュートリアル）の申し込みは 2015年1月23日(金) 17:00 (JST) まで，カテゴリ3（ポスター・デモ発表）の申し込みは 2015年2月6日(金) 17:00 (JST) まで受け付けております．こちらも http://www-kb.is.s.u-tokyo.ac.jp/ppl2015/ をご参照の上，投稿をご検討いただけますと幸いです． -------------------------------------------------------------------------- 第17回プログラミングおよびプログラミング言語ワークショップ（PPL2015） http://www-kb.is.s.u-tokyo.ac.jp/ppl2015/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2015年3月4日(水)～3月6日(金) 会場: 愛媛県松山市道後温泉「道後プリンスホテル」 http://www.dogoprince.co.jp/ PPL2015は、プログラミングおよびプログラミング言語に関する研究者が一堂に会し、最新の研究成果の発表、および新たな研究課題についての討論やアイディア交換等を行うことを目的とした、合宿形式のワークショップです． ====================================================================== 参加登録ならびに宿泊予約を2月17日(火)まで日本旅行のWebサービスにて受け付けております． http://www-kb.is.s.u-tokyo.ac.jp/ppl2015/registration/ をご参照いただき，ご登録ください．問い合わせ先：ppl2015-oc [at] kb.is.s.u-tokyo.ac.jp （[at]を@に置き換えてください） ====================================================================== プログラム委員会青戸等人東北大学浅田和之東京大学岩崎英哉電気通信大学鵜川始陽高知工科大学馬谷誠二京都大学 [プログラム共同委員長] 大岩寛産業技術総合研究所亀山幸義筑波大学河内谷清久仁日本IBM 久野靖筑波大学木村大輔国立情報学研究所宋剛秀神戸大学塚田武志 University of Oxford 中田景子 FireEye DresDen 浜名誠群馬大学 [プログラム共同委員長] 平井洋一 FireEye Dresden 平石拓京都大学藤田憲悦群馬大学星野直彦京都大学増原英彦東京工業大学渡部卓雄東京工業大学組織委員会松田一孝東京大学 [組織委員長] 浜名誠群馬大学 [プログラム共同委員長] 馬谷誠二京都大学 [プログラム共同委員長] 末永幸平京都大学上野雄大東北大学海野広志筑波大学木村大輔国立情報学研究所 [ポスターセッション幹事] --------------------------------------------------------------------------

1 0

Gilles Dowek教授講演会　１月１６日金曜日　三田ロジックセミナー
by Mitsuhiro Okada 14 Jan '15

14 Jan '15

次のようなセミナートークを予定しておりますのでご案内させていただきます。参加自由です。(日時が次のように変更しています。Please note that　the date/time changed as follows.) 　　　　　　　　慶應義塾大学文学部哲学専攻岡田光弘 ------------------------------ Mita Logic Seminar Jan.16th (Fri) 13:00-14:30 Place: Basement B1 , Meeting Room #3, North Building, Mita campus, Keio University　(Campus Map http://www.keio.ac.jp/en/maps/mita.html) １月１６日金曜日　１３時ー１４時半, 慶應義塾大学三田キャンパス北館地下一階第３会議室　(キャンパスマップhttp://www.keio.ac.jp/ja/access/mita.html） Speaker; Gilles Dowek, INRIA, France Title: Real numbers, chaos, and the principle of a bounded density of information Abstract: Two definitions of the notion of a chaotic transformation are compared: sensitivity to initial conditions and sensitivity to perturbations. Only the later is compatible with the idea that information has a finite density. 連絡先：思考と行動判断の研究拠点事務局（logic(a)abelard.flet.keio.ac.jp) ------------

1 0

PPL2015 ポスター発表申込み締切日訂正
by Makoto Hamana 13 Jan '15

13 Jan '15

皆様、すみませんです、先ほどご案内したPPL2015の案内メールのポスター・デモ発表申込み締切り日に間違いありましたので訂正させていただきます。 [訂正] カテゴリ3（ポスター・デモ発表）締切は 2015年2月6日(金) 17:00 (JST) です。カテゴリ4(サーベイ・チュートリアル)の方は1月23日〆で正しいです。 PPL 2015 Webページ http://www-kb.is.s.u-tokyo.ac.jp/ppl2015/ にあるものが正式な情報です。お騒がせして申し訳ありません。どうぞよろしくお願いいたします。 -- 浜名　誠群馬大学理工学府電子情報部門 http://www.cs.gunma-u.ac.jp/~hamana/

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml January 2015