- Logic-ml - fos.kuis.kyoto-u.ac.jp

CFP: (締切延長)第84回プログラミング研究会発表募集
by Takahito Aoto 15 Apr '11

15 Apr '11

皆様， 6月に函館で開催予定の，情報処理学会第84回プログラミング研究会の発表申込締切が一週間ほど延長になりました．発表申込時点で必要なのはタイトルと概要などとなっております．また，投稿を伴なわない発表も受けつけております． http://www.ipsj.or.jp/sig/pro/trans-author.html 投稿・発表について今一度ご検討いただければ幸いです． --- 青戸等人東北大学電気通信研究所 http://www.nue.riec.tohoku.ac.jp/user/aoto/ ------------------------------------------------------------------ ＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊【発表申込締切が 4/22(金) に延長されました】この場を借りて2011年度第1回情報処理学会プログラミング研究発表会の発表募集のご案内をさせて頂きたく存じます．プログラミング研究会(PRO)は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています (論文誌投稿を希望しない発表も歓迎します)．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2011年6月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切が4月22日に延長されましたので，よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．第84回プログラミング研究会(PRO-2011-1)発表募集日程: 2011年6月14日(火)・15日(水) 会場: サン・リフレ函館〒040-0034 北海道函館市大森町2-14 JR函館駅より徒歩15分発表申込締切: 2011年4月22日(金)【延長されました】投稿論文原稿提出締切: 2011年5月14日(土) 申込先: 青戸等人 (東北大学電気通信研究所) E-mail: aoto [at] nue.riec.tohoku.ac.jp Tel: 022-217-5420 / Fax: 022-217-5426 (電気通信研究所) 案内ページ: http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ ・申込みに当たっての注意はプログラミング研究会のページ http://www.ipsj.or.jp/sig/pro/ を参照してください．・できるだけE-mailでお願いします．・申込み後返信がない場合はご連絡下さい． ------------------------------------------------------------------

1 0

助教公募（北陸先端科学技術大学院大学情報科学研究科）
by Hajime Ishihara 15 Apr '11

15 Apr '11

皆様、北陸先端大の石原です。北陸先端科学技術大学院大学情報科学研究科では以下のように、助教の公募を行っております。専門の例示にとらわれず、数理論理学・数学基礎論関連分野から多数の応募をお待ちしております。関係の方々への周知のため、参加されているメーリングリストやお心当たりの方へ転送していいただければ幸いです。公募人員　　理論情報科学領域　助教（任期付）１名専門分野　　数理論理学・数学基礎論着任時期　　平成23年10月１日以降出来る限り早い時期任期　　　　　５年 (再任あり) 応募締切　　平成23年6月27日（月）必着詳しい公募要領は http://www.jaist.ac.jp/jimu/syomu/koubo/logic.html でご覧いただけます。北陸先端科学技術大学院大学情報科学研究科に関しては http://www.jaist.ac.jp/is/2008ja/index.html をご覧ください。どうぞよろしくお願いいたします。 -- Professor Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Tel: +81-761-51-1206 Fax: +81-761-51-1149 ishihara(a)jaist.ac.jp http://www.jaist.ac.jp/~ishihara

1 0

PhD Program: Call for applications
by Bertram Fronhöfer 09 Apr '11

09 Apr '11

Please pass on this CALL FOR APPLICATIONS to all people who might be interested in. ====================================================== European PhD Program in Computational Logic (EPCL) ====================================================== http://www.epcl-study.eu/ CALL FOR APPLICATIONS The European PhD Program in Computational Logic (EPCL) is run jointly by four of the leading European universities in the field: - Free University of Bozen-Bolzano (Italy), - Technische Universit�t Dresden (Germany), - Technische Universit�t Wien (Austria), and - Universidade Nova de Lisboa (Portugal). Further international universities, research organizations and enterprises which contribute to Computational Logic or apply results from it are involved as associated partners: The Simon Fraser University (Canada), the Universidad de Chile, the National ICT Australia Limited (NICTA), and several companies. The program involves three years of PhD study in at least two of the European partner universities. It leads to a joint doctoral degree of the partner universities at which the studies have been physically performed. The language of the program is English. Financial support is available in the form of positions and scholarships. Necessary requirements for participation in EPCL are a Master's degree in Computer Science or Mathematics, or an equivalent degree; the proof of adequate knowledge of English; and substantial knowledge in the areas Foundations of Logics, Foundations of Artificial Intelligence and Declarative Programming. The program will start on 1 October 2011. Applications have to be electronically submitted on the Webpage http://www.epcl-study.eu/, before the ======================================= Application Deadline on 15 May 2011 ======================================= If you have enquiries, please do not hesitate to contact the coordinator of the program Prof. Steffen H�lldobler Technische Universit�t Dresden Fakult�t Informatik International Center for Computational Logic Email: sh(a)iccl.tu-dresden.de Phone: +49 (351) 463 38340 EPCL is supported by the German Federal Ministry of Education and Research (BMBF) within the German Academic Exchange Service (DAAD) program International Doctorates in Germany (IPID).

1 0

Call for Contribution and Participation: RIMS Workshop "ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics"
by Ichiro Hasuo 07 Apr '11

07 Apr '11

(English version below) みなさま，（何人かの方々には bcc で失礼します）こんにちは！東京大学コンピュータ科学専攻の蓮尾です．京都大学数理解析研究所で行うワークショップ ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics RIMS Workshop, Mon 16 - Wed 18 May 2011 https://sites.google.com/site/acanws/ へのお誘いです．現在（3月から5月まで），アムステルダム大学 ILLC の Yde Venema さんが客員教授として京大数理研に滞在されています．Yde さんは様相論理の教科書 (Blackburn-de Rijke-Venema)などで高名な論理学者で，近年は特に余代数的様相論理 coalgebraic modal logic の分野で活躍なさっています． http://staff.science.uva.nl/~yde/ この機会に，Yde さんのご研究分野である様相論理をはじめとしたさまざまな非古典論理と，彼の最近のアプローチである代数・余代数・圏論的手法とをコアトピックとして，数理研での研究集会を企画しました．まず，講演者として以下のかたがたに参加いただきます： Yde Venema さん，Raul Leal さん (ILLC, University of Amsterdam) Jose Gil-Ferez さん， Milan Petrik さん (JAIST) 佐野勝彦さん，丸山善宏さん（京都大学大学院文学研究科）さらに，オーガナイザーによるチュートリアル Algebraic Approaches to Substructural Logics （照井） Coalgebra for Modal Logic(ians) （蓮尾）も企画しています．みなさま，ぜひご参加ください！ - ぜひ講演をご検討ください．非古典論理・代数・余代数の一つでもかすっていれば大歓迎です！ - 国内からの参加者の方には，旅費の補助があります．(予算が限られています．ごめんなさい) - ちょうど親鸞750回忌と重なって，京都市内のホテルが大混雑です．宿泊の予約はぜひお早めに．また，数理研の宿泊施設「北白川学舎」の予約も受け付けます(部屋数限りあり)．詳しい情報，参加登録，講演登録については，ウェブサイト https://sites.google.com/site/acanws/ をご覧になってください．京都でお会いするのを楽しみにしております．それでは！運営：照井一成，佐藤哲也，蓮尾一郎 ================================================= Dear all, This is Ichiro Hasuo at Dept. CS, Univ. Tokyo. This is an invitation to the workshop ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics Mon 16 - Wed 18 May 2011 RIMS, Kyoto University https://sites.google.com/site/acanws/ This workshop is organized on the occasion of the visit of Prof.Dr. Yde Venema, a modal logician from ILLC, University of Amsterdam, as a visiting professor at RIMS, Kyoto University. It will feature Yde's talk and talks by * Jose Gil-Ferez (JAIST) * Raul Leal (ILLC, University of Amsterdam) * Yoshihiro Maruyama (Grad. School of Letters, Kyoto University) * Milan Petrik (JAIST) * Katsuhiko Sano (Grad. School of Letters, Kyoto University) as well as tutorial talks by two organizers: * Kazushige Terui on algebraic approaches to substructural logics * Ichiro Hasuo on coalgebra for modal logic(ians) We solicit your participation (and your contributed talk if possible). Some organizational matters: - We will financially support your trip, if it is from inside Japan and within our budget - The hotel rooms in Kyoto will be tight due to a big Buddhism event. So book in advance! Some rooms at the RIMS accommodation are available, too. Visit the website https://sites.google.com/site/acanws/ for more info and registration. Looking forward to seeing you in Kyoto! Best regards, Organization Committee: Kazushige Terui Tetsuya Sato Ichiro Hasuo

1 1

(First Announcement) RIMS 研究集会 ( 集合論分野 ) について
by FUJITA Hiroshi 07 Apr '11

07 Apr '11

このメールは研究協力者をお引受けいただいた皆様に直接お送りするほか, 同じ文面で Logic-ML にも投稿いたします. ご了承くださいませ. 毎年秋に京都大学数理解析研究所で開催しております集合論分野のRIMS研究集会ですが、今年2011年はわたくし藤田博司が世話役を担当させていただきます。今年は、10月19日水曜日〜同21日金曜日の3日間にわたって記述集合論の展望 (Aspects of Descriptive Set Theory)」という研究題目のもとで研究集会を開催いたします。今年は, 海外からのゲストスピーカーとして Slaomir Solecki (Illinois大学, USA) Stephan Gescke (Bonn大学, ドイツ) Tamas Matrai (Rutgers大学, USA) の三方をお招きしており, SoleckiさんとGeschkeさんにはそれぞれ60分×3回のミニコース, Matraiさんには60分の招待講演をお願いしております. 広い意味で記述集合論に関連する諸分野 (実数の集合論, 内部モデル, 強制法, 巨大基数公理, 集合論的実解析学, など) の講演を募ります. お名前と所属と職名 (それぞれ英語表記を添えて) 講演タイトルを, 8月中を目処にわたくし藤田までお知らせください. なおこの研究集会のホームページを http://www.math.sci.ehime-u.ac.jp/~fujita/RIMS-settheory-2011.html に作ります. いろいろのお知らせを掲載していきますので時折開いてみてください. 旅費や宿泊などについての詳細を含むSecond Announcementを9月上旬に流します. -- 藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp>

1 0

[開催案内] 情報処理学会第83回プログラミング研究発表会(4/25-26)
by Keisuke Nakano 07 Apr '11

07 Apr '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りまして，情報処理学会第83回プログラミング研究発表会開催のご案内をさせて頂きます．この研究発表会は3月16-17日に行われる予定でしたが，東日本大震災の影響により中止となったため，学会の通達に基づき日程と開催地を変更して開催させていただくことなりました．日程は4月25日-26日で，場所は京都大学楽友会館です．皆様のご参加をお待ちしております．最新情報は下記ページに掲示されますのでご確認ください． http://millsmess.cs.uec.ac.jp/pro/2010-5/ ---------------- 第83回プログラミング研究会 (PRO-2010-5) 日程：2011年 4月 25日(月)・26日(火) 場所：京都大学楽友会館 http://www.kyoto-u.ac.jp/ja/profile/intro/facilities/kyoshokuin/rakuyu/ 　　　〒606-8501　京都市左京区吉田二本松町市バス「近衛通（このえどおり）」下車徒歩すぐ ---------------- プログラムは発表予定者の都合に基づいて現在調整中です．元のプログラムは http://millsmess.cs.uec.ac.jp/pro/2010-5/old-program.html からご覧になれますが，都合により発表がキャンセルされる可能性があることを予めご了承ください．多くの方のご参加をお待ちしております．担当：中野圭介(電通大)，河内谷清久仁(日本IBM)

1 0

2nd CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 06 Apr '11

06 Apr '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 [Please accept our apologies if you receive multiple copies of this email] ================================================== INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM‚11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this „service revolution‰ will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general „rigorous software development‰ might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks∑), service dependability, service evaluation/monitoring/testing, etc∑, a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, ∑) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We have already agreed with the editor of the international Journal of Internet Services and Information Security to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra(a)imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas(a)oracle.com * Fabio Massacci, University of Trento, Italy - massacci(a)disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara(a)newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montréal, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep Küngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hernán Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA

1 0

CFP: Non-classical Modal and Predicate Logics
by Yuping Shen 05 Apr '11

05 Apr '11

Call for papers *** Non-classical Modal and Predicate Logics *** Guangzhou (Canton), China, 5-9 December 2011 http://logic.sysu.edu.cn/ncmpl2011 Modalities and predicates have since ancient time been central notions of logic. In the 20th century, various systems of non-classical logics have emerged, with applications in many disciplines like Computer Science, Linguistics, Mathematics, and Philosophy. This gave rise to the questions of non-classical treatment of quantification and modalities and their accommodation in these non-classical logics. In response, various modal and predicate variants of non-classical logics have been introduced and studied in the past decades. Although there are many good conferences on (mainly propositional) non-classical logics, this conference is one solely dedictated to modal and predicate non-classical logics. The aim of the conference is to bring together researchers from various branches of non-classical logics, not only to present recent advances in their particular fields, but also to identify common problems and methods and foster the exchange of ideas between researchers from separate fields. Topics of interest: * The study of first- or higher-order variants of non-classical logics, including, but not limited to: - Predicate intuitionistic and superintuitionistic logics - Predicate modal logics - Predicate substructural logics - Predicate many-valued and partial logics - Predicate paraconsistent logics - Predicate non-monotonic logics, etc. * Non-classical theories of quantification over classical logics, such as: - Free logics - Branching quantifiers and IF-logic - Generalized quantifiers * Extensions by modalities of (propositional or predicate) non-classical logics, including: - Modal extensions of (super)intuitionistic, substructural, many-valued, paraconsistent, non-monotonic, etc., logics - Co-algebraic treatment of modalities We accept both purely theoretical works on the above logics coming from all branches of mathematical logic (proof-theory, model theory, game theory, computational complexity, etc.), as well as their application in the foundation of mathematics (non-classical mathematics), computer science, linguistics, philosophy, etc. Strong papers on propositional logics can also be accepted, provided they relate to the themes in the main scope of the conference (e.g., the study of completions in algebraic semantics, propositional quantification, etc.). Full versions of selected papers will be published in a special issue of an international peer-reviewed journal (to be specified). == Invited speakers == Gabriel Sandu Hiroakira Ono Mingsheng Ying Rob Goldblatt Valentin Shehtman Xuefeng Wen == Conference chairs == Shier Ju Petr Cintula == Program committee == Steve Awodey Libor Behounek Itala M.L. D'Ottaviano Rosalie Iemhoff Hu Liu Michael Rathjen Greg Restall Yde Venema == Organizing committee == Yuping Shen (chair) == Coference web page == http://logic.sysu.edu.cn/ncmpl2011 == Conference fee == Foreign participants: 150 EUR Chinese participants: 1000 RMB Chinese students: 200 RMB The conference fee covers accommodation and all meals during the conference, coffee breaks, social program, and conference materials. == Abstracts == Extended abstracts of 3-5 pages should be submitted via the EasyChair web interface, see http://logic.sysu.edu.cn/ncmpl2011 == Important dates == Deadline for abstracts: 1 September 2011 Notification of acceptance: 20 September 2011 Conference: 5-9 December 2011 Shier Ju and Petr Cintula Conference chairs

1 0

[TACL 2011] Third and last call for papers -- submission deadline approaching: 18/04/2011
by tacl2011＠lif.univ-mrs.fr 04 Apr '11

04 Apr '11

[Apologies for multiple copies] *Submission deadline approaching: 18/04/2011* =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Third and final call for papers =============================================================================== July 26-30, 2011 Universités Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Università degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. The program committee specially encourages submissions related to the work of Leo Esakia, and may select some of these submission for presentation at the special session. Submissions ----------- Contributed presentations will be of two types: * standard presentations of 20 minutes in parallel sessions, * featured, 30 minutes long, plenary presentations. The submission of an extended abstract in pdf format will be required to be selected for a contributed presentation of either kind. Concerning the standard presentations, while preference will be given to new work, results that have already been published or presented elsewhere will also be considered. Concerning the featured presentations: the program committee will choose a small number of submissions of which the authors will be invited to give a plenary presentation. The criteria for this selection will be: originality, significance and interest to the wider TACL community. There will be just one submission procedure, for contributed presentations of either kind: authors are requested to submit a short text of four pages, in English and in pdf format, through the easychair submission site: https://www.easychair.org/conferences/?conf=tacl2011 Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Università degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Université Aix-Marseille II Tadeusz Litak, University of Leicester Paul-André Melliès, CNRS Paris Diderot George Metcalfe, Universität Bern Nicola Olivetti, Université Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Université Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Université de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011(a)lif.univ-mrs.fr ===============================================================================

1 0

CFP IEICE Transactions Special Issue (FORMAL APPROACH)
by Jacques Garrigue 28 Mar '11

28 Mar '11

名古屋大学の結縁先生に代わっての投稿です。電子情報通信学会英文誌フォーマルアプローチ特集の論文募集案内をお送り致します。皆様のご投稿をお待ちしています。７月中旬締切で１２月末までには最終判定が出る予定です。 ------------------------------------------------ CALL FOR PAPERS Special Section on Formal Approach The IEICE Transactions on Information and Systems announces a forthcoming special issue on Formal Approach to be published in May 2012. Formal methods and techniques play a key role in designing and developing highly reliable hardware and software. The last decades have seen various new techniques and profound theoretical results using formal methods in surprisingly many fields such as modeling, requirements analysis, specification, automatic generation of codes, test, verification, maintenance, and reuse. They are rapidly extending its application domains as a result of the recent growth of information and communication technologies. The Special Section on Formal Approach aims at stimulating research on formal approach to information systems, ranging from fundamental theory to case studies in practical systems. Our emphasis is put on the cross-fertilization of related research fields and encouragement of young researchers. Topics: The major topics are listed below, but we solicit submissions in all areas of formal approaches, i.e., first to formalize information systems and their environment, next to analyze their behavior and to derive their properties rigorously, and then to solve various problems in designing and managing the systems. Theory: Logic, Automata and Formal Languages, Formal Semantics, and Models of Computation Formal Specification: Petri Net, Process Algebra, Timed Automata, Statechart, UML，Z，VDM，B-method，Alloy, etc. Verification Method: Model Checking, Automatic and Semi-Automatic Theorem Proving, Test, and Formalization and Verification of Information Security. Formal Approaches to Various Systems such as Database Systems, Distributed Systems, and Embedded Systems, using above theories and techniques. Submission Instructions: The deadline for submission is July 18, 2011, 23:59 JST(GMT+9). Manuscripts should be carefully prepared according to the guideline in the ``Information for Authors'' (available at http://www.ieice.org/eng/shiori/mokuji_iss.html). The preferred length of the manuscript is 8 pages. Only electronic submission through the web page is accepted. 1. Submit a complete paper and electronic files (TeX/Word files, figures, authors' photos and biography) for publishing using the IEICE Web site https://review.ieice.org/regist_e.aspx Authors should choose ``[Special ED] Formal Approach'' as a ``Type of Section (Issue)/Transactions'' on the online screen. 2. Send signed and completed forms of ``Copyright Transfer and Page Charge Agreement'' and ``Confirmation Sheet of Manuscript Registration'' (which will be generated when you submit a paper) by e-mail (preferable) or postal mail to Prof. Shoji Yuen, the guest editor. Please mark ``[Special ED] Formal Approach'' on the envelope. Editorial Committee: Guest Editor-in-Chief: Shoji Yuen(Nagoya University) Guest Editors: Yoshinao Isobe (AIST) Kazuhiro Ogata (JAIST) Tatsuhiro Tsuchiya(Osaka University) Members: Ichiro Hasuo (Kyoto University) Nao Hirokawa (JAIST) Yasunori Ishihara (Osaka University) Koji Iwanuma (Yamanashi University) Yoshinobu Kawabe (Aichi Institute of Technology) Yasuhiko Minamide (University of Tsukuba) Kozo Okano (Osaka University) Hiroshi Sakamoto (Kyushu Institute of Technology) Tachio Terauchi(Tohoku University) Tomohiro Yoneda (National Institute of Informatics) Further information may be obtained from the web page at: http://www.agusa.i.is.nagoya-u.ac.jp/FA/ All inquiries should be sent to the guest editor: Shoji Yuen <fa-submit(a)agusa.i.is.nagoya-u.ac.jp> Graduate School of Information Science, Nagoya University Furo-cho, Chikusa-ku, Nagoya, 464-8601 Japan FAX: +81-52-789-3649 Important Dates: Submission Deadline: July 18, 2011 23:59JST(GMT+9) First Notification: September 14, 2011 Revised Version Deadline: November 13, 2011 Final Notification: December 22, 2011 Important Notice. (1) At least one of the authors must be an IEICE member when the manuscript is submitted for review. For the application of IEICE membership, visit http://www.ieice.org/eng/member/OM-appli.html. (2) If accepted for publication, authors are required to pay the page charges covering pat of the cost of publication. -- Shoji Yuen Graduate School of Information Science, Nagoya University

1 0

Kobe Colloquium (talk by Toshiyasu Arai)
by Makoto Kikuchi 26 Mar '11

26 Mar '11

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2011年3月30日（水）15:30 ～場所：神戸大学自然科学総合研究棟3号館4階421室（渕野グループ内プレゼンテーション室）講演者：新井敏康（千葉大学）題目：Lifting up the proof theory to the countables アブストラクト： We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in set theories. 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

MOL 12 - VENUE CHANGE
by Makoto Kanazawa 25 Mar '11

25 Mar '11

*** NEW VENUE AND DATES *** FINAL CALL FOR PAPERS (new submission deadline: April 2, 2011) 12th Meeting on Mathematics of Language Nara, Japan, September 6–8, 2011 http://sites.google.com/site/mol12nara/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held in Nara, Japan, from September 6 through 8, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available atftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: April 2, 2011 (extended from the original deadline of March 22, 2011) • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 6-8, 2011 (shifted one day later than the dates originally announced) Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (co-chair) • Hiroyuki Seki (co-chair) • Ryo Yoshinaka

1 0

PLS8: SUBMISSION DEADLINE EXTENDED
by Christos Nomikos 24 Mar '11

24 Mar '11

The deadline for paper submission to PLS8 has been exteded to April 2, 2011. ******************************************************************************* ******************************************************************************* *** *** *** T H E 8 T H P A N H E L L E N I C L O G I C S Y M P O S I U M *** *** J u l y 4 - 8 , 2 0 1 1 *** *** I o a n n i n a, G r e e c e *** *** *** *** www.cs.uoi.gr/~pls8/ *** *** *** ******************************************************************************* ******************************************************************************* FINAL CALL FOR PAPERS HISTORY OF THE SYMPOSIUM The Panhellenic Logic Symposium, a biennial scientific event established in 1997, aims to promote interaction and cross-fertilization among different areas of logic. Originally conceived as a way of bringing together the many logicians of Hellenic descent throughout the world, it has evolved into an international forum for the communication of state-of-the-art advances in logic. The symposium is open to researchers worldwide who work in logic broadly conceived. The Eighth Panhellenic Logic Symposium will be hosted by the Department of Computer Science at the University of Ioannina. PROGRAM OF THE SYMPOSIUM The scientific program of the symposium will consist of one-hour long invited talks, three-hour long tutorials, and twenty-five-minute presentations of accepted contributed papers. There will also be special opportunities for students to give short talks, and receive comments on work in progress. INVITED TUTORIALS - Jeremy Avigad (Carnegie Mellon, USA) - Dale Miller (INRIA, France) - Simon Thomas (Rutgers, USA) INVITED SPEAKERS - George Barmpalias (University of Amsterdam, Netherlands) - Ozlem Beyarslan (Bogazici University, Turkey) - Michael Rathjen (University of Leeds, UK) - Nicole Schweikardt (Goethe University, Germany) - Athanassios Tzouvaras (University of Thessaloniki, Greece) CALL FOR PAPERS Original papers that fall within the scope of the symposium are solicited. Prospective speakers of twenty-five-minute presentations are invited to submit an extended abstract, in English, not exceeding five pages, by 25 March 2011. Papers should be prepared using the EasyChair class style (available from http://www.easychair.org/coolnews.cgi) and submitted electronically, using the Easy Chair conference system, at http://www.easychair.org/conferences/?conf=pls8 If possible, each submitted paper should be classified in one of the following areas (in alphabetical order): - Algebraic and Categorical Methods in Logic - Computability Theory - History and Philosophy of Logic - Logic in Computer Science - Model Theory - Nonclassical and Modal Logics - Proof Theory - Set Theory All submitted papers will be reviewed by the scientific committee of the symposium, who will make final decisions on acceptance or rejection. During the symposium, each accepted paper will be presented by one of its authors, with five extra minutes for questions. Authors of submitted papers will be notified of the decision by early May 2011. Camera-ready extended abstracts will be due by the end of May for inclusion in the symposium proceedings which will be distributed to all participants. STUDENT SESSIONS Graduate students are invited to submit short abstracts on work in progress but not yet ready for a regular contributed talk. Those accepted will have an opportunity to present their subject in a special student session, and to receive comments and suggestions from mentors including some of the invited speakers. Interested students should submit to http://www.easychair.org/conferences/?conf=pls8 by May 29, 2011, an abstract of no more than one page in .pdf form. IMPORTANT DATES: - Abstract Submission Deadline: April 2, 2011 - Student Abstract Submission Deadline: May 29, 2011 - Acceptance Notification: May 7, 2011 - Camera Ready Papers Deadline: May 31, 2011 - Acceptance Notification for Student Abstracts: June 10, 2011 - Conference Dates: July 4-8, 2011 SCIENTIFIC COMMITTEE - Ayse Berkman (Middle East Technical University) - Costas Dimitracopoulos (University of Athens) - Kostas Hatzikiriakou (University of Thessaly) - Antonis Kakas (University of Cyprus) - Panagis Karazeris (University of Patras) - Phokion Kolaitis (University of California, Santa Cruz and IBM Research-Almaden) - George Koletsos (National Technical University of Athens ) - Joan Moschovakis (Occidental College (retired), Chair of SC) - Christos Nomikos (University of Ioannina) - Itay Neeman (University of California, Los Angeles) - Thanases Pheidas (University of Crete) - Alexandra Soskova (Sofia University) - Constantine Tsinakis (Vanderbilt University) - Stathis Zachos (National Technical University of Athens ) ORGANIZING COMMITTEE - Manolis Gergatsoulis (Ionian University) - Spyros Kontogiannis (University of Ioannina) - Costas Koutras (University of Peloponnese) - Christos Nomikos (University of Ioannina, chair of the OC) - Panos Rondogiannis (University of Athens) SYMPOSIUM WEBPAGE www.cs.uoi.gr/~pls8/ CONTACT Joan Moschovakis (Chair of the Scientific Committee) e-mail: joan(a)math.ucla.edu Christos Nomikos (Chair of the Organizing Committee) address: University of Ioannina Department of Computer Science P.O. Box 1186 45110, Ioannina Greece tel: +30 26510 08815 fax: +30 26510 08895 e-mail: cnomikos(a)cs.uoi.gr pls8(a)zeus.cs.uoi.gr

1 0

MOL 12 Tokyo - Deadline extended
by Makoto Kanazawa 22 Mar '11

22 Mar '11

*** SUBMISSION DEADLINE EXTENDED *** FINAL CALL FOR PAPERS (new submission deadline: March 29, 2011) 12th Meeting on Mathematics of Language Tokyo, September 5–7, 2011 http://sites.google.com/site/mol12tokyo/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available atftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: March 29, 2011 (extended from March 22, 2011) • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 5-7, 2011 Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (Chair) • Ryo Yoshinaka

1 0

数学会中止
by KASHIMA Ryo 16 Mar '11

16 Mar '11

日本数学会数学基礎論および歴史分科会会員の皆様、昨日、以下のメールを kisoron-ml 宛に送りましたが、うまく届いていないようなので logic-ml にも含めて再送します。 ---------- 差出人: KASHIMA Ryo <kashima(a)is.titech.ac.jp> 日時: 2011年3月15日 15:03:19:JST 宛先: kisoron-ml(a)sato.kuis.kyoto-u.ac.jp Cc: KASHIMA Ryo <kashima(a)is.titech.ac.jp> 件名: 数学会中止日本数学会数学基礎論および歴史分科会会員の皆様、分科会連絡責任評議員の鹿島です。すでに新井敏康先生名で logic-ml に流れたのでご存知の方が多いと思いますが、早稲田大学で開催予定されていた数学会年会が中止になりました： http://mathsoc.jp/publicity/news20110314.html したがいまして、21日の昼に予定していた分科会総会も中止といたします。総会で予定していた報告事項等は，後日このメーリングリスト(kisoron- ml) に流します。分科会評議員・運営委員へのご意見がありましたら、総会の代わりにメールでお知らせください。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 0

ICFP 2011 の締め切りについて
by Kenichi Asai 15 Mar '11

15 Mar '11

お茶大のあさいと申します。この秋に東京で開かれる ICFP 2011 ですが、地震の影響により論文の準備が難しくなっていることが考えられます。それに対応するため、ICFP 2011 では地震で影響を受けた方を対象に以下のような締め切りの延長を行っています。（地震で影響を受けた方のみです。） If you are affected by the earthquake in Japan, we will accept your title and abstract until Monday 4 April at 23:59, and your submission until Thursday 7 April at 23:59. 今の状況で論文を準備するのは、特に東北地方の方にはなかなか難しいようにも思いますが、この延長を利用して、多くの論文を投稿いただければ幸いです。なお、地震の影響を受けたかどうかの判断は性善説に基づいています。（外国からの投稿など、地震との関係がわからない場合は問い合わせが行くと思います。）判断に悩む場合は、プログラム委員長の Olivier Danvy 氏（あるいは私）までお問い合わせ頂ければと思います。よろしくお願いします。 -- お茶大・理・情報浅井健一 asai(a)is.ocha.ac.jp

1 0

Kobe Colloquium (talk by Toshiyasu Arai)
by Makoto Kikuchi 15 Mar '11

15 Mar '11

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロクウィウムを開催します。日時：2011年3月17日（木）10:30 〜場所：神戸大学自然科学総合研究棟3号館4階421室（渕野グループプレゼンテーション室）講演者：新井敏康（千葉大学）題目：Lifting up the proof theory to the countables アブストラクト： We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in set theories. 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 1

Asian Workshop on Philosophical Logic
by Hiroakira Ono 15 Mar '11

15 Mar '11

Asian Workshop on Philosophical Logic "Asian Workshop on Philosophical Logic" will be held at Research Center for Integrated Science (RCIS), Japan Advanced Institute of Science and Technology (JAIST) on 17th and 18th March, 2011. Our aim is to promote mutual understandings among researchers on logic working in Asian countries, and to establish closer collaborations in future. The scope of the Workshop will cover: philosophical logic, non-classical logics, algebraic logic, and their applications in computer science and cognitive science During the Workshop, we will have a special session of discussions on future collaborations, in particular on research, education and exchange of researchers in our region. The workshop will start from 9:30 of 17th March and will end in the afternoon of 18th. The venue is at the RCIS seminar room of the 3rd floor of Multidisciplinary Research Center Bldg. of JAIST, which is indicated as No.28 in the map of JAIST: http://www.jaist.ac.jp/english/campus/index.html We welcome your participation in both talks and discussions from all areas and all levels. =============== Organizers Hiroakira Ono ono(a)jaist.ac.jp Norbert Preining preining(a)jaist.ac.jp Research Center for Integrated Science Japan Advanced Institute of Science and Technology Nomi, Ishikawa, 923-1292 Japan =============== Program March 17: 9:30 - 9:40 Opening 9:40 - 10:20 * Fenrong Liu (Tsinghua Univ., China) : Reasoning about Preference Dynamics 10:20 - 10:30 Break 10:30 - 11:50 * Ching-hui Su (Academia Sinica, Taiwan) : The Generalized Triviality Result * Katsuhiko Sano (Kyoto Univ., Japan) : Product of Hybrid Logics 11:50 -13:00 Lunch break 13:00 -15:00 * Chin-mu Yang (National Taiwan Univ., Taiwan) : Belief, Knowledge, and Assertion: From a Modal Perspective * Xin Li (JAIST, Japan) : Model Checking Pushdown Systems and Practical Applications * Takahiro Seki (Niigata Univ., Japan) : Recent Topics on Relevant Modal Logics 15:00 -15:30 Break 15:30 -16:50 * Hu Liu (Sun Yat-sen Univ., China) : Simulative Belief Logic * Jose Gil Ferez (JAIST, Japan) : A Glance through Abstract Algebraic Logic -------------------- March 18: 9:30 - 10:10 * Wen-fang Wang (National Yang Ming Univ., Taiwan) : On Priest's Solutions to the Sorites Paradox 10:10 - 10:30 Break 10:30 - 11:50 * Milan Petrik (JAIST, Japan) : Web-geometric View on Fuzzy Logic * Kaile Su (Griffith Univ., Australia/Beijing Univ., China) : Logic for Agents with Defective Observation 11:50 -13:00 Lunch break 13:00 - 15:00 Special Session 15:00 - 15:10 Closing

1 1

Fwd: 2011年度日本数学会年会の中止について（お知らせ）
by Makoto Kikuchi 14 Mar '11

14 Mar '11

みなさま数学会年会が中止されました http://mathsoc.jp/publicity/news20110314.html -- 新井敏康 ---------- 転送メッセージ ---------- From: chou ryou <msjchou(a)muse.ocn.ne.jp> 日付: 2011年3月14日16:22 件名: 2011年度日本数学会年会の中止について（お知らせ） To: msjchou(a)muse.ocn.ne.jp 関係者各位　殿日本数学会事務局の張と申します．日頃に日本数学会の運営にご協力いただきありがとうございます．さて，３月１１日に東北地方を中心に大地震が発生いたしました．地震の影響を考慮して，３月２０日から早稲田大学理工学術院で開催が予定されております２０１１年度年会を中止することと致しました．年会および秋季総合分科会は日本数学会で最も重要な事業ですので，今回の決定は当会にとって苦渋の判断です．皆様に，大変ご迷惑をかけて申し訳ございませんが，ご理解のほど宜しくお願い申し上げます．取り急ぎ，お知らせまで． ************************* 社団法人　日本数学会事務局　　張　良ＴＥＬ：03-3835-3483 FAX：03-3835-3485 E-mail:msjchou@muse.ocn.ne.jp *************************

1 0

東北大，田中・山崎グループの状況について
by YOKOYAMA Keita 14 Mar '11

14 Mar '11

皆様，東北大の横山です，皆様には多大なご心配をお掛けしていることと存じます．研究とは直接関係のないメールで恐縮です．本日14日午前までに，直接・間接様々な方法で，田中先生・山崎先生をはじめ，研究グループの修士以上全員の無事が確認できましたので，ここにご報告いたします．ご心配をいただきました皆様に，心より感謝申し上げます．なお，近隣を含め，ライフラインの復旧は未だ限定的で，大学のメールシステムの復旧までにはかなりの時間を要するかと思われます．田中・山崎グループのメンバーへの緊急の連絡がありましたら横山 azutab(a)gmail.com までご連絡ください．横山啓太 -- Keita Yokoyama Mathematical Institute, Tohoku University Aoba, Sendai, JAPAN, 980-8578 azutab(a)gmail.com

1 0

Talk by Yde Venema, Thursday this week (17 March)
by Ichiro Hasuo 13 Mar '11

13 Mar '11

Dear colleagues, This coming Thursday our guest Yde Venema from ILLC, University of Amsterdam is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ PS. Our deepest sympathy for those suffering from the tragic earthquake. ======= Speaker: Yde Venema Institute for Logic, Language and Computation Universiteit van Amsterdam http://staff.science.uva.nl/~yde/ Title: Coalgebra automata (towards a universal theory of automata) Date: 11.00 - 12.00, Thu 17 Mar 2011 Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Automata operating on infinite objects provide an invaluable tool for the spcification and verification of programs. Many of the infinite objects studied in this area, such as words/streams, trees, graphs or transition systems, represent ongoing behaviour in some way, and provide key specimens of coalgebras. Hence it make sense to develop a universal theory of coalgebra automata: automata operating on coalgebras. The motivation underlying the introduction of coalgebra automata is to gain a deeper understanding of this branch of automata theory by studying properties of automata in a uniform manner, parametric in the type of the recognized structures. Coalgebraic automata theory thus contributes to Universal Coalgebra as a mathematical theory of state-based evolving systems. In the talk we give a quick introduction to coalgebra, and we introduce the notion of a coalgebra automaton. We will see that in fact a large part of the theory of parity automata can be lifted to a coalgebraic level of generality, and thus indeed belongs to the theory of Universal Coalgebra. More specifically, coalgebra automata satisfy various closure properties: under some conditions on the coalgebraic type, the collection of recognizable languages are closed under taking union, intersection, complementation, and existential projections. We will discuss two kinds of coalgebra automata, corresponding to approaches in coalgebraic logic that are based on, respectively, relation lifting and predicate liftings. Our results have many applications in the theory of (coalgebraic fixpoint logics), but these will only be discussed tangentially. =======

1 0

MOL 12 Tokyo - Submission Open
by Makoto Kanazawa 06 Mar '11

06 Mar '11

*** ONLINE PAPER SUBMISSION OPEN *** Last Call for Papers (submission deadline: March 22, 2011) 12th Meeting on Mathematics of Language Tokyo, September 5–7, 2011 http://sites.google.com/site/mol12tokyo/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available atftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: March 22, 2011 • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 5-7, 2011 Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (Chair) • Ryo Yoshinaka

1 0

Talk by Yoshihiro Maruyama, Tuesday next week (8 Mar 2011)
by Ichiro Hasuo 03 Mar '11

03 Mar '11

Dear colleagues, Next week on Tuesday Yoshihiro Maruyama, a finishing master student at Department of Humanistic Informatics, Kyoto University is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Yoshihiro Maruyama (Department of Humanistic Informatics, Kyoto University) http://researchmap.jp/ymaruyama/ Title: Duality in Logic, Algebraic Geometry, and Computer Science Date: 11.00 - 12.00, Tue 8 Mar 2011 Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Categorical duality often arises between ontological and epistemological aspects of concepts.　Indeed, we can find a number of such dualities in diverse fields: duality between models and theories in logic; duality between computer systems and their properties in computer science; duality between states and observables in quantum physics; duality between varieties and rings in algebraic geometry. In this talk, we briefly attempt to clarify the relationships between these dualities (especially, dualities in logic and algebraic geometry in relation to logical completeness and Hilbert Nullstellensatz), and develop a moderately general theory of dualities between modal logics and coalgebras (representations of the above-mentioned duality in computer science), extending the theory of natural dualities (a general theory of Stone-type dualities based on universal algebra) via a new concept of modal power. For the latter part, a preprint "Natural Duality, Modality and Coalgebra" is available in: http://researchmap.jp/ymaruyama/

1 0

Fwd: NSA2011
by Tchizawa 02 Mar '11

02 Mar '11

関係各位様 2010年度超準解析シンポジウムの第4報です。今回は Guy Wallet, Imme van den Berg　教授が海外から参加されます。講演は日本語でOKですが、レジュメはできれば英語で作成されることを希望します。尚、3 月 29日（火）に懇親会を予定しています、こちらの参加の予定もお知らせください。２０１０年度超準解析シンポジウム日時：３月２8日（月）,２9日（火）,30日（水）, 2011　場所：東京都市大学　世田谷キャンパス 2号館1階　21C 　　（東急大井町線　尾山台駅　徒歩　約１５分） NSA 2011 Program ********************** 28th March Reception, 12:30-14:00 Session, 14:00-15:00 : H.Yamashita, "Brownian phase-space path integral" 15:30-17:30 : I.V.D.Berg, "External numbers and external points" ----------------------------------- 29th March 10:00-11:00 : K.Yokoyama "TBA" 11:30-12:30 : S.Sanders, "Nonstandard Analysis, the star of Reverse Mathematics" Lunch Time Session, 14:00-15:00 : S.Nagamachi, "Bosonization" 15:30-17:30 : G.Wallet, "Arithmetization and Harthong-Reeb line based on Omega-numbers" Banquet : Santo Spirito (Meguro) 19:00-21:30 -------------------------------------------- 30th March 10:00-11:00 : H.Miki, "4-dim duck solutions in a trading economic model" 11:30-12:30 : K.Tchizawa, "On a local model in a 4-dim slow-fast system" ------------------------------------- Kiyoyuki Tchizawa Directorate Ph.D Tokyo Nonlinear Analysis Research Center Institute of Administration Engineering, Ltd.

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 ================================================== Call for papers INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM‚11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 ================================================== Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this „service revolution‰ will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general „rigorous software development‰ might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks∑), service dependability, service evaluation/monitoring/testing, etc∑, a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, ∑) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We already agreed with the editor of an international journal to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra(a)imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas(a)oracle.com * Fabio Massacci, University of Trento, Italy - massacci(a)disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara(a)newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montréal, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep Küngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hernán Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 ================================================== Call for papers INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM‚11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 ================================================== Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this „service revolution‰ will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general „rigorous software development‰ might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks∑), service dependability, service evaluation/monitoring/testing, etc∑, a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, ∑) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We already agreed with the editor of an international journal to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra(a)imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas(a)oracle.com * Fabio Massacci, University of Trento, Italy - massacci(a)disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara(a)newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montréal, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep Küngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hernán Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA

1 0

CFP: 第84回プログラミング研究会発表募集
by Takahito Aoto 28 Feb '11

28 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りて2011年度第1回情報処理学会プログラミング研究発表会の発表募集のご案内をさせて頂きたく存じます．プログラミング研究会(PRO)は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています (論文誌投稿を希望しない発表も歓迎します)．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2011年6月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切は4月14日(投稿締切は5月14日)ですので，よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．第84回プログラミング研究会(PRO-2011-1)発表募集日程: 2011年6月14日(火)・15日(水) 会場: サン・リフレ函館〒040-0034 北海道函館市大森町2-14 JR函館駅より徒歩15分発表申込締切: 2011年4月14日(木) 投稿論文原稿提出締切: 2011年5月14日(土) 申込先: 青戸等人 (東北大学電気通信研究所) E-mail: aoto [at] nue.riec.tohoku.ac.jp Tel: 022-217-5420 / Fax: 022-217-5426 (電気通信研究所) 案内ページ: http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ ・申込みに当たっての注意はプログラミング研究会のページ http://www.ipsj.or.jp/sig/pro/ を参照してください．・できるだけE-mailでお願いします．・申込み後返信がない場合はご連絡下さい． --- 青戸等人東北大学電気通信研究所 http://www.nue.riec.tohoku.ac.jp/user/aoto/

1 0

[開催案内] 情報処理学会第83回プログラミング研究発表会(3/16-17)
by Keisuke Nakano 27 Feb '11

27 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りまして，情報処理学会第83回プログラミング研究発表会開催のご案内をさせて頂きます．日程は3月16日-17日で，場所はIBM東京基礎研究所です．皆様のご参加をお待ちしております．なお，入館手続きをスムーズに行うため，参加予定の方は事前連絡をお願いします．（当日の飛び入り参加も可能ですが，入館に時間がかかる可能性があります．）また，3月16日の研究会終了後には懇親会を予定しております．参加希望者はあわせて出席予定をお知らせ下さい． -------- To: kawatiya <at> jp.ibm.com Subject: PRO83参加予定第83回PRO研究会に出席します． (↓どちらかを消して下さい) 3月16日の懇親会に参加します． 3月16日の懇親会に参加しません．御名前: 御所属: -------- 最新情報は下記ページに掲示されますのでご確認ください． http://millsmess.cs.uec.ac.jp/pro/2010-5/ 担当：中野圭介(電通大)，河内谷清久仁(日本IBM) ---------------- 第83回プログラミング研究会 (PRO-2010-5) 日程：2011年 3月 16日(水)・17日(木) 場所：日本アイ・ビー・エム（株）東京基礎研究所　　　〒242-8502 神奈川県大和市下鶴間1623-14 　　　東急田園都市線つきみ野駅から徒歩10分，または　　　小田急江ノ島線／東急田園都市線中央林間駅より徒歩12分　　　(交通ガイド http://www.trl.ibm.com/lab/trlmap.htm) ---------------- [プログラム] 2011/03/16 (水) 9:10 - 9:55 (1) Rubyの文字列処理の手軽な高速化 ○中川博貴 (東京大学) 笹田耕一 (東京大学) 9:55 - 10:40 (2) 大規模主記憶環境における GC 方式の性能評価 ○井出真広 (横浜国立大学) 養安元気 (横浜国立大学) 倉光君郎 (横浜国立大学) 10:40 - 11:25 (3) 要求駆動型部分無用コード除去 ○滝本宗宏 (東京理科大学) (昼食) 12:45 - 13:30 (4) 分散メモリアーキテクチャ向けFuceランタイムシステムとその上でのストリーム処理の評価 ○雨宮聡史 (九州大学) 雨宮真人 (大阪工業大学) 13:30 - 14:15 (5) メモ化表へのプリフェッチによるPackrat Parserの並列化 ○遠藤仁 (筑波大学) 前田敦司 (筑波大学) 山口喜教 (筑波大学) 14:15 - 15:00 (6) 正規表現マッチングの並列化とそのHadoopでの評価 ○松崎公紀 (高知工科大学) 江本健斗 (東京大学) 劉雨 (総合研究大学院大学) (休憩) 15:10 - 15:55 (7) CNFSATからHornSATへの変換手法について ○小林弘二 (フリー) 15:55 - 16:40 (8) 証明支援系Coqのプログラムに対する対話的修正機構の提案 ○森口草介 (東京工業大学) 渡部卓雄 (東京工業大学) 16:40 - 16:50 CS領域奨励賞授与式 18:30 - 21:00 懇親会 ---------------- 2011/03/17 (木) 9:10 - 9:55 (9) サーバ・クライアント処理の動的分割・再配置機能を備えた Webアプリケーション用言語 ○石橋崇 (電気通信大学) 小宮常康 (電気通信大学) 多田好克 (電気通信大学) 9:55 - 10:40 (10) Decidability of Reachability for Right-Shallow Context-Sensitive Term Rewriting Systems ○小島芳治 (名古屋大学) 酒井正彦 (名古屋大学) 西田直樹 (名古屋大学) 草刈圭一朗 (名古屋大学) 坂部俊樹 (名古屋大学) 10:40 - 11:25 (11) Determinization of Conditional Term Rewriting Systems for Program Generation ○長島正憲 (名古屋大学) 酒井正彦 (名古屋大学) 坂部俊樹 (名古屋大学) (昼食) 12:45 - 13:30 (12) Orchid: Webアプリケーションのための安全なコード生成機能を持つプログラミング言語 ○高橋宏文 (筑波大学) 亀山幸義 (筑波大学) 13:30 - 14:15 (13) グラフ書換え言語REGRELによるメタプログラミングの表現 ○東達軌 (東京理科大学) 武田正之 (東京理科大学) 14:15 - 15:00 (14) Practical Implementation of EPLAS: an Epistemic Programming Language for All Scientists ○方文琤 (埼玉大学) Isao Takahashi (埼玉大学) Yuichi Goto (埼玉大学) Jingde Cheng (埼玉大学) (休憩) 15:10 - 15:55 (15) 純粋関数型言語を用いた超コンパクト音声認識デコーダの開発 ○篠崎隆宏 (東京工業大学) 関嶋政和 (東京工業大学) 萩原茂樹 (東京工業大学) 古井貞煕 (東京工業大学) 15:55 - 16:40 (16) 日本語プログラミング言語における関数の多重定義解決の実装と評価 ○馬場祐人 (早稲田大学) 筧捷彦 (早稲田大学)

1 0

【2/25参加締切】 PPL2011 プログラム決定および参加最終案内
by Kiyokuni Kawachiya 23 Feb '11

23 Feb '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊日本IBMの河内谷と申します．この場を借りて，3/9(水)〜3/11(金)に北海道で開催される，第13回プログラミングおよびプログラミング言語ワークショップ (PPL2011) の参加最終案内をさせて頂きたく存じます．参加申込の期限が【2/25(金)】に迫っています．以下からお急ぎください． http://www.info.kochi-tech.ac.jp/ppl2011/registration.html また，プログラムが決定しましたので，お知らせいたします．論文発表が17件，既発表論文の紹介が10件，ポスター・デモ発表が54件です．招待講演として，以下のお二方にご講演いただきます．田中哲朗氏 (東京大学) 「将棋プログラムの大規模並列実行」照井一成氏 (京都大学) 「線形論理とラムダ計算の計算量」非常に充実した内容になっておりますので，ぜひご参加ください． -------------------------------------------------------------------------- 第13回プログラミングおよびプログラミング言語ワークショップ（PPL2011） http://www.info.kochi-tech.ac.jp/ppl2011/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2011年3月9日(水)〜3月11日(金) 会場: 北海道札幌市定山渓ビューホテル http://www.jozankeiview.com/ PPL2011は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表が，カテゴリ別に幅広く行われます．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） -------------------------------------------------------------------------- プログラム発表時間: C1, C2: 質疑応答も含め25分 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1日目 (3月9日(水)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 13:45 - 13:55 オープニング 13:55 - 15:10 (75分) セッション1 (C1) Java における適切な同期機構の選択システム山田佑二, 鵜川始陽, 岩崎英哉 (電気通信大学) (C1) 生存区間を変数名とする中間表現の実装と, それに基づく最適化高橋和将, 森畑明昌, 上野雄大, 大堀淳 (東北大学) (C2) A Study of Java's Non-Java Memory (出典: 25th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA 2010), pp. 191-204, 2010) Kazunori Ogata, Dai Mikurube, Kiyokuni Kawachiya, Scott Trent, Tamiya Onodera (IBM Research) 15:10 - 15:30 休憩 15:30 - 16:30 セッション2 招待講演将棋プログラムの大規模並列実行田中哲朗 (東京大学情報基盤センター) 16:30 - 16:50 休憩 16:50 - 18:30 (100分) セッション3 (C1) 条件論理 Cb とそのタブローシステム尾崎有梨, 戸次大介 (お茶の水女子大学) (C1) 先読み付き正規表現の効率の良いマッチングアルゴリズム森畑明昌 (東北大学) (C1) メタラムダ計算の圏論的意味論増子萌, 戸次大介 (お茶の水女子大学) (C2) A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (出典: 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2011), to appear) Naoki Kobayashi (Tohoku University) 18:30 - 20:30 夕食 20:30 - 22:00 セッション4 (ポスター・デモ1) (C3) ポスター型システムによる高階木変換器の逆像計算塚田武志, 松田一孝 (東北大学) (C3) デモ MoCHi: 高階関数型プログラム用モデル検査器佐藤亮介, 海野広志, 小林直樹 (東北大学) (C3) ポスターオブジェクトを移動させない，関数型言語に適したビットマップマーキングガベージコレクションの提案大友聡顕, 上野雄大, 大堀淳 (東北大学) (C3) ポスター・デモコンパイラ内部機能を利用したプログラム開発環境の構築齋藤啓太, 上野雄大, 大堀淳 (東北大学) (C3) ポスター正規表現マッチングのトランスデューサへの変換佐久間雄和*, 南出靖彦*, Andrei Voronkov** (*筑波大学, **マンチェスター大学) (C3) ポスターコントロールオペレータ control/prompt を用いた nested shift/reset のマクロ表現高島尚希 (筑波大学) (C3) ポスター証明支援系 Coq における対話的修正機構の提案森口草介, 渡部卓雄 (東京工業大学) (C3) ポスター総称型に対応した拡張型緩和織込機構の提案当山学*, 青谷知幸**, 増原英彦* (*東京大学, **北陸先端科学技術大学院大学) (C3) ポスター GPGPU プログラミングのための Ruby 言語処理系西口裕介 (東京大学) (C3) ポスター操作の一意性の推論形式からの自動判定中村宇佑 (東京大学) (C3) ポスタースキーマを持った実行可能なデータ形式大谷桂介 (東京工業大学) (C3) ポスタービジュアルプログラミング言語とプログラム変換吉永卓矢, 脇田建 (東京工業大学) (C3) ポスター構文マクロ定義を利用したプログラム整形システム甫水佳奈子 (東京工業大学) (C3) ポスター分散 JavaScript 言語による Web アプリケーションの効率的な開発加藤真人 (東京工業大学) (C3) ポスタープログラムの更新を可能とする Checkpoint/Restart 機構室井雅仁, 鵜川始陽, 岩崎英哉 (電気通信大学) (C3) ポスター仮想化支援技術を用いた純関数型言語による仮想マシンモニタの設計加藤瞬, 岩崎英哉 (電気通信大学) (C3) ポスター探索アルゴリズムのための非決定性オペレータの実装金子ちひろ, 浅井健一 (お茶の水女子大学) (C3) デモ Emacs における対話的な型デバッガの実装と改良対馬かなえ (お茶の水女子大学) (C3) ポスター部分方向性組み合わせ論理の計算論的性質尾崎博子, 戸次大介 (お茶の水女子大学) (C3) ポスター前提記述のための動的論理の証明論構築に向けて石下裕里, 戸次大介 (お茶の水女子大学) (C3) ポスター階層グラフ書換え言語 LMNtal における管理アトムの処理目黒学, 中川遼平, 上田和紀 (早稲田大学) (C3) ポスターハイブリッドシステムモデリング言語 HydLa の処理系による非決定性の扱い松本翔太*, 高田賢士郎*, 細部博史**, 上田和紀* (*早稲田大学, **国立情報学研究所) (C3) ポスター・デモ OCaml によるスマートフォン向け動的 Web ページの開発事例今井敬吾*, 今井宜洋*, 小笠原啓*, 結縁祥治** (*有限会社ITプランニング，**名古屋大学) (C3) ポスター形式手法を含む言語教育の成果と課題小川清, 斉藤直希 (名古屋市工業研究所) (C3) ポスター例外機構を持つ型付きラムダ計算におけるパラメトリシティ大里陽一, 五十嵐淳, 中澤巧爾 (京都大学) (C3) ポスター多相型と存在型に対する型検査問題の同値性加藤祐輝, 中澤巧爾 (京都大学) (C3) ポスター・デモ Safe アンビエントに基づく分散アプリケーション開発用 Lisp 環境林奉行, 馬谷誠二, 八杉昌宏, 湯淺太一 (京都大学) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2日目 (3月10日(木)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 9:00 - 10:00 セッション5 招待講演線形論理とラムダ計算の計算量照井一成 (京都大学数理解析研究所) 10:00 - 10:20 休憩 10:20 - 12:00 (100分) セッション6 (C1) 基底項書き換え系の多項式時間合流性判定法の改良村井正勝, 青戸等人, 外山芳人 (東北大学) (C1) 多項式サイズ正規形を保証する項書き換えシステムの経路順序磯部耕己, 青戸等人, 外山芳人 (東北大学) (C2) Verification of Tree-Processing Programs via Higher-Order Model Checking (出典: 8th Asian Symposium on Programming Languages and Systems (APLAS 2010), pp. 312-327, 2010) Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi (Tohoku University) (C2) General Bindings and Alpha-Equivalence in Nominal Isabelle (出典: 20th European Symposium on Programming (ESOP 2011), to appear) Christian Urban*, Cezary Kaliszyk** (*TU Munich, **University of Tsukuba) 12:00 - 13:30 昼食 13:30 - 14:45 (75分) セッション7 (C1) A Homomorphism-based Framework for Systematic Parallel Programming with MapReduce Yu Liu*, Zhenjiang Hu** (*The Graduate University for Advanced Studies, **National Institute of Informatics) (C1) 標準 Java 仮想機械上で動的にメンバーの追加を行う機構の提案早船総一郎, 千葉滋 (東京工業大学) (C2) Mostly modular compilation of crosscutting concerns by contextual predicate dispatch (出典: 25th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA 2010), pp. 539-554, 2010) Shigeru Chiba*, Atsushi Igarashi**, Salikh Zakirov* (*Tokyo Institute of Technology, **Kyoto University) 14:45 - 15:10 休憩 15:10 - 16:50 (100分) セッション8 (C1) 模倣に基づくグラフスキーマを利用したビュー更新可能性判定中野圭介*, 日高宗一郎**, 胡振江**, 稲葉一浩**, 加藤弘之** (*電気通信大学, **国立情報学研究所) (C1) An Algebraic Approach to Efficient Parallel Algorithms for Nested Reductions Kento Emoto (University of Tokyo) (C2) Bidirectionalizing Graph Transformations (出典: 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010), pp. 205-216, 2010) Soichiro Hidaka*, Zhenjiang Hu*, Kazuhiro Inaba*, Hiroyuki Kato*, Kazutaka Matsuda**, Keisuke Nakano*** (*National Institute of Informatics, **Tohoku University, ***The University of Electro-Communications) (C2) Calculating Tree Navigation with Symmetric Relational Zipper (出典: 20th ACM SIGPLAN 2011 Workshop on Partial Evaluation and Program Manipulation (PEPM 2011), pp. 101-110, 2011) Yuta Ikeda, Susumu Nishimura (Kyoto University) 16:50 - 17:15 休憩 17:15 - 18:30 (75分) セッション9 (C1) Haskellによる拡張性の高いプレゼンテーション・システム今村悠, 岩崎英哉 (電気通信大学) (C1) 宣言的記述からの関数型言語によるゲームプログラムの導出松島勇介, 上野雄大, 森畑明昌, 大堀淳 (東北大学) (C2) MikiBeta : A General GUI Library for Visualizing Proof Trees --- System Description and Demonstration --- (出典: 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), LNCS, to appear) Kanako Sakurai, Kenichi Asai (Ochanomizu University) 18:30 - 20:30 夕食 20:30 - 22:00 セッション10 (ポスター・デモ2) (C3) ポスター Java 言語のための暗黙的に型定義される構造体大久保貴司, 千葉滋 (東京工業大学) (C3) ポスター IDE を活用した言語機構に頼らないコード再利用のためのモジュール化寺本裕基, 武山文信, 千葉滋 (東京工業大学) (C3) ポスター内部ドメイン専用言語支援のための型に連動した字句・構文ルールの変更機構市川和央, 千葉滋 (東京工業大学) (C3) ポスター機能モジュールの合成コードのより良いモジュール化に向けて武山文信, 千葉滋 (東京工業大学) (C3) ポスター細かい粒度でコードの再利用を可能とするメソッド内メソッドの Java 言語への導入平松俊樹 (東京工業大学) (C3) ポスタープログラム構造に強く依存しないポイントカットの提案伊尾木将之 (東京工業大学) (C3) ポスタープログラムの織り込み関係を可視化するアウトラインビューの提案と実装大谷晃司 (東京工業大学) (C3) ポスター量子プロトコルの形式的検証のための観測同値久保田貴大, 角谷良彦 (東京大学) (C3) ポスター Coq を用いた Hadoop MapReduce アプリケーションの仕様記述とプログラム抽出小野洸亮*, 田辺良則**, 谷幹也***, 中野雄介*, 野田夏子***, 萩谷昌己*, 平井洋一*, 細野繁***, 蒔原省吾* (*東京大学, **国立情報学研究所, ***日本電気株式会社) (C3) ポスター型に場所がついた計算体系木村大輔*, 角谷良彦** (*NII, **東京大学) (C3) ポスターコレクションデータのパターンマッチ江木聡志 (東京大学) (C3) ポスター対称λ計算と古典論理 Reloaded 上田やよい (お茶の水女子大学) (C3) ポスター・デモ AlGoL: プログラミング言語の基礎を学ぶアプリケーションの提案対馬かなえ, 増子萌 (お茶の水女子大学) (C3) ポスター Automatic Parallelization via Matrix Multiplication Shigeyuki Sato, Hideya Iwasaki (The University of Electro-Communications) (C3) ポスター Haskell で記述した仮想マシンモニタの評価大山恵弘, 岩崎英哉 (電気通信大学) (C3) デモ Haskell による拡張性の高いプレゼンテーション・システム今村悠, 岩崎英哉 (電気通信大学) (C3) ポスタースクリプト言語向けスタックベース GC と Lua への実装小室直, 阿部公輝 (電気通信大学) (C3) ポスター・デモ並行処理記述のための DynAlloy の拡張岩塚卓弥, 結縁祥治 (名古屋大学) (C3) ポスター・デモ CONPASU: 記号処理に基づく並行プロセスの状態数削減ツール磯部祥尚 (産業技術総合研究所) (C3) ポスター・デモ OCaml への GADT の導入 Jacques Garrigue, Jacques Le Normand (名古屋大学) (C3) ポスター・デモ制約付き項書換え系における木準同型写像を用いた等価性証明ツール高桑一也, 西田直樹, 大場康司, 酒井正彦, 坂部俊樹, 草刈圭一朗 (名古屋大学) (C3) ポスター・デモ難解言語 Malbolge におけるプログラミング環境の構築と改良長坂哲, 安藤聡, 酒井正彦, 坂部俊樹, 草刈圭一朗, 西田直樹 (名古屋大学) (C3) ポスター・デモ難解言語 Malbolge における高級アセンブリ言語への加算命令の追加安藤聡, 長坂哲, 酒井正彦, 坂部俊樹, 草刈圭一朗, 西田直樹 (名古屋大学) (C3) ポスターモナド的意味論の比較問題について勝股審也 (京都大学) (C3) ポスター確率的オートマトンにおける決定的スケジューラのための非決定的確率的モナド佐藤哲也 (京都大学) (C3) ポスター分離論理を用いた，C 言語プログラムの機械的検証アフェルトレナルド*, 山田聖** (*産業技術総合研究所, **株式会社レピダム) (C3) ポスター Java 経験者を対象とした関数型プログラム学習支援環境の開発佐藤功二, 高田喜朗 (高知工科大学) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 3日目 (3月11日(金)) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 9:00 - 10:15 (75分) セッション11 (C1) 暗に型付けられた関数型言語に対する変数名補完方式の提案後藤拓実, 篠埜功 (芝浦工業大学) (C1) Kide: 開発環境によるオブジェクト指向言語でのアスペクト指向開発の支援金澤圭, 堀江倫大, 千葉滋 (東京工業大学) (C2) EventCJ: A Context-Oriented Programming Language with Declarative Event-based Context Transition (出典: 10th Annual Aspect-Oriented Software Development Conference (AOSD 2011), to appear) Tetsuo Kamina*, Tomoyuki Aotani**, Hidehiko Masuhara* (*University of Tokyo, **Japan Advanced Institute of Science and Technology) 10:15 - 10:40 休憩 10:40 - 11:55 (75分) セッション12 (C1) 名前渡しプロセス計算における優先度ガード結縁祥治, 太田正悟 (名古屋大学) (C1) エフェクトを持つマルチステージ計算体系の型推論小鍛治雄一郎, 亀山幸義 (筑波大学) (C2) Polymorphic Contracts (出典: 20th European Symposium on Programming (ESOP 2011), to appear) Joao Filipe Belo*, Michael Greenberg*, Atsushi Igarashi**, Benjamin C. Pierce* (*University of Pennsylvania, **Kyoto University) 11:55 - 12:20 休憩 12:20 - 13:00 クロージング --------------------------------------------------------------------------

1 0

Registration open: 23rd European Summer School in Logic, Language and Information
by Esslli Ljubljana 22 Feb '11

22 Feb '11

Apologies if you receive multiple copies of this message. Please distribute it to colleagues and students. ****************************************************************************************** CALL FOR PARTICIPATION AT ESSLLI 2011 Meeting: 23rd European Summer School in Logic, Language and Information (ESSLLI) Date: 01-Aug-2011 - 12-Aug-2011 Location: Ljubljana, Slovenia Contact Email: esslli2011(a)gmail.com Meeting URL: http://esslli2011.ijs.si/ Early registration deadline: 31-05-2011 ****************************************************************************************** *Meeting Description* For the past 23 years, the European Summer School in Logic, Language and Information (ESSLLI) has been organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1.5 hours per day during a five days week, with up to seven parallel sessions. ESSLLI also includes a student session (papers and posters by students only, 1.5 hour per day during the two weeks) and four evening lectures by senior scientists in the covered areas. In 2011, ESSLLI will held in Ljubljana, Slovenia and will be organized by the Slovenian Language Technologies Society (SDJT), the Jožef Stefan Institute (IJS) and The Faculty of Mathematics and Physics (FMF) in Ljubljana, Slovenia. Chair of the Program Committee is Makoto Kanazawa (National Institute of Informatics, Japan), and Chair of the Organizing Committee is Darja Fišer (The University of Ljubljana, Slovenia). To contact the ESSLLI 2011 Organizing Committee, write to: esslli2011(a)gmail.com. *Summer School Programme* http://esslli2011.ijs.si/?page_id=897 *Online Registration Form* https://www.kompas-online.net/Pages/MeetingsConferences/Register/RegisterV2… *Programme Committee* Chair: Makoto Kanazawa (National Institute of Informatics, Tokyo) Local Co-chair: Andrej Bauer (University of Ljubljana) Area Specialists: Language and Computation: - Markus Egg (Humboldt-Universität zu Berlin) - Aline Villavicencio (Federal University of Rio Grande do Sul, Brazil) Language and Logic: - Hans-Christian Schmitz (Fraunhofer FIT, Sankt Augustin) - Louise McNally (UPF, Barcelona) Logic and Computation: - Ralph Matthes (IRIT, CNRS and University of Toulouse) - Eric Pacuit (Center for Logic and Philosophy of Science, Tilburg *Organizing Committee* Chair: Darja Fišer (University of Ljubljana) Committee Members: - Špela Vintar (University of Ljubljana) - Andrej Bauer (University of Ljubljana) - Monika Kropej (Jožef Stefan Institute) - Špela Sitar (Jožef Stefan Institute) - Boštjan Bajec (University of Ljubljana) - Senja Pollak (University of Ljubljana) - Mihael Arčan

1 0

CFP: Two Workshops on Continuations
by Yukiyoshi Kameyama 22 Feb '11

22 Feb '11

logic-ml および sonoteno 皆様、 (重複して受け取りの節は御容赦ください) Continuation (継続) に関する2つのワークショップが、5月末および9月下旬に開催されます。 1. RDP (RTA + TLCA) に併設 TPDC 2011: Theory and Practice of Delimited Continuations May 29, 2011, Novi Sad, Serbia http://www.pps.jussieu.fr/~saurin/tpdc2011/ 2. ICFP に併設 CW 2011: ACM SIGPLAN Continuation Workshop 2011 September 24, 2011, Tokyo, Japan http://logic.cs.tsukuba.ac.jp/cw2011/ どちらも、基礎理論(classical logic, type theory)から、プログラム言語の理論/実装、継続の様々な応用(web programming, linguistics etc.)までをカバーするワークショップです。「2」の方は、システムのデモンストレーションの発表も歓迎します。 RDP に行かれる方、あるいは、ICFP に行かれる方は、是非投稿をご検討ください。 CFP は添付ファイルにします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam Call for Papers TPDC 2011 1st International Workshop on Theory and Practice of Delimited Continuations http://www.pps.jussieu.fr/~saurin/tpdc2011/ 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop - Federated Conference on Rewriting, Deduction, and Programming SCOPE AND TOPIC: Since their introduction in the late 1980s, delimited control operators have triggered increasing interest among programmers and the programming language community, found unexpected applications in conceptual domains such as linguistics and constructive mathematics, and shown themselves to be the natural development of classical control operators. The first workshop on the Theory and Practice of Delimited Continuations aims to bring together people working with the many different (practical, theoretical, or foundational) aspects of delimited continuations, in the hope of fostering some unity and progress. Contributions on all topics related to delimited continuations are welcome, as either short abstracts or full papers (see SUBMISSION PROCEDURE below). INVITED SPEAKERS: To be announced IMPORTANT DATES: # Submission of full papers: 25 February 2011 # Submission of short abstracts: 18 March 2011 # Notification of acceptance: 25 March 2011 # Final version due: 8 April 2011 # Workshop: 29-30 May 2011 SUBMISSION PROCEDURE: We accept submissions of two kinds: * short abstracts (1 to 2 pages) * full papers up to 12 pages Short abstracts are proposals for talks within a wide rubric: reports on work-in-progress or recently published papers, surveys or short tutorials, system demonstrations, etc. Full papers must describe new work not under consideration for publication elsewhere. Accepted papers and abstracts will be presented at the workshop and included in the proceedings, published as a technical report. Papers and abstracts should be formatted using the easychair.cls LaTeX class (see http://easychair.org/coolnews.cgi), and may be submitted electronically as pdf files via the easychair website: https://www.easychair.org/login.cgi?conf=tpdc2011 PROGRAM COMMITTEE: Zena Ariola, University of Oregon, USA Dariusz Biernacki, University of Wroclaw, Poland Hugo Herbelin, INRIA, Paris, France Yukiyoshi Kameyama, University of Tsukuba, Japan Alexis Saurin, CNRS, Paris, France Hayo Thielecke, University of Birmingham, UK Noam Zeilberger, Université Paris Diderot, Paris, France WORKSHOP ORGANIZERS: Hugo Herbelin, INRIA, Paris, France Alexis Saurin, CNRS, Paris, France Noam Zeilberger, Université Paris Diderot, Paris, France For more information, please contact Alexis Saurin <saurin(a)pps.jussieu.fr> or Noam Zeilberger <noam(a)pps.jussieu.fr> CW 2011 ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Contributions Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc). Continuation Workshop 2011 will be informal. We aim at accessible presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. The workshop will have no published proceedings; submissions of short abstracts are preferred. We intend to organize a tutorial session on delimited continuations and their main applications, in the evening before the workshop, on Friday, September 23, 2011. Invited speakers ---------------- TBD Important dates --------------- Submission: June 25, 2011 Notification: August 8, 2011 Tutorials: September 23, 2011 Workshop: September 24, 2011 Format ------ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ----- We seek several types of presentations on topics related to continuations. We especially encourage presentations that describe work in progress, outline a future research agenda, or encourage lively discussion. Research presentations on: - implementations of continuations - semantics - type systems and logics - meta-theory and its mechanization - code generation with continuations or effects - distributed programming - systems programming and security - pearls Research presentations must be broadly accessible and should describe new ideas, experimental results, significant advances in the theory or application of continuations, or informed positions regarding new control operators. Application presentations, or status reports These broadly accessible presentations should describe interesting applications of continuations in research, industry or open source. We encourage presentations of applications from areas outside of programming language research -- such as linguistics, logics, AI, computer graphics, operating systems, etc. These presentations need not present original research, but should deliver information that is new or that is unfamiliar to the general ICFP audience. (A broadly accessible version of research presented elsewhere, with the most recent results and more discussion of future work may be acceptable as a CW 2011 status report.) The abstract submission should justify, to a general reader, why an application is interesting. Demos and work-in-progress reports Live demonstrations or presentations of preliminary results are intended to show new developments, interesting prototypes, or work in progress. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes, and a work-in-progress report should take about 5 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Presenters will have to bring all the software and hardware for their demonstration; the workshop organizers are only able to provide a projector.) Submission Guidelines and Instructions -------------------------------------- Unlike the previous Continuation Workshops, we do not require the submission of complete research papers. We will select presentations based on submitted abstracts, up to 2 (A4 or US letter) pages long in the PDF format (with the optional supplementary material, up to 8 PDF pages). Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Email submissions to cw2011-submit(a)logic.cs.tsukuba.ac.jp Organizers ---------- Yukiyoshi Kameyama, University of Tsukuba http://logic.cs.tsukuba.ac.jp/~kam/ Chung-chieh Shan, Rutgers University http://www.cs.rutgers.edu/~ccshan/ Oleg Kiselyov http://okmij.org/ftp/ Program Committee ----------------- Kenichi Asai, Ochanomizu University, Japan http://pllab.is.ocha.ac.jp/~asai/ Malgorzata Biernacka, University of Wroclaw, Poland http://www.ii.uni.wroc.pl/~mabi/ Hugo Herbelin, PPS - pi.r2, INRIA, France http://pauillac.inria.fr/~herbelin/index-eng.html Oleg Kiselyov http://okmij.org/ftp/ Julia Lawall, University of Copenhagen, Denmark http://www.diku.dk/~julia Tiark Rompf, EPFL, Switzerland Chung-chieh Shan, Rutgers University (Chair) http://www.cs.rutgers.edu/~ccshan/ Hayo Thielecke, University of Birmingham, UK http://www.cs.bham.ac.uk/~hxt Previous Workshops ------------------ ACM SIGPLAN Continuation Workshop (CW'04) http://www.cs.bham.ac.uk/~hxt/cw04/index.html ACM SIGPLAN Workshop on Continuations (CW'01) http://www.cs.indiana.edu/~sabry/cw01/ ACM SIGPLAN Workshop on Continuations (CW'97) http://www.brics.dk/~cw97/ Continuation Fest 2008 http://logic.cs.tsukuba.ac.jp/~kam/Continuation2008/

1 0

Talk by Ryu Hasegawa at RIMS, Kyoto U. (2/24)
by Kazushige TERUI 21 Feb '11

21 Feb '11

みなさま今週木曜日に催されるセミナーのご案内をさせていただきます。どうぞお気軽にお越しください。照井 --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: 長谷川立 (東京大学) Title: Combinatorial enumeration model を用いた Church-Rosser 性の証明 Date: 11.00 - 12.00, Februrary 24th (Thu) Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Combinatorial enumeration model は, Joyal-Girard による解析関手を用いたラムダ計算のモデルのことであり, ここではそれを線形論理のモデルに改変したものを指している. ある意味で数え上げの個数を与えており, その事実を用いたシンプルな解析を可能にしている。ここでは, linear category 上に構成された計算体系 LC の Church-Rosser 性の証明に, このモデルを応用する技術を紹介する。 ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

「証明論の展開とその哲学」シンポジウム
by Mitsuhiro Okada 18 Feb '11

18 Feb '11

次の会合の案内をこのメールリストに投稿させていただきます。　慶応大哲学　岡田光弘 ================================================================= PROOF THEORY AND PHILOSOPHY 「証明論の展開とその哲学」シンポジウム Feb 26th, 2011, Tokyo, Keio University, Mita Campus 2011年2月26日(土) 慶應義塾大学三田キャンパス ================================================================== 本研究会の目的：現代論理、特に証明論に源泉を持ち、Hilbert, Gödel, Friedman, Girardらによって議論されたテーマのいくつかについて、その技術的概観とともに哲学的観点を検討する。 The purpose of this Meeting is to discuss issues presented in various new fields derived from proof theory, initiated by Hilbert, Gëdel, Friedman, Girard and others, from the philosophical point of view as well as from the technical point of view. 日時：　22011年月26日(土)　午後１３時ー１８時Ｄａｔｅ&Ｔｉｍｅ:: Feb 26th, 2011, 13:00pm-18:00pm 場所: 慶應義塾大学三田キャンパス東館6階 G-Sec Lab Place: G-Sec Lab, 6th floor of the East Building, the Mita Campus, Keio University (5 minutes walk from JR-Tamachi, Subway Mita or Akabanebashi) 参加自由、無料です。 URL: http://abelard.flet.keio.ac.jp/ptp11/ （abstracts情報はここを参照ください） =========================================================================- なお、この集会の直前の２月２４－２５日にFormal Ontology Meetingが開催されます。 http://abelard.flet.keio.ac.jp/seminar/oam11.html　（事前電子登録推奨） ========================================================================== "Proof Theory and Philosophy" Program 1. 13:00-14:00 Richard Zach (University of Calgary, Department of Philosophy) “Gëdel’s First Incompleteness Theorem and Mathematical Instrumentalism” (14:00-14:15 coffee) 2. 14:15-15:15 Ryo Takemura (Keio University) “Proof theory for reasoning with Euler diagrams” (15:15-15:30 coffee) 3. 15:30-16:30 Sam Sanders (Tohoku University) “Reverse Mathematics & Non-Standard Analysis: WHY SOME THEOREMS ARE MORE EQUAL THAN OTHERS” (16:30-16:45 coffee) 4. 16:45-17:45 Michele Basaldella (Kyoto University) “A gentle introduction to ludics” 17:45-18:00 Concluding discussion 18:00 End of the Meeting ----- 本集会は慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンターとグローバルＣＯＥ「論理と感性の先端的教育研究拠点」の共催集会です。 Organizing Committee Ryoto Akiyoshi Mitsu Okada (responsible) Yutaro Sugimoto 問い合わせ先: 慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンター事務局住所: 東京都港区三田2-15-45 TEL: 03-3453-4511 (内線23847) E-Mail: interontology[AT]abelard.flet.keio.ac.jp 最新情報は URL: http://abelard.flet.keio.ac.jp/ptp11/ をご参照ください。 -----------------------------------------------------------------------------------------------

1 0

[TACL 2011] Second call for papers
by tacl2011＠lif.univ-mrs.fr 17 Feb '11

17 Feb '11

[Apologies for multiple copies] =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) II call for papers =============================================================================== 26-30 July 2011 Universités Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theoryfile:///home/lsantoca/public_html/tacl2011/IIcallforpapers.txt * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic List of speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Università degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. The program committee specially encourages submissions related to the work of Leo Esakia, and may select some of these submission for presentation at the special session. Submissions ----------- Contributed presentations will be of two types: * standard presentations of 20 minutes in parallel sessions, * featured, 30 minutes long, plenary presentations. The submission of an extended abstract in pdf format will be required to be selected for a contributed presentation of either kind. Concerning the standard presentations, while preference will be given to new work, results that have already been published or presented elsewhere will also be considered. Concerning the featured presentations: the program committee will choose a small number of submissions of which the authors will be invited to give a plenary presentation. The criteria for this selection will be: originality, significance and interest to the wider TACL community. There will be just one submission procedure, for contributed presentations of either kind: authors are requested to submit a short text of four pages, in English and in pdf format, through the easychair submission site: https://www.easychair.org/conferences/?conf=tacl2011 Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Università degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Université Aix-Marseille II Tadeusz Litak, University of Leicester Paul-André Melliès, CNRS Paris Diderot George Metcalfe, Universität Bern Nicola Olivetti, Université Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Université Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Université de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011(a)lif.univ-mrs.fr ===============================================================================

1 0

オントロジー会議(Ontology Meeting)２月２４−２５日(Feb 24-25th), Keio University, Tokyo
by Mitsuhiro Okada 15 Feb '11

15 Feb '11

論理、計算科学、数学のオントロジーの講演を含む学際集会です。本メーリングリストに投稿させていただきます。　慶応大哲学　岡田光弘 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ONTOLOGY Meeting, Feb 24th-25th, 2011, Tokyo, Keio University, Mita Campus オントロジー研究集会 2011年2月24-25日慶應義塾大学三田キャンパス主催：慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンター Roberto Casati教授 (影のオントロジー)，Barry Smith教授 (痛みのオントロジー，文書のオントロジー) らの講演をはじめとして，analytic metaphysics，ontologyの基礎的諸問題や論理的側面などを議論します．論理学，計算機科学，数学などの観点を含むオントロジーの討論も予定されています．(プログラムは以下に掲載) 参加自由，無料です．　 The purpose of this Meeting is to discuss some fundamental issues on ontology from various points of views including analytic metaphysics, logic, phenomenology, computing science and mathematics. ------------------------------------------------------------------------ *日時 / Date:* 2011年2月24日 -- 25日 / Feb 24th -- Feb 25th, 2011 *場所 / Place:* 6th Floor (G-SEC Lab), East Building, the Mita Campus, Keio University / 慶應義塾大学三田キャンパス東館6F G-SEC Lab *公式ページURL / Official Page URL:* http://abelard.flet.keio.ac.jp/oam11/ ------------------------------------------------------------------------ (この他に今月(2月)の研究会として，2月10-11日に「数学の哲学の現在」研究会 <http://abelard.flet.keio.ac.jp/pom11/>が予定されております．) ------------------------------------------------------------------------ 参加自由です．ただし，会場の設定や予稿集(無料)の準備のため，できる限り下記の登録ページで電子登録をお願いしております． Free for participation. Please register here in order to ensure receiving your copy of the proceedings volume upon your arrival at the Meeting site: https://abelard.flet.keio.ac.jp/oam11/registration.html ------------------------------------------------------------------------ The PROGRAM: 2月24日 (Feb 24th) *13:00* Smith (Department of Philosophy, State University of new York at Buffalo, and National Center for Ontological Research) “The Ontology of Documents” *14:00* Break *14:30* Daisuke Kachi (Philosopy, Saitama University) “The Power of Holes” *15:30* Takashi Iida (Philosophy Department, Nihon University) “On the Contingency of Some Abstract Objects” *16:10* Break *16:30* Roberto Casati (Institut Jean Nicod Ecole Normale Superieure, Paris) “Shadow lessons: competition between ontologies for dependent entities” *18:10* Reception Party at Chuugoku Hanten (中国飯店 : Restaurant near the Mita Campus) (Free for participation 参加自由無料です) 2月25日 (Feb 25th) *10:00* Barry Smith (Department of Philosophy, State University of new York at Buffalo, and National Center for Ontological Research) “The Ontology of Pains” *11:00* Break *11:20* Takeshi Akiba (Keio University) “On the ontological basis of predication” *12:00* Lunch Break *13:30* Sungho Choi (Philosophy at Kyung Hee University, Seoul, Korea) “Is fragility an intrinsic disposition?” *14:30* Tora Koyama (Osaka University) “Modal Realism and Metaontology” *15:10* Break *15:30* Sam Sanders (Tohoku University) “Reverse mathematics and non-standard analysis; a treasure trove for the philosophy of science” *16:30* Hiroyuki Miyoshi (Department of Mathematics, Kyoto Sangyo University) “Ontology and Epistemology from Computational Phenomena” *17:30* Concluding discussions *18:00* End of the Meeting 問い合わせ先: 慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンター事務局住所: 東京都港区三田2-15-45 TEL: 03-3453-4511 (内線23847) E-Mail: interontology[AT]abelard.flet.keio.ac.jp なお，セミナーの最新の情報は以下の公式ページに掲示する予定です． http://abelard.flet.keio.ac.jp/oam11/ ------------------------------------------------------------------------ /This document was translated from L^A T_E X by //H//^E //V//^E //A/ <http://hevea.inria.fr/index.html>/./

1 0

Fw: PLS8 - SECOND CALL FOR PAPERS
by Suzuki, Nobu-Yuki 14 Feb '11

14 Feb '11

皆さま静岡大学理学部数学科の鈴木信行と申します。以下のような案内が来ましたので、お知らせします。重複して受け取られた方には、ご寛恕を賜りますようお願いいたします。 -----------------------転送元のメール----------------------- From: Christos Nomikos <cnomikos(a)cs.uoi.gr> To: pls8(a)cs.uoi.gr Cc: cnomikos(a)cs.uoi.gr Subject: PLS8 - SECOND CALL FOR PAPERS Date: Tue, 15 Feb 2011 08:46:41 +0900 ******************************************************************************* ******************************************************************************* *** *** *** T H E 8 T H P A N H E L L E N I C L O G I C S Y M P O S I U M *** *** J u l y 4 - 8 , 2 0 1 1 *** *** I o a n n i n a, G r e e c e *** *** *** *** www.cs.uoi.gr/~pls8/ *** *** *** ******************************************************************************* ******************************************************************************* CALL FOR PAPERS HISTORY OF THE SYMPOSIUM The Panhellenic Logic Symposium, a biennial scientific event established in 1997, aims to promote interaction and cross-fertilization among different areas of logic. Originally conceived as a way of bringing together the many logicians of Hellenic descent throughout the world, it has evolved into an international forum for the communication of state-of-the-art advances in logic. The symposium is open to researchers worldwide who work in logic broadly conceived. The Eighth Panhellenic Logic Symposium will be hosted by the Department of Computer Science at the University of Ioannina. PROGRAM OF THE SYMPOSIUM The scientific program of the symposium will consist of one-hour long invited talks, three-hour long tutorials, and twenty-five-minute presentations of accepted contributed papers. There will also be special opportunities for students to give short talks, and receive comments on work in progress. INVITED TUTORIALS - Jeremy Avigad (Carnegie Mellon, USA) - Dale Miller (INRIA, France) - Simon Thomas (Rutgers, USA) INVITED SPEAKERS - George Barmpalias (University of Amsterdam, Netherlands) - Ozlem Beyarslan (Bogazici University, Turkey) - Michael Rathjen (University of Leeds, UK) - Nicole Schweikardt (Goethe University, Germany) - Athanassios Tzouvaras (University of Thessaloniki, Greece) CALL FOR PAPERS Original papers that fall within the scope of the symposium are solicited. Prospective speakers of twenty-five-minute presentations are invited to submit an extended abstract, in English, not exceeding five pages, by 25 March 2011. Papers should be prepared using the EasyChair class style (available from http://www.easychair.org/coolnews.cgi) and submitted electronically, using the Easy Chair conference system, at http://www.easychair.org/conferences/?conf=pls8 If possible, each submitted paper should be classified in one of the following areas (in alphabetical order): - Algebraic and Categorical Methods in Logic - Computability Theory - History and Philosophy of Logic - Logic in Computer Science - Model Theory - Nonclassical and Modal Logics - Proof Theory - Set Theory All submitted papers will be reviewed by the scientific committee of the symposium, who will make final decisions on acceptance or rejection. During the symposium, each accepted paper will be presented by one of its authors, with five extra minutes for questions. Authors of submitted papers will be notified of the decision by early May 2011. Camera-ready extended abstracts will be due by the end of May for inclusion in the symposium proceedings which will be distributed to all participants. IMPORTANT DATES: - Abstract Submission Deadline: March 25, 2011 - Acceptance Notification: May 7, 2011 - Camera Ready Papers Deadline: May 31, 2011 - Conference Dates: July 4-8, 2011 SCIENTIFIC COMMITTEE - Ayse Berkman (Middle East Technical University) - Costas Dimitracopoulos (University of Athens) - Kostas Hatzikiriakou (University of Thessaly) - Antonis Kakas (University of Cyprus) - Panagis Karazeris (University of Patras) - Phokion Kolaitis (University of California, Santa Cruz and IBM Research-Almaden) - George Koletsos (National Technical University of Athens ) - Joan Moschovakis (Occidental College (retired), Chair of SC) - Christos Nomikos (University of Ioannina) - Itay Neeman (University of California, Los Angeles) - Thanases Pheidas (University of Crete) - Alexandra Soskova (Sofia University) - Constantine Tsinakis (Vanderbilt University) - Stathis Zachos (National Technical University of Athens ) ORGANIZING COMMITTEE - Manolis Gergatsoulis (Ionian University) - Spyros Kontogiannis (University of Ioannina) - Costas Koutras (University of Peloponnese) - Christos Nomikos (University of Ioannina, chair of the OC) - Panos Rondogiannis (University of Athens) SYMPOSIUM WEBPAGE www.cs.uoi.gr/~pls8/ CONTACT Joan Moschovakis (Chair of the Scientific Committee) e-mail: joan(a)math.ucla.edu Christos Nomikos (Chair of the Organizing Committee) address: University of Ioannina Department of Computer Science P.O. Box 1186 45110, Ioannina Greece tel: +30 26510 08815 fax: +30 26510 08895 e-mail: cnomikos(a)cs.uoi.gr pls8(a)zeus.cs.uoi.gr

1 0

Fw: Second International Conference on Order, Algebra, and Logics (3rd announcement)
by Suzuki, Nobu-Yuki 13 Feb '11

13 Feb '11

皆さま静岡大学理学部数学科の鈴木信行と申します。以下のような案内が来ましたので、お知らせします。重複して受け取られた方には、ご寛恕をお願いいたします。 -----------------------転送元のメール----------------------- From: Order Algebra Logic <Order.Algebra.Logic(a)tcs.uj.edu.pl> To: smnsuzu(a)ipc.shizuoka.ac.jp Subject: Second International Conference on Order, Algebra, and Logics (3rd announcement) Date: Mon, 14 Feb 2011 08:15:01 +0900 ==================================================================== THIRD ANNOUNCEMENT ==================================================================== SECOND INTERNATIONAL CONFERENCE ON ORDER ALGEBRA AND LOGICS (Honoring Ralph McKenzie, Hiroakira Ono, and Andrzej Wronski on the occasion of their 70th Birthdays) June 6-10, 2011, Krakow, POLAND ==================================================================== The organizers of the 2nd OAL conference in Cracow kindly inform the following: The conference website http://2oal.tcs.uj.edu.pl contains up to date information about the conference, including how - to register: http://2oal.tcs.uj.edu.pl/register.html and - to submit an abstract of a proposed talk: http://2oal.tcs.uj.edu.pl/submissions.html With kind regards, Marcin Kozik /on behalf of the organizers/

1 0

Second International Conference on Order, Algebra, and Logics (3rd announcement)
by Order Algebra Logic 11 Feb '11

11 Feb '11

==================================================================== THIRD ANNOUNCEMENT ==================================================================== SECOND INTERNATIONAL CONFERENCE ON ORDER ALGEBRA AND LOGICS (Honoring Ralph McKenzie, Hiroakira Ono, and Andrzej Wronski on the occasion of their 70th Birthdays) June 6-10, 2011, Krakow, POLAND ==================================================================== The organizers of the 2nd OAL conference in Cracow kindly inform the following: The conference website http://2oal.tcs.uj.edu.pl contains up to date information about the conference, including how - to register: http://2oal.tcs.uj.edu.pl/register.html and - to submit an abstract of a proposed talk: http://2oal.tcs.uj.edu.pl/submissions.html With kind regards, Marcin Kozik /on behalf of the organizers/

1 0

第24回量子情報技術研究会（QIT24）のご案内
by Harumichi Nishimura 10 Feb '11

10 Feb '11

logic-mlの皆様，第24回量子情報技術研究会（QIT24）の案内について，世話人からの依頼投稿をさせていただきます．なお，重複してお受け取りの節はご容赦ください．大阪府立大学理学系研究科西村治道 http://www.mi.s.osakafu-u.ac.jp/~hnishimura/ ============================================================== 各位この場をお借りしまして，第24回量子情報技術研究会（QIT24）についてご案内させていただきます．周囲の方々にご周知いただければ幸いです．なお，口頭発表申込締切は 2011年 3月3日（木）となっております．何かご不明な点などございましたら，QIT24世話人 (qit24(a)ngc.is.ritsumei.ac.jp) までお尋ねください． QIT24世話人細谷暁夫（東京工業大学理工学研究科基礎物理学専攻）山下茂（立命館大学情報理工学部情報システム学科）河内亮周（東京工業大学情報理工学研究科数理・計算科学専攻） ============================================================== 第24回量子情報技術研究会のご案内研究会の内容情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究と，そこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．第24回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表，聴講を募集致します．奮ってご参加ください．期日　2011年 5月12日（木）, 13日（金）会場　東京工業大学西９号館ディジタル多目的ホール（〒152-0033 東京都目黒区大岡山東京工業大学大岡山キャンパス内）発表募集内容発表募集分野（申込状況によっては査読可能性あり）：量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，およびその関連分野招待講演： Aephraim M. Steinberg氏 (CQIQC) 佐藤文隆氏 (甲南大学) 蔡兆申氏 (理研/NEC) 定員　200名程度参加費　事前振込み　一般5,000円, 学生1,000円 (当日会場払いは一般6,000円, 学生2,000円) (懇親会は別途）研究会参加申込要領講演(口頭・ポスター)申込，聴講申込は下記URLにて受付を行います http://staff.aist.go.jp/s-kawabata/qit/ 【講演申込締切】 2011年 3月 3日（木）口頭 2011年 4月 1日（金）ポスター【参加申込締切】 2011年 4月15日（金）【世話人】細谷暁夫（東京工業大学理工学研究科基礎物理学専攻）山下茂（立命館大学情報理工学部情報システム学科）河内亮周（東京工業大学情報理工学研究科数理・計算科学専攻） e-mail: qit24(a)ngc.is.ritsumei.ac.jp 主催　量子情報技術時限研究専門委員会 (委員長　北川勝浩(大阪大学)) 共催　応用物理学会量子エレクトロニクス研究会

1 0

BLAST 2011
by No-Reply 09 Feb '11

09 Feb '11

BLAST 2011 June 1-5, 2011 Lawrence, Kansas http://www.math.ku.edu/conferences/blast2011/ BLAST (Boolean algebras, Lattices, Algebraic logic, Set theory, and Topology; quantum logic and point-free topology have been added to the mix) is a series of annual conferences. The first three BLAST conferences were at the University of Denver, New Mexico State University, and the University of Colorado in Boulder. Go to the BLAST 2011 website for complete details. Invited Talks * Themba Dube (University of South Africa) * Todd Eisworth (Ohio University) * Christian Herrmann (Technische Universitat Darmstadt) * Albin Jones (National Security Agency) * Milos Kurilic (University of Novi Sad) * Keye Martin (Naval Research Laboratory) * Jorge Martinez (University of Florida) * Paul Szeptycki (York University) Tutorials * Magdalena Grzech (Cracow University of Technology) * Pieter Hofstra (University of Ottawa) * Marion Scheepers (Boise State University) * Stevo Todorcevic (University of Toronto) A limited amount of financial support is available for graduate students and recent Ph.D.'s. To apply for support, send an email of request to the conference organizers. The conference organizers can be contacted at blast2011(a)math.ku.edu. A printable version of this flyer is available for download here: http://www.math.ku.edu/conferences/blast2011/announcement-flyer.pdf

1 0

[PPDP'11] Call for Papers
by Kazunori UEDA 08 Feb '11

08 Feb '11

メーリングリストをお借りして、PPDP'10 の論文募集をお送りします。論文締切は３月１５日（アブストラクトは８日）です。上田和紀＠早稲田大学 ====================================================================== CALL FOR PAPERS PPDP 2011 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www-ps.informatik.uni-kiel.de/ppdp11/ July 20-22, 2011, Odense, Denmark (in cooperation with ACM SIGPLAN, co-located with LOPSTR 2011) ====================================================================== PPDP 2011 aims to provide a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will held in cooperation with ACM SIGPLAN and take place in July 2011 in Odense, Denmark, co-located with the 21st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011). TOPICS: - Logic, Constraint, and Functional Programming - Database, AI and Knowledge Representation Languages - Visual Programming - Executable Specification Languages - Applications of Declarative Programming - Methodologies: Program Design and Development - Declarative Aspects of Object-Oriented Programming - Concurrent Extensions to Declarative Languages - Declarative Mobile Computing - Integration of Paradigms - Proof Theoretic and Semantic Foundations - Type and Module Systems - Program Analysis and Verification - Program Transformation - Abstract Machines and Compilation - Programming Environments This list is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. IMPORTANT DATES: Abstract submission: March 8, 2011 Paper submission: March 15, 2011 Notification: April 19, 2011 Camera-ready version: May 12, 2011 Symposium: July 20-22, 2011 SUBMISSION GUIDELINES: Papers should be submitted via the submission website for PPDP 2011: http://www.easychair.org/conferences/?conf=ppdp11 Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. PROCEEDINGS: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. PROGRAM COMMITTEE: Peter Achten Radboud University Nijmegen, The Netherlands Sergio Antoy Portland State University, USA Michael Codish Ben-Gurion University of the Negev, Israel Moreno Falaschi Universita di Siena, Italy Amy Felty University of Ottawa, Canada Michael Hanus University of Kiel, Germany (Chair) Andy King University of Kent, UK Helene Kirchner INRIA, France Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Salvador Lucas Universidad Politecnica de Valencia, Spain Simon Peyton Jones Microsoft Research, Cambridge, UK Kostis Sagonas Uppsala University, Sweden Peter Schneider-Kamp University of Southern Denmark, Denmark Doaitse Swierstra Utrecht University, The Netherlands Paul Tarau University of North Texas, USA Peter Thiemann University of Freiburg, Germany Kazunori Ueda Waseda University, Japan Tarmo Uustalu Tallinn University of Technology, Estonia Peter Van Roy Catholic University of Louvain, Belgium For more information, contact the chairs: Program Chair: Michael Hanus University of Kiel, Germany Email: mh(a)informatik.uni-kiel.de Symposium Chair: Peter Schneider-Kamp University of Southern Denmark Email: petersk(a)imada.sdu.dk ----------------------------------------------------------------------

1 0

CALCO 2011: Last Call for Papers
by Ichiro Hasuo 02 Feb '11

02 Feb '11

みなさま，国際会議 CALCO のご案内です．プロセス代数，代数的仕様，余代数，項書換え，様相論理など幅広いトピックが対象です．ぜひ投稿をご検討ください．招待講演者も豪華です！！蓮尾一郎京都大学数理解析研究所 ========================================================================= !! LAST CALL FOR PAPERS: CALCO 2011 !! 4th International Conference on Algebra and Coalgebra in Computer Science August 29 - September 2, 2011 Winchester, UK http://calco2011.ecs.soton.ac.uk/ ========================================================================= Abstract submission: February 6, 2011 Paper submission: February 13, 2011 Author notification: April 20, 2011 Final version due: May 18, 2011 ========================================================================= -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. This is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will be held in the city of Winchester (England), a historic cathedral city and the ancient capital of Wessex and the Kingdom of England. -- INVITED SPEAKERS -- Vincent Danos (UK) Javier Esparza (Germany) Philippa Gardner (UK) Gopal Gupta (USA) -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is also being planned. -- IMPORTANT DATES -- Abstract submission: February 6, 2011 Paper submission: February 13, 2011 Author notification: April 20, 2011 Final version due: May 18, 2011 -- PROGRAMME COMMITTEE -- Jiri Adamek (Technical University of Braunschweig, Germany) Lars Birkedal (IT University of Copenhagen, Denmark) Filippo Bonchi (INRIA Saclay, France) Corina Cirstea (University of Southampton, UK) Andrea Corradini (co-chair, University of Pisa, Italy) Maribel Fernandez (King's College London, UK) Jose Fiadeiro (University of Leicester, UK) H. Peter Gumm (Philipps University Marburg, UK) Ichiro Hasuo (Kyoto University, Japan) Bart Jacobs (Radboud University Nijmegen, The Netherlands) Bartek Klin (co-chair, University of Warsaw, Poland) Barbara Koenig (University of Duisburg-Essen, Germany) Alexander Kurz (University of Leicester, UK) Marina Lenisa (University of Udine, Italy) Jose Meseguer (University of Illinois, Urbana-Champaign, USA) Ugo Montanari (University of Pisa, Italy) Larry Moss (Indiana University, Bloomington, USA) Till Mossakowski (DFKI Lab Bremen and University of Bremen, Germany) Catuscia Palamidessi (INRIA Saclay, France) Dusko Pavlovic (Kestrel Institute, USA) John Power (University of Bath, UK) Jan Rutten (CWI and Radboud University Nijmegen, The Netherlands) Sam Staton (University of Cambridge, UK) Lutz Schroeder (DFKI Lab Bremen and University of Bremen, Germany) Andrzej Tarlecki (Warsaw University, Poland) Yde Venema (University of Amsterdam, The Netherlands) Martin Wirsing (Ludwig-Maximilians-University Munich, Germany) -- ORGANISING COMMITTEE -- Corina Cirstea (University of Southampton, UK) Dirk Pattinson (Imperial College London, UK) Toby Wilkinson (University of Southampton, UK) -- LOCATION -- Winchester is a beautiful historic city in southern England, known for its 11th-century cathedral and 12th-century castle. It is located just under an hour by rail from London Waterloo, and 15 minutes by road or rail from Southampton Airport. London Heathrow is 50 miles away and London Gatwick 72 miles away. -- SATELLITE WORKSHOPS -- CALCO 2011 will be preceded by the CALCO Young Researchers Workshop, CALCO-Jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO-Tools, will be held on the same dates as the main CALCO conference. There are separate submission procedures for CALCO-Jnr and CALCO-Tools. -- CALCO-Jnr Overview -- The CALCO Young Researchers Workshop invites submissions on the same topics as the CALCO conference. CALCO-Jnr presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page abstracts. After the workshop, the author(s) of each presentation will be invited to submit a full 10-15 page paper on the same topic. Following additional reviewing, selected papers will be published as a technical report. http://calco2011.ecs.soton.ac.uk/workshops/calco-jnr.html -- CALCO-Jnr Dates -- Abstract submission: May 8, 2011 Author notification: May 30, 2011 Final version due: June 30, 2011 -- CALCO-Jnr Programme Committee -- Corina Cirstea (University of Southampton, UK) Magne Haveraaen (University of Bergen, Norway) John Power (University of Bath, UK) Monika Seisenberger (chair, Swansea University, UK) Toby Wilkinson (University of Southampton, UK) -- CALCO-Tools Overview -- CALCO-Tools will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. Topics of interest include systems/prototypes/tools developed specifically for the design, checking, execution, and verification of (co)algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. Tool submissions should not exceed 5 pages in LNCS format. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission. http://calco2011.ecs.soton.ac.uk/workshops/calco-tools.html -- CALCO-Tools Dates -- Paper submission: March 23, 2011 Author notification: April 20, 2011 Final version due: May 18, 2011 -- CALCO-Tools Programme Committee -- Paolo Baldan (University of Padova, Italy) Luis Barbosa (University of Minho, Portugal) Dorel Lucanu (chair, Al. I. Cuza University of Iasi, Romania) Milad Niqui (CWI, Amsterdam, The Netherlands) Peter Olveczky (University of Oslo, Norway) Dirk Pattinson (Imperial College London, UK) -- FURTHER INFORMATION -- Queries related to submission, reviewing, and programme should be sent to the relevant PC chairs. Queries related to the organisation should be emailed to calco2011(a)ecs.soton.ac.uk .

1 0

PPL2011（3月＠北海道），ポスター・デモ発表募集および参加登録開始のお知らせ
by Kiyokuni Kawachiya 31 Jan '11

31 Jan '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊日本IBMの河内谷と申します．この場を借りて，来年３月に北海道で開催される，第13回プログラミングおよびプログラミング言語ワークショップ (PPL2011) のご案内を再度させて頂きたく存じます．参加登録ページがオープンしました． http://www.info.kochi-tech.ac.jp/ppl2011/registration.html 参加ご希望の方は説明をお読みの上，2/25(金)までに登録をお願いいたします．また，カテゴリ３（ポスター・デモ発表）の申込締切が，一週間後の2/7(月)に迫っております．こちらにも奮ってご応募ください． -------------------------------------------------------------------------- 第13回プログラミングおよびプログラミング言語ワークショップ（PPL2011） http://www.info.kochi-tech.ac.jp/ppl2011/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2011年3月9日(水)〜3月11日(金) 会場: 北海道札幌市定山渓ビューホテル http://www.jozankeiview.com/ PPL2011は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） ※ 今回はショートプレゼンテーションは行いませんカテゴリ１の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションに発表賞（一般の部，学生の部）を授与する予定です．カテゴリ１（国内外未発表論文） ------------------------------ （投稿受付は終了しました）カテゴリ２（国外既発表論文） ---------------------------- （投稿受付は終了しました）カテゴリ３（ポスター・デモ発表） -------------------------------- ２時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．なお，PPL2011ではポスターやデモによる活発な意見交換を促進したいという観点から，ショートプレゼンテーションのセッションは設けません．招待講演 -------- 以下の２件の招待講演が予定されています．田中哲朗氏 (東京大学) 講演タイトル(予定)「将棋プログラムの大規模並列実行」照井一成氏 (京都大学) 講演タイトル(予定)「Linear logic and implicit computational complexity」 ====================================================================== 投稿・発表申込要領３つのカテゴリそれぞれに対して，投稿は以下のように行って下さい．最新の情報は上記Webページでご確認下さい．なお，PPL2011では，発表者の希望により発表の様子をインターネットでストリーミング放映することを検討しております．カテゴリ１（国内外未発表論文） ------------------------------ （投稿受付は終了しました）カテゴリ２（国外既発表論文） ---------------------------- （投稿受付は終了しました）カテゴリ３（ポスター・デモ発表） ------------------------------------------ 発表申込先：submission-ppl2011(a)pllab.is.ocha.ac.jp 発表申込締切：2011年2月7日(月) 著者名，所属，発表タイトル，発表概要（200〜300字程度），希望する発表形態（ポスター・デモの別），をテキスト形式で上記申込先宛にお送り下さい．申込後，翌日までに受付確認が届かない場合は，下記問い合わせ先までご連絡下さい．採否通知：2011年2月14日(月) 問い合わせ先：organizers-ppl2011(a)pllab.is.ocha.ac.jp ====================================================================== プログラム委員会浅井健一 (お茶の水女子大学) 磯部祥尚 (産業技術総合研究所) 稲葉一浩 (国立情報学研究所) 今井宜洋 (ITプランニング) 岩崎英哉 (電気通信大学) 馬谷誠二 (京都大学) 亀山幸義 (筑波大学) 河内谷清久仁 (日本IBM東京基礎研究所) 久野靖 (筑波大学) 中田景子 (Institute of Cybernetics) 中田秀基 (産業技術総合研究所) 蓮尾一郎 (京都大学・JSTさきがけ) 長谷川立 (東京大学) 番原睦則 (神戸大学) 廣川直 (北陸先端科学技術大学院大学) 森畑明昌 (東北大学) 横山大作 (東京大学) 実行委員会浅井健一 (お茶の水女子大学) [プログラム共同委員長] 河内谷清久仁 (日本IBM東京基礎研究所) [プログラム共同委員長] 松崎公紀 (高知工科大学) [実行委員長] --------------------------------------------------------------------------

1 0

Second Call for Papers: MOL 12 Tokyo
by Makoto Kanazawa 31 Jan '11

31 Jan '11

--------------------- PLEASE POST --------------------- Second Call for Papers 12th Meeting on Mathematics of Language Tokyo, September 5–7, 2011 http://sites.google.com/site/mol12tokyo/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: March 22, 2011 • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 5-7, 2011 Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (Chair) • Ryo Yoshinaka

1 0

「数学の哲学」研究集会２月１０日ー１１日のお知らせ
by Mitsuhiro Okada 28 Jan '11

28 Jan '11

PHILOSOPHY OF MATHEMATICS Feb 10th-11th, 2011 (Preliminary Announcement) 「数学の哲学の現在」シンポジウム 2011年2月10日―11日主催：慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンター計算機科学，論理学，分析哲学，現象学，意識科学などの異なるフィールドで数学の哲学を研究しておられる研究者が集まり，次のような公開研究集会の開催を予定しています． The purpose of this meeting is to bring together researchers from different fields to discuss the resent state of philosophy of mathematics. （また、２月２４日ー２５日にFormal Ontologyの哲学と論理に関する研究会を、また２６日に数学基礎論の哲学に関する研究会を同一会場で予定しております。追ってご案内させていただきます。We also plan to have a Formal Ontology meeting on 24-25th and a Philosophy of the foundations of Mathematics meeting on 26th; to be announced shortly.) *日時:* 2011年2月10日午後1時 -- 11日午後5時 *Date:* Feb 10, 2011 (13pm) -- Feb 11 (17pm) *場所:* 慶應義塾大学三田キャンパス東館6階 G-Sec Lab *Place:* G-Sec Lab, 6th floor of the East Building, the Mita Campus, Keio University http://abelard.flet.keio.ac.jp/pom11/ 参加自由ですが会場設定や座席の優先確保などのためにできるだけ事前電子登録をお願いいたします．登録先はこちらです． https://abelard.flet.keio.ac.jp/pom11/registration.html 招待講演者は次の方を含みます． The main foreign guest speakers include: *講演者:* Henk Barendregt (オランダニーメゲン Radboud University, Foundations of Mathematics and Computer Science 講座長) *タイトル:* “Philosophy of mathematics, computer mathematics and lambda calculus” *講演者* Mirja Hartimo (フィンランド，ヘルシンキ大学) *タイトル* Husserl’s Philosophy of Mathematics *講演者* Mathieu Marion (カナダ，ケベック大学モントリオール校) *タイトル* Wittgenstein and Philosophy of Mathematics *講演者* Mark van Atten (フランス，パリ科学史科学哲学研究所) *タイトル* Intuitionism as phenomenology: a critique of Rota また国内ゲストはつぎの方たちを含みます．Other guest speakers include: 佐藤雅彦先生 (京都大学) “Formalization of mathematics” 矢田部俊介先生 (産業総合研究所) “Truth theories and co-induction” また，第一日目のプログラム終了時に懇親会 (参加自由) を予定しています． The (tentative) PROGRAM: 2月10日 (Feb 10th. The first Day) *13:00* Henk Barendregt “Philosophy of mathematics, computer mathematics and lambda calculus” *13:30* Discussion and short break *14:30* Mirja Hatimo “Husserl’s Philosophy of mathematics” *15:30* Discussion and short break *16:00* Mathieu Marion “Wittgenstein and Philosophy of Mathematics (tentative)” *17:00* Discussion and short break *18:00* Reception Party at Chuugoku Hanten Restaurant near (a few minutes walk distance from) the conference site/EAST GATE of the Mita Campus (Free for participation) 懇親会 (於中国飯店 <http://www.chuugokuhanten.com/>) 参加自由無料です． 2月11日 (Feb 11th. The second Day) *10:00* Masahiko Sato (Kyoto University) “Formalization of mathematics” *11:00* Discussion and short break *11:30* Lunch Break *13:00* Mark Van Atten “Intuitionism as phenomenology: a critique of Rota” *14:00* Discussion and short break *14:30* Shunsuke Yatabe (National Institute of Advanced Industrial Science and Technology, Collaborate Research Team for Verification) “Truth theories and co-induction (tentative)” *15:30* Discussion and short break *16:00* Mitsuhiro Okada (Keio University) “Some Remarks on Equational theories in the early foundational studies of Hilbert and Husserl and Concluding discussions” And Concluding Discussion *17:00* End of the Meeting 参加自由ですが，会場設定や座席の優先確保などのためにできるだけ事前電子登録をお願いいたします。登録先はこちらです。 https://abelard.flet.keio.ac.jp/pom11/registration.html この会議は慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンターの主催で行われます． Organized by the Open Research Centre for Logic and Formal Ontology, Keio University. ------------------------------------------------------------------------ Organizing Committee: Mitsuhiro Okada (Keio University) Ryo Takemura (Keio University) Yutaro Sugimoto (Keio University) ------------------------------------------------------------------------ 問い合わせ先: 慶應義塾大学「論理学とフォーマルオントロジー」オープンリサーチセンター事務局住所:東京都港区三田2-15-45 TEL:03-3453-4511 (内線23847) E-Mail: logic[AT]abelard.flet.keio.ac.jp なお，セミナーの最新の情報は以下のページに掲示する予定です． http://abelard.flet.keio.ac.jp/pom11/ ------------------------------------------------------------------------ /This document was translated from L^A T_E X by //H//^E //V//^E //A/ <http://hevea.inria.fr/index.html>/./

1 0

$B=u65$N8xJg$N$*CN$i$;(B
by Hasegawa Masahito 27 Jan '11

27 Jan '11

$B3'MM(B $B!J=EJ#$7$F$*<u$1<h$j$N@a$O$4MF<O2<$5$$!K(B $B5~ETBg3X?tM}2r@O8&5f=j$G$O!"8=:_!"=u65<c43L>$N8xJg$r9T$J$C$F$*$j$^$9!#(B $B7W;;5!2J3X$d?tM}O@M}3X$r4^$a$??tM}2J3X4XO"J,Ln$+$i$N1~Jg$r4?7^CW$7$^$9!#(B $B8xJg$N>\:Y$K$D$$$F$O!"8&5f=j%Z!<%8(B http://www.kurims.kyoto-u.ac.jp/ja/index.html $B$h$j$4Mw2<$5$$!#(B $B$^$?!"?tM}2r@O8&5f=j$N7W;;5!2J3XJ,Ln$N9=@.0w$H8&5f3hF0FbMFEy$K$D$$$F$O(B http://www.kurims.kyoto-u.ac.jp/~cs/ $B$r$4Mw2<$5$$!#$I$&$>$h$m$7$/$*4j$$CW$7$^$9!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B Email: hassei at kurims.kyoto-u.ac.jp URL: http://www.kurims.kyoto-u.ac.jp/~hassei/index-j.html

1 0

1st CFP- THE THIRD INTERNATIONAL WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION (LORI-III)
by Yuping Shen 26 Jan '11

26 Jan '11

*************************************************************************** CALL FOR PAPERS THE THIRD INTERNATIONAL WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION (LORI-III) Guangzhou, China, October 10-13, 2011 URL: http://www.golori.org/lori2011/ *************************************************************************** LORI-III THE THIRD INTERNATIONAL WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION October 10 - 13, 2011 Guangzhou, China CALL FOR PAPERS We invite submissions of contributed paper bearing on any of the broad themes of the LORI workshop series, including knowledge acquisition, use, and management, information exchange, rational action, and rational interaction. Specific topics of interest include but are not limited to: * semantic models for knowledge, for belief, and for uncertainty * dynamic logics of knowledge, information flow, and action * logical analysis of the structure of games * belief revision, belief merging * logics and preferences, compact preference representation * logics of intentions, plans, and goals * logics of probability and uncertainty * logical approaches to decision making and planning * argument systems and their role in interaction * norms, normative interaction, and normative multiagent systems * logical and computational approaches to social choice Papers can be submitted on the Easychair site for the conference and should be no longer than 4,000 words (approximately 12 double spaced pages). PUBLICATION INFORMATION A LNCS Proceedings Volume containing all accepted papers will be available at the workshop. *************************************************************************** Tentative dates Submission Deadline: June 1, 2011 Notification: July 1, 2011 Final version due: August 10, 2011 Conference: October 10 - 13, 2011 ***************************************************************************

1 0

第11回関西集合論セミナ：1月28日（金）大阪府立大学
by Masaru KADA 21 Jan '11

21 Jan '11

logic-ml のみなさま：大阪府立大学嘉田です．下記のとおり，集合論のセミナーを行いますので，ご案内申し上げます． ======== 第11回関西集合論セミナ 2011年1月28日（金）11:00--15:50 大阪府立大学中百舌鳥キャンパス A2棟2階226講義室 11:00--11:40 嘉田勝（大阪府立大学） Remarks on Scheepers' theorem on the cardinality of Lindelof spaces 13:10--14:40 酒井拓史（神戸大学） reflection principles and tree property (joint work with Boban Veclickovic) 15:10--15:50 大須賀昇（神戸大学） Separation of the covering numbers of J_g ======== 講演順，講演時間は変更の可能性あり．最新のスケジュール，講演アブストラクト，会場案内，関連情報は関西集合論セミナのウェブサイトでご覧いただけます． http://www.mi.s.osakafu-u.ac.jp/~kada/kansaiset/ お問い合わせ：嘉田勝（大阪府立大学） kada(a)mi.s.osakafu-u.ac.jp -------- Masaru KADA （嘉田勝） kada(a)mi.s.osakafu-u.ac.jp --------

1 0

Workshop on Logic and Computation: 2月8,9日金沢市能楽美術館
by hirokawa＠jaist.ac.jp 21 Jan '11

21 Jan '11

logic-ml の皆様 JAISTの廣川と申します。2月に金沢市で行われます論理と計算に関するワークショップのご案内を申し上げます。 -------------------------------------------------------------------------------------- Workshop on Logic and Computation February 8–9, Kanazawa http://www.jaist.ac.jp/is/labs/ogawa-lab/wlc11.html -------------------------------------------------------------------------------------- The workshop aims at promoting interactions among logicians from proof theory, computability, and rewriting. Several internationally renowned scientists will participate and contribute talks on recent developments. We welcome participants from all areas and all levels, but due to space restrictions in the venue, the Kanazawa Noh Museum, we kindly ask to contact the organizers at preining(a)jaist.ac.jp beforehand. The tentative program is as follows: February 8: 10:00-11:00 Ulrich Berger (Swansea, UK) Extraction of verified algorithms in exact real arithmetic 11:00-11:20 Break 11:20-12:00 Monika Seisenberger (Swansea, UK) Program Extraction from Constructive and Classical Proofs: Higman's Lemma 12:00-13:50 Lunch break 13:50-14:30 Guillaume Bonfante (Nancy, France) Comparing implicit characterization by program transformations 14:30-15:10 Masahiko Sato (Kyoto, Japan) Formalization of Mathematics 15:10-15:30 Break 15:30-16:10 Christian Fermüller (Vienna, Austria) Parallel Dialogue Games and Hypersequents for Intermediate Logics 16:10-16:50 Nao Hirokawa (Nomi, Japan) Rewriting Techniques in Complexity Analysis February 9: 10:00-11:00 Constantine Tsinakis (Nashville, USA) The Finite Embeddability Property for Algebras of Logic 11:00-11:20 Break 11:20-12:00 Dominik Klein (Nomi, Japan) Maximal Completion 12:00-13:50 Lunch break 13:50-14:30 Matthias Baaz (Vienna, Austria) Epsilon-calculus for non-classical logics 14:30-15:10 Agata Ciabattoni (Vienna, Austria) Power and limits of analytic calculi: towards a systematic proof theory for nonclassical logics 15:10-15:30 Break 15:30-16:10 Norbert Preining (Nomi, Japan) Satsifiability in Gödel Logics 16:10-16:50 Kazushige Terui (Kyoto, Japan) Church => Scott = Ptime: an application of resource sensitive realizability Closing -- 廣川　直　（北陸先端科学技術大学院大学）

1 0

第11回関西集合論セミナ：1月28日（金）大阪府立大学
by Masaru Kada 21 Jan '11

21 Jan '11

logic-ml のみなさま：大阪府立大学嘉田です．下記のとおり，集合論のセミナーを行いますので，ご案内申し上げます． ======== 第11回関西集合論セミナ 2011年1月28日（金）11:00--15:50 大阪府立大学中百舌鳥キャンパス A2棟2階226講義室 11:00--11:40 嘉田勝（大阪府立大学） Remarks on Scheepers' theorem on the cardinality of Lindelof spaces 13:10--14:40 酒井拓史（神戸大学） reflection principles and tree property (joint work with Boban Veclickovic) 15:10--15:50 大須賀昇（神戸大学） Separation of the covering numbers of J_g ======== 講演順，講演時間は変更の可能性あり．最新のスケジュール，講演アブストラクト，会場案内，関連情報は関西集合論セミナのウェブサイトでご覧いただけます． http://www.mi.s.osakafu-u.ac.jp/~kada/kansaiset/ お問い合わせ：嘉田勝（大阪府立大学） kada(a)mi.s.osakafu-u.ac.jp -- -------- Masaru KADA （嘉田勝） kada(a)mi.s.osakafu-u.ac.jp --------

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml