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

2011LLS
by Toshihiko Kurata 26 Jun '11

26 Jun '11

kisoron-ml，logic-mlの皆様，夏休み期間に「ラムダと論理の研究会」が計画されています．詳しい情報は http://www.i.hosei.ac.jp/~kurata/2011LLS/ にありますので気軽に参加を検討いただけますと幸いです．過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関して，成果発表の場というよりは成果をあげる場となっていまして，講演件数を抑え，残りの時間は個人やグループで柔軟に計画してもらうようになっています．（こうした形式のセミナーは主に海外で行われているらしく，それを取り入れた古森先生の研究室の下で継続的に実施されています．）特に今年の夏は節電の影響で大学では仕事がはかどりそうにないという方も多いと思われます．草津のセミナーで仕事を進め節電にも貢献する計画などされては如何でしょうか？ ---- Toshihiko Kurata, Hosei University e-mail kurata(a)hosei.ac.jp ---------------------------------------------------------------------- 日時：　2011年8月28日(金)午後5時から9月1日(火)正午まで場所：　国立大学草津セミナーハウス参加申込：　倉田（法政大学）が窓口となっています．講演や参加を希望されます方は8月15日までに以下の項目を kurata(a)hosei.ac.jp までメイル下さい．会議室確保の都合がありまして，参加のみ希望されます方も予め御連絡頂けますと幸いです． -------------------------- 参加申込 -------------------------- 氏名：所属：連絡先 (e-mail): 参加期間：講演希望：有・無題目：希望時間：その他： -------------------------------------------------------------- また，セミナーに参加される方の中でセミナーハウスでの宿泊を希望される方は7月7日までに宿泊申込を倉田（上記e-mailアドレス）までメイル下さい．宿泊定員の関係でこちらの締切は早くなっています．他の情報は後から送って頂いて構いませんので，よろしくお願いいたします． ------------------- セミナーハウス宿泊申込 ------------------- セミナーハウスの宿泊の申込をします。部屋タイプの希望（教員は選択可，学生は学生部屋となります）：　　　　教員用, 学生用, どちらでもよい宿泊・食事の希望（希望しない部分を消去して下さい）：　　　　２８日　　夕食　宿泊　　　　２９日　　朝食　夕食　宿泊　　　　３０日　　朝食　夕食　宿泊　　　　３１日　　朝食　夕食　宿泊　　　　　１日　　朝食 --------------------------------------------------------------

1 0

Prof. Sy David Friedman's talk on June 30.
by Sakae Fuchino 25 Jun '11

25 Jun '11

渕野昌＠神戸大学システム情報学研究科というものです．以下の講演を御案内いたします． ------------------------------------------------------------------------------ 2011年 6月30日（木）に開催される神戸大学統合研究拠点設置記念・システム情報学研究科1周年合同シンポジウム http://kurt.scitec.kobe-u.ac.jp/~fuchino/misc/flier-11-05-20.pdf において，ウィーン大学 Kurt Goedel Research Center 所長 Prof. Sy David Friedman が "Mathematical Logic and its Role in Computer Science and Mathematics" という題の（一般向けの）講演をされます．日時: 2011年 6月30日（木）15:10 -- 16:10 場所: 神戸ポートピアホテル南舘1階（大輪田） ------------------------------------------------------------------------------ お時間のある方はぜひいらしてください． -- best regards Saka\'e Fuchino (渕野昌) ------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 e-mail: fuchino(a)diamond.kobe-u.ac.jp web page: http://kurt.scitec.kobe-u.ac.jp/~fuchino/ My mail surver in Tokyo (to which all the emails to the address above are forwarded) does not run properly at the moment in connection with the aftermath of the earthquake on March 11, 2011. To be sure please send your email not only to the email address above but also to: sakae.fuchino(a)gmail.com -------------------------------------------------------------------------

1 0

TACL 2011 : Call for participation
by Luigi Santocanale 20 Jun '11

20 Jun '11

=============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Call for participation =============================================================================== July 26-30, 2011 Universités Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Latest informations ------------------- * Program. The complete list of talks, including a short abstract, is available at the url http://www.lif.univ-mrs.fr/tacl2011/talks * Registration site. You can register to the conference through the url http://www.lif.univ-mrs.fr/tacl2011/registration * Early registration deadline: July 1, 2011. 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. Important dates --------------- July 1,2011: Early registration deadline 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, Universitat 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 =============================================================================== -- Luigi Santocanale LIF/CMI Marseille Tél: 04 13 55 13 08 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 13 55 13 02

1 0

CfP: Non-classical Modal and Predicate Logics, Guangzhou, December 2011
by info＠mathfuzzlog.org 15 Jun '11

15 Jun '11

(Apologies for multiple copies) 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 logic, 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) == Contacts == Web: http://logic.sysu.edu.cn/ncmpl2011 Email: ncmpl2011(a)easychair.org == 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. == Submissions == 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

FSFLA 2011: 1st announcement
by "Carlos Martín Vide" 11 Jun '11

11 Jun '11

********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 – November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische München), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School’s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu(a)urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputació de Tarragona Universitat Rovira i Virgili

1 0

The 51th ToPS [June 21]
by Kazuyuki ASADA 11 Jun '11

11 Jun '11

[Apologies for multiple copies] I am pleased to announce the 51th Tokyo Programming Seminar, which will be held at NII on June 21 (Tue). Shin-ya Katsumata from Kyoto University will give a talk about a categorical approach to attribute grammars and Kazuyuki Asada from National Institute of Informatics will give a talk about bialgebraic semantics for multi-rooted graph algebra. The programme is attached below. I'm looking forward to meeting you at ToPS. Best regards, Kazuyuki Asada ---- The 51th ToPS http://www.ipl.t.u-tokyo.ac.jp/~tops/upcoming_seminar.html Time: June 21th (Tue) 2011, 15:00--17:00 Place: Rm. 1208, 12F, National Institute of Informatics Speaker: (1) Kazuyuki Asada (National Institute of Informatics) Title: Many-sorted Bialgebraic Semantics for a Multi-rooted Graph Algebra and a CBV Calculus Abstract: In this talk, bialgebraic semantics for the graph algebra introduced by Buneman et al. is given. The graph algebra is a graph representation for some kind of multi-rooted graph, which is the same as Kripke model. First I give a bijective correspondence between graph algebras and terms in (the first-order part of) a call-by-value calculus equipped with output, non-termination, non-determinism, and iteration operator. Then I induce an equational theory for graph algebra from the standard one for the CBV calculus including (modified) uniformity for the iteration operator. Then, after reveiwing coalgebraic semantics for Kripke model, we see that those final coalgebras form a relative monad, and the graph algebra can be formulated as many-sorted algebra. Then I give many-sorted bialgebraic semantics for the graph algebra and the graph. Time permitting, I will explain three future works: Completeness of the equational theory, full-abstractness, and generalization. (2) Shin-ya Katsumata (Kyoto University) Title: A Categorical Approach to Attribute Grammars Abstract: Attribute grammars (AGs) are a mechanism to assign computations with bidirectional information flow to trees. We introduce a categorical formulation of AGs called monoidal AGs, and demonstrate that they subsume existing formulations of AGs, such as domain-theoretic, graph-theoretic, and relational ones, and also a special class of syntactic AGs called SSUR-ACs. Using this categorical formulation, we give a syntax-free account of the descriptional composition, which is a method to fuse two term transformation algorithms described by SSUR-ACs into one.

1 0

SSLST 2011: 1st announcement
by "Carlos Martín Vide" 10 Jun '11

10 Jun '11

2011 INTERNATIONAL SUMMER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES (SSLST 2011) (formerly International PhD School in Language and Speech Technologies) Tarragona, Spain, August 29 – September 2, 2011 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/sslst2011/ ****************************************** AIM: SSLST 2011 offers a broad and intensive series of lectures on language and speech technologies at different levels. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate their career in research. ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Linguistics. Other students (for instance, from Mathematics, Electrical Engineering, or Philosophy) are welcome too. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. COURSES AND PROFESSORS: Walter Daelemans (Antwerpen), Computational Stylometry [advanced, 4 hours] Robert Dale (Macquarie), Automated Writing Assistance: Grammar Checking and Beyond [intermediate, 8 hours] Christiane Fellbaum (Princeton), Computational Lexical Semantics [introductory/intermediate, 8 hours] Ralph Grishman (New York), Information Extraction [intermediate, 8 hours] Daniel Jurafsky (Stanford), Computational Extraction of Social and Interactional Meaning [introductory/advanced, 8 hours] Chin-Hui Lee (Georgia Tech), A Short Course on Digital Speech Processing and Applications [intermediate, 8 hours] Yuji Matsumoto (Nara), Syntax and Parsing: Phrase Structure and Dependency Parsing [introductory/intermediate, 8 hours] Diana Maynard (Sheffield), Text Mining [introductory/intermediate, 8 hours] Dan Roth (Urbana-Champaign), Predicting Structures in NLP: Constrained Conditional Models and Integer Linear Programming in NLP [intermediate/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/sslst2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until June 5, 2011), - 15 euros (for payments after June 5, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSLST 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation will be provided on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: April 21, 2011 Starting of the registration: April 25, 2011 Early registration deadline: June 5, 2011 Starting of the School: August 29, 2011 End of the School: September 2, 2011 QUESTIONS AND FURTHER INFORMATION: Florentina-Lilica Voicu: florentinalilica.voicu(a)urv.cat WEBSITE: http://grammars.grlmc.com/sslst2011/ POSTAL ADDRESS: SSLST 2011 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386

1 0

Call for Participation: 12th Meeting on Mathematics of Language
by Makoto Kanazawa 09 Jun '11

09 Jun '11

*** REGISTRATION OPEN *** CALL FOR PARTICIPATION (early-bird registration deadline: July 1, 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, University of Stuttgart Program available at http://sites.google.com/site/mol12nara/program Contact: mol12(a)googlegroups.com

1 0

数学基礎論サマースクールのご案内
by Ikuo Yoneda 05 Jun '11

05 Jun '11

【数学基礎論メーリングリスト加入の皆様へ】今夏は神戸大学において「モデル理論」をテーマにサマースクール開校となりました。よろしくお願い申し上げます。日程：平成２３年８月２９日（月）１３：３０〜８月３１日（水）１２：１０ＨＰ： http://kurt.scitec.kobe-u.ac.jp/~kikyo/LogicSummerSchool2011/ チュートリアルが沢山ございます。幅広い，ご参加，お待ちしております。連絡係米田郁生（徳山高専）

1 0

CFP: SAC 2012 track on Service Oriented Architectures and Programming (SOAP)
by Koji Hasebe 03 Jun '11

03 Jun '11

（重複して受け取られた場合はご容赦下さい。）来年3月にTrentoにて開催されるACM SACのトラック"Service Oriented Architectures and Programming (SOAP)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二＠筑波大学コンピュータサイエンス専攻 ============================================== Call for Papers 27th Annual ACM Symposium on Applied Computing (SAC) http://www.acm.org/conferences/sac/sac2012/ Track on Service-Oriented Architectures and Programming (SOAP) Riva del Garda (Trento), Italy March 25-29, 2012 http://www.itu.dk/acmsac2012-soap/ ============================================== ACM SAC 2012 For the past twenty-seven years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. SOAP TRACK: CALL FOR PAPERS Service-Oriented Programming (SOP) is quickly changing our vision of the Web, bringing a paradigmatic shift in the methodologies followed by programmers when designing and implementing distributed systems. Originally, the Web was mainly seen as a means of presenting information to a wide spectrum of people, but SOP is triggering a radical transformation of the Web towards a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be discovered by other services and then invoked, abstracting from their actual implementation. Research on SOP is giving strong impetus to the development of new technologies and tools for creating and deploying distributed software. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of SOP needs to be clarified on many aspects, both from the engineering and from the foundational points of view. From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modelling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, OWL, ...) and the syntactic one (WSDL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new different implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrate only on a few features of Service-Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service-Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming SOP into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what SOP still needs in order to achieve its original goal. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service Oriented Computing - Methodologies and tools for Service Oriented application design - Service Oriented Middlewares - Service Oriented Programming languages - Test methodologies for Service Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service-Oriented Computing IMPORTANT DATES (strict) August 31, 2011: Paper submissions October 12, 2011: Author notification November 2, 2011: Camera-Ready Copy March 25-29, 2012: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. SOAP track chairs will not submit to the track. Submissions from SOAP PC members and from PC members and track chairs of other SAC tracks are welcome. Submission guidelines can be found on SAC 2012 Website: http://www.acm.org/conferences/sac/sac2012/ Prospective papers should be submitted to the track using the provided automated submission system. Please pay attention to ensure anonimity of your submitted manuscript as detailed in the submission page so to allow for double-blind review. Papers not satisfying this constraint will be automatically rejected. The maximum length for papers is 8 pages. Accepted papers whose camera-ready version will exceed 6 pages will have to pay an extra charge. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Jesper Bengtson, IT University of Copenhagen (Denmark) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Tim Hallwyl, Sirius IT (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Tartu (Estonia) Hernàn Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. (Italy) Paolo Missier, Newcastle University (UK) Bardia Mohabbati, Simon Fraser University (Canada) Kévin Ottens, Klarälvdalens Datakonsult AB (Sweden) Rosario Pugliese, University of Firenze (Italy) Jean-Bernard Stefani, INRIA Grenoble (France) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Olaf Zimmermann, IBM Research - Zurich (Switzerland) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy

1 0

AQIS2011のご案内
by Harumichi Nishimura 02 Jun '11

02 Jun '11

logic-ml の皆様，大阪府立大学の西村と申します．国際会議AQIS2011の御案内をさせていただきます．量子計算，量子論理など量子情報科学に興味をお持ちの方はぜひ参加の程ご検討いただければ幸いです．宜しくお願い致します．西村治道大阪府立大学理学系研究科〒599-8531 堺市中区学園町１−１ TEL: 072-254-9693 E-mail: hnishimura(a)mi.s.osakafu-u.ac.jp ============================================================ The 11th Asian Quantum Information Science Conference http://newton.kias.re.kr/aqis11 August 23 - 30, 2011 Tutorial: August 23, Main conference: August 24-27 Special Programs: August 28, A Satellite Workshop at KIAS, Seoul: August 29-30 Venue: Pukyong National University, Busan, Korea Organized by Korea Institute for Advanced Study (KIAS) Co-organized by Pukyong National University Important Dates: Submission deadline: June 20, 2011 Acceptance notification: July 17, 2011 Final draft: August 7, 2011 ============================================================ Apologies for cross-postings. Please send to interested colleagues and students. The 11th AQIS conference will be focused on new theoretical and experimental development in quantum information processing, communication and cryptography and on both physics and computing aspects of the field. Program is to consists of invited talks, selected presentations and posters, as well as tutorials and satellite workshops. Areas of coverage include (but are not limited to): -Quantum computation, programming, algorithms and complexity -Quantum information theory -Quantum decoherence fighting concepts, methods and tool -Quantum cryptography theory and experiments -Quantum communication experiments and theory -Quantum technologies (optics, NMR, solid states,...) -Quantum computers and processors design -Quantum information processing impacts on other sciences Social program will include excursion to the exciting Gyeongju that was the capital of Silla (ancient Korea) for 1000 years. Keynote Speakers: Gilles Brassard (University of Montreal) Yoshihisa Yamamoto (NII, Tokyo, Stanford University) Tutorial Lecturers: Andris Ambainis (University of Latvia, Riga) Jozef Gruska (Masaryk University, Brno) Barry Sanders (University of Calgary, Calgary) Invited Speakers: Charles Bennett (IBM, Yorktown Heights) Guoping Guo (University of Science and Technology of China, Hefei) Wu-Ming Liu (Chinese Academy of Sciences, Beijing) Mio Murao (University of Tokyo, Tokyo) Hyunchul Nha (Texas A&M University, Qatar) Rajiah Simon (Institute of Mathematical Sciences, Chennai) Shigeki Takeuchi (Osaka University, Osaka) Andreas Winter (University of Bristol, Bristol)[to be confirmed] Contact Information: Se-Wan Ji, Korea Institute for Advanced Study (KIAS) Hoegiro 87, Dongdaemun, SEOUL, KOREA [130-722] Tel: +82-2-958-3863 Fax: +82-2-958-3820 Email: aqis11(a)kias.re.kr Steering Committee Chair: Jozef Gruska (Masaryk University, Brno) Conference Chairs: Jaewan Kim (KIAS, Seoul) Hai-Woong Lee (KAIST, Daejeon) Program committee: Andris Ambainis (Co-Chair; University of Latvia, Riga) Almut Beige (U Leeds) Charles Bennett (IBM) Warwick Bowen (U Queensland) Giulio Chiribella (PI, Ontario) Sang Kyung Choi (KRISS) His-Sheng Goan (NTU) Andrew Greentree (U Melbourne) Guang-Can Guo (USTC, Hefei) Kazuo Iwama (Kyoto U) Hyunseok Jeong (Seoul Nat'l U) Jaewan Kim (Chair; KIAS) Kisik Kim (Inha U) Yoon Ho Kim (POSTECH) Julien Laurat (CNRS, Paris) Hai-Woong Lee (KAIST) Jinhyoung Lee (Hanyang U) Peter van Loock (Max-Planck Inst) Norbert Lutkenhaus (U Waterloo) Kae Nemoto (NII, Tokyo) Hyunchul Nha (Texas A&M U, Qatar) Franco Nori (RIKEN/U Michigan) Arun Pati (Inst Physics, Bhubaneswar) Martin B Plenio (U Ulm) Daowen Qiu (Zhongshan U, Guangzhou) Martin Roetteler (NEC Labs) Barry Sanders (U Calgary) Stephanie Wehner (CQT/NUS) Andreas Winter (U Bristol) Shigeru Yamashita (Ritsumeikan U) Bei Zeng (IQC, U Waterloo) Shengyu Zhang (CUHK, Hong Kong) Organizing Committee: Kyungsik Kim (Chair; Pukyong National University, Busan) Tae-Gon Noh (Kyungsung University, Busan) Sang Wook Kim (Pusan National University, Busan) Han Seb Moon (Pusan National University, Busan) Se-Wan Ji (KIAS, Seoul) Shigeru Yamashita (Ritsumeikan University, Nara) Sheng-Mei Zhao (NUPT, Nanjing) Jae-Weon Lee (Jungwon University, Goesan) ============================================================

1 0

ESSLLI 2011 Early-Bird Registration Extended Deadline
by Makoto Kanazawa 31 May '11

31 May '11

Apologies if you receive multiple copies of this message. Please distribute it to colleagues and students. *********************************************************************** DEADLINE EXTENSION FOR EARLY-BIRD REGISTRATION FOR 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: 15-06-2011 *********************************************************************** *Meeting Descriptrmation (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* http://esslli2011.ijs.si/?page_id=12 *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) - Senja Pollak (University of Ljubljana) - Mihael Arčan (DERI, National University of Ireland, Galway) - Andrej Bauer (University of Ljubljana) - Boštjan Bajec (University of Ljubljana) - Monika Kropej (Jožef Stefan Institute) - Špela Sitar (Jožef Stefan Institute) - Mitja Jermol (Jožef Stefan Institute)

1 0

東北大学ロジックセミナー(6/3)
by higurashi3873＠yahoo.co.jp 27 May '11

27 May '11

皆様，東北大学の堀畑佳宏です．下記の日程でロジックセミナーを行いますので，興味のある方はぜひご参加ください．日時：6月3日(金)，16時から場所：東北大学北青葉山キャンパス理学総合棟1201号室発表者：Sam Sanders　（Ghent university，東北大学大学院）タイトル： Nonstandard Analysis: a new way to compute アブストラクト： The notion of computability (in principle) is central to topics like e.g. Recursion Theory and Erret Bishop's Constructive Analysis. In contrast, the notion of computability has not been studied intensively in the context Nonstandard Analysis. Bishop even notoriously derided Nonstandard Analysis for its `lack of computational content'. Today, we set the historical record straight. We introduce `$\omega$-invariance' a new notion of computability based on Nonstandard Analysis. We show that $\omega$-invariance has the usual properties of computability and even derive several results from Constructive Reverse Mathematics. セミナーの詳細につきましては，下記をご参照ください． https://sites.google.com/site/sendailogichomepage/ 堀畑　佳宏 -- -- 東北大学大学院　理学研究科数学専攻　博士後期課程三年 E-mail: sa6m31(a)math.tohoku.ac.jp E-mail: higurashi3873(a)yahoo.co.jp

1 0

CFP: LENLS 8 (Logic and Engineering of Natural Language Semantics 8)
by BEKKI Daisuke 25 May '11

25 May '11

（重複して受け取られた場合はご容赦ください）今年の１２月に高松で開催される LENLS8 国際ワークショップのCFPをお送りします。多数の投稿をお待ちしています。戸次大介（お茶の水女子大学） [Apologies for multiple copies] ================================================================= FIRST CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 8 (LENLS8) Workshop Site : "Sunport Hall Takamatsu", Takamatsu 2-1, Sunport, Takamatsu-shi, Kagawa-ken, Japan Dates : December 1-2, 2011 Contact Person: Alastair Butler Contact Email : lenls8(a)easychair.org Website : http://www.is.ocha.ac.jp/‾bekki/lenls/ ================================================================= Chair: Alastair Butler (JST/Tohoku University) Invited Speaker(s): - Kentaro Inui (Tohoku University) - TBA LENLS is an annual international workshop focusing on formal semantics and pragmatics. It will be held as one of the workshops of JSAI isAI 2011, sponsored by The Japan Society for Artificial Intelligence (JSAI). Call For Papers We invite submissions to this year's workshop on topics in formal semantics and pragmatics, and related fields, including but in no way limited to the following: - Dynamic syntax/semantics/pragmatics of natural language - Categorical/topological/coalgebraic approaches for natural language syntax/semantics/pragmatics - Logic and its relation to natural language and linguistic reasoning (especially dynamic logics) - Type-theoretic approaches to natural language - Formal Philosophy of language - Formal pragmatics (especially game- and utility-theoretic approaches) - Substructural expansion of Lambek Lambda Calculi - Many-valued/Fuzzy and other non-classical logics and natural language This year we especially welcome submissions connected to the theme of "Where is dynamic semantics now?". Flavours of dynamic semantics (world updating, assignment changing, etc.) have been broadly applied to solve problems in linguistics (notably anything related to anaphora) and philosophy (e.g., foundational issues of context, the role of variables) and have prompted the development of a diverse range of frameworks with replicable formal results. However in recent years direct appeals to the dynamic metaphor have been waning, as has the explicit development of novel systems, or even refinements to or mergings of older systems. Has dynamic semantics been so successful in solving its problems that all that remains for discussion are implementational differences among established parameters, or have debates simply shifted to new issues? Either way now seems an apt time to take stock and question where the decades of research have taken us and where we might hope this legacy to send us in the future. Submissions: Abstracts (4-6 pages, including figures, bibliography, possible apendices) must be submitted electronically in PDF format at: https://www.easychair.org/conferences/?conf=lenls8 When his/her abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The proceedings of the workshop will be available at the conference site for registered persons. Important dates: Abstract submission deadline : August 31, 2011 Notification of acceptance : September 30, 2011 Deadline for camera-ready copy : October 15, 2011 Deadline for onsite registration: November 12, 2011 LENLS8: December 01-02, 2011 Organizing Committee: Alastair Butler (Chair) Daisuke Bekki Eric McCready Yoshiki Mori Yasuo Nakayama Katsuhiko Yabushita Tomoyuki Yamada Shunsuke Yatabe Kei Yoshimoto

1 0

名古屋大学大学院多元数理科学研究科教員公募
by Jacques Garrigue 25 May '11

25 May '11

logic-mlの皆様、名古屋大学大学院多元数理科学研究科で教員の公募を行っています。広い分野での応募を期待していますので、よろしくお願いします。 Jacques Garrigue ====================================================================== 2011年5月24日関係各位名古屋大学大学院多元数理科学研究科教員の公募について名古屋大学大学院多元数理科学研究科　准教授・助教選考委員会委員長　納谷　信　このたび本研究科におきましては、下記要領で教員公募を行うことになりました。つきましては貴関係者にお知らせいただくともに、適任者をご存じの場合には、応募をお勧め下さるようお願い申し上げます。記職名及び人数:　准教授もしくは助教若干名学位取得後10年以内（学位取得見込みを含む）であることが望ましい研究分野:　数学および数理科学採用予定日:　2011年10月1日以降できるだけ早い時期応募期限:　2011年7月1日(金)必着必要書類: 応募用紙 (ウェッブページよりダウンロードし、必要事項を記入してください) 履歴書研究業績リスト主要論文解説研究計画書過去の教育経験 (TAなどの経験を含む) 及び教育についての考え方を述べた書類主要論文およびプレプリントのコピー業績について照会できる方3名の氏名と連絡先　　照会先が海外在住の場合は推薦書を依頼して下さい。応募方法の詳細: 　下記ウェッブページを参照のこと http://www.math.nagoya-u.ac.jp/ja/job/ その他:　本学では、男女共同参画を積極的に推進しています。問い合わせ先:　納谷　信(ap-search-2011(a)math.nagoya-u.ac.jp) 以上

1 0

$BCLOC2q$N$40FFb(B [Prof. Yde Venema, 5/25]
by Hasegawa Masahito 22 May '11

22 May '11

$B3'MM!"(B $B:#=5$N?eMK!J#57n#2#5F|!K$K!"5~ETBg3X?tM}2r@O8&5f=j$G0J2<$NCLOC2q$,3+:E(B $B$5$l$^$9!#9V1i<T$O!"8=:_5R0w65<x$H$7$F?tM}8&$KBZ:_$5$l$F$$$k!"%"%`%9%F(B $B%k%@%`Bg$N(BYde Venema$B$5$s$G$9!#$I$&$>$4MhD0$/$@$5$$!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B -- $BCLOC2q$N$40FFb(B $BF|;~(B: $B!!(B5$B7n(B 25$BF|(B($B?e(B) 16:30-17:30 $B>l=j(B: $B!!?tM}8&(B110$B9f<<(B (16:00$B$h$j(B1$B3,%m%S!<$G(Btea) $B9V1i<T(B: Yde Venema $B;a(B $B=jB0(B: $B!!5~Bg!&?tM}8&(B & University of Amsterdam $BBjL\(B: Coalgebra, its Logic, and some of its Mathematical Environments Abstract: Computers and other electronic equipment are becoming more and prominent, both in our daily life, and in society as a whole. When we are confronted with undesired or incomprehensible behavior of for instance our mobile phone, we will naively start reasoning about the system, modelling it as a state-based evolving system, that we can only observe as a black box. Clearly, when it comes to specifying and reasoning about the behavior of critical software systems, a sophisticated mathematical theory is needed. The theory of coalgebra, which has emerged from theoretical computer science in the last two decades, provides a general, mathematical framework for reasoning about such state-based evolving systems. It combines mathematical simplicity with wide applicability, due to its categorical foundations: many features such as input/output, nondeterminism, probability, and interaction can be encoded in the coalgebraic type which formally is a functor over Set (or some other base category). Coalgebra allows us to give precise mathematical definitions of notions such as behavior or observational equivalence of systems. Logic naturally enters the picture since we want to specify and reason about behavior in a formal way. In the talk, we will give a very informal introduction and motivation of coalgebra and coalgebraic logic. We then briefly explain the dualities between algebra and coalgebra, and discuss the principle of coinduction. In the second part of the talk we describe some of the mathematical environments of the theory, and sketch how ideas from coalgebraic logic can be used to generalize results in topology (the Vietoris construction) and automata theory (Rabin's Theorem). $BCLOC2q$N0FFb!'(B http://www.kurims.kyoto-u.ac.jp/ja/seminar/danwakai.html $B?tM}2r@O8&5f=j$X$N%"%/%;%9!'(B http://www.kurims.kyoto-u.ac.jp/ja/access-01.html --

1 0

２２（日）-２５（水）: 国際会議TAMC2011
by arai toshiyasu 19 May '11

19 May '11

みなさま代理投稿します。 -- 新井敏康 --- 電通大の垂井と申します。５月２２日（日）から２５日（水）まで電通大（調布）にて理論計算機科学に関するTAMC2011という国際会議を開催します。 http://www.tamc2011.com/index.html ２２日（日）は３つのチュートリアルのみ開催しこのチュートリアルは、誰でも聴講できると明示的に告知しています。（登録不要。費用不要。）２番目の午後最初のチュートリアルは finite model theoryに関するものです。 (finiteの場合の基本的事項、計算量との関係、0-1 lawなどをカバーしてもらう予定です。）さらに、２３・２４・２５の会議の部分についても聴講だけは登録/費用不要で誰でもできることにしました。（プロシーディングスもらえず、宴会には参加できないですが。）ご興味とご都合に応じて参加検討ください。電気通信大学垂井淳 tarui(a)ice.uec.ac.djp

1 0

CFP: 日本ソフトウェア科学会第28回大会
by Yukiyoshi Kameyama 15 May '11

15 May '11

皆様， 9月に沖縄で開催される日本ソフトウェア科学会第28回大会の発表募集をお送りします．学会誌への同時投稿も可能です．是非，発表・投稿をご検討ください． -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam -------------------------------------------------------------------------- 日本ソフトウェア科学会第28回大会日時：2011年9月27日(火)〜29日(木) [大会本体] (併設イベントは調整中) 会場：沖縄産業支援センター・沖縄県市町村自治会館 (沖縄県那覇市) http://jssst11.kuis.kyoto-u.ac.jp/ ＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿熱い企画満載です！＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿日本ソフトウェア科学会では第28回大会を9月27日(火)から29日(木)まで沖縄県那覇市で開催します．大会での一般の登壇発表と，大会同時投稿論文としての学会誌への投稿を下記の要領で募集します．発表申込締切は6月24日(金)です．皆様のご発表，ご投稿をお待ちしております． ■一般の登壇発表一般の登壇発表の場を一般セッション，いくつかの研究会セッション，ソフトウェア論文セッションから選ぶことができます．特に優秀な登壇発表に対しては「高橋奨励賞」(故高橋秀俊先生にちなむ賞)が与えられます．・一般セッションソフトウェア科学全般を対象とします．分野横断的な研究，従来の研究分野ではカバーできない新しい発想の研究なども対象に含みます．・研究会セッション以下の研究会と連携して各分野の観点から議論を深めることで，発表者にも聴講者にも有益で楽しめるセッションを実現します． - プログラミング論研究会(PPL) - マルチ・エージェントと協調計算研究会(MACC) - インタラクティブシステムとソフトウェア研究会(ISS) - ソフトウェア工学の基礎研究会(FOSE) - インターネットテクノロジー研究会(ITECH) - ディペンダブルシステム研究会(DSW) - ネットワークが創発する知能研究会(EIN) ただし，MACCについては発表募集をせずに研究会の特色を生かしたセッションが企画されます．・ソフトウェア論文セッション先進的なアイデアを実現したソフトウェアについての成果発表の場を提供します．また，学会誌「コンピュータソフトウェア」のソフトウェア論文特集号(11月初旬頃投稿締切)とリンクも用意されています．さらに登壇発表と同じ内容によるデモ・ポスターセッションでの発表も歓迎します．ポスター掲示に加えて，ノートPC等を持ち込んでのデモも可能です． ■大会同時投稿論文日本ソフトウェア科学会大会では，登壇発表の予稿を学会誌「コンピュータソフトウェア」へ論文として投稿できる「大会同時投稿論文」の仕組みを提供しています．同時投稿の時期は大会前(第1回)と大会後(第2回)のどちらかで，著者自身が大会予稿の提出時に選択できます．また，レター論文の場合，判定結果は2012年1月末までに著者へ通知します． ■スケジュール一般の登壇発表，大会同時投稿論文に関する主なスケジュールは以下の通りです．・6月24日(金) 発表申込締切・8月8日(月) 予稿原稿締切および大会同時投稿論文第1回投稿締切・9月27日(火)〜29日(木) 大会本体 (併設イベントは 9月26日(月)で調整中) ・10月20日(木) 大会同時投稿論文第2回投稿締切 ■発表申込登壇発表者は日本ソフトウェア科学会の正会員または学生会員に限ります．ただし，発表申込時に入会手続き中である場合も含みます．発表申込ページの開設は，しばらくお待ちください． ■詳細について一般の登壇発表，大会同時投稿論文についての詳細は以下の大会ウェブサイトでご確認ください． http://jssst11.kuis.kyoto-u.ac.jp/ ■組織大会委員長遠藤聡志 (琉球大学) 運営委員長河野真治 (琉球大学) プログラム委員長八杉昌宏 (京都大学) プログラム委員会 (5月12日時点) 八杉昌宏 (委員長, 京都大学) 明石修 (NTT未来ねっと研究所) 五十嵐淳 (京都大学) 伊知地宏 (ラムダ数学教育研究所) 岩崎英哉 (電気通信大学) 大沢英一 (はこだて未来大学) 亀山幸義 (筑波大学) 栗原聡 (大阪大学) 河野健二 (慶應義塾大学) 志築文太郎 (筑波大学) 杉山安洋 (日本大学) 中野圭介 (電気通信大学) 並木美太郎 (東京農工大学) 番原睦則 (神戸大学) 細部博史 (国立情報学研究所) 増原英彦 (東京大学) ■お問合せ一般の登壇発表，大会同時投稿論文についてお問合せの際はプログラム委員長 (八杉昌宏)宛てに以下へメールをお送りください． yasugi*ＡＴ*kuis.kyoto-u.ac.jp (*ＡＴ*は@に置き換えてください) --------------------------------------------------------------------------

1 0

第84回プログラミング研究会開催案内
by Takahito Aoto 08 May '11

08 May '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊情報処理学会第84回プログラミング研究発表会開催のご案内をさせて頂きます． 6月14日(火)・15日(水)に函館にて開催されます．皆様のご参加をお待ちしております．また，第1日目の夜に懇親会を予定しています．懇親会への参加をご希望の方は 6月7日(火)までに下記の要領で青戸までお申し込みください．(発表会への参加自体については事前の申し込みは不要です．) ------------------------------------ To: aoto [at] nue.riec.tohoku.ac.jp Subject: PRO84-party 6月14日(火)の懇親会に参加します．御名前: 御所属: 区別: 学生・一般 (6月7日(火)までにお知らせ下さい．) ------------------------------------ なお，下記のプログラムで，発表の順番につきましては今後変更される可能性がございますのでご了承ください．最新情報は以下のWEBページに掲載致します． http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ --- 担当: 青戸等人(東北大学)，花井亮(東京大学) ================================================================= 情報処理学会第84回プログラミング研究発表会プログラム ================================================================= 日程: 2011年6月14日(火)・15日(水) 会場: サン・リフレ函館 2階視聴覚室　　　〒040-0034 北海道函館市大森町2-14 　　　JR函館駅より徒歩15分詳細情報: http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ ※ 1件あたり45分 (発表25分，質疑・討論20分) ※ 発表の順番につきましてはまだ確定ではありませんのでご了承ください． 6月14日(火) セッション１：14:15-15:45 2011-1-(1)：14:15-15:00 An Annotated Type System for Inlining ○馬雷，佐藤周行(東京大学) 2011-1-(2)：15:00-15:45 コントロールオペレータの表現力の比較 ○高島尚希，亀山幸義(筑波大学) 15:45-16:00 休憩セッション２：16:00-17:30 2011-1-(3)：16:00-16:45 拡張可能な外部識別子の設計と実装 ○倉光君郎(横浜国立大学) 2011-1-(4)：16:45-17:30 SSA形式を用いた動的バイトコード操作器の設計と実装 ○若森拓馬，井出真広，菅谷みどり，倉光君郎(横浜国立大学) 19:30-21:30 懇親会 6月15日(水) セッション３：9:30-11:45 2011-1-(5)：9:30-10:15 書き換え帰納法における文脈探索の有効性について ○佐藤晴彦，栗原正仁(北海道大学) 2011-1-(6)：10:15-11:00 弱単項TRSのE重なり性について ○三橋一郎，大山口通夫，松浦邦博(三重大学) 2011-1-(7)：11:00-11:45 GUIアクセシビリティ技術による網羅的な画面遷移の回帰検査の自動化 ○中島一，増田健，秋山幸生(日本電信電話株式会社) ------------------------------------------------------------------------

1 0

CFP: Special Session on Logic and Knowledge Representation at IICAI-11
by Ken Kaneiwa 05 May '11

05 May '11

---------------------------------------------------------------------------------- Special Session on Logic and Knowledge Representation at The 5th Indian International Conference on Artificial Intelligence (IICAI-11) December 14-16, 2011, Tumkur (near Bangalore), India ---------------------------------------------------------------------------------- A special session on Logic and Knowledge Representation will be held during the 5th Indian International Conference on Artificial Intelligence (IICAI-11). The session invites papers in all areas of Logic and Knowledge Representation . For many years, logic has been studied as an important topic of knowledge representation and reasoning. In fact, many AI researchers use logic for analyzing the problems and for modeling the reasoning process. In addition, the knowledge representation research in AI lead to various extensions of logic in other fields such as philosophy, linguistics, cognitive science, computer science, etc. The special session on Logic and Knowledge Representation provides an ideal platform for exchanging ideas in all the areas related to logic and knowledge representation. The topics covered by the session include but certainly not limited to: * Abduction and Induction * Automated Reasoning * Belief Revision * Complexity of Reasoning * Description Logics * Foundations of Knowledge Representation * Hybrid Reasoning Systems * Knowledge-base Systems * Knowledge Representation and Reasoning * Logic for Databases * Logic for Multi-agent Systems * Logic for the Semantic Web * Logic Programming * Logical Formalisms in AI * Modal Logic * Nonclassical Logic * Nonmonotonic Reasoning * Object-Oriented Deductive Languages * Ontology * Ontology Description Languages * Order-Sorted Logic * Philosophical Logic * Proof Theory * Reasoning About Actions and Change * Temporal Representation and Reasoning Paper Submission and Publication: Authors are encouraged to submit the papers for this session as an email attachment to the Session Chair given below. The papers should be in MSWORD, PDF, or PS format and should be formatted according to the Springer Lecture Notes instructions (click here for instructions/sample paper) . The length of a paper should not exceed 20 pages. Shorter papers or papers on the work currently in progress are also welcome. The first page of the paper should contain the title, name(s) of the authors, affiliations, the postal and email addresses, and at least 3 keywords appropriate to the content of the paper. Further information regarding the paper submission can be obtained from the conference website too. Each paper will be peer reviewed by at least two experts in the topical area. All accepted papers will be published in the conference proceedings, under the title of the session. You may contact the conference chairs at iicai.conference[at]gmail.com for any additional information. Deadlines: Draft paper submission: May 9 , 2011 (extended deadline) June 7, 2011: Notification of acceptance/rejection to authors July 1 2011: Camera ready papers and Pre-registration due. December 14-16, 2011: Special Session and the IICAI-11 Conference Session Chair: Ken Kaneiwa Department of Electrical Engineering and Computer Science, Iwate University 4-3-5 Ueda, Morioka, Iwate 020-8551, Japan Email: kaneiwa(a)cis.iwate-u.ac.jp Tel/Fax: +81 19-621-6430 URL: http://www.ai.cis.iwate-u.ac.jp/kaneiwa/index.html URL of Kaneiwa Lab.: http://www.ai.cis.iwate-u.ac.jp

1 0

*DL Approaching* RIMS Workshop "ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics"
by Ichiro Hasuo 28 Apr '11

28 Apr '11

みなさま，以前お知らせした京大数理研の研究集会のご案内ですが（下です），旅費補助，数理研宿舎，講演，懇親会の申込みの締切りが *** 5/1 日曜日 *** です．また， - ちょうど親鸞750回忌と重なって，京都市内のホテルが大混雑です． - 数理研の宿舎「北白川学舎」，残室5室です！という都合もありますので，登録・宿舎の手配，どうか早めにお願いいたします．京都でお会いできるのを楽しみにしていますね．それでは！運営：照井一成，佐藤哲也，蓮尾一郎 ---------- Forwarded message ---------- From: Ichiro Hasuo <ichiro(a)kurims.kyoto-u.ac.jp> Date: 2011/4/5 Subject: Call for Contribution and Participation: RIMS Workshop "ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics" To: logic-ml <logic-ml(a)sato.kuis.kyoto-u.ac.jp>, sonoteno <sonoteno(a)m.aist.go.jp>, sigemb-info <sigemb-info(a)ertl.jp>, jssst-ppl(a)kb.ecei.tohoku.ac.jp (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

BLAST 2011
by No-Reply 22 Apr '11

22 Apr '11

** BLAST 2011 ** June 1-5, 2011 Lawrence, Kansas REGISTER NOW! 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: http://www.math.ku.edu/conferences/blast2011 * Important Deadlines * Early registration: May 15, 2011 Abstracts: May 15, 2011 In order to give a talk, one must submit a title and abstract for the talk by May 15, 2011. Please submit titles and abstracts at the Atlas. Abstracts submitted after May 1, 2011, will not appear in the booklet of abstracts. Abstracts may be viewed here: http://atlas-conferences.com/cgi-bin/abstract/cbbs-01 Hotel Accommodations: April 30, 2011 to guarantee conference rates The conference organizers can be contacted at: blast2011(a)math.ku.edu

1 0

Talk by Michele Basaldella at RIMS, Kyoto U. (4/21)
by Kazushige TERUI 17 Apr '11

17 Apr '11

みなさま今週木曜日に催されるセミナーのご案内をさせていただきます。どうぞお気軽にお越しください。照井 --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Michele Basaldella (RIMS, Kyoto University) Title: A gentle introduction to ludics Date: 11.00 - 12.00, April 21st (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: When one is interested in understanding the duality between syntax (proofs) and semantics (models) in logic, a primary obstacle is that proofs are finite and concrete objects, while models are infinite and abstract structures. Since proofs and models are so different by their nature, they hardly interact together. This lack of interaction between the two worlds prevents a deeper analysis of the relations between syntax and semantics. Ludics is a research program started by Girard aimed to explain various logical and computational phenomena from an interactive point of view. The universe of ludics consists of designs: partial and infinitary proofs in which the logical type-information has been almost erased. In this vast universe, both proofs and models can be homogeneously represented as designs. Moreover, since designs come from proofs, we can make them interact together via normalization (cut-elimination). This induces an orthogonality relation, based on the termination of the computation of the normal form, which allows to reconstruct the logical types, as bi-orthogonality-closed sets of designs. In this talk we introduce and discuss the basic concepts of ludics and show some completeness results for proofs. --------------------------------------------------------- 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

The 50th ToPS [Apr. 27]
by Kazuyuki ASADA 17 Apr '11

17 Apr '11

[Apologies for multiple copies] I am pleased to announce the 50th Tokyo Programming Seminar, which will be held at NII on April 27 (Wed). Ichiro Hasuo from University of Tokyo and Yde Venema from University of Amsterdam will be talking about coalgebra theory and automata theory. The programme is attached below. I'm looking forward to meeting you at ToPS. Best regards, Kazuyuki Asada ---- The 50th ToPS http://www.ipl.t.u-tokyo.ac.jp/~tops/upcoming_seminar.html Time: April 27th (Wed) 2011, 15:00--17:00 Place: Rm. 2004 & 2005, 20F, National Institute of Informatics Speaker: (1) Ichiro Hasuo (University of Tokyo) Introduction to Coalgebra, through Final Sequences Abstract: In this talk I wish to deliver an elementary and informal introduction to the theory of coalgebra---a mathematical machinery underlying coinductive datatypes in functional programming---focusing on its aspect of being the categorical dual to algebra. More specifically, I'll first review the categorical "initial sequence" construction of an initial algebra, and then elaborate on its dual--the "final sequence" construction of a final coalgebra. A trip along these sequences is a good way to familiarize ourselves with the essence of induction and coinduction, and the contrast between them. (2) Yde Venema (University of Amsterdam) Coalgebra Automata 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. Time permitting, 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

Talk by Michele Basaldella at RIMS, Kyoto U. (4/21)
by Kazushige TERUI 16 Apr '11

16 Apr '11

みなさま今週木曜日に催されるセミナーのご案内をさせていただきます。どうぞお気軽にお越しください。照井 --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Michele Basaldella (RIMS, Kyoto University) Title: A gentle introduction to ludics Date: 11.00 - 12.00, April 21st (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: When one is interested in understanding the duality between syntax (proofs) and semantics (models) in logic, a primary obstacle is that proofs are finite and concrete objects, while models are infinite and abstract structures. Since proofs and models are so different by their nature, they hardly interact together. This lack of interaction between the two worlds prevents a deeper analysis of the relations between syntax and semantics. Ludics is a research program started by Girard aimed to explain various logical and computational phenomena from an interactive point of view. The universe of ludics consists of designs: partial and infinitary proofs in which the logical type-information has been almost erased. In this vast universe, both proofs and models can be homogeneously represented as designs. Moreover, since designs come from proofs, we can make them interact together via normalization (cut-elimination). This induces an orthogonality relation, based on the termination of the computation of the normal form, which allows to reconstruct the logical types, as bi-orthogonality-closed sets of designs. In this talk we introduce and discuss the basic concepts of ludics and show some completeness results for proofs. ------------------------------------------ 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

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml