Logic-ml

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

7 participants
1772 discussions

名古屋ロジックセミナー(10/6)
by Takayuki Kihara 04 Oct '17

04 Oct '17

皆様名古屋大学の木原貴行です．以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：10月6日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：宮元忠敏 (南山大学)　題目： On iterated forcing with side conditions アブストラクト： Aspero-Mota introduced an iterated forcing that used symmetric systems of elementary substructures with the markers. We reproduce it. Our construction features the following: 1. We stick to a single transitive set universe to form various clubs. 2. We use a pre-forced stationary set to manage amalgamations. 3. We use what we call signed coordinates rather than the markers. We consider these features by iteratively forcing the following examples. 1. Posets that force what we call fast functions. 2. Posets that kill weak club guessings. -------- Takayuki Kihara Graduate School of Informatics, Nagoya University, Japan URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/ Email: kihara(a)i.nagoya-u.ac.jp

1 0

PEPM 2018: Final CfP
by Kohei SUENAGA 29 Sep '17

29 Sep '17

皆様，（複数お受け取りの場合はご容赦ください．）京都大学の末永と申します． PEPM 2018 の final call for paper をお送りします．投稿をお待ちしております．末永幸平 PEPM 2018 FINAL CALL FOR PAPERS =============================== The submission site is now open: https://pepm18.hotcrp.com Only one week until the paper submission deadline (6th October AoE)! Highlights ---------- PEPM 2018 welcomes submissions on * semantics based and machine-learning based program synthesis and program optimisation, and * modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications, in addition to traditional PEPM topics. Do submit a short paper if you want to get feedback for your work in progress! If requested, short papers can be left out of the proceedings so that the results can be published elsewhere. New in this call ---------------- Invited talks by Alex Aiken, Conal Elliott, and Jan Midtgaard. Short papers should include the words “short paper” somewhere in their title, and will be evaluated primarily on the basis of their ideas rather than finished execution. -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2018 =============================================================================== * Website : http://popl18.sigplan.org/track/PEPM-2018 * Time : 8th – 9th January 2018 * Place : Los Angeles, CA, US (co-located with POPL 2018) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM), which has a history going back to 1991 and has co-located with POPL every year since 2006, originates in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2018 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Fritz Henglein (http://www.diku.dk/~henglein/) and Josh Ko (https://josh-hs-ko.github.io). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: Regular Research Papers and Short Papers. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages (excluding bibliography). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar; they will be evaluated primarily on the basis of their ideas rather than finished execution. Short papers must not exceed 6 pages (excluding bibliography), and should include the words “short paper” somewhere in their title. Both kinds of submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm18.hotcrp.com/ PEPM 2018 will employ lightweight double-blind reviewing according to the rules of POPL 2018. Quoting from POPL 2018’s call for papers: “submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work ...” but rather “We build on the work of ...”). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.” See POPL 2018’s Submission and Reviewing FAQ page for more information: http://popl18.sigplan.org/track/POPL-2018-papers#Submission-and-Reviewing-F… Submissions are welcome from PC members (except the two co-chairs) provided that there are non-PC co-authors. Accepted papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Authors of short papers, however, can ask for their papers to be left out of the formal proceedings. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. Important dates --------------- * Paper submission deadline : Friday 6th October 2017 (AoE) (firm) * Author notification : Saturday 4th November 2017 * Workshop : Monday 8th – Tuesday 9th January 2018 The proceedings will be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Best paper award ---------------- PEPM 2018 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Invited speakers ---------------- Alex Aiken (Stanford University) Conal Elliott (Target) Jan Midtgaard (University of Southern Denmark) Programme committee ------------------- Nada Amin (EPFL) Shigeru Chiba (University of Tokyo) Ezgi Çiçek (Max Planck Institute for Software Systems) Olivier Danvy (Yale-NUS College) Ronald Garcia (University of British Columbia) Simon Gay (University of Glasgow) Andy Gill (X, the Moonshot Factory) Fritz Henglein (co-chair) (University of Copenhagen) Anastasia Izmaylova (IMC Financial Markets) Johan Jeuring (Utrecht University) Gabriele Keller (University of New South Wales) Oleg Kiselyov (Tohoku University) Hsiang-Shang Ko (co-chair) (National Institute of Informatics) Ralf Lämmel (University of Koblenz-Landau) Julia Lawall (Inria) Simon Peyton Jones (Microsoft Research Cambridge) Frank Pfenning (Carnegie Mellon University) Sriram Rajamani (Microsoft Research India) Norman Ramsey (Tufts University) Thomas Reps (University of Wisconsin-Madison) Sergei Romanenko (Keldysh Institute of Applied Mathematics) Tiark Rompf (Purdue University) Wolfram Schulte (Facebook) Peter Sestoft (IT University of Copenhagen) Harald Søndergaard (University of Melbourne) Kohei Suenaga (Kyoto University) Martin Vechev (ETH Zurich) Marcos Viera (University of the Republic) Nobuko Yoshida (Imperial College London) -- 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 0

Kyoto Workshop on Logic and Metaphysicsのご案内
by Hitoshi Omori 27 Sep '17

27 Sep '17

Kyoto Workshop on Logic and Metaphysicsのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。 ------------------------------------- Kyoto Workshop on Logic and Metaphysics 【日時】2017年10月2日【場所】京都大学吉田泉殿【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kwlm 【プログラム】 09:30-10:30 Filippo Casati "Inside *Aussersein*" 10:30-11:30 Ryo Ito "Rules and Trivialities in Proofs" 11:30-12:45 Lunch 12:45-13:45 Colin Caret "The Mutability of Entailment" 13:45-14:45 Ole Hjortland "Theories of truth and the maxim of minimal mutilation" 14:45-15:00 Break 15:00-16:00 Zach Weber "On paradox explanation, the inclosure schema, and being exceptionally ordinary" ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

Kyoto Nonclassical Logic Workshop IIIのご案内
by Hitoshi Omori 22 Sep '17

22 Sep '17

Kyoto Nonclassical Logic Workshop IIIのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。 ------------------------------------- Kyoto Nonclassical Logic Workshop III 【日時】2017年9月25日【場所】京都大学吉田泉殿【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kncl3 【プログラム】 September 25: 11:00--12:00 Zach Weber "On Substructural Logic and Metatheory" 12:00--13:00 Takuro Onishi "Unifying two plans in relevant logic" 13:00--14:30 Lunch 14:30--15:30 Igor Sedlár "Abstract completeness of some lattice-valued modal logics" 15:30--16:30 Kazushige Terui "The noble art () of diagrammatic reasoning in algebraic logic" 16:30--16:45 Coffee break 16:45--17:45 Adam Přenosil "Reconstructing involutive residuated lattices from their negative cones" 17:45--18:45 Petr Cintula "Lindenbaum-style proof of completeness for infinitary logics" 19:00-- Dinner ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

続報: MLG 数理論理学研究集会
by Suzuki, Nobu-Yuki 21 Sep '17

21 Sep '17

皆様静岡大学の鈴木信行です。第52回MLG 数理論理学研究集会の続報です。ご参加・ご講演のお申込みを開始いたします。参加の申し込みは以下のフォームにご記入の上、 11月1日(水)までにお送りください。送り先: mlg52.shizuoka(a)gmail.com -------------------- １．お名前２．所属・身分３．メールアドレス４．講演する・しない５．講演する場合タイトル（未定でも可）６．懇親会(12月1日)に参加する・しない７．備考 (講演の希望日などがありましたらこちらにご記入ください) -------------------- 申し込み無しでもご参加いただけますが、懇親会（大学内で行う予定です）の参加を希望される場合は必ずお申し込みください。詳しくは、下記のサイトをご覧下さい。 https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/

1 0

第37回量子情報技術研究会(QIT37)のご案内
by NISHIMURA Harumichi 15 Sep '17

15 Sep '17

logic-mlの皆様 QIT37の世話人に代わりまして第３７回量子情報技術研究会（QIT37）の会告をご案内させていただきます．よろしくお願いいたします．名古屋大学大学院情報学研究科西村治道 -------- QIT37 第37回量子情報技術研究会研究会の内容情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第３７回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表，聴講を募集致します．奮ってご参加ください．日時：平成２９年１１月１６日（木），１７日（金）会場：埼玉大学総合研究棟１階シアター教室　　　（〒338-8570 さいたま市桜区下大久保255）発表募集分野：（申し込み状況によっては査読可能性あり）：量子情報，　　　　　　　　　量子計算，量子暗号など広く量子情報技術に関わる理論的　　　　　　　　　研究，実験的研究，計算機科学的研究，数学的研究，及び　　　　　　　　　その他関連分野定員：１４０名程度参加費：事前振込み　一般4,000円，学生3,000円　　　　（当日会場支払いは一般5,000円，学生4,000円）　　　　（懇親会は別途）研究会参加申込要領：講演(口頭，ポスター)希望者，聴講希望者は下記Webにて受付を行います．http://staff.aist.go.jp/s-kawabata/qit/ <http://staff.aist.go.jp/s-kawabata/qit/> <http://staff.aist.go.jp/s-kawabata/qit/> 申込締め切り【講演申込締め切り】　　　平成２９年１０月６日（金）口頭　　　　　　　　　　　　　平成２９年１０月１３日（金）ポスター【PDF原稿提出締め切り】　平成２９年１０月２０日（金）【参加申込締め切り】　　　平成２９年１０月２７日（金） [問合先] 小柴健史 (早稲田大学) 小川朋宏 (電気通信大学) 大久保潤 (埼玉大学) E-mail　qit37(a)list.waseda.jp <mailto:qit37@list.waseda.jp> <qit37(a)list.waseda.jp> 主催：電子情報通信学会　量子情報技術特別研究専門委員会（委員長　竹内繁樹（京都大学））共催：応用物理学会量子エレクトロニクス研究会 ----------------------------------------------------------

1 0

Fwd: [hscc] 2018 Hybrid Systems: Computation and Control (HSCC) -- Call for Papers
by Ichiro Hasuo 04 Sep '17

04 Sep '17

*HSCC 2018 CALL FOR PAPERS* 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC) April 11-13, 2018, Porto, Portugal *URL:* www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> *Important dates:* Paper submission deadline: October 6, 2017 (11:59pm UTC-12) *FIRM* Notification: December 2017 Camera-ready: February 2018 Conference dates: April 11-13, 2018 * Please refer to the conference website for up-to-date information. * *Paper submission information:* Regular papers (maximum 10 pages, 10pt font, two-column ACM format) Tool and Case Study Papers (maximum 6 pages, 10pt font, two-column ACM format) Demos (maximum 2 pages, 10pt font, two-column ACM format, title should begin with “Demo”) Posters (maximum 2 pages, 10pt font, two-column ACM format, title should begin with “Poster”) *Awards:* - Best Repeatability Evaluation Award; Papers would be eligible upon passing the repeatability evaluation process will receive the “artifact evaluated” badge. - Best Demo/Poster Award - Best Paper Award **New** - Test-of-Time Award* *New** *Conference scope:* HSCC 2018 is the 21st in a series of conferences focusing on original research on concepts, tools, and techniques from computer science, control theory, and applied mathematics for the analysis and control of hybrid systems, with an emphasis on computational aspects. By drawing on strategies from computation and control, hybrid systems theory finds application in both man-made cyber-physical systems (ranging from small robots to global infrastructure networks) and natural systems (ranging from biochemical networks to physiological models). Papers are expected to cover a wide spectrum of topics from theoretical results to practical considerations, from academic research to industrial adoption, including but not limited to: - Mathematical foundations, computability and complexity - Analysis, verification, validation, and testing - Modeling paradigms and techniques - Design, synthesis, planning, and control - Programming and specification languages - Network science and network-based control - Security, privacy, and resiliency in cyber-physical systems with a focus on computation and control - Artificial intelligence and machine learning in control algorithms - Software tools - Applications and industrial case studies in: automotive, transportation, autonomous systems, avionics, energy and power, robotics, medical devices, manufacturing, systems and synthetic biology, models for the life sciences, and other related areas *Program Committee Chairs:* Maria Prandini, Politecnico di Milano Jyotirmoy V.Deshmukh, University of Southern California *Repeatability Evaluation Chair:* Sergiy Bogomolov, Australian National University *Publicity Chair:* Kostas Margellos, University of Oxford *Demo and Poster Session Chair:* Jens Oehlerking, Robert Bosch GmbH *Awards Chair* Akshay Rajhans, The MathWorks *Program Committee:* See www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> *Steering Committee:* Rajeev Alur, University of Pennsylvania Werner Damm, OFFIS John Lygeros, ETH Zurich Oded Maler, Verimag Paulo Tabuada, University of California at Los Angeles Claire Tomlin, University of California at Berkeley *Submission website: * See www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> — Kostas Margellos Department of Engineering Science University of Oxford Parks Road, Ox1 3PJ, Oxford United Kingdom kostas.margellos(a)eng.ox.ac.uk

1 0

Kyoto Philosophical Logic Workshop IIIのご案内
by Hitoshi Omori 02 Sep '17

02 Sep '17

Kyoto Philosophical Logic Workshop IIIのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。概要などの詳細はウェブサイトをご覧下さい。 ------------------------------------- Kyoto Philosophical Logic Workshop III 【日時】2017年9月7日, 8日, 9日【場所】京都大学吉田泉殿(7日、9日)、芝蘭会館別館(8日) 【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kplw-3 【プログラム】 September 7: The third workshop on connexive logic, co-organized by Heinrich Wansing and Hitoshi Omori 11:00--12:00 Norihiro Kamide "Bi-classical connexive logic and its modal extension: Cut-elimination, completeness and duality" 12:00--13:00 Tomasz Jarmużek "Connexive logics defined by relating semantics and tableau approach" 13:00--14:30 Lunch 14:30--15:00 Sara Ipakchi "A justification for Aristotle Thesis AT on the basis of LNC" 15:00--16:00 Wolfgang Lenzen "Is connexive logic based on a gross misunderstanding? A Leibnitian approach" 16:00--16:15 Coffee break 16:15--17:15 Heinrich Wansing "Connexive Logic and Chellas-Segerberg Semantics" 17:15--18:15 Andreas Kapsner "What is Connexivity? Lessons from Constructive and Conditional Logics" 19:00-- Dinner September 8: 09:15--10:15 Yasuo Deguchi "Analytic Nishida: Metaphysics of Self and Non-classial Logic" 10:15--11:15 Rafał Urbaniak "Paradoxes of informal provability and many-valued indeterministic provability logic" 11:15--12:15 Toshiharu Waragai "Lesniewski's Ontology from a Syllogistic Point of View" 12:15--13:30 Lunch Special session on Leibniz's logic 13:30--14:30 Ryosuke Igarashi "A Comparison of the Logical Systems of Leibniz and Kant" 14:30--15:30 Hiroyuki Inaoka "Mathematics as make-believe: Infinite diagram in Leibniz's mathematical study" 15:30--15:45 Coffee break 15:45--16:45 Shinji Ikeda "Extension and Space in Leibniz’s Theory of Abstraction" 16:45--17:45 Wolfgang Lenzen "The evolution of the system of Leibniz’s logic" 18:30-- Dinner September 9: 10:00--11:00 Vít Punčochář "Between material and strict implication" 11:00--12:00 Igor Sedlár "Term negation in first-order logic" 12:00--13:30 Lunch 13:30--14:30 Yasuo Nakayama "Philosophical Basis for Dynamic Belief-Desire-Obligation Logic" 14:30--15:30 Shunsuke Yatabe "TBA" 15:30--15:45 Coffee break 15:45--16:45 Makoto Kanazawa "Lambek Calculus and Context-Free Grammars: Some Unresolved Issues" 16:45--17:45 Heinrich Wansing "Disentangling FDE-based Paraconsistent Modal Logics" 18:30-- Dinner ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

FINAL CALL FOR PAPERS: Logic and Engineering of Natural Language Semantics 14 (LENLS 14), Deadline Extended
by Katsuhiko Sano 31 Aug '17

31 Aug '17

[Apologies for multiple copies] ================================================================= FINAL CALL FOR PAPERS **Deadline extended to September 7, 2017** Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Eric McCready (Aoyama Gakuin University) Daisuke Bekki (Ochanomizu University/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (University of Amsterdam) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Submissions: ============ Abstracts (anonymous, up to 4 pages, including figures and references, A4 size, with 12 point font) must be submitted electronically in PDF format at: https://easychair.org/conferences/?conf=lenls14 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The online proceedings of the workshop will be available at the conference site. Important dates: ================ Abstract submission deadline: September 7, 2017 (extended) Notification of acceptance: September 30, 2017 Deadline for camera-ready copy: mid-October, 2017 LENLS14: November 13-15, 2017 Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (iCLA, Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 30 Aug '17

30 Aug '17

皆様スワンジー大学のArnold Beckmann先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/), and EU Horizon 2020 Marie Skłodowska-Curie actions RISE project CID. Date: Friday 15, September, 2017, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Professor Arnold Beckmann (University of Swansea, Head of Department of Computer Science) http://www.cs.swan.ac.uk/~csarnold/ Title: Provably Total NP Search Problems of Bounded Arithmetic and beyond Abstract: Bounded Arithmetic forms a collection of weak theories of Arithmetic related to complexity classes of functions like the Polynomial Time Hierarchy. Many connections between Bounded Arithmetic and important questions about complexity classes have already been established. Recent research considers total NP search problems in the context of Bounded Arithmetic. Total NP search problems have been studied by Papadimitriou et al as a means to characterise the complexity of natural search problems which cannot be analysed as decision problems. In my talk I will review the research programme of characterising the provably total NP search problems in Bounded Arithmetic, and explain why it is important for current research questions in the area. I will describe recent results about the provably total NP search problems of a Bounded Arithmetic theories related to PSPACE and EXPTIME reasoning. I will also describe this program for theories beyond Bounded Arithmetic like Peano arithmetic, and what impact this might have on Complexity Theory.

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml