Logic-ml

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

1792 discussions

SAML 2018 / Takeuti Memorial Symposium 講演募集
by Teruyuki YORIOKA 09 Jul '18

09 Jul '18

皆様，静岡大学の依岡です。竹内外史先生を追悼するシンポジウムについてのリマインダーです。講演をご希望でなくても、参加ご希望の方は申し込みをお願いします。お申し込みをいただいた方々には必ず依岡から返信をしております。申し込んだのに返信を受け取っていない方がいらっしゃいましたら、もう一度送信をお願いします（静岡大学のメールサーバーが今年の4月から不調なのです）。みなさまのご参加をお待ちしております。 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, M. Ozawa, 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

Talk by Florian Steinberg (July 5, Fukuoka)
by Akitoshi Kawamura 01 Jul '18

01 Jul '18

皆様九州大学の河村です。フロリアン・シュタインベルク氏（仏INRIA）の講演を以下のように開催いたしますので、お近くの方はどうぞお越しください。 http://www.fc.inf.kyushu-u.ac.jp/seminars/H300705.html 日時　July 5, 2018, Thursday, 16:40– 場所　Room 302, Ito Campus West Building II, Kyushu University 　(九州大学伊都キャンパスウエスト二号館302講義室) Type-two poly-time and length revisions Florian Steinberg (Institut National de Recherche en Informatique et en Automatique) The talk presents an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. The characterization relies on the usual oracle machines to model programs with subroutine calls, but the use of higher-order objects as running times is avoided. This is achieved by refining the notion of oracle-polynomial-time introduced by Cook by imposing a further restriction on the oracle interactions. Both the restriction as well as its purpose are very simple: it is well-known that Cook's model allows polynomial depth iteration of functional inputs with no restrictions on size, and thus does not guarantee that operators from the class preserve polynomial-time computability. We restrict the number of lookahead revisions, that is the number of times a query can be asked that is bigger than any of the previous queries and prove that this leads to a class of feasible functionals. Furthermore, all feasible problems can be solved within this class if one is allowed to separate a task into efficiently solvable subtasks. More formally put: the closure of the class under lambda-abstraction and application includes all feasible operations. This has consequences for a very similar class of strongly polynomial-time computable operators previously considered by Kawamura and Steinberg: It turns out to have the same closure property. This can be attributed to properties of the limited recursion operator, which is not strongly polynomial-time computable but decomposes into two such operations and lies in the broader class. -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 0

名古屋ロジックセミナー (6/29) のお知らせ
by Takayuki Kihara 25 Jun '18

25 Jun '18

皆様以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．講演終了後に夕食会を予定しています．夕食会にご参加いただける方は，早めに木原貴行 kihara(a)i.nagoya-u.ac.jp までご一報お願い致します．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：6月29日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：Paul-Elliot Anglès D'Auriac (パリ・エスト・クレテイユ大学)　題目： On Infinite Time Turing Machine and and its related ordinals アブストラクト： In 1998, Hamkins and Lewis introduced Infinite Time Turing Machines (ITTMs), a version of Turing Machines where time is allowed to run through the ordinals instead of the integers. This model of computation revealed itself to have interesting connections with set theory and in particular Godel's constructible hierarchy. In this talk, we will be interested in the properties of the ordinals that naturally arises in the study of ITTMs, such as those that correspond to halting time, or that have a code that can be written on the tape of an ITTM. -------- 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

Talk by Kohei Kishida (28 June, 11.00-, at Kyoto University)
by Kazushige TERUI 25 Jun '18

25 Jun '18

皆様今週木曜日に、京都大学にてKohei Kishidaさんのご講演があります。詳細は以下のとおりです。どうぞお気軽にご参加ください。京都大学数理解析研究所照井一成 ==================== Time: 11:00-12:00, 28 June, 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: Kohei Kishida (Dalhousie University) Title: A Topological Approach to Quantum Contextuality Abstract: Non-locality and contextuality are paradoxical phenomena in quantum physics that are of foundational and potentially great practical significance: While non-locality is known to be fundamental to quantum communication, the more general phenomenon of contextuality may provide a key resource for quantum computation, as suggested by recent studies. This has motivated several approaches to the high-level expression of non-locality and contextuality that can be independent of the concrete formalism of quantum mechanics. Starting with a review of the paradoxical probabilistic behavior of non-locality, this talk lays out some formalisms that express non-locality and contextuality. In particular, the topological approach makes it clear that contextuality is isomorphic to various phenomena in other disciplines. We show two results, one on the relationship between probabilistic and qualitative versions of contextuality, and the other on how to use a topological idea to demonstrate (qualitative) contextuality. This talk is based on several joint works with Samson Abramsky, Rui Soares Barbosa, Ray Lal and Shane Mansfield.

1 0

第二十九回ALGIの開催について
by 西澤弘毅 22 Jun '18

22 Jun '18

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。 ALGI（代数，論理，幾何と情報科学研究集会）について第二十九回 ALGIの開催に関する告知をさせていただきます。 < 重複してお受け取りの節はご容赦願います。> **************************************************************** * 第二十九回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2018年8月27日（月）午後～8月28日（火） * * 崇城大学池田キャンパス F号館 203講義室 * * * * 開催のお知らせと講演の募集 * **************************************************************** ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。このたび、第二十九回ALGIを開催することになりました。会場の手配などは、幹事の一人である崇城大学の津曲が担当しています。開催場所は下記のとおりです。崇城大学池田キャンパス http://www.sojo-u.ac.jp/access/ 講演を希望される方は、・題目・講演者名・所属・希望時間（基本は質疑応答含め30分です）・講演に必要な道具・梗概（後日でも構いません）などの情報を nishizawa(a)kanagawa-u.ac.jp までお寄せください。「講演したいと思っている」程度の不完全情報でも結構です。時間の空きがある限り、開催直前まで講演申込を受け付けるつもりですが、申込順に発表時間を割り当てていきますので、講演をお考えの方は、なるべくお早めにお知らせいただけますようにお願い致します。参加自体は申し込み不要で自由にご参加いただけますが、初日の夕方に予定している懇親会については、事前に詳細を告知し参加申し込みを受け付ける予定です。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。なお、昨年度、現在の algi メーリングリスト algi(a)sakura.imi.kyushu-u.ac.jp から googleグループを利用したメーリングリストへの移行を計画しているとお伝えしましたが、移行が遅れております。ご迷惑をおかけしますが、もうしばらくお待ちください。西澤弘毅（神奈川大学）津曲紀宏（崇城大学） -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

1 0

“WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” Mathieu Marion教授講演会(6月26日
by Mitsu Okada 20 Jun '18

20 Jun '18

数学と論理の哲学セミナー Mathieu Marion教授講演会(6月26日) “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” の開催を予定しております。参加自由、事前登録なしです。お気軽にお立ち寄りください。慶應義塾大学文学部哲学専攻岡田光弘 ****************************** ***************************************************** 数学と論理の哲学セミナー Mathieu Marion教授講演会(6月26日) “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” 6月26日 (火) 18:10-19:30 June 26, Tues. 慶應義塾大学三田キャンパス大学院校舎1階313番教室 Mita Campus, Keio University, Classroom 313, 1F of Graduate School Building （講演会のAbstractは下のweb-siteにあります。。）（Abstractを含む最新情報: https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/ <https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/> ） *********************************************************************************** 場所 / Venue: 慶應義塾大学三田キャンパス大学院校舎1階313番教室（大学院校舎は下記キャンパスマップの8です） Mita Campus, Keio University, Classroom 313, 1F of Graduate School Building (Number 8 of the Campus Map below) 構内図 Campus Map: https://www.keio.ac.jp/en/maps/mita.html <https://www.keio.ac.jp/en/maps/mita.html> 日時 / Date & Time: 6月26日 (火) 18:10-19:30 June 26, Tues. 講演者 / Speaker: Mathieu Marion教授（ケベック大学モントリオール校哲学科教授） Prof. Mathieu Marion (Département　de Philosophie**, Université du Québec à Montréal) 題目 / Title: “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” (Joint work with Mitsuhiro Okada, Keio University) （Abstract: https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/ <https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/> ）お問い合わせ先: 慶應義塾大学文学部岡田光弘研究室東京都港区三田２−１５−４５ Email: logic(a)abelard.flet.keio.ac.jp <mailto:logic@abelard.flet.keio.ac.jp> 主催: 慶應義塾大学論理と感性のグローバル研究センター ----------------------------------------------------------

1 0

Talk by Prof. Georgios Fainekos (June 21st, 13:00-)
by Kohei SUENAGA 19 Jun '18

19 Jun '18

皆様，ロボットのパスプランニングの研究に関する講演会を 6月21日の13:00より，京都大学吉田キャンパス総合研究7号館1F講義室3で開催します．話者のGeorgios Fainekosさんは，時相論理式で記述されたシステムの仕様をチェックするツールS-TaLiRoで有名な方です．どうぞご参加ください． Prof. Georgios Fainekos is giving a talk about path planning in robotics on June 21st from 13:00-- at the lecture room 3 in Research Building 7 (Sogo-Kenkyu 7 gou kan) in Yoshida campus of Kyoto University. Georgios is famous for the work on a tool S-TaLiRo, a checker of a system specification written in an extension of temporal logic called metric temporal logic. Looking forward to your participation! Kohei -- Title: Temporal Logic Planning for Mobile Robots: What happens when missions cannot be satisfied? Abstract: Temporal logic planning methods have provided a viable path towards solving the single- and multi-robot path planning, control and coordination problems from high level formal requirements. In the existing frameworks, the prevalent assumptions are (1) that a plan always exists which satisfies the mission requirements, and (2) that there is a single stakeholder with full or partial knowledge of the environment that the robots operate in. In addition, it is typically assumed that the requirements themselves are fixed and do not change over time. However, any of these assumptions may not be valid in both off-line and on-line temporal logic planning problems. That is, multiple stakeholders and inaccurate sources of information may produce unsatisfiable missions or self-contradictory models of the world or the system. Classical temporal logic planning methods cannot handle non-consistent model environments or missions even though such inconsistencies may not affect the planning problem. In this talk, we present how the user feedback problem for unsatisfiable missions can be reduced to searching for an optimal weighted path on a graph. Albeit the general search problem is NP-complete, the graph formulation of the problem opens-up the possibility for the development of efficient approximation algorithms. We present a number of heuristics for quickly computing such user feedback and we present experimental results on the performance and scalability of our solutions. Finally, we show how inconsistencies and conflicts in the mission requirements and the model of the world can be circumvented by utilizing multi-valued temporal logics and system models. Bio: Georgios Fainekos is an Associate Professor at the School of Computing, Informatics and Decision Systems Engineering (SCIDSE) at Arizona State University (ASU). He is director of the Cyber-Physical Systems (CPS) Lab and he is currently affiliated with the NSF I/UCR Center for Embedded Systems (CES) at ASU. He received his Ph.D. in Computer and Information Science from the University of Pennsylvania in 2008 where he was affiliated with the GRASP laboratory. He holds a Diploma degree (B.Sc. & M.Sc.) in Mechanical Engineering from the National Technical University of Athens (NTUA). Before joining ASU, he held a Postdoctoral Researcher position at NEC Laboratories America in the System Analysis & Verification Group. His expertise is on logic, formal verification, testing, control theory, artificial intelligence, and optimization. His research has applications to automotive systems, medical devices, autonomous (ground and aerial) vehicles, and human-robot interaction (HRI). In 2013, Dr. Fainekos received the NSF CAREER award and the ASU SCIDSE Best Researcher Junior Faculty Award. He is also recipient of the 2008 Frank Anger Memorial ACM SIGBED/SIGSOFT Student Award. His software toolbox, S-TaLiRo, for testing and monitoring of CPS has been nominated twice as a technological breakthrough by the industry. In 2016, Dr. Fainekos was the program co-Chair for the ACM International Conference on Hybrid Systems: Computation and Control (HSCC). -- 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

The 21st Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2018) 福岡8月26～27日
by Akitoshi Kawamura 14 Jun '18

14 Jun '18

皆様九大の河村と申します。メーリングリストをお借りして、本年8月26～27日に福岡で開催される標記研究集会についてお知らせ致します。詳しくはウェブページをご覧ください。 http://www.i.kyushu-u.ac.jp/waac2018/ ウェブページにありますように、投稿は英文8ページ以内（より短くても可）で、投稿締切　7月6日採否通知　7月27日完成稿締切　8月10日となっております。ぜひ発表・参加を御検討ください。 -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 1

Preliminary announcement of CTFM2018
by Kenshi Miyabe 01 Jun '18

01 Jun '18

Dear all, Let me announce CTFM 2018. Workshop on Computability Theory and Foundations of Mathematics 2018 Date: 13--15 September, 2018 The venue: Surugadai Campus, Meiji University, Tokyo, Invited Speakers George Barmpalias (Chinese Academy of Sciences) Matthew de Brecht (Kyoto University) Bjorn Kjos-Hanssen (University of Hawaii at Manoa) Tomoyuki Miyaji (Meiji University) Igor Potapov (University of Liverpool) Liang Yu (Nanjing University) Organising Committee Akitoshi Kawamura (Kyushu University) Kenshi Miyabe (Meiji University) Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. We will call for the contributed talks later. For other information, see the following website: http://www.isc.meiji.ac.jp/~random/ctfm2018/ best, Kenshi Miyabe -- Kenshi Miyabe email (research) : research(a)kenshi.miyabe.name email (other) : miyabe(a)meiji.ac.jp Associate Professor Department of Mathematics School of Science and Technology Meiji University Tel: +81-44-934-7460

1 0

Call for Papers: JURISIN-2018
by 藤田恵 01 Jun '18

01 Jun '18

国立情報学研究所の藤田恵と申します。新田克己先生(東工大名誉教授)の代理で投稿いたします。 Call for Paper 12th International Workshop on Juris-informatics (JURISIN 2018) associated with JSAI International Symposia on AI 2018 (isAI 2018) Raiosha, Hiyoshi Campus in Keio University 12 and 13 November 2018 - Yokohama, Japan Juris-informatics is a new research area which studies legal issues from the perspective of informatics. The purpose of this workshop is to discuss both the fundamental and practical issues among people from the various backgrounds such as law, social science, information and intelligent technology, logic and philosophy, including the conventional "AI and law" area. We solicit unpublished papers on theories, technologies and applications on juris-informatics. Relevant topics include, but are not limited to, the following: •Model of legal reasoning •Argumentation / Negotiation / Argumentation agent •Legal term ontology •Formal legal knowledge-base / Intelligent management of legal knowledge-base •Translation of legal documents •Information retrieval of legal texts •Computer-aided law education •Use of Informatics and AI in law •Legal issues on applications of robotics and AI to society •Social implications of use of informatics and AI in law •Natural language processing for legal knowledge •Verification and validation of legal knowledge systems •Normative Systems/Deontic Logic •Any theories and technologies which is not directly related with juris-informatics but has a potential to contribute to this domain We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere except as a submission to JURIX 2018 (The 31th International Conference on Legal Knowledge and Information Systems). The double submission policy with JURIX 2018 is as follows: 1.Papers being submitted both to JURISIN2018 and JURIX2018 must note this on the title page. 2.A paper to be presented at JURISIN2018 must be withdrawn from JURIX2018 and vice versa according to the choice by the authors. 3.If the authors do not follow this double submission policy, the paper by the authors will not be included in the proceedings of JURISIN 2018. Selected papers will be published as a post-proceedings via Springer Verlag LNAI series after the second round of review after the workshop. Invited Speakers Douglas Walton, University of Windsor, Canada Harumichi Yuasa, Institute of Information Security, Japan Important Dates Submission Deadline: August 30, 2018(tentative)( AOE ) Notification: September 30, 2018(tentative) Camera-ready due: October 10, 2018(tentative) ( AOE ) Steering Committee members Takehiko Kasahara, Toin Yokohama University Makoto Nakamura, Niigata Institute of Technology, Japan Katsumi Nitta, Tokyo Institute of Technology, Japan Seiichiro Sakurai, Meiji Gakuin University, Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST), Japan Katsuhiko Toyama, Nagoya University, Japan Advisory Committee Members Kevin Ashley, University of Pittsburgh, USA Trevor Bench-Capon, The University of Liverpool, UK Tomas Gordon, Fraunfoher FOKUS, Germany Robert Kowalski, Imperial College London, UK Henry Prakken, University of Utrecht & Groningen, The Netherlands John Zeleznikow, Victoria University, Australia Program Committee Members Thomas Agotnes, University of Bergen, Norway Natasha Alechina, University of Nottingham, UK Ryuta Arisaka, National Institute of Informatics, Japan Kristijonas Cyras, Imperial College London, UK Mehdi Dastani, Utrecht University, The Netherlands Marina De Vos, University of Bath, UK Juergen Dix, Clausthal University of Technology, Germany Phan Minh Dung, AIT, Thailand Randy Goebel, University of Alberta, Canada Guido Governatori, CSIRO, Australia Tatsuhiko Inatani, Kyoto University, Japan Tokuyasu Kakuta, Chuo University, Japan Yoshinobu Kano, Shizuoka University, Japan Tetsuro Kawamoto, AIST, Japan Mi-Young Kim, University of Alberta, Canada Nguyen Le Minh, JAIST, Japan Beishui Liao, Zhejiang University, Chaina Brian Logan, The University of Nottingham, UK Hatsuru Morita, Tohoku University, Japan Yoichi Motomura, AIST, Japan Makoto Nakamura, Niigata Institute of Technology, Japan Yoshiaki Nishigai, Nihon University, Japan Konatsu Nishigai, Tokyo Metropolitan University, Japan Katsumi Nitta, Titech, Japan Paulo Novais, University of Minho, Portugal Julian Padget, University of Bath, UK Monica Palmirani, University of Bologna, Italy Seiichiro Sakurai, Meiji Gakuin University, Japan Katsuhiko Sano, Hokkaido University, Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Akira Shimazu, JAIST, Japan Fumio Shimpo, Keio University, Japan Kazuko Takahashi, Kansei Gakuin University, Japan Satoshi Tojo, JAIST, Japan Katsuhiko Toyama, Nagoya University, Japan Rob van den Hoven van Genderen, VU University Amsterdam, The Netherlands Leon van der Torre, University of Luxembourg, Luxembourg Bart Verheij, University of Groningen, The Netherlands Masaharu Yoshioka, Hokkaido University, Japan Harumichi Yuasa, Institute of Information Security, Japan Yueh-Hsuan Weng, Tohoku University, Japan COLIEE 2018 This year, JURISIN will co-located with the Fifth Competition on Legal Information Extraction/Entailment (COLIEE-2018). The motivation for the competition is to help create a research community of practice for the capture and use of legal information. Please visit the homepage of COLIEE2018 https://sites.ualberta.ca/~miyoung2/COLIEE2018/ <https://sites.ualberta.ca/~miyoung2/COLIEE2018/> to see the detail of the competition. For further information, please contact Katsumi Nitta, Workshop Chair, Tokyo Institute of Technology nitta 'at' dis.titech.ac.jp <http://dis.titech.ac.jp/>

1 0

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml