logic-mlの皆様、
国立情報学研究所のと申します。
本メーリングリストをお借りして、国立情報学研究所の主催で、アジアに
おける最初のダグスツールスタイル・セミナーとなる「NII湘南会議」の
企画募集をご案内させて頂きたいと思います。
NII湘南会議は、情報学の分野で世界的にトップレベルの研究者が一堂に会し、
叡智を分け合う場を提供します。会議は、毎月開催し、成田国際空港からも
アクセスのよい湘南国際村センターにて行われます。富士山をバックに、
湘南海岸を眼下に見下ろす景観が楽しめます。詳しくは、リーフレット
http://www.nii.ac.jp/shonan/wp-content/uploads/2010/08/smtg_low.pdf
もしくは本メールの後半の英文企画募集のほか、下記webサイトをご参照下さい。
http://www.nii.ac.jp/shonan/ (英文)
http://www.nii.ac.jp/about/international/shonanmtg/ (和文概要)
企画は随時受付けておりますが、年に3回締切りがあり…
[View More]、次の締切りは
12月15日となっております。
是非ご検討いただければ幸いです。
----
NII SHONAN MEETINGS: CALL FOR PROPOSAL
(1) Objective
NII Shonan Meetings, following the well-known Dagstuhl Seminars, aim
to promote informatics and informatics research at an international
level, by providing yet another world's premier venue for world-class
scientists, promising young researchers, and practitioners to come
together in Asia to exchange their knowledge, discuss their research
findings, and explore a cutting-edge informatics topics.
The meetings are held in Shonan Village Center (near Tokyo), which
offers a combination of facilities for conferences, trainings, lodging
in a resort-like setting. The friendly and open atmosphere is to
promote a culture of communication and exchange among the meeting
participants. The NII International Meetings are managed by National
Institute of Informatics (NII) in Japan.
(2) Scope and Style
NII Shonan Meetings follow the style of the Dagstuhl Seminars. A
meeting usually lasts for four days (Monday to Thursday) or shorter.
It is initiated by at most three organizers (one from Asia),
established leaders in their field, representing the different
communities invited to the Seminar, preferably from different
institutions. NII invites on their behalf about 25 to 35 researchers
of international standing from academia and industry.
Like Dagstuhl Seminars, an NII Shonan Meeting typically does not come
with a fixed program. Instead, the pace and the program are guided by
topics and presentations that evolve through discussions. In
particular, NII does not require participants to submit a paper for
presentation, or to give a presentation at all. On the contrary, NII
encourages to present new ideas and work in progress.
All administrate work of a meeting will be supported by the NII team
in the preparation phase and during the seminars themselves, so that
the organizers can focus on choosing research topics and selecting
active researchers for the meeting.
(3) Proposal Submissions
NII invites international standing scientists to submit proposals for
international meetings (with about 25-35 participants) on any topics
of informatics. The proposal should clearly motivate the topic of your
seminar and include the following items:
- Meeting Title
- Organizers (at most three, 1-page CV for each)
- Proposed Dates for the Meeting
- Description of the Meeting (1-2 pages, in English)
- Invitation list
(Position/First Name/Middle Name/Last Name/Affiliation/Email/Gender/URL/research list)
The proposal should be submitted via the following EasyChair page:
http://www.easychair.org/conferences/?conf=nim1
The proposal will be reviewed by the Academic Committee. Once the
proposal is approved, our staff will help to organize the seminar.
We welcome proposal submission anytime through a whole year, although
submission is closed in June 15th, September 15th and December 15th.
Notification of acceptance is only made after about 40 days of each
closing day.
(4) Locations and Expenses
The meetings are held in Shonan Village Center (near Tokyo), whose
nearest train station can be accessed by a direct train from Narita
International Airport, and offers a combination of facilities for
conferences, trainings, lodging in a resort-like setting.
http://www.shonan-village.co.jp/svc/
The following rates cover overnight accommodation (single room) and
full board (breakfast, lunch, and dinner) per day:
- Meeting organizers: free
- Participants from academia: 8,000 Yen/day
- Participants from industry: 15,000 Yen/day
- Accompanied persons to participants: 7,500 Yen/day (Meal charge is not included.)
(5) Organization
Organization Committee:
Yoh'ichi Tohkura (NII): Chair
Zhenjiang Hu (NII)
Akiko Aizawa (NII)
Hiroshi Hosobe (NII)
Hiroyuki Kato (NII)
Soichiro Hidaka (NII)
Academic Committee:
Zhenjiang Hu (NII): Chair
Akiko Aizawa (NII)
Ken'ichi Kawarabayashi (NII)
Masaru Kitsuregawa (Univ. of Tokyo)
Jeff Kramer (Imperial College London)
Katsumi Inoue (NII)
Kae Nemoto(NII)
Bashar Nuesibeh (Lero/Open Univ.)
Yoichi Sato (Univ. of Tokyo)
Shin'ichi Satoh (NII)
Satoshi Sekine (New York Univ./Rakuten Inst. of Tech.)
Akihiko Takano (NII)
(6) Inquiry
Should you have any questions, please feel free to contact us by
sending an email to
shonan(a)nii.ac.jp
More information about NII Shonan Meetings is available at the
following website:
http://www.nii.ac.jp/shonan/
国立情報学研究所 アーキテクチャ科学研究系 助教 日高 宗一郎
総合研究大学院大学 複合科学研究科 情報学専攻 併任 博士(工学)
hidaka(a)nii.ac.jp http://research.nii.ac.jp/~hidaka
〒101-8430 東京都千代田区一ツ橋2-1-2 学術総合センタービル内
TEL:03-4212-2586(直)/03-4212-2000(代) 内線2586 FAX:03-4212-2120
[View Less]
Kobe Colloquium on Logic, Statistics and Informatics (minicourse)
以下の要領でコロキウム(ミニコース)を開催します。
日時:2012年11月22日(木)15:10-16:40
と2012年11月26日(月)13:20-14:50
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
講演者:Boban Velickovic (Universite de Paris 7, Paris, France)
========================================================================
題目:Iteration of semiproper forcing revisited
アブストラクト:Recently Neeman introduced a new technique of
iterating proper forcing by using finite chains of elementary
submodels as …
[View More]side conditions. We present an extension and refinement
of this method which can be used to iterate a larger class of forcing
notions. We also discuss some possible generalizations and open problems.
========================================================================
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」
行きに乗車,「神大本部工学部前」停留所下車,徒歩すぐ.
http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm
連絡先:ブレンドレ ヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp
[View Less]
研究会のご案内
以下の要領で計算可能性,逆数学等に関する研究会
Computability Theory and Foundations of Mathematics (CTFM)
(2013年2月18日(月)〜2月20日(水),東京工業大学大岡山キャンパス)
を開催いたします.
幅広い分野から多くの方々の参加をお待ちいたします.
CTFM プログラム委員一同
CTFM(a)math.tohoku.ac.jp
============================================================
Computability Theory and Foundations of Mathematics
(Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013)
http://sendailogic.math.tohoku.ac.jp/CTFM/
============================================================
…
[View More]
Computability Theory and Foundations of Mathematics (CTFM) aims to
develop computability theory and logical foundations of Mathematics. The
scope involves the topics Computability Theory, Reverse Mathematics,
Nonstandard Analysis, Proof Theory, Constructive Mathematics, Theory of
Randomness and Computational Complexity Theory.
This is a successor workshop to Workshop on Proof Theory and
Computability Theory 2012 - Philosophical Frontiers in Reverse
Mathematics (February 20 - 23, 2012, Tokyo, Japan).
--------------------------------------------
Deadline of Submission for Presentations:
December 18, 2013
--------------------------------------------
Invited Speakers:
Chi Tat Chong (National University of Singapore)
Erik Palmgren (Stockholm University)
Michael Rathjen (University of Leeds)
Helmut Schwichtenberg (LMU Munich)
Stephen G. Simpson (Pennsylvania State University)
Yang Yue (National University of Singapore)
Wu Guohua (Nanyang Technological University)
--------------------------------------------
Programme Committee:
Toshiyasu Arai (Chiba)
Naohi Eguchi (Tohoku)
Hajime Ishihara (JAIST)
Ryo Kashima (Tokyo Institute of Technology)
Sam Sanders (Ghent)
Kazuyuki Tanaka (Tohoku, Co-chair)
Andreas Weiermann (Ghent, Co-chair)
Takeshi Yamazaki (Tohoku)
Keita Yokoyama (Tokyo Institute of Technology)
--------------------------------------------
[View Less]
Logic-ml の皆様,
東北大学の江口と申します.
以下の要領で講演会を行います.
当日は祝日のため建物の玄関が施錠されます.
参加ご希望の方は江口までお知らせください.
江口直日:eguchi(a)math.tohoku.ac.jp
=========================================
日時 2012年11月23日(金)
場所 東北大学北青葉山キャンパス理学総合A棟1201号室
14:00 - 16:00 横山啓太 (東京工業大学大学院情報理工学研究科)
Combinatorial principles and Reverse Mathematics
Abstract:
Determining the first-order/proof-theoretic strength of Ramsey's
theorem for pairs is a long-term open question in reverse mathematics.
In this talk, I will explain this question and …
[View More]related topics. After
that, I would like to have a discussion on several different
approaches for this question.
16:00 - 18:00 菊池健太郎 (東北大学電気通信研究所)
On Terms Representing Sequent Calculus Proofs
Abstract:
In this talk, we introduce a term notation to represent
proofs in a standard intuitionistic sequent calculus.
We identify a subset of the terms that correspond to
simply typed lambda-terms, and then discuss the relation
between beta-reduction and a cut-elimination procedure
which is represented by reduction rules on the terms.
--
江口 直日
東北大学 大学院理学研究科 数学専攻
産学官連携研究員
980-8578 宮城県仙台市青葉区荒巻字青葉6ー3
E-mail: eguchi(a)math.tohoku.ac.jp
[View Less]
みなさま,
ETAPS 併設のワークショップ HAS 2013 のご案内です.
特にハイブリッドシステム関連のみなさま,ぜひ投稿をご検討ください.
それでは!
蓮尾 一郎
東京大学大学院情報理工学系研究科
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
********************************************************************************
*************************************
FIRST CALL FOR PAPERS
Third Workshop on Hybrid Autonomous Systems (HAS 2013)
A satellite event of European Joint Conferences on Theory and Practice of
Software, ETAPS 2013
March 17, 2013, Rome, Italy
http://www2.warwick.ac.uk/…
[View More]fac/sci/maths/people/staff/bujorianu/has2013/
********************************************************************************
*************************************
SCOPE:
The interest on autonomous systems is increasing both in industry and academia.
Such systems must operate with limited human intervention in a changing
environment and must be able to compensate for significant system failures
without external intervention. The hybrid discrete-continuous models constitute
appropriate models of autonomous systems . Hybrid systems have behaviours
characterised by the interaction between continuous and discrete dynamics and
research in the area is driven by several school of thoughts. One approach is
mainly focussed on applications to automation systems and the models and methods
are centred on the concept of hybrid automaton (deterministic or probabilistic).
A distinct school of thought interprets hybrid systems as control systems with
regime change. Such systems are highly adaptive and suitable for modelling
autonomic behaviours. The most prominent models of this approach are the
stochastic hybrid systems and the mixed logical and dynamical systems. There is
a clear research opportunity to combine these approaches for developing models,
methods, techniques, methodologies, tools and environments for autonomous
systems engineering. This workshop brings together researchers interested in all
aspects
of autonomy and resilience of hybrid systems.
TOPICS:
Topics include (but are not limited to):
Ø new modelling paradigms for autonomous systems;
Ø verification and safety certification techniques;
Ø modelling, analysis and control of hybrid systems;
Ø uncertainty and stochastic modelling;
Ø multi-agent systems;
Ø algebraic and categorical methods;
Ø interaction between hybrid modelling and complexity science;
Ø reports on case studies and practical experiments;
Ø autonomous systems in natural science (e.g. from biology, ecology, climate).
INVITED SPEAKERS:
* Maria Domenica di Benedetto, L'Aquila University, IT
* Radu Grosu, Vienna University of Technology, AU
* Rafael Wisniewski, Aalborg University, DEN
SUBMISSIONS:
In order to encourage participation and discussion, this workshop solicits
the submission of regular papers, which must contain original work, and
must not have been previously published, nor be under consideration for
publication elsewhere. The accepted submissions should clearly indicate
the membership to one of the following categories:
- technical contributions;
- tutorials on a topic of importance;
- surveys on large extent cross-disciplinary research (e.g., project
outcomes);wor
- reports on early stage or ongoing work.
For each category of submission the novelty of the submission has to be clearly
stated and
the page limit should vary between 6 and 15 pages.
All submissions must be in PDF format and use the EPTCS latex style, see
http://style.eptcs.org/. Submissions can be made on the following website:
https://www.easychair.org/conferences/login_as_yes.cgi?a=3413468
The workshop PC will review all regular paper submissions to select
appropriate ones, ones for acceptance in each category, based on their
relevance, merit, originality, and technical content.
The authors of accepted submissions are expected to present and discuss
their work at the workshop. Accepted regular papers will be published
in the Electronic Proceedings in Theoretical Computer Science (EPTCS).
A special issue in a journal is under consideration.
IMPORTANT DATES:
Submission (regular paper): January 3, 2013
Notification: January 24, 2013
Final version (ETAPS proceedings): February 14, 2013
Workshop: March 17, 2013
Final version (EPTCS post proceedings): TBA
ORGANIZATION:
PC Chairs:
* Luca Bortolussi, University of Trieste, IT
* Manuela Bujorianu, University of Warwick, UK
* Giordano Pola, University of L’Aquila, IT
Program Committee:
* Ezio Bartocci, TU Wien, AU
* Maria Domenica di Benedetto, L'Aquila University, IT
* Luca Bortolussi, University of Trieste, IT (co-Chair)
* Manuela Bujorianu, University of Warwick, UK (co-Chair)
* Alberto Casagrande, Univeristy of Trieste, IT
* Thao Dang, Verimag, FR
* Louise Dennis, University of Liverpool, UK
* Clare Dixon, University of Liverpool, UK
* Alexandre Donzé, UC Berkeley, US
* Martin Fränzle, Carl von Ossietzky Universität, DE
* Ichiro Hasuo, University of Tokio, JP
* Agung Julius, Rensselaer Polytechnic Institute, US
* Toshimitsu Ushio, Osaka University, JP
* Giordano Pola, L'Aquila University, IT (co-Chair)
* Rom Langerak, University of Twente, NL
* David Parker, University of Birmingham, UK
* Guido Sanguinetti, University of Edinburgh, UK
* Olaf Stursberg, University of Kassel, DE
[View Less]
(重複して受け取られた場合はご容赦ください)
名古屋大学の中村と申します。
法情報学に関する国際ワークショップ JURISIN2012 のプログラムをお送りします。
今年の11月30日から12月1日にかけて宮崎で開催されますので
皆様のご参加をお待ちしております。
[Apologies for multiple copies]
--------------------------------------------------------
CALL FOR PARTICIPATION
Sixth International Workshop on
Juris-informatics (JURISIN 2012)
WEB: http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
Date: Nov.30 - Dec. 1, 2012
Venue: Amusement Zone Miyazaki (The JA-AZM Hall)
…
[View More]Kirishima 1-1-1, Miyazaki, Japan
Chairs: Makoto Nakamura and Katsuhiko Toyama
Invited Speakers:
1. Kazuhisa Todayama (Professor, Graduate School of Information Science,
Nagoya University, Japan)
2. Philip T H Chung (Executive Director, Australasian Legal Information
Institute, Australia) and Graham Greenleaf (Professor, Faculty of Law,
University of New South Wales, Australia)
Special Commentator:
Robert Kowalski (Professor Emeritus and Senior Research Fellow,
Department of Computing, Imperial College London)
--------------------------------------------------------
with a support of The Japanese Society for Artificial Intelligence in
association with Fourth JSAI International Symposia on AI (JSAI-isAI 2012)
**** Aims and scope ****
Juris-informatics is a new research area which studies legal issues
from the perspective of informatics. The purpose of this workshop is
to discuss both the fundamental and practical issues for
juris-informatics among people from the various backgrounds such as
law, social science, information and intelligent technology, logic and
philosophy, including the conventional "AI and law" area. We solicit
unpublished papers on theories, technologies and applications on
juris-informatics.
**** Topics ****
Relevant topics include, but are not limited to, the following:
* Legal reasoning
* Argumentation/Argumentation agent
* Legal term ontology
* Formal legal knowledge-base/Intelligent management of legal
knowledge-base
* Translation of legal documents
* Computer-aided law education
* Use of Informatics and AI in law
* Legal issues on ubiquitous computing/multi-agent system/the Internet
* Social implications of use of informatics and AI in law
**** Post Proceedings****
Springer Verlag has agreed to publish selected papers of the workshop in
the JSAI-isAI 2011 post-proceedings as a volume of LNAI. Thus, the
authors of papers presented at the workshop will be asked to extend
their contributions, possibly incorporating the results of the workshop
discussion, to be included in the workshop post-proceedings, after
another round of refereeing.
**** Important Dates ****
Deadline for onsite registration: November 24, 2012
JURISIN 2012: November 30 - December 1, 2012
**** Registration ****
Please refer to the website of JSAI-isAI:
http://ai-gakkai.or.jp/jsai-isai/2012/index.html#registration
**** JURISIN 2012 Program ****
Nov. 30, 2012
10:00-10:10 Opening Remark
10:10-11:10 Invited Talk I
* What Toulmin really wanted to do by "the Toulmin Model"
Kazuhisa Todayama (Nagoya University)
11:10-11:40 Coffee Break
11:40-12:40 General Session I
* Behavioural and Context Analysis in an Online Dispute Resolution Environment
Paulo Novais, Davide Carneiro, Marco Gomes and Jose Neves
* Privacy and Data Protection in Elderly Healthcare: Threats and Legal Warranties
Ângelo Costa, Francisco Andrade and Paulo Novais
12:40-14:00 Lunch Time
14:00-15:30 General Session II
* Summarization of Legal Texts with High Cohesion and Automatic Compression Rate
Mi-Young Kim, Ying Xu and Randy Goebel
* Syntactic Document Structure of Legal Documents
Hirokazu Igari and Akira Shimazu
* Discussion Analysis Using Temporal Data Crystallization
Takahiro Ueda, Masaki Sugimoto, Shogo Okada, Yukio Ohsawa, Yoshiharu Maeno and Katsumi Nitta
15:30-16:00 Coffee Break
16:00-18:00 Special Session: Logic Programming
Special Commentator: Robert Kowalski (Imperial College London)
* Detecting Conflicts in Legal Systems
Tingting Li, Tina Balke, Marina De Vos, Ken Satoh and Julian Padget
* Modelling Legitimate Expectations
Marina De Vos, Tina Balke and Ken Satoh
*Misconception in Legal Cases From Dynamic Logical Viewpoints
Katsuhiko Sano, Ryo Hatano and Satoshi Tojo
* On Generality of PROLEG Knowledge Representation
Ken Satoh, Takamune Kogawa, Nao Okada, Kentaro Omori, Shunsuke Omura and Kazuki Tsuchiya
19:00- Informal Workshop Dinner
Dec. 1, 2012
10:00-11:00 Invited Talk II
* Policies and Technologies in Development of Free Access to Legal Information: AustLII's
Experience, 1992-2012
Philip T. H. Chung and Graham Greenleaf (Australasian Legal Information Institute)
11:00-11:30 Coffee Break
11:30-12:30 General Session III
* On Law Enforcement in Norm-Governed Learning Agents
Regis Riveret, Giuseppe Contissa, Antonino Rotolo and Jeremy V Pitt
* Modeling and Analyzing Legal Interpretations for/by Requirements Engineering Approaches
Fuyuki Ishikawa, Rihoko Kawai Inoue and Shinichi Honiden
12:30-12:35 Closing Remark
**** Programme Committee Members ****
Thomas Agotnes, University of Bergen, Norway
Marina De Vos, University of Bath, UK
Phan Minh Dung, AIT, Thailand
Tom Gordon, Franfoher FOKUS, Germany
Guido Governatori, University of Queensland, Australia
Tokuyasu Kakuta, Nagoya University, Japan
Takehiko Kasahara, Toin University of Yokohama, Japan
Masahiro Kozuka, Kanazawa University, Japan
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Paulo Novais, University of Minho, Portugal
Jeremy Pitt, Imperial College London, UK
Henry Prakken, University of Utrecht & Groningen, the Netherlands
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Akira Shimazu, Japan Advanced Institute of Science and Technology, Japan
Fumihiko Takahashi, Meiji Gakuin University, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology, Japan
Katsuhiko Toyama, Nagoya University, Japan
Radboud Winkels, University of Amsterdam, the Netherlands
Shin-ichi, Yoro, Osaka University, Japan
John Zeleznikow, Victoria University, Australia
**** Home page of JURISIN 2012 ****
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
For any inquiry, please send it to "jurisin2012 ((at)) kl.i.is.nagoya-u.ac.jp".
[View Less]
皆様、下記のような論文募集が出ております。締め切りまで時間がありませんが、多数の投稿をお待ちしております。
==================================================
2nd International Workshop on
Engineering Safety and Security Systems
March 18, 2013, Luxembourg
Co-located with ICST 2013 in Luxembourg, March 18-22, 2013
More information:
http://www.comp.nus.edu.sg/~pat/esss2013/
===================================================
Important dates
-----------------
* December 21st 2012: Submission deadline
* January 28th 2013: Notification of acceptance/…
[View More]rejection
* March 18th 2013: Workshop
Introduction of the Workshop
-----------------
The International Workshop on Engineering Safety and Security Systems
(ESSS) aims at contributing to the challenge of constructing reliable
and secure systems. The workshop covers areas such as formal
specification, (extended) type checking, model checking, program
analysis/transformation, model-based testing and model-driven software
construction. The workshop will bring together researchers and
industry R&D expertise together to exchange their knowledge, discuss
their research findings, and explore potential collaborations.
Theme of the Workshop
-----------------
The main theme of the workshop is methods and techniques for
constructing large reliable and secure systems. The goal of the
workshop is to establish a platform for the exchange of ideas,
discussion, cross-fertilization, inspiration, co-operation, and
dissemination. The topics of the workshop include, but are not
limited to:
-- methods, techniques and tools for system safety and security
-- methods, techniques and tools for analysis, certification, and
debugging of complex safety and security systems
-- model-based and verification-based testing
-- emerging application domains such as cloud computing and
cyber-physical systems
-- case studies and experience reports on the use of formal methods
for analyzing safety and security systems
Submissions guidelines
-----------------
Paper submissions must be original, unpublished work. Submissions
should be in made via the Easychair site:
https://www.easychair.org/conferences/?conf=esss2013.
Submitted manuscripts should be in English and formatted in the style
of the IEEE Computer Society Proceedings Format (see
http://www.ieee.org/conferences_events/conferences/publishing/templates.html
).
Papers should not exceed 6 pages for full papers and 2 pages for short
papers, including figures, references, and appendices. All submissions
should be in PDF format. Submissions not adhering to the specified
format and length may be rejected immediately, without review.
All workshop papers will be published in the IEEE Digital Library in
the form of a post-proceedings. A pre-workshop version of the papers
will be available on the workshop website prior. Publication of
accepted articles requires the commitment of one of the authors to
register for the workshop and present the paper.
General chair
-----------------
Sjouke Mauw, University of Luxembourg, Luxembourg
Program chairs
-----------------
Yang Liu, Nanyang Technological University, Singapore
Jun Pang, University of Luxembourg, Luxembourg
Program committee
-----------------
Etienne Andre, Universite Paris 13, France
Cyrille Artho, AIST, Japan
Marieke Huisma, University of Twente, The Netherlands
Weiqiang Kong, Kyushu University, Japan
Keqin Li, SAP Research, France
Yang Liu, Nanyang Technological University, Singapore
Zhiming Liu, UNU/IIST Macao, China
Sjouke Mauw, University of Luxembourg, Luxembourg
Jun Pang, University of Luxembourg, Luxembourg
Geguang Pu, East China Normal University, China
Mohammad Torabi Dashti, ETH Zurich, Switzerland
Anton Wijs, Eindhoven University of Technology
Yoriyuki Yamagata, AIST, Japan
--
山形頼之
独立行政法人 産業技術総合研究所 研究員
E-mail: yoriyuki.yamagata(a)aist.go.jp
http://staff.aist.go.jp/yoriyuki.yamagata/
[View Less]
(重複して受け取られた場合はご容赦ください)
今年の11〜12月に宮崎で開催される LENLS 9 国際ワークショップの
プログラムをお送り致します。皆様のご参加をお待ちしております。
戸次大介(お茶の水女子大学/国立情報学研究所)
[Apologies for multiple copies]
=================================================================
CALL FOR PARTICIPATION
Logic and Engineering of
Natural Language Semantics 9 (LENLS 9)
Workshop Site : "Amusement Zone Miyazaki (The JA-AZM Hall)"
Kirishima 1-1-1, Miyazaki, Japan.
http://www.…
[View More]jaazm.jp/access/english.html
Dates : November 30 - December 2, 2012
Contact Person: Alastair Butler (PRESTO JST/Tohoku University)
Contact Email : lenls9[[at]]easychair.org
Website : http://www.is.ocha.ac.jp/‾bekki/lenls/
=================================================================
Chair: Alastair Butler (PRESTO JST/Tohoku University)
Co-chair: Daisuke Bekki (Ochanomizu University
/National Institute of Informatics)
Eric McCready (Aoyama Gakuin University)
Invited Speaker(s):
- Hans Kamp (University of Stuttgart)
- Kazuhiko Fukushima (Kansai Gaidai University)
LENLS is an annual international workshop on formal syntax,
semantics and pragmatics, focusing on the following topics.
It will be held as one of the workshops of
the forth JSAI International Symposia on AI (isAI2012)
(http://www.ai-gakkai.or.jp/jsai-isai/2012/)
sponsored by the Japan Society for Artificial Intelligence (JSAI)
(http://www.ai-gakkai.or.jp/jsai/english.html).
- 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-theoretic and utility-theoretic
approaches)
- Substructural expansion of Lambek Lambda Calculi
- Many-valued/Fuzzy and other non-classical logics and natural
language
Selected Papers:
================
We also plan to publish a selection of the accepted/invited papers
as a portion of a volume "JSAI-isAI selected papers", which will
be published from `Lecture Notes in Artificial Intelligence' series
(Springer Verlag).
Important dates:
================
Deadline for onsite registration: November 24, 2012
LENLS 9: November 30-December 01, 2012
Tutorial Lecture (by Hans Kamp): December 02, 2012
Registration:
=============
The proceedings of the workshop will be available at the
conference site for registered persons. Please follow the link
below and register yourself until 24th November 2012.
http://www.ai-gakkai.or.jp/jsai-isai/2012/index.html#registration
Program:
========
November 30th (Fri), 2012
-------------------------
09:00-10:00:Reception and Coffee Break
10:00-10:10:Opening Remarks
10:10-11:40:Session 1
* Aleksandra Kislak-Malinowska and Claudia Casadio
"Tupled Pregroups: A Study of Italian Clitic Patterns"
* Kata Balogh
"Hungarian pre-verbal focus and exhaustivity"
* Chungmin Lee
"Psych Predicates, the First Person, and Evidentiality "
11:40-13:30:Lunch
13:30-15:00:Session 2
* Liesbeth Martens and Giuseppe Primiero
"A Formal Approach to Vague Indexicals"
* Sai Qian and Maxime Amblard
"Accessibility for Plurals in Continuation Semantics"
* Takuya Matsuzaki
"Toward Wide-Coverage Natural Language Mathematical Problem
Solving"
15:00-15:30:Coffee break
15:30-17:00:Session 3
* Pascal Amsili, Emilia Ellsiepen and Gr'egoire Winterstein
"Parameters on the obligatoriness of `too'"
* Eric Mccready and Nicholas Asher
"Winning Strategies in Politeness"
* Daisuke Bekki and Nicholas Asher
"Subtyping for Logical Polysemy and Copredication"
17:00-17:30:Coffee break
17:30-18:30:Invited Talk 1
* Hans Kamp
"Speaking about the Present and Temporal Perspective Shift"
Alternates
----------
* Satoru Suzuki
"Measurement-Theoretic Foundations of Multidimensional-
Predicate-Comparison Logic"
December 01st (Sat), 2012
-------------------------
09:30-10:30:Reception and Coffee break
10:30-11:30:Session 4
* Richard Zuber
"Reciprocals as higher order functions"
* Decock Lieven, Richard Dietz and Douven Igor
"Modelling Comparative Concepts in Conceptual Spaces"
11:30-13:30:Lunch
13:30-15:00:Session 5
* Hanti Lin
"When `Or' Meets `Might': A Compositional Assertability
Semantics for Classical Logic and Epistemic Modals"
* Kohei Kishida
"Public Announcements under Sheaves"
* Shunsuke Yatabe
"Yablo's paradox, a coinductive language and its semantics"
15:00-15:30:Coffee break
15:30-17:00:Session 6
* David Yoshikazu Oshima
"On the functions of the Japanese discourse particle `ne': A
study with special reference to intonation"
* J.-R. Hayashishita and Daisuke Bekki
"On the semantic relation between noun phrases and quantity
expressions in Japanese"
* Alastair Butler, Ruriko Otomo, Zhen Zhou and Kei Yoshimoto
"Treebank annotation for formal semantics research"
17:00-17:30:Coffee break
17:30-18:30:Invited Talk 2
* Kazuhiko Fukushima
"Negation with a Bound Morpheme and Direct Compositionality"
Tutorial Lecture:
=================
On December 2nd (Sun), there will also be a tutorial lecture at
the workshop venue.
Lecturer: Hans Kamp (University of Stuttgart)
Venue: Amusement Zone Miyazaki (The JA-AZM Hall)
(Kirishima 1-1-1, Miyazaki, Japan)
Time Table:
10:00-12:00 Session 1
12:00-14:00 Lunch
14:00-16:00 Session 2
Title: Referring in Verbal Communication: The role and function of
names and other noun phrases as referential devices
Abstract
--------
The point of saying something is (normally) to communicate a
message to someone else. So we try to choose our words in such a
way that those we address will be able to decode the message we
want them to get. Part of this is that the words we choose must
enable our addressees to determine who or what we are talking
about. Languages have a repertoire of expressions that serve this
`referring' function, most prominently nominal phrases. For
instance, English has names, definite descriptions, pronouns and
demonstratives. This means that when an English speaker wants to
refer to someone or something, she has a choice between phrases of
these different kinds. And her choice will be guided by which
phrase will enable her addressees to identify the referent she
intends.
But the different types of referring phrases come with different `
decoding rules', which the recipient must apply in order to
identify the referent. But whether an addressee will succeed in
identifying the referent when he applies these rules, will usually
depend on what information he already has and that he can apply
the rules to. Therefore, when choosing a phrase to refer to a
given person or thing, a speaker will be guided by what she
assumes is already known to her audience.
A proper understanding of how different referring phrases function
can only be gained by paying close attention to the communication-
theoretic aspects of referring: We must study the interpretation
and production of referring phrases in tandem, as part of a
formally precise general theory of verbal communication which
describes how thoughts are verbally encoded by the speaker and
then decoded by the recipients of her utterance. I will outline
such a general framework for the study of verbal communication,
and we will use that framework to look into the conditions for
successful use of different types of referring phrases, focussing
in particular on proper names.
A crucial component of the general framework is the representation
of complex mental states, composed out of propositional attitudes
and entity representations. It is parts of such states that
speakers convert into words when they produce an utterance and it
is also parts of such states that help interpreters to turn those
utterances back into mental representations (which they then
incorporate into their mental states). The basis for this
component is Discourse Representation Theory (DRT), and, more
specifically, the DRT-based theory of propositional attitudes
sketched in the last part of (Kamp, Van Genabith and Reyle, 2011).
H. Kamp, J. Van Genabith and U. Reyle, `An Updated Survey of DRT'.
In: D. Gabbay (ed.) Handbook of Philosophical Logic, Volume 15,
125-394, Elsevier, 2011
Workshop Organizers/Program Committee:
======================================
- Alastair Butler (PRESTO JST/Tohoku University)
- Daisuke Bekki (Ochanomizu University
/National Institute of Informatics)
- Eric McCready (Aoyama Gakuin University)
- Koji Mineshima (Keio University)
- Yoshiki Mori (University of Tokyo)
- Yasuo Nakayama (Osaka University)
- Katsuhiko Sano (Japan Advanced Institute of Science and
Technology)
- Katsuhiko Yabushita (Naruto University of Education)
- Tomoyuki Yamada (Hokkaido University)
- Shunsuke Yatabe (National Institute of Advanced Industrial
Science and Technology)
- Kei Yoshimoto (Tohoku University)
[View Less]
Logicの皆様、
12月に京都で開催される APLAS と CPP という国際会議の参加募集案内を送ら
せて頂きます。
**早期割引の締め切りは11月10日です**
Jacques Garrigue & 五十嵐淳
======================================================================
CALL FOR PARTICIPATION
The 10th Asian Symposium on Programming Languages and Systems
(APLAS2012)
and
The Second International Conference on Certified Programs and Proofs
(CPP2012)
Kyoto, Japan
December 11-15, 2012
http://aplas12.kuis.kyoto-u.ac.…
[View More]jp/ (APLAS)
http://cpp12.kuis.kyoto-u.ac.jp/ (CPP)
APLAS aims at stimulating programming language research by providing a
forum for the presentation of latest results and the exchange of ideas
in topics concerned with programming languages and systems. APLAS is
based in Asia, but is an international forum that serves the worldwide
programming language community.
CPP is a new international forum on theoretical and practical topics
in all areas, including computer science, mathematics and education,
that consider certification as a essential paradigm for their work.
The 10th APLAS and 2nd CPP will be held together in Kyoto, Japan from
December 11 to 15, 2012. The five-day event includes, five invited
talks, and two conferences. The common registration site for both
conferences is now open at:
https://v3.apollon.nta.co.jp/aplas12_cpp12/
Early Registration (until November 10, 2012)
Regular | Student
-----------------------+-----------
APLAS+CPP: JPY 54000 | JPY 36000
APLAS only: JPY 31000 | JPY 22000
CPP only: JPY 31000 | JPY 22000
Venue
APLAS and CPP will take place at the Kyoto International Community
House, nearby the touristic area of Okazaki, inside Kyoto.
Kyoto International Community House
2-1 Torii-cho, Awataguchi, Sakyo-ku, Kyoto 606-8536
Invited Speakers
o Jan Vitek (Purdue University)
"Planet Dynamic or: How I Learned to Stop Worrying and Love Reflection"
o Greg Morrisett (Harvard University)
“Scalable Formal Machine Models”
o Xavier Leroy (INRIA)
“Mechanized Semantics for Compiler Verification”
o Gilles Barthe (IMDEA)
"Automation in computer-aided cryptography: proofs, attacks and designs"
o Naoki Kobayashi (University of Tokyo)
"Program Certification by Higher-Order Model Checking"
For detailed conference programs, see
- http://aplas12.kuis.kyoto-u.ac.jp/program.html
- http://cpp12.kuis.kyoto-u.ac.jp/program.html
[View Less]
1
0
講演のお知らせ
by minami@kurt.cla.kobe-u.ac.jp
04 Nov '12
みなさま,
東京大学の蓮尾研究室M1の森谷です.
蓮尾研究室では明日30日(直前で申し訳ないのですが)に Salzburg 大学の Ana Sokolova さん,
11月9日に Jan Rutten さんをお迎えしてご講演いただきます.
事前の登録等不要です.ご興味のある方はぜひお越しください!
==========================================================
Tue 30 October 2012, 16:40-18:10
Ana Sokolova (U. Salzburg),
Quantitative relaxations of concurrent data structures
理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7
This talk is about our recent work on relaxing the semantics of
concurrent data structures, in a quantitative way,…
[View More] so that they allow
better-performing implementations. By their nature, data structures
are bottlenecks in the presence of concurrency, e.g. the top pointer
of a stack is a point of contention for which all threads compete. As
a consequence, implementations of concurrent data structures often
show negative scalability. Recent trends in concurrency show that
relaxing the semantics may be the way to better performance. In this
work we provide a framework for quantitative relaxations of concurrent
data structures, where the allowed``error" from the perfect semantics
is quantified by a distance. During the talk, we will use a stack as a
running example. Also we present new concurrent implementation of a
quantitatively relaxed stack that performs well and shows positive
scalability.
(joint work with Thomas A. Henzinger, Christoph M. Kirsch, Hannes
Payer, and Ali Sezgin)
==========================================================
Fri 9 November 2012, 10:30-12:00
Jan Rutten (CWI Amsterdam & Radboud Univ. Nijmegen),
The method of coalgebra--an overview
理学部7号館地下1階 007教室 Room 007 (on the underground floor), School of
Science Bldg. No. 7
Since the early nineties, coalgebra has become an active area of
research in which one tries to understand all kinds of infinite data
types, automata, transition systems and dynamical systems from a
unifying perspective. The focus of coalgebra is on observable
behaviour and one uses coinduction as a central methodology, both for
behavioural specifications and to prove behavioural equivalences.
These days, one uses coalgebraic techniques in a wide variety of
areas, ranging from automata theory to software engineering to
ecology. In this talk, we shall illustrate the coalgebraic approach by
discussing a number examples, including streams, automata and
circuits.
[View Less]
Dr. Sylvain Salvati Lecture at NII Logic Seminar
Date: October 31, 2012, 13:30--15:30
Place: National Institute of Informatics, Lecture Room 1208 (12th floor)
場所: 国立情報学研究所 12階 1208室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Speaker: Dr. Sylvain Salvati (INRIA Bordeaux Sud-Ouest)
Title: Myhill-Nerode, Loader, Urzyczyn and logical relations
Abstract:
When trying to define a notion of recognizability on languages over a
particular …
[View More]class of structures, it is customary to prove an
equivalence between a class of machines and congruences of finite
index on those structures. Such equivalences can be coined as
"Myhill-Nerode theorems". This talk is going to be centered on such an
equivalence concerning languages of simply typed lambda-terms. Here
machines are type-checkers based on "uniform intersection types" and
finite index congruences are "extensional finite models" of the
lambda-calculus. The use of logical relations give a nice way of
proving that uniform intersection types and extensional finite models
allow to define exactly the same sets of lambda-terms. This result
relates two important results of the literature on lambda-calculus:
the undecidability of lambda-definability in finite standard models by
Loader (2001) and the undecidability of the inhabitation problem for
intersection types by Urzyczyn (1999). It shows in particular that
these two problems are turing-equivalent, and provides a refinement of
Urzyczyn's result. (Joint work with Giulio Mazonetto, Mai Gehrke and
Henk Barendregt)
問合せ先:
金沢 誠 (国立情報学研究所)
e-mail: kanazawa(a)nii.ac.jp
[View Less]
Logic-ml の皆様,
東北大学の江口と申します.
以下の要領で東北大学ロジックセミナー(田中・山崎研究室)
を開催いたします.
ご興味のある方は是非参加をご検討ください.
日時 平成24年9月2日(金)16時から.
場所 東北大学北青葉山キャンパス理学総合棟1201号室.
講演者 新井敏康 (千葉大学大学院理学研究科)
タイトル Proof theory of indescribable cardinals
アブストラクト
I will explain how to lift up the ordinal analyses to set theories
of indescribable cardinals.
This yields a proof-theoretic reduction of the existence of
a $\Pi^{1}_{n+1}$-indescribable cardinal to iterations of
$\Pi^{1}_{n}$-indescribabilities over ZF+V=L.
東北大学ロジックセミナーの情報は東…
[View More]北大学ロジックグループ
のホームページからもご覧いただけます.
https://sites.google.com/site/sendailogichomepage/
江口直日
--
江口 直日
東北大学 大学院理学研究科 数学専攻
産学官連携研究員
980-8578 宮城県仙台市青葉区荒巻字青葉6ー3
E-mail: eguchi(a)math.tohoku.ac.jp
[View Less]
皆様
RTA 2013 の論文募集をご案内致します。今回の RTA はオランダ Eindhoven で
行われ、TLCA 2013 との共催となっています。ぜひ投稿をご検討下さい。
廣川 直 (JAIST)
*************************************************************************
RTA 2013: FIRST CALL FOR PAPERS
24th International Conference on Rewriting Techniques and Applications
June 24 - 26, 2013
Eindhoven, The Netherlands
collocated with TLCA 2013 as part of RDP 2013
http://www.…
[View More]win.tue.nl/rdp2013/
*************************************************************************
abstract submission February 1 2013
paper submission February 5 2013
rebuttal period March 18-21 2013
notification April 4 2013
final version April 26 2013
*************************************************************************
The 24th International Conference on Rewriting Techniques and Applications
(RTA 2013) is organized as part of the Federated Conference on Rewriting,
Deduction, and Programming (RDP 2013), together with the 11th International
Conference on Typed Lambda Calculi and Applications (TLCA 2013), and
several
workshops. RDP 2013 will be held at the Eindhoven University of Technology
in the Netherlands.
*** TOPICS OF INTEREST ***
RTA is the major forum for the presentation of research on all aspects of
rewriting. Typical areas of interest include (but are not limited to):
Applications: case studies; analysis of cryptographic protocols; rule-based
(functional and logic) programming; symbolic and algebraic computation;
SMT solving; theorem proving; system synthesis and verification; proof
checking; reasoning about programming languages and logics; program
transformation; XML queries and transformations; systems biology;
homotopy theory; implicit computational complexity;
Foundations: equational logic; universal algebra; rewriting logic;
rewriting models of programs; matching and unification; narrowing;
completion techniques; strategies; rewriting calculi; constraint solving;
tree automata; termination; complexity; modularity;
Frameworks: string, term, and graph rewriting; lambda-calculus and
higher-order rewriting; constrained rewriting/deduction; categorical and
infinitary rewriting; stochastic rewriting; net rewriting; binding
techniques; Petri nets; higher-dimensional rewriting;
Implementation: implementation techniques; parallel execution; rewrite and
completion tools; certification of rewriting properties; abstract
machines; explicit substitutions; automated (non)termination and
confluence provers; automated complexity analysis.
*** PUBLICATION ***
The proceedings of RTA 2013 will be published by LIPIcs (Leibniz
International Proceedings in Informatics). LIPIcs is open access, meaning
that publications will be available online and free of charge, and authors
keep the copyright for their papers. LIPIcs publications are indexed in
DBLP.
For more information about LIPIcs please consult:
<http://www.dagstuhl.de/en/publications/lipics>
*** SUBMISSION GUIDELINES ***
Submissions must be
- original and not submitted for publication elsewhere,
- written in English,
- a research paper, or a problem set, or a system description,
- in pdf prepared with pdflatex using the LIPIcs stylefile:
<http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>,
- at most 10 pages for system description,
at most 15 pages for the other two types of submissions
- submitted electronically through the EasyChair system at:
<https://www.easychair.org/conferences/?conf=rta2013>.
The page limit and the deadline for submission are strict.
Additional material for instance proof details, may be given in an appendix
which is not subject to the page limit. However, submissions must be
self-contained within the respective page limit; reading the appendix
should
not be necessary to assess the merits of a submission.
*** PROGRAMME COMMITTEE CHAIR ***
Femke van Raamsdonk (VU University Amsterdam, The Netherlands)
*** PROGRAMME COMMITTEE ***
Eduardo Bonelli, National University of Quilmes
Byron Cook, Microsoft Research Cambridge
Stephanie Delaune, ENS Cachan
Gilles Dowek, Inria Paris-Rocquencourt
Maribel Fernandez, King's College London
Nao Hirokawa, JAIST Ishikawa
Delia Kesner, University Paris-Diderot
Helene Kirchner, Inria Paris-Rocquencourt
Barbara Koenig, University Duisburg Essen
Temur Kutsia, Johannes Kepler University Linz
Aart Middeldorp, University of Innsbruck
Vincent van Oostrom, Utrecht University
Femke van Raamsdonk, VU University Amsterdam
Kristoffer Rose, IBM Research New York
Manfred Schmidt-Schauss, Goethe University Frankfurt
Peter Selinger, Dalhousie University
Paula Severi, University of Leicester
Aaron Stump, The University of Iowa
Tarmo Uustalu, Institute of Cybernetics Tallinn
Roel de Vrijer, VU University Amsterdam
Johannes Waldmann, HTWK Leipzig
Hans Zantema, Eindhoven University of Technology
*** CONFERENCE CHAIR ***
Hans Zantema (Eindhoven University of Technology, The Netherlands)
*** STEERING COMMITTEE ***
Mauricio Ayala-Rincon, Brasilia University
Frederic Blanqui, INRIA Tsinghua University Beijing
Salvador Lucas, Technical University of Valencia
Georg Moser, University of Innsbruck
Masahiko Sakai, Nagoya University
Sophie Tison, University of Lille
*** FURTHER INFORMATION ***
Questions related to submission, reviewing, and programme should be sent to
the programme committee chair Femke van Raamsdonk, email femke at
few.vu.nl.
[View Less]
logic-ml の皆様,
12月に京都で開催される APLAS と CPP という国際会議の参加募集案内を送ら
せて頂きます。沢山のご参加をお待ちしております。
五十嵐淳 & Jacques Garrigue
======================================================================
CALL FOR PARTICIPATION
The 10th Asian Symposium on Programming Languages and Systems
(APLAS2012)
and
The 2nd International Conference on Certified Programs and Proofs
(CPP2012)
…
[View More] Kyoto, Japan
December 11-15, 2012
http://aplas12.kuis.kyoto-u.ac.jp/ (APLAS)
http://cpp12.kuis.kyoto-u.ac.jp/ (CPP)
APLAS aims at stimulating programming language research by providing a
forum for the presentation of latest results and the exchange of ideas
in topics concerned with programming languages and systems. APLAS is
based in Asia, but is an international forum that serves the worldwide
programming language community.
CPP is a new international forum on theoretical and practical topics
in all areas, including computer science, mathematics and education,
that consider certification as a essential paradigm for their work.
The 10th APLAS and 2nd CPP will be held together in Kyoto, Japan from
December 11 to 15, 2012. The five-day event includes, five invited
talks, and two conferences. The common registration site for both
conferences is now open at:
https://v3.apollon.nta.co.jp/aplas12_cpp12/
Early Registration (until November 10, 2012)
Regular | Student
-----------------------+-----------
APLAS+CPP: JPY 54000 | JPY 36000
APLAS only: JPY 31000 | JPY 22000
CPP only: JPY 31000 | JPY 22000
Venue
APLAS and CPP will take place at the Kyoto International Community
House, nearby the touristic area of Okazaki, inside Kyoto.
Kyoto International Community House
2-1 Torii-cho, Awataguchi, Sakyo-ku, Kyoto 606-8536
Invited Speakers
o Jan Vitek (Purdue University)
"Planet Dynamic or: How I Learned to Stop Worrying and Love Reflection"
o Greg Morrisett (Harvard University)
“Scalable Formal Machine Models”
o Xavier Leroy (INRIA)
“Mechanized Semantics for Compiler Verification”
o Gilles Barthe (IMDEA)
"Automation in computer-aided cryptography: proofs, attacks and designs"
o Naoki Kobayashi (University of Tokyo)
"Program Certification by Higher-Order Model Checking"
For detailed conference programs, see
- http://aplas12.kuis.kyoto-u.ac.jp/program.html
- http://cpp12.kuis.kyoto-u.ac.jp/program.html
[View Less]
logic-mlの皆様,
名古屋大学の西村と申します.
東京大学の村尾先生のご依頼により,
量子情報科学の国際会議TQC2013の告知を
投稿させていただきます.
よろしくお願いいたします.
名古屋大学大学院情報科学研究科
西村治道
--以下告知--
-------
Dear Friends,
The 8th Conference on the Theory of Quantum Computation, Communication
and Cryptography will be held at the University of Guelph, 21st--23rd
May 2013.
http://www.uoguelph.ca/quigs/tqc2013/index.html
There are some interesting news about TQC! The proceedings consisting of
accepted papers and a selection of posters will be published
…
[View More]electronically in the LIPIcs (Leibniz International Proceedings in
Informatics) series. The LIPIcs series guarantees perennial, free and
easy electronic access, while the authors will retain the rights over
their work (Attribution 3.0 Unported (CC BY 3.0)). Notice that abstract
material can be published elsewhere after TQC. For further information
please visit
http://www.uoguelph.ca/quigs/tqc2013/en/submissions.html
Here are the important dates:
Submission deadline: *** February 05, 2013 (23:59h in any time zone) ***
Notification of acceptance/rejection: March 15, 2013
Registration deadline: April 20, 2013
Short abstracts submission: May 5, 2013
Conference: May 21-23, 2013
Proceedings submission (final version of accepted papers): July 03, 2013
It would be great if you could forward this email to your
students/colleagues at your home institution.
Please accept our apologies if you receive multiple copies of this message.
Best wishes,
The TQC2013 Committees
tqc2013(a)gmail.com
[View Less]
みなさま,
こんにちは! 東京大学の蓮尾です.
国際会議 CALCO 2013 の案内をお送りします.
トピックは代数・余代数・形式検証の理論一般,
開催地はポーランド・ワルシャワ,締切は来年2月です.
どうか投稿をご検討ください.それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
---------- Forwarded message ----------
[Apologies for multiple copies]
=========================================================================
FIRST CALL FOR PAPERS: CALCO 2013
5th International Conference on Algebra and Coalgebra in Computer Science
September 3 - 6, 2013
…
[View More] Warsaw, Poland
http://coalg.org/calco13/
=========================================================================
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
=========================================================================
-- SCOPE --
CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science.
It 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), Udine (Italy, 2009)
and Winchester (UK, 2011). The fifth edition will be held in Warsaw,
the capital of Poland.
-- INVITED SPEAKERS --
N.N.
-- 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
-- NEW TOPICS --
This edition of CALCO will feature two new topics, and submission of
papers on these topics is especially encouraged.
* Corecursion in Programming Languages
- Corecursion in logic / constraint / functional / answer set
programming
- Corecursive type inference
- Coinductive methods for proving program properties
- Implementing corecursion
- Applications
* Algebra and Coalgebra in quantum computing
- Categorical semantics for quantum computing
- Quantum calculi and programming languages
- Foundational structures for quantum computing
- Applications of quantum 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.
-- BEST PAPER AND BEST PRESENTATION AWARDS --
For the first time, this edition of CALCO will feature two kinds of
awards: a best paper award whose recipients will be selected by the PC
before the conference and a best presentation award, elected by the
participants.
-- IMPORTANT DATES --
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
-- PROGRAMME COMMITTEE --
Luca Aceto - Reykjavik University, Iceland
Jiri Adamek - TU Braunschweig, D
Lars Birkedal - IT University of Copenhagen, DK
Filippo Bonchi - CNRS, ENS-Lyon, F
Corina Cirstea - University of Southhampton, UK
Bob Coecke - University of Oxford, UK
Andrea Corradini - University of Pisa, I
Mai Gehrke - Université Paris Diderot - Paris 7, F
H. Peter Gumm - Philipps University Marburg, D
Gopal Gupta - University of Texas at Dallas, USA
Ichiro Hasuo - Tokyo University, Japan
Reiko Heckel - University of Leicester, UK (cochair)
Bart Jacobs - Radboud University Nijmegen, NL
Ekaterina Komendantskaya - University of Dundee, Scotland, UK
Barbara König - University of Duisburg-Essen, D
José Meseguer - University of Illinois, Urbana-Champaign, USA
Marino Miculan - University of Udine, I
Stefan Milius - TU Braunschweig, D (cochair)
Larry Moss - Indiana University, Bloomington, USA
Till Mossakowski - DFKI Lab Bremen and University of Bremen, D
Prakash Panangaden - McGill University, Montreal, Canada
Dirk Pattinson - Imperial College London, UK
Dusko Pavlovic - Royal Holloway, University of London, UK
Daniela Petrisan - University of Leicester, UK
John Power - University of Bath, UK
Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL
Lutz Schröder - Friedrich-Alexander Universität Erlangen-Nürnberg, D
Monika Seisenberger - Swansea University, UK
Sam Staton - University of Cambridge, UK
Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL
Pawel Sobocinski - University of Southampton, UK
Yde Venema - University of Amsterdam, NL
Uwe Wolter - University of Bergen, NO
-- ORGANISING COMMITTEE --
Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)
-- LOCATION --
Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.
-- SATELLITE WORKSHOPS --
CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired
by Monika Seisenberger (Swansea University). The workshop is dedicated
to presentation of work in progress and original research
proposals. PhD students and young researchers are particularly
encouraged to contribute.
A workshop dedicated to tools based on algebraic and/or coalgebraic
principles, CALCO Tools, will be held alongside the main conference,
chaired by Lutz Schröder (Friedrich Alexander Universität
Erlangen-Nürnberg). Papers of this workshop will be included in the
CALCO proceedings.
-- FURTHER INFORMATION --
Queries related to submission, reviewing, and programme should be sent
to the relevant conference or workshop chairs.
Queries related to the organisation should be emailed to
calco2013(a)mimuw.edu.pl
.
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
[View Less]
皆様、
(重複してお受け取りになられた場合はご容赦ください)
産業技術総合研究所の武山と申します。この場をお借りしまして
来年1月22日にPOPL 2013に併設して開催される国際ワークショップ
PLPV 2013 の Last Call for Papers をご案内させていただきます。
プログラミング言語とプログラム検証に跨る話題について、
幅広く多くの研究コミュニティーからの論文投稿をお待ちしております。
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
The Seventh ACM SIGPLAN Workshop
on
Programming Languages meets Program Verification (PLPV 2013)
http://plpv.tcs.ifi.lmu.de/…
[View More] 22nd January, 2013
Rome, Italy
(Affiliated with POPL 2013)
Call for Papers
Overview
The goal of PLPV is to foster and stimulate research at the
intersection of programming languages and program verification, by
bringing together experts from diverse areas like types, contracts,
interactive theorem proving, model checking and program analysis. Work
in this area typically attempts to reduce the burden of program
verification by taking advantage of particular semantic or structural
properties of the programming language. One example are dependently
typed programming languages, which leverage a language's type system
to specify and check rich specifications. Another example are
extended static checking systems which incorporate contracts with
either static or dynamic contract checking.
We invite submissions on all aspects, both theoretical and practical,
of the integration of programming language and program verification
technology. To encourage interaction between different
communities, we seek a broad scope for PLPV. In particular,
submissions may have diverse foundations for verification (based on
types, Hoare-logic, abstract interpretation, etc), target
different kinds of programming languages (functional, imperative,
object-oriented, etc), and apply to diverse kinds of program
properties (data structure invariants, security properties, temporal
protocols, resource constraints, etc).
Important Dates
Submission 8th October, 2012 (Monday)
Notification 1st November, 2012 (Thursday)
Final Version 8th November, 2012 (Thursday)
Workshop 22nd January, 2013 (Tuesday)
Submissions
We seek submissions of up to 12 pages related to the above
topics; shorter submissions are also welcome. Submissions may describe
new work, propose new challenge problems for language-based
verification techniques, or present a known idea in an elegant way
(i.e., a pearl).
Submissions should be prepared with SIGPLAN two-column conference
format. Submitted papers must adhere to the SIGPLAN republication
policy. Concurrent submissions to other workshops, conferences,
journals, or similar forums of publication are not allowed.
To submit a paper, access the online submission site at
http://www.easychair.org/conferences/?conf=plpv2013.
Publication
Accepted papers will be published by the ACM and will appear in the
ACM Digital library.
Program Committee
Andreas Abel Ludwig-Maximilians-University Munich (co-chair)
Robert Atkey University of Strathclyde
Harley Eades The University of Iowa
Chung-Kil Hur Max Planck Institute for Software Systems
Brigitte Pientka McGill University
Andrew Pitts University of Cambridge
Francois Pottier INRIA
Tim Sheard Portland State University (co-chair)
Makoto Takeyama Advanced Industrial Science and Technology
--
Makoto Takeyama <makoto.takeyama(a)aist.go.jp>
AIST/RISEC (National Institute of Advanced Industrial Science and Technology /
Research Institute for Secure Systems)
tel: +81-6-6494-8045
[View Less]
CALL FOR PAPERS
Twenty-Eighth Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS 2013)
June 25-28, 2013, New Orleans, USA
http://www2.informatik.hu-berlin.de/lics/lics13/
LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA,
from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13
(23-25 June) and CSF13 (28-30 June).
The LICS Symposium is an annual international forum on theoretical and
practical …
[View More]topics in computer science that relate to logic, broadly construed.
We invite submissions on topics that fit under that rubric. Suggested, but
not exclusive, topics of interest include: automata theory, automated
deduction, categorical models and logics, concurrency and distributed
computation, constraint programming, constructive mathematics, database
theory, decision procedures, description logics, domain theory, finite model
theory, theory of automatic structures, formal aspects of program analysis,
formal methods, foundations of computability, higher-order logic, lambda
and combinatory calculi, linear logic, logic in artificial intelligence, logic
programming, logical aspects of bioinformatics, logical aspects of
computational complexity, logical aspects of quantum computation,
logical frameworks, logics of programs, modal and temporal logics,
model checking, probabilistic systems, process calculi, programming
language semantics, proof theory, real-time systems, reasoning about
security, rewriting, type systems and type theory, and verification.
Important Dates:
Authors are required to submit a paper title and a short abstract of about
100 words in advance of submitting the extended abstract of the paper.
Titles & Short Abstracts Due : January 7, 2013
Extended Abstracts Due : January 14, 2013
Author Notification (approximate) : March 22, 2013
Final Versions Due for Proceedings: April 26, 2013
Deadlines are firm; late submissions will not be considered. All submissions
will be electronic via http://easychair.org/conferences/?conf=lics2013.
Submission Instructions:
Every extended abstract must be submitted in the IEEE Proceedings 2-column
10pt format and may not be longer than 10 pages, including references.
LaTeX style files will be available on the conference website. The extended
abstract must be in English and provide sufficient detail to allow the
program committee to assess the merits of the paper. It should begin with
a succinct statement of the issues, a summary of the main results, and
a brief explanation of their significance and relevance to the conference
and to computer science, all phrased for the non-specialist. Technical
development directed to the specialist should follow. References and
comparisons with related work must be included. (If necessary, detailed
proofs of technical results may be included in a clearly-labeled appendix,
to be consulted at the discretion of program committee members.) Extended
abstracts not conforming to the above requirements will be rejected without
further consideration. Papers selection will be merit-based, with no a priori
limit on the number of accepted papers. Results must be unpublished and not
submitted for publication elsewhere, including the proceedings of other
symposia or workshops. The program chair must be informed, in advance of
submission, of any closely related work submitted or about to be submitted
to a conference or journal. Authors of accepted papers are expected to sign
copyright release forms. One author of each accepted paper is expected to
present it at the conference.
Short Presentations:
A session of short presentations, intended for descriptions of student
research, works in progress, and other brief communications, is planned.
These abstracts will not be published. Dates and guidelines will be
posted on the LICS website.
Kleene Award for Best Student Paper:
An award in honor of the late Stephen C. Kleene will be given
for the best student paper(s), as judged by the program committee.
Special Issues:
Full versions of up to three accepted papers, to be selected by the program
committee, will be invited for submission to the Journal of the ACM.
Additional selected papers will be invited to a special issue of Logical
Methods in Computer Science.
Sponsorship:
The symposium is sponsored by the IEEE Technical Committee on Mathematical
Foundations of Computing and by ACM SIGACT, in cooperation with the Association
for Symbolic Logic and the European Association for Theoretical
Computer Science.
Program Chair:
Orna Kupferman, Hebrew University
Program Committee:
Parosh A. Abdulla, Uppsala University
Amal Ahmed, Northeastern Universtiy
Sergei Artemov, City University of New York
Andrei Bulatov, Simon Fraser University
Yijia Chen, Shanghai Jiao Tong University
Veronique Cortier, CNRS, Loria
Mariangiola Dezani-Ciancaglini, Univ. di Torino
Thomas Ehrhard, CNRS, Universite Paris Diderot
Javier Esparza, Technische Universitaet Muenchen
Kousha Etessami, University of Edinburgh
Maribel Fernandez, King’s College London
Santiago Figueira, University of Buenos Aires
Simon Gay, University of Glasgow
Martin Grohe, Humboldt-Universitaet zu Berlin
Martin Hofmann, LMU Munich
Petr Jancar, Technical University Ostrava
Barbara Jobstmann, CNRS, Verimag and Jasper DA
Patricia Johann, University of Strathclyde
Bakhadyr Khoussainov, The University of Auckland
Antonina Kolokolova, University of Newfoundland
Victor Marek, University of Kentucky
Angelo Morzenti, Politecnico di Milano
Lawrence Moss, Indiana University
Madhavan Mukund, Chennai Math. Institute
Anca Muscholl, Universite Bordeaux
Mogens Nielsen, Aarhus University
Catuscia Palamidessi, INRIA, Ecole Polytechnique
Luc Segoufin, INRIA, ENS Cachan
Natarajan Shankar, SRI International
Alexandra Silva, Radboud University Nijmegen
Balder ten Cate, UC Santa Cruz
Kazushige Terui, Kyoto University
Ron van der Meyden, Univ. of New South Wales
Jeannette M. Wing, Carnegie Mellon University
Nobuko Yoshida, Imperial College London
Conference Chair:
Mike Mislove, Tulane University
Workshop Chair:
Patricia Bouyer-Decitre, CNRS, ENS Cachan
Publicity Chair:
Andrzej Murawski, Univ. of Leicester
General Chair:
Luke Ong, University of Oxford
Organizing Committee:
Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame,
Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum
Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna
Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman,
Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej
Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys,
Matt Valeriote
Advisory Board:
Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry
Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller,
John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin,
Moshe Vardi, Glynn Winskel
------------------------------------------
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/
[View Less]
$B3'MM!"(B
$B5~Bg$ND9C+@n$H?=$7$^$9!#(B
$BMhG/#67n$K%*%i%s%@$G3+:E$5$l$k9q:]2q5D!V(BTyped Lambda Calculi and
Applications$B!W$NO@J8Jg=80FFb$r$*Aw$j$7$^$9!#M}O@!&1~MQ$rLd$o$:!"(B
$B%i%`%@7W;;$d7?M}O@$K4XO"$7$?O@J8$NEj9F$r4?7^$$$?$7$^$9!#(B
$B4XO"=tJ,Ln$N3'MM!"@'HsEj9F$r$48!F$$/$@$5$$!#(B
$BD9C+@n???M(B
$B5~ETBg3X?tM}2r@O8&5f=j(B
================================================================
TLCA 2013 First Call for Papers
11th International Conference on
Typed …
[View More]Lambda Calculi and Applications
Eindhoven, 23-28 June 2013
co-located with RTA 2013 as part of RDP 2013
RDP 2013 webpage: http://www.win.tue.nl/rdp2013/
================================================================
The 11th International Conference on Typed Lambda Calculi
and Applications (TLCA 2013) is a forum for original
research in the theory and applications of typed lambda
calculus, broadly construed.
Suggested, but not exclusive, list of topics for submission are:
* Proof-theory: natural deduction, sequent calculi, cut elimination
and normalization, propositions as types, linear logic and proof
nets, type-theoretic aspects of computational complexity
* Semantics: denotational semantics, game semantics, realisability,
domain theory, categorical models
* Types: subtypes, dependent types, polymorphism, intersection types
and related approaches, type inference and type checking, types in
program analysis and verification, types in proof assistants
* Programming: foundational aspects of functional programming,
object-oriented programming and other programming paradigms,
flow analysis of higher-type computation, program equivalence,
program transformation and optimization
IMPORTANT DATES
* Paper Registration (titles & short abstracts): 25 January 2013
* Full Paper Submission: 1 February 2013
* Author Notification: 22 March 2013
* Camera-Ready Paper for the Proceedings: 12 April 2013
SUBMISSION GUIDELINES
We solicit submissions of research papers, which must:
* be in English and not exceed 15 pages (including figures and
bibliography). Additional material intended for the reviewers
but not for publication in the final version - for example
details of proofs - may be placed in a clearly marked appendix
that is not included in the page limit. Reviewers will be told
that they may choose to ignore the appendix.
* present original research which is unpublished and not submitted
elsewhere (conferences, journals, books, etc.)
* use the Springer-Verlag LNCS style.
* be submitted electronically in PDF via the EasyChair TLCA 2013
Submission Webpage (will open nearer the deadline)
https://www.easychair.org/conferences/?conf=tlca2013 .
Submissions deviating from these instructions may be rejected
without review. A condition of submission is that, if accepted,
one of the authors must attend the conference to give the
presentation. The proceedings will be published as a volume
in the ARCoSS subline series of Springer-Verlag Lecture Notes in
Computer Science. Final papers will be in the format specified by
Springer-Verlag. Any questions regarding the submission guidelines
should be directed to the Programme Committee Chair
(Masahito Hasegawa <tlca2013(a)easychair.org>) prior to
submitting.
COLOCATED EVENTS
TLCA 2013 is organized as part of the Federated Conference on
Rewriting, Deduction, and Programming (RDP 2013), together with
the International Conference on Rewriting Techniques and
Applications (RTA 2013) and several related events. Details on
workshops affiliated with RDP 2013 will be available at the web
site in due course.
CONFERENCE CHAIR
Herman Geuvers (Radboud University Nijmegen, Netherlands)
PROGRAMME COMMITTEE CHAIR
Masahito Hasegawa (Kyoto University, Japan)
PROGRAMME COMMITTEE
Andreas Abel (LMU Munchen, Germany)
Patrick Baillot (CNRS and ENS Lyon, France)
Nick Benton (Microsoft Cambridge, UK)
Lars Birkedal (IT University of Copenhagen, Denmark)
Herman Geuvers (Radboud University Nijmegen, Netherlands)
Masahito Hasegawa (Kyoto University, Japan) (PC chair)
Naoki Kobayashi (University of Tokyo, Japan)
Paul-Andre Mellies (CNRS and Universite Paris Diderot, France)
Thomas Streicher (TU Darmstadt, Germany)
Lorenzo Tortora de Falco (Universita Roma Tre, Italy)
Stephanie Weirich (University of Pennsylvania, US)
TLCA STEERING COMMITTEE
Samson Abramsky (University of Oxford, UK)
Henk Barendregt (Radboud University Nijmegen, Netherlands)
Pierre-Louis Curien (CNRS and Universite Paris Diderot, France)
Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy)
Martin Hofmann (LMU Munchen, Germany)
Luke Ong (University of Oxford, UK)
Simona Ronchi Della Rocca (Universita di Torino, Italy)
Pawel Urzyczyn (University of Warsaw, Poland)
TLCA HONORARY ADVISOR
Roger Hindley (Swansea University)
TLCA PUBLICITY CHAIR
Luca Paolini (Universita di Torino, Italy)
================================================================
[View Less]
# 複数受け取られた場合はご容赦ください。
京都大学の末永幸平と申します。
12月11〜13日に京都で開催される APLAS 2012 の
ポスター・デモ募集のお知らせをお送りします。
申し込みの締め切りまで一週間となりました。
どうぞ発表をご検討ください。
末永幸平
京都大学白眉センター
ksuenaga(a)fos.kuis.kyoto-u.ac.jp
--
10th Asian Symposium on
Programming Languages and Systems
(APLAS 2012)
December 11-13, 2012, Kyoto, Japan
(Co-located with CPP 2012)
http://aplas12.kuis.kyoto-u.ac.jp/…
[View More]
Call for Poster and Demos
APLAS 2012 will include a poster and demo session during the
conference. The poster session aims to give students and professionals
an opportunity to present technical materials to the research
community, and to get responses from other researchers in the field.
This year, accepted posters will be presented in the main hall so that
presenters have much opportunity of discussion during breaks. Standing
by the poster on each break is not mandatory, though.
* Scope
Poster and demo contributions are sought in all areas of programming
languages and systems, including the following topics:
- semantics, logics, foundational theory;
- design of languages and foundational calculi;
- type systems;
- compilers, interpreters, abstract machines;
- program derivation and transformation;
- program analysis, verification, model-checking, software security;
- concurrency, constraints, domain-specific languages;
- tools for programming, verification, implementation.
* Format of Posters
A space of A1 paper size (594 mm wide and 841 mm high) will be
provided for each presentation. AC Power outlet of 100V will be also
provided during the poster & demo session. If you need more space and
facilities, contact the poster chair (aplas2012-poster AT
fos.kuis.kyoto-u.ac.jp).
* Submission
Each presenter should e-mail a 1-2 page abstract in PDF to the poster
chair (Kohei Suenaga: aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) by
October 5th 2012. The abstract should include the title, author(s),
affiliation(s) and summary of the work. The program of the poster
session will be announced by October 29th, 2012. We hope to
accommodate every poster, but may restrict presentations (based on
relevance and interest to the community) due to space constraints.
* Important Dates
Submission deadline: October 5th, 2012
Notification: October 29th, 2012
* Contact
Poster chair: Kohei Suenaga
(aplas2012-poster AT fos.kuis.kyoto-u.ac.jp)
--
Kohei Suenaga
ksuenaga AT fos.kuis.kyoto-u.ac.jp
[View Less]
# 複数受け取られた場合はご容赦ください。
2012年9月18日(火)に京都大学文学研究科附属応用哲学・倫理学教育研究センター(CAPE)の主催にて開催されるCAPEロジック・ワークショップに、以下の講演が追加されます。
17:15-18:15 Greg Restall "Logical Constants and Focusing Disagreements"
ご案内として以下をご転送いたします。皆様のご参加をお待ち申し上げます。
矢田部俊介
---------- Forwarded message ----------
From: Toshihiko TAKENAKA <t-take(a)rj8.so-net.ne.jp>
Date: 2012/9/12
Subject: CAPEロジック・ワークショップ:講演追加のお知らせ
To: CAPE(a)bun.kyoto-u.ac.jp
皆様
2012年9月18日(火)に京都大学文学研究科附属応用哲学・倫理学教育研究センター
(CAPE)の主催にて開催されるCAPEロジック・ワークショップですが、以下の…
[View More]講演が
追加されました。
17:15-18:15 Greg Restall "Logical Constants and Focusing Disagreements"
皆様のご参加をお待ち申し上げます。
京都大学大学院文学研究科附属
応用哲学・倫理学教育研究センター
http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/
事務補佐 竹中利彦
〒606-0085 京都市左京区吉田本町 京都大学文学部内
CAPE(a)bun.kyoto-u.ac.jp
--- 記 ---
CAPEロジック・ワークショップ
日時:2012年9月18日(火) 10時30分〜18時15分
場所:京都大学文学部校舎二階第六講義室
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm
(8番の建物です)
講演者・題目:
10:30-12:00 大西琢郎 "Usefulness of deduction and Proof-Theoretic
Semantics"
13:30-15:00 Shawn Standefer: "Truth and conditionals"
15:30-17:00 丸山善宏 "Categorical Harmony and Degrees of Paradoxity"
17:15-18:15 Greg Restall "Logical Constants and Focusing Disagreements"
****************************************************************************
**********
CAPE Logic workshop
Date : September 18 (Tuesday)
Place: The 6th lecture room, 2nd floor, Faculty of letters, Kyoto
University
(building no.6 of the following map)
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm
*Schedule:
10:30-12:00 Takuro Onishi: "Usefulness of deduction and
Proof-Theoretic Semantics"
13:30-15:00 Shawn Standefer: "Truth and conditionals"
15:30-17:00 Yoshihiro Maruyama: "Categorical Harmony and Degrees of
Paradoxity"
17:15-18:15 Greg Restall "Logical Constants and Focusing Disagreements"
*Abstracts
(1)Speaker: Takuro Onishi
Title: Usefulness of deduction and Proof-Theoretic Semantics
Abstract:
Michael Dummett’s anti-realist theory of meaning is considered to
provide a philosophical basis of proof-theoretic semantics, which is
an inferentialis approach to logical validity. Unfortunately, in the
debate of proof-theoretic semantics, due attention has not been paid
to his fundamental consideration on the nature of deductive inference,
in which he emphasizes its usefulness or fruitfulness as well as its
validity. That is, deduction is a special kind of activity of
extending our knowledge. Dummett represents it as involving a certain
tension between validity and usefulness, and tries to reconcile it
against the background of his own meaning theory. In this talk I
present Dummett’s view on deduction, and compare it with G.Restall’s
bilateralist explication of logical consequence which would justify
classical logic.
(2)Speaker: Shawn Standefer
Title: Truth and conditionals
Abstract:
Some recent approaches to truth have adopted the strategy of enriching
the underlying logic with a new conditional. I will provide some
background on these approaches and distinguish different roles that
such conditionals play in the theory. I will show how this distinction
plays out in an extension of the revision theory of truth and use the
distinction to offer a philosophical defense of that theory.
(3)Speaker: Yoshihiro Maruyama
Title: Categorical Harmony and Degrees of Paradoxity
Abstract:
Prior's weird connective "tonk" compelled logicians to articulate the
concept of a logical constant, eventually giving rise to developments
of proof-theoretic semantics in the spirit of inferentialism, and to
the notion of proof-theoretic harmony in particular, which works as a
criterion to judge if a connective is a proper logical constant or
not. Different concepts of harmony have been proposed and discussed by
Belnap, Dummett, and many others.
Building upon Lawvere's understanding of logic via category theory, I
formulate a categorical concept of harmony relativised to primitive
vocabulary, and compare it with other notions of harmony. The
categorical conception of harmony leads us to a novel analysis of the
nature of tonk: namely, the problem of tonk is the problem of
equivocation in terms of adjoint functors. It finally turns out that
there are different degrees of paradoxity of logical constants from a
categorical perspective.
(4)Speaker: Greg Restall
Title: Logical Constants and Focusing Disagreements
Abstract:
For expressivists about logic (such as Robert Brandom and Jaroslav
Peregrin), logical vocabulary gives us means to do more than we could
without it. With concepts such as negation, conjunction,
conditionality, and the quantifiers, we can express contents which
would otherwise be out of reach to us. However, in another sense,
logical vocabulary seems to be neutral with regard to content. It does
not seem to add any new subject matter to our thoughts or
conversations.
I will attempt to explain why a certain class of logical expressions
(including the standard propositional connectives, first order
quantifiers, and perhaps some modal operators) give us means to extend
our expressive resources without adding new subject matter, by
attending to the role special that logical vocabulary can play in
articulating disagreements.
[View Less]
(重複して受け取られた場合はご容赦ください)
名古屋大学の中村と申します。
法情報学に関する国際ワークショップ JURISIN2012 の Final CFP をお送りします。
今年の11月30日から12月1日にかけて宮崎で開催されます。
投稿締め切りが9月24日まで延長されましたので、多数のご投稿をお待ちしております。
[Apologies for multiple copies]
---------------------------------------------------
Final Call for Papers (Deadline extended to Sep 24, 2012):
Sixth International Workshop on Juris-informatics (JURISIN 2012)
Nov.30 - Dec. 1, 2012
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
Amusement Zone Miyazaki (The JA-AZM Hall)
Kirishima 1-…
[View More]1-1, Miyazaki, Japan
with a support of The Japanese Society for Artificial Intelligence in
association with Fourth JSAI International Symposia on AI (JSAI-isAI 2012)
**** Submission Deadline: September 24, 2012 (extended) ****
**** Aims and scope ****
Juris-informatics is a new research area which studies legal issues
from the perspective of informatics. The purpose of this workshop is
to discuss both the fundamental and practical issues for
juris-informatics among people from the various backgrounds such as
law, social science, information and intelligent technology, logic and
philosophy, including the conventional "AI and law" area. We solicit
unpublished papers on theories, technologies and applications on
juris-informatics.
**** Topics ****
Relevant topics include, but are not limited to, the following:
* Legal reasoning
* Argumentation/Argumentation agent
* Legal term ontology
* Formal legal knowledge-base/Intelligent management of legal
knowledge-base
* Translation of legal documents
* Computer-aided law education
* Use of Informatics and AI in law
* Legal issues on ubiquitous computing/multi-agent system/the Internet
* Social implications of use of informatics and AI in law
**** Submissions ****
We welcome and encourage the submission of high quality, original
papers, which are not simultaneously submitted for publication
elsewhere except as a submission to JURIX 2012 (The 25th International
Conference on Legal Knowledge and Information Systems). The double
submission policy with JURIX 2012 is as follows:
1. Papers being submitted both to JURISIN2012 and JURIX2012 must note
this on the title page.
2. A paper to be presented at JURISIN2012 must be withdrawn from
JURIX2012 and vice versa according to the choice by the authors.
3. If the authors do not follow this double submission policy, the paper
by the authors will not be included in the proceedings of JURISIN 2012.
Papers should be written in English, formatted according to the
Springer Verlag LNCS style in a pdf form, which can be obtained from
http://www.springeronline.com, and not exceed 14 pages including
figures, references, etc.
If you use a word file, please follow the instruction of the format
designated at the workshop page, and then convert it into a pdf form
and submit it at the paper submission page.
If a paper is accepted, at least one author of the paper must register
the workshop and present it.
**** Invited Speakers ****
1. Kazuhisa Todayama (Professor, Graduate School of Information Science,
Nagoya University, Japan)
2. Philip T H Chung (Executive Director, Australasian Legal Information
Institute, Australia) and Graham Greenleaf (Professor, Faculty of Law,
University of New South Wales, Australia)
**** Proceedings ****
A printed volume of the proceedings with ISBN will be available at the
workshop.
**** Post Proceedings****
The chair of JSAI-IsAI 2012 is now negotiating with Springer Verlag to
publish selected papers of the workshop in the JSAI-isAI 2012
post-proceedings as a volume of LNAI. If it is the case, the authors
of papers presented at the workshop will be asked to extend their
contributions, possibly incorporating the results of the workshop
discussion, to be included in the workshop post-proceedings, after
another round of refereeing.
Note that the selected papers of the previous workshops were publisehd
as volumes of LNAI4914(JURISIN 2007), LNAI5447(JURISIN 2008),
LNAI6284(JURISIN 2009), LNAI6797(JURISIN2010) and LNAI7258(JURISIN2011),
respectively.
**** Financial Support for Students ****
We have received from JSAI partical economical support for travelling
costs for promising foreign students whose papers have been accepted
to be presented at JURISIN2012. The amount of the whole support is
250,000 yen and we divide it to students who need a support. The
actual support will vary based on the number of applicants and where
students come from. Please contact the chairperson (mnakamur ((at))
law.nagoya-u.ac.jp) for details.
**** Important Dates ****
Submission Deadline: September 24, 2012 (extended)
Notification: October 22, 2012 (extended)
Camera Ready Copy due: November 5, 2012 (extended)
JURISIN 2012: November 30 - December 1, 2012
**** Workshop Chair ****
Makoto Nakamura, Nagoya University, Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Organizing Committee Members ****
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST),
Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Programme Committee Members ****
Thomas Agotnes, University of Bergen, Norway
Marina De Vos, University of Bath, UK
Phan Minh Dung, AIT, Thailand
Tom Gordon, Franfoher FOKUS, Germany
Guido Governatori, The University of Queensland, Australia
Tokuyasu Kakuta, Nagoya University, Japan
Takehiko Kasahara, Toin University of Yokohama, Japan
Masahiro Kozuka, Kanazawa University, Japan
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Paulo Novais, University of Minho, Portugal
Jeremy Pitt, Imperial College, UK
Henry Prakken, University of Utrecht & Groningen, The Netherlands
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Akira Shimazu, Japan Advanced Institute of Science and Technology, Japan
Fumihiko Takahashi, Meiji Gakuin University, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology, Japan
Katsuhiko Toyama, Nagoya University, Japan
Radboud Winkels, The University of Amsterdam, the Netherlands
Shin-ichi, Yoro, Osaka University, Japan
John Zeleznikow, Victoria University, Australia
**** Home page of JURISIN 2012 ****
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
**** preivous JURISIN workshops ****
JURISIN2007 http://research.nii.ac.jp/~ksatoh/jurisin.html
JURISIN2008 http://www.ntt.dis.titech.ac.jp/jurisin2008/
JURISIN2009 http://research.nii.ac.jp/~ksatoh/jurisin2009.html
JURISIN2010 http://research.nii.ac.jp/~ksatoh/jurisin2010.html
JURISIN2011 http://research.nii.ac.jp/~ksatoh/jurisin2011.html
For any inquiry, please send it to "jurisin2012 ((at)) kl.i.is.nagoya-u.ac.jp".
[View Less]
SLACS2012講演者および参加を考慮されている皆様,
プログラムおよび梗概をお送り致します。
京都産業大学理学部数理科学科
三好博之
hxm(a)cc.kyoto-su.ac.jp
----------------------------------------------------------
9/15(土曜日)
13:00-13:30
鴨浩靖,萩尾由貴子,溝口涼子(講演者)(奈良女子大学理学部)
題目:三角形に関する平面ユークリッド幾何への数式処理の応用
梗概:未定
13:35-14:05
吉村和人(JAIST)
題目:オラクルの圏論的記述―終対象の一般化として―TTE
(Type-2 Theory of Effectivity) は計算可能解析学の枠組みの一
つである.TTEでの初等的な事実の一つとして,(計算可能性概念の
導入された) ある種の位相空間の間の写像に対してはオラクル計算
可能性と位相的連続性が一致するというものがある.本発表では左
記事実の圏論的特徴づけについて現状得られている結果の紹介を行
う .具体的には,factorization …
[View More]systemを伴う圏のうち適当な性
質を満たすものの上で: オラクルの概念の再現; オラクル計算可能
性と位相的連続性の一致に相当する命題の特徴づけ: 左記2点を吟
味する.
14:10-14:40
江口直日(東北大学理学研究科)
題目:Rewriting Apploaches to Computational Complexity and
Complexity Analysiss by Rewriting 梗概:関数型言語により定義
できる関数の多くは停止性を持つ項書き換えシステムとして表現す
ることができる.現在まで多項式解釈,行列解釈,リダクション順
序など項書き換えシステムの停止性を証明する方法が知られている.
こうした停止性の証明により,しばしば停止性だけでなく時間計算
量と深く関係する書き換え回数の上限を求めることができる.本講
演では経路順序と呼ばれるリダクション順序による計算量解析法に
ついてM. Avanzini, G. Moser (共に University of Innsbruck)と
の共同研究の成果を報告する.さらに新しく導入する経路順序は多
項式時間計算量に対して完全となることを説明する.
14:40-15:00 休憩20分
15:00-15:30
河野友亮
題目:論理CDの補完定理について梗概:中間論理のひとつであるCD
において、クレイグの補間定理が成り立たないことが[1]によって
証明された。そのおおまかな内容の解説に加え、CDを少し変えた論
理でもクレイグの補間定理が成り立たないことが[1]と同様の手法
で証明できることを示す。
[1] Failure of interpolation in the intuitionistic logic of
constant domains, Grigori Mints, Grigory Olkhovikov,
Alasdair Urquhart
15:35-16:05
岩波克(東京工業大学情報理工学研究科)
題目:様相Lukasiewicz論理の公理化について
梗概:Lukasiewicz論理の様相論理化にはいくつかの流儀が知られ
ているが、最も自然と思われる、Kripke modelを用いて様相論理化
したものの公理について考える。
14:40-15:00 休憩20分
16:10-16:40
龍田真(国立情報学研究所)
題目:Non-Commutative First-Order Sequent Calculus 梗概:非
可換一階シーケント計算NCLKについて講演する。まず、非可換
positive fragment を普通の一階シーケント計算で前件にグループ
があり右交換規則のない論理体系LK-に拡張する。次のことを示す。
(1) NCLK は LJ に同等、(2) NCLKに交換規則を追加するとLKに同
等になる、(3) LK-はLJに同等、(4) LK-とNCLKの間の翻訳。
16:45-17:15
龍田真(国立情報学研究所)
題目:TLCA未解決問題20番: 遺伝的置換子の型梗概:TLCA未解決問
題20番とは遺伝的置換子を特徴付ける型システムを見つけよという
問題である.本講演はこれに答える.まず,遺伝的置換子全体が枚
挙不可能であることを示すことにより,そのような型システムが存
在しないことを証明する.次に,最善解として,可算無限個の型を
与え,項がそのすべての型をもつこととその項が遺伝的置換子であ
ることが同等であることを証明する.本講演はLICS2008と同じ内容
である。
17:15-17:30
ビジネスミーティング(次回開催について)
18:00-20:00
懇親会
9/16(日曜日)
10:00-11:00
丸山善宏(Oxford University)
題目:Duality, Quantum Symmetry and Categorical Logic
梗概:After an introduction to duality theory, this talk is
two-fold while duality works as a unifying theme. In the
first part, we aim at articulating Chu Duality hidden in
Categorical Quantum Mechanics (i.e., dagger-compact
categories), thereby giving coalgebraic and logical
characterizations of quantum symmetries. In the second part,
we develop the framework of Categorical Universal Logic
building upon Lawvere's idea of hyperdoctrine, in which
duality theory can be exploited to find various models of
logic and set theory. From this perspective, we discuss the
following issues: Lawvere-Tierney topology; the tripos-topos
construction; and categorical quantum logic.
11:10-12:10
Nonstandard Static Analysis: Discrete Verification Methodologies
蓮尾一郎(東京大学情報理工学研究科)
題目:Nonstandard Static Analysis: Discrete Verification
Methodologies Transferred to Hybrid Applications 梗概:
*Hybrid systems* are those which exhibit both discrete
"jump" and continuous "flow" dynamics. Their importance---as
components of *cyber-physical systems*---is paramount now
that more and more physical systems (cars, airplanes, etc.)
are controlled with computers.
There are naturally two directions towards the study of
hybrid systems: *control theory* (typically continuous) and
*formal verification* (typically discrete). For us from the
formal verification community, therefore, the big challenge
is how to incorporate continuous "flow" dynamics. Many
existing techniques---such as hybrid automaton or Platzer’s
differential dynamic logic---include differential equations
explicitly. This incurs a difficult (and very interesting)
question of how to handle differential equations.
In our project we take a different path of *turning flow
into jump*---more precisely into infinitely many jumps each
of which is infinitesimal (i.e. infinitely small). This
makes everything discrete jump dynamics, to which all the
discrete techniques accumulated in the community of formal
verification readily apply. This venture is mathematically
supported by *nonstandard analysis*, where we can rigorously
speak about infinites and infinitesimals.
In the talk I will lay out: 1) our framework of a
while-language and a Hoare-style program logic, augmented
with an infinitesimal constant, for modeling and
verification of hybrid systems; 2) how discrete verification
techniques can be *transferred*, as they are, to hybrid
applications, via the celebrated *transfer principle* in
nonstandard analysis; and 3) the overview of our prototype
automatic prover.
The talk is based on the joint work with Kohei Suenaga,
Kyoto University. References:
[1] Kohei Suenaga and Ichiro Hasuo. Programming with
Infinitesimals: A While-Language for Hybrid System
Modeling. Proc. ICALP 2011, Track B. LNCS 6756,
p. 392-403. Springer-Verlag.
[2] Ichiro Hasuo and Kohei Suenaga. Exercises in Nonstandard
Static Analysis of Hybrid Systems. To appear in Proc. CAV
2012.
12:10-13:30 昼食
13:30-14:15
Michele Basaldella (JAIST) (この講演は英語で行われます)
演題:An interactive semantics for classical arithmetic
梗概:In this talk, we introduce a sequent calculus which is
a variant of some well-known proof-systems introduced by
Novikoff, Tait, Coquand, and Herbelin. A common - and
perhaps the most interesting - aspect of these kinds of
calculi is that they can be used to provide a simple and
elegant formulation of syntactical derivability for first
order classical arithmetic... at a reasonable price: we have
to consider infinitary formulas and infinitary derivations,
rather than the usual finitary ones. In more detail, we
will talk about a calculus which has the following features:
* we derive sequents (finite multisets) of infinitary
propositional formulas, * some inference rules may have an
infinite number of premises, * derivations are infinitary
trees made of sequents. We also require that both formulas
and derivations are (infinitary) well-founded objects, which
means that both formulas and derivations can be defined
inductively. The main purpose of this talk is to define an
interactive semantics for derivations strongly inspired by
Girard's ludics. The target of this analysis is not the
derivability predicate 'the formula A is derivable' as
traditionally in logic, but the more subtle - and deeper -
statement 'p is a proof of the formula A'. Specifically, we
define a notion of untyped derivation and a procedure of
interaction (a kind of cut-elimination procedure) between
these untyped objects. Next, we we define two relations
'PROVES' and 'INTERACTIVELY' between untyped derivations 'p'
and formulas 'A' such that * 'p PROVES A' is defined
inductively, it corresponds to 'p is a proof of the formula
A' in the sequent calculus. * 'p INTERACTIVELY A' holds
whenever the interaction between 'p' and all the tests for
'A' (special derivations associated to 'A' ) terminates. We
finally show a soundeness-and-completeness theorem: 'p
PROVES A' if and only if 'p INTERACTIVELY A'.
14:15-15:00
木原貴行(JAIST)
題目:On some variants of the Jayne-Rogers THeorem via the
Posner-Robinson Join THeorem
梗概:位相空間上の関数 F が (m,n)-可測であるとは,ボレル階層
の第 m 段階に属す集合の F による逆像が常にボレル階層の第 n
段階に属すことである.20世紀初頭,ルージンは任意のボレル可測
関数は可算個の連続関数に分解可能か,すなわち可算的連続かどう
か尋ねた.ルージン問題は1930年代に否定的解決が与えられ,現在
では,m が n 未満ならば,可算的連続でない (m,n)-可測関数が存
在することが知られている.その一方,Jayne-Rogers (1984) は,
(2,2)-可測性と区分的連続性が同値であることを示した.
Jayne-Rogers の定理の(n,n)-可測性への拡張,乃至,ボレル可測
関数の階層における可算的連続性の境界の発見は,現代の実解析学
における重要な問題の一つである.本発表では,連続的(n,n)-可測
性の概念を定義し,チューリング次数の代数的構造に関する
Posner-Robinson Join Theorem (1981) を介して,次の 5条件の同
値性を与える:「連続的 (n+1,n+1)-可測」「連続的(2,n+1)-可測
かつ可算的連続」「離散ベール第 n 類」「 n 世代神託学習によっ
て同定可能」「第 n 階区分的連続」
15:05-15:35
宮部賢志(京都大学数理解析研究所)
題目:ゲーム論的確率論入門
梗概:ゲーム論的確率論では測度を使わずに確率の理論を展開する.
その手法はランダムネスの理論に強く影響を受けており,証明では
多くの場面でアルゴリズムを作ることが要求される.そこで何らか
の形でコンピュータ科学にも参考になることを期待して,ゲーム論
的確率論の基本的な考え方を解説する.
15:35-15:55 休憩20分
15:55-16:40
松尾亮太(名古屋大学大学院情報科学研究科計算機数理科学専攻)
題目:戦略的論理式
梗概:戦略の定義を、Strategic formulaによって表現されるよう
な写像のことと改めることによって、自然な戦略の理論の構築を目
指す。R_G,n という命題論理の言語を定め、ここの論理式の内で戦
略を表現するようなものをStarategic formula と呼ぶ。この枠組
みによって、人が事実上用いることができる戦略の定義や、戦略の
複雑さの妥当な定義が可能となる。我々の方法の応用として、ゲー
ム理論における最も有名な定理の一つであり、哲学的な問題点も併
せ持った、The perfect folk theorem の解析を試みる。
16:45-17:30
小林聡(京都産業大学コンピュータ理工学部)
題目:未定
梗概:未定
17:35-18:35
佐藤雅大(名古屋大学多元数理科学研究科)
題目:未定(Coqによる数学について)
梗概:今回は私がCoqを用いて直観主義的集合論に基づいた数学の
理論を構築したことについて発表する。Coqで集合論を展開すると
いう試みはたくさん存在するが、今回は「Coqで集合論を展開した」
ということより「Coqで展開できた集合論の上でどのように数学が
展開できたか」という点に焦点を置いて発表したい。
18:35-18:40
次回予定アナウンスおよび挨拶
[View Less]
# 複数受け取られた場合はご容赦ください。
今月9月18日(火)の 10時30分〜17時に、京都大学文学部校舎二階第六講義室において、CAPEロジック・ワークショップのご案内をご転送いたします。皆様のご参加をお待ち申し上げます。
矢田部俊介
---------
皆様
京都大学文学研究科附属応用哲学・倫理学教育研究センター(CAPE)の主催にて、
CAPEロジック・ワークショップが下記のように 開催されます。
皆様のご参加をお待ち申し上げます。
京都大学大学院文学研究科附属
応用哲学・倫理学教育研究センター
http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/
事務補佐 竹中利彦
〒606-0085 京都市左京区吉田本町 京都大学文学部内
CAPE(a)bun.kyoto-u.ac.jp
--- 記 ---
CAPEロジック・ワークショップ
日時:2012年9月18日(火) 10時30分〜17時
場所:文学部校舎二階第六講義室
http://www.kyoto-u.ac.jp/ja/access/campus/…
[View More]map6r_y.htm
(8番の建物です)
講演者・題目:
10:30-12:00 大西琢朗 "Usefulness of deduction and Proof-Theoretic
Semantics"
13:30-15:00 Shawn Standefer: "Truth and conditionals"
15:30-17:00 丸山善宏 "Categorical Harmony and Degrees of Paradoxity"
****************************************************************************
**********
CAPE Logic workshop
Date : September 18 (Tuesday)
Place: The 6th lecture room, 2nd floor, Faculty of letters, Kyoto
University
(building no.6 of the following map)
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm
*Schedule:
10:30-12:00 Takuro Onishi: "Usefulness of deduction and
Proof-Theoretic Semantics"
13:30-15:00 Shawn Standefer: "Truth and conditionals"
15:30-17:00 Yoshihiro Maruyama: "Categorical Harmony and Degrees of
Paradoxity"
*Abstracts
(1)Speaker: Takuro Onishi
Title: Usefulness of deduction and Proof-Theoretic Semantics
Abstract:
Michael Dummett’s anti-realist theory of meaning is considered to
provide a philosophical basis of proof-theoretic semantics, which is
an inferentialis approach to logical validity. Unfortunately, in the
debate of proof-theoretic semantics, due attention has not been paid
to his fundamental consideration on the nature of deductive inference,
in which he emphasizes its usefulness or fruitfulness as well as its
validity. That is, deduction is a special kind of activity of
extending our knowledge. Dummett represents it as involving a certain
tension between validity and usefulness, and tries to reconcile it
against the background of his own meaning theory. In this talk I
present Dummett’s view on deduction, and compare it with G.Restall’s
bilateralist explication of logical consequence which would justify
classical logic.
(2)Speaker: Shawn Standefer
Title: Truth and conditionals
Abstract:
Some recent approaches to truth have adopted the strategy of enriching
the underlying logic with a new conditional. I will provide some
background on these approaches and distinguish different roles that
such conditionals play in the theory. I will show how this distinction
plays out in an extension of the revision theory of truth and use the
distinction to offer a philosophical defense of that theory.
(3)Speaker: Yoshihiro Maruyama
Title: Categorical Harmony and Degrees of Paradoxity
Abstract:
Prior's weird connective "tonk" compelled logicians to articulate the
concept of a logical constant, eventually giving rise to developments
of proof-theoretic semantics in the spirit of inferentialism, and to
the notion of proof-theoretic harmony in particular, which works as a
criterion to judge if a connective is a proper logical constant or
not. Different concepts of harmony have been proposed and discussed by
Belnap, Dummett, and many others.
Building upon Lawvere's understanding of logic via category theory, I
formulate a categorical concept of harmony relativised to primitive
vocabulary, and compare it with other notions of harmony. The
categorical conception of harmony leads us to a novel analysis of the
nature of tonk: namely, the problem of tonk is the problem of
equivocation in terms of adjoint functors. It finally turns out that
there are different degrees of paradoxity of logical constants from a
categorical perspective.
All slot consist of 60 minutes talk and 30 minutes discussion.
[View Less]
# 複数受け取られた場合はご容赦ください。
京都大学の末永幸平と申します。
12月11〜13日に京都で開催される APLAS 2012 の
ポスター・デモ募集のお知らせをお送りします。
今年の APLAS はせっかくの国内開催ですので、
多数のご発表をお待ち申し上げております。
末永幸平
京都大学白眉センター
ksuenaga(a)fos.kuis.kyoto-u.ac.jp
--
10th Asian Symposium on
Programming Languages and Systems
(APLAS 2012)
Call for Poster and Demos
APLAS 2012 will include a poster and demo session during the
conference. The poster session aims to give …
[View More]students and professionals
an opportunity to present technical materials to the research
community, and to get responses from other researchers in the field.
This year, accepted posters will be presented in the main hall so that
presenters have much opportunity of discussion during breaks. Standing
by the poster on each break is not mandatory, though.
* Scope
Poster and demo contributions are sought in all areas of programming
languages and systems, including the following topics:
- semantics, logics, foundational theory;
- design of languages and foundational calculi;
- type systems;
- compilers, interpreters, abstract machines;
- program derivation and transformation;
- program analysis, verification, model-checking, software security;
- concurrency, constraints, domain-specific languages;
- tools for programming, verification, implementation.
* Format of Posters
A space of A1 paper size (594 mm wide and 841 mm high) will be
provided for each presentation. AC Power outlet of 100V will be also
provided during the poster & demo session. If you need more space and
facilities, contact the poster chair (aplas2012-poster AT
fos.kuis.kyoto-u.ac.jp).
* Submission
Each presenter should e-mail a 1-2 page abstract in PDF to the poster
chair (Kohei Suenaga: aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) by
October 5th 2012. The abstract should include the title, author(s),
affiliation(s) and summary of the work. The program of the poster
session will be announced by October 29th, 2012. We hope to
accommodate every poster, but may restrict presentations (based on
relevance and interest to the community) due to space constraints.
* Important Dates
Submission deadline: October 5th, 2012
Notification: October 29th, 2012
* Contact
Poster chair: Kohei Suenaga
(aplas2012-poster AT fos.kuis.kyoto-u.ac.jp)
[View Less]
SWoPPメーリングリストの皆様、
(独)産業技術総合研究所の北村崇師です。
2012年11月12日〜16日に京都で開催される国際会議
ICFEM 2012 (14th International Conference on Formal Engineering Methods)
に併設して開催される国際ワークショップ
FTSCS 2012 (1st International Workshop on Formal Techniques for
Safety-Critical Systems) http://www.ftscs12.org/index.php?n=Main.Home
の論文投稿締切が 9 月 8 日に延長されました。
是非投稿を御検討頂けますようお願い申し上げます。
---------------------------------------------------------------------
Call for Papers
FTSCS …
[View More]2012
1st International Workshop on Formal Techniques for Safety-Critical Systems
Kyoto, Japan, November 12, 2012
(satellite workshop of ICFEM 2012)
http://www.ftscs12.org
---------------------------------------------------------------------
*** Extended submission deadline: September 8, 2012 ***
*** Science of Computer Programming special issue ***
*** EPTCS proceedings ***
Aims and Scope:
There is an increasing demand in industry to use formal methods to
achieve software-independent verification and validation of
safety-critical systems, e.g., in fields such as avionics, automotive,
medical, and other cyber-physical systems. Newer standards, such as
DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for
formal methods and model-based development, speeding up the
adaptation of such methods in industry.
The aim of this workshop is to bring together researchers
and engineers who are interested in the application of formal and semi-formal
methods to improve the quality of safety-critical computer systems. In
particular, FTSCS strives strives to promote research and development of
formal methods and tools for industrial applications, and is particularly
interested in industrial applications of formal methods.
Specific topics include, but are not limited to:
* case studies and experience reports on the use of formal methods for
analyzing safety-critical systems, including avionics, automotive,
medical, and other kinds of safety-critical and QoS-critical systems
* methods, techniques and tools to support automated analysis,
certification, debugging, etc., of complex safety/QoS-critical systems
* analysis methods that address the limitations of formal methods in
industry (usability, scalability, etc.)
* formal analysis support for modeling languages used in industry,
such as AADL, Ptolemy, SysML, SCADE, Modelica, etc.
* code generation from validated models.
The workshop will provide a platform for discussions and the exchange of
innovative ideas, so submissions on work in progress are encouraged.
Invited speaker:
TBA
Submission:
We solicit submissions reporting on:
A- original research contributions (16 pages max, EPTCS format);
B- applications and experiences (16 pages max, EPTCS format);
C- surveys, comparisons, and state-of-the-art reports (16 pages max,
EPTCS format);
D- tool papers (4 pages max, EPTCS format);
E- position papers and work in progress (4 pages max, EPTCS format)
related to the topics mentioned above.
All submissions must be original, unpublished, and not submitted concurrently
for publication elsewhere. Paper submission will be done electronically
via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2012.
The final version of the paper must be prepared in LaTeX, adhering to
the EPTCS format available at http://style.eptcs.org/.
Note, in particular, that EPTCS requires that you include the doi of
each reference in the bibliography.
Publication:
All accepted papers will appear in the pre-proceedings of FTSCS 2012.
Accepted papers in the categories A-D above will appear in
the workshop proceedings that will be published as a volume in
Electronic Proceedings in Theoretical Computer Science.
The authors of a selected subset of accepted papers will be invited to submit
extended versions of their papers to appear in a special issue of the
Science of Computer Programming journal.
Important dates:
Submission deadline: September 8, 2012
Notification of acceptance: October 1, 2012
Workshop: November 12, 2012
Venue:
Kyoto, Japan
Program chairs:
Cyrille Artho AIST, Japan
Peter Olveczky University of Oslo, Norway
Program committee:
Erika Abraham RWTH Aachen University, Germany
Musab AlTurki King Fahd University of Petroleum and Minerals,
Saudi Arabia
Farhad Arbab Leiden University and CWI, The Netherlands
Cyrille Artho AIST, Japan
Armin Biere Johannes Kepler University, Austria
Saddek Bensalem Verimag, France
Peter Bokor Technical University Darmstadt, Germany
Santiago Escobar Universidad Politecnica de Valencia, Spain
Bernd Fischer University of Southampton, UK
Klaus Havelund NASA JPL, USA
Marieke Huisman University of Twente, The Netherlands
Ralf Huuck NICTA/UNSW, Sydney, Australia
Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan
Takashi Kitamura AIST, Japan
Alexander Knapp Augsburg University, Germany
Yang Liu NUS, Singapore
Steven P. Miller Rockwell Collins, USA
Tang Nguyen AIST, Japan
Thomas Noll RWTH Aachen University, Germany
Peter Olveczky University of Oslo, Norway
Grigore Rosu University of Illinois at Urbana-Champaign, USA
Neha Rungta NASA Ames, USA
Carolyn Talcott SRI International, USA
Tatsuhiro Tsuchiya Osaka University, Japan
Contact:
(web) http://www.ftscs12.org
(email) peterol(a)ifi.uio.no
c.artho(a)aist.go.jp
--
Takashi KITAMURA Ph.D.
t.kitamura(a)aist.go.jp
Research Institute for Secure Systems (RISEC)
National Institute of Advanced Industrial Science and Technology (AIST)
Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan
Tel: +81-6-6494-8054 Fax: +81-6-6494-8073
[View Less]
(重複して受け取られた場合はご容赦ください)
名古屋大学の中村と申します。
法情報学に関する国際ワークショップ JURISIN2012 の 2nd CFP をお送りします。
今年の11月30日から12月1日にかけて宮崎で開催されます。
多数のご投稿をお待ちしております。
[Apologies for multiple copies]
---------------------------------------------------
Call for Papers:
Sixth International Workshop on Juris-informatics (JURISIN 2012)
Nov.30 - Dec. 1, 2012
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
Amusement Zone Miyazaki (The JA-AZM Hall)
Kirishima 1-1-1, Miyazaki, Japan
with a support of The Japanese Society for …
[View More]Artificial Intelligence in
association with Fourth JSAI International Symposia on AI (JSAI-isAI 2012)
**** Submission Deadline: September 17, 2012 ****
**** Aims and scope ****
Juris-informatics is a new research area which studies legal issues
from the perspective of informatics. The purpose of this workshop is
to discuss both the fundamental and practical issues for
juris-informatics among people from the various backgrounds such as
law, social science, information and intelligent technology, logic and
philosophy, including the conventional "AI and law" area. We solicit
unpublished papers on theories, technologies and applications on
juris-informatics.
**** Topics ****
Relevant topics include, but are not limited to, the following:
* Legal reasoning
* Argumentation/Argumentation agent
* Legal term ontology
* Formal legal knowledge-base/Intelligent management of legal
knowledge-base
* Translation of legal documents
* Computer-aided law education
* Use of Informatics and AI in law
* Legal issues on ubiquitous computing/multi-agent system/the Internet
* Social implications of use of informatics and AI in law
**** Submissions ****
We welcome and encourage the submission of high quality, original
papers, which are not simultaneously submitted for publication
elsewhere except as a submission to JURIX 2012 (The 25th International
Conference on Legal Knowledge and Information Systems). The double
submission policy with JURIX 2012 is as follows:
1. Papers being submitted both to JURISIN2012 and JURIX2012 must note
this on the title page.
2. A paper to be presented at JURISIN2012 must be withdrawn from
JURIX2012 and vice versa according to the choice by the authors.
3. If the authors do not follow this double submission policy, the paper
by the authors will not be included in the proceedings of JURISIN 2012.
Papers should be written in English, formatted according to the
Springer Verlag LNCS style in a pdf form, which can be obtained from
http://www.springeronline.com, and not exceed 14 pages including
figures, references, etc.
If you use a word file, please follow the instruction of the format
designated at the workshop page, and then convert it into a pdf form
and submit it at the paper submission page.
If a paper is accepted, at least one author of the paper must register
the workshop and present it.
**** Invited Speakers ****
1. Kazuhisa Todayama (Professor, Graduate School of Information Science,
Nagoya University, Japan)
2. Philip T H Chung (Executive Director, Australasian Legal Information
Institute, Australia) and Graham Greenleaf (Professor, Faculty of Law,
University of New South Wales, Australia)
**** Proceedings ****
A printed volume of the proceedings with ISBN will be available at the
workshop.
**** Post Proceedings****
The chair of JSAI-IsAI 2012 is now negotiating with Springer Verlag to
publish selected papers of the workshop in the JSAI-isAI 2012
post-proceedings as a volume of LNAI. If it is the case, the authors
of papers presented at the workshop will be asked to extend their
contributions, possibly incorporating the results of the workshop
discussion, to be included in the workshop post-proceedings, after
another round of refereeing.
Note that the selected papers of the previous workshops were publisehd
as volumes of LNAI4914(JURISIN 2007), LNAI5447(JURISIN 2008),
LNAI6284(JURISIN 2009), LNAI6797(JURISIN2010) and LNAI7258(JURISIN2011),
respectively.
**** Financial Support for Students ****
We have received from JSAI partical economical support for travelling
costs for promising foreign students whose papers have been accepted
to be presented at JURISIN2012. The amount of the whole support is
250,000 yen and we divide it to students who need a support. The
actual support will vary based on the number of applicants and where
students come from. Please contact the chairperson (mnakamur ((at))
law.nagoya-u.ac.jp) for details.
**** Important Dates ****
Submission Deadline: September 17, 2012
Notification: October 15, 2012
Camera Ready Copy due: October 29, 2012
JURISIN 2012: November 30 - December 1, 2012
**** Workshop Chair ****
Makoto Nakamura, Nagoya University, Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Organizing Committee Members ****
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST),
Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Programme Committee Members ****
Thomas Agotnes, University of Bergen, Norway
Marina De Vos, University of Bath, UK
Phan Minh Dung, AIT, Thailand
Tom Gordon, Franfoher FOKUS, Germany
Guido Governatori, The University of Queensland, Australia
Tokuyasu Kakuta, Nagoya University, Japan
Takehiko Kasahara, Toin University of Yokohama, Japan
Masahiro Kozuka, Kanazawa University, Japan
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Paulo Novais, University of Minho, Portugal
Jeremy Pitt, Imperial College, UK
Henry Prakken, University of Utrecht & Groningen, The Netherlands
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Akira Shimazu, Japan Advanced Institute of Science and Technology, Japan
Fumihiko Takahashi, Meiji Gakuin University, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology, Japan
Katsuhiko Toyama, Nagoya University, Japan
Radboud Winkels, The University of Amsterdam, the Netherlands
Shin-ichi, Yoro, Osaka University, Japan
John Zeleznikow, Victoria University, Australia
**** Home page of JURISIN 2012 ****
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
**** preivous JURISIN workshops ****
JURISIN2007 http://research.nii.ac.jp/~ksatoh/jurisin.html
JURISIN2008 http://www.ntt.dis.titech.ac.jp/jurisin2008/
JURISIN2009 http://research.nii.ac.jp/~ksatoh/jurisin2009.html
JURISIN2010 http://research.nii.ac.jp/~ksatoh/jurisin2010.html
JURISIN2011 http://research.nii.ac.jp/~ksatoh/jurisin2011.html
For any inquiry, please send it to "jurisin2012 ((at)) kl.i.is.nagoya-u.ac.jp".
[View Less]
The deadline for submissions has been extended to September 20, 2012,
23:59 Samoa Time Zone.
*Call for Papers*
TARK 2013
14th Conference on Theoretical Aspects of Rationality and Knowledge
January 7-9, 2013
The Institute of Mathematical Sciences, Chennai, India
Conference website: http://www.imsc.res.in/tark/
About the Conference
The mission of the TARK conferences is to bring together researchers
from a wide variety of fields, including Artificial Intelligence,
Cryptography, Distributed …
[View More]Computing, Economics and Game Theory,
Linguistics, Philosophy, and Psychology, in order to further our
understanding of interdisciplinary issues involving reasoning about
rationality and knowledge. Topics of interest include, but are not
limited to, semantic models for knowledge, belief, awareness and
uncertainty, bounded rationality and resource-bounded reasoning,
commonsense epistemic reasoning, epistemic logic, epistemic game
theory, knowledge and action, applications of reasoning about
knowledge and other mental states, belief revision, and foundations of
multi-agent systems.
Invited Speakers
Pierpaolo Battigalli, Bocconi University
Lin Fangzhen, Hong Kong University of Science and Technology
Rineke Verbrugge, University of Groningen
Submissions are now invited to TARK 2013. Extended Abstracts can be
submitted here:
https://www.easychair.org/conferences/?conf=tark2013
Strong preference will be given to papers whose topic is of interest
to an interdisciplinary audience, and papers should be accessible to
such an audience. Papers will be held to the usual high standards of
research publications. In particular, they should 1) contain enough
information to enable the program committee to identify the main
contribution of the work; 2) explain the significance of the work --
its novelty and its practical or theoretical implications; and 3)
include comparisons with and references to relevant literature.
Abstracts should be no longer than ten double-spaced pages (4,000
words). Optional technical details such as proofs may be included in
an appendix. An email address of the contact author should be
included. Papers arriving late or departing significantly from these
guidelines risk immediate rejection. One author of each accepted
paper will be expected to present the paper at the conference.
Economists should be aware that special arrangements have been made
with certain economics journals (in particular, with International
Journal of Game Theory, Games and Economic Behavior, Journal of
Economic Theory, and Mathematical Social Sciences, so that publication
of an extended abstract in TARK will not prejudice publication of a
full journal version.
TARK 2013 will precede the Indian Conference on Logics and
Applications (ICLA) held from January 10 - 12, 2013, also at the
Institute for Mathematical Sciences in Chennai, India.
TARK 2013 is the 14th conference of the TARK conference series.
Previous conferences have been held bi-annually around the world. The
most recent conference was held 2011 at the University of Groningen,
Netherlands, see http://www.philos.rug.nl/TARK2011/. The proceedings
of all previous TARK conferences can be accessed here
http://www.tark.org/.
TARK 2013 is the first TARK conference to be held in India. It is also
the first TARK conference to be held in January.
Key Dates for TARK 2013
Submission of abstracts - New Deadline: September 20, 2012, 23:59
Samoa Time Zone
Notification of authors: October 29, 2012
Camera ready copy of accepted papers: November 30, 2012
Conference: January 7 - 9, 2013, Institute of Mathematical Sciences,
Chennai, India
Program Committee
Samson Abramsky, Oxford University
Thomas Agotnes, Universitetet i Bergen
Hans van Ditmarsch, Universidad de Sevilla
Amanda Friedenberg, Arizona State University
Aviad Heifetz, The Open University of Israel
Jerome Lang, CNRS and Université Paris-Dauphine
Fenrong Liu, Tsinghua University
Larry Moss, Indiana University, Bloomington
Antonio Penta, University of Wisconsin-Madison
Andres Perea, Maastricht University
Ramaswamy Ramanujam, Institute for Mathematical Sciences, Chennai
Olivier Roy, Ludwig-Maximilians-Universität München
Burkhard C. Schipper, University of California, Davis
Marciano Siniscalchi, Northwestern University
Giacomo Sillari, Scuola Normale Superiore, Pisa
Nobuyuki Suzuki,Shizuoka University
Jonathan Zvesper, London
Local Organizing Committee
Sujata Ghosh, Indian Statistical Institute, Chennai
Kamal Lodaya, Institute of Mathematical Sciences, Chennai
R. Ramanujam, Institute of Mathematical Sciences, Chennai
S. P. Suresh, Chennai Mathematical Institute
Program Chair
Burkhard C. Schipper
University of California, Davis
Department of Economics
One Shields Avenue
Davis, CA 95616, USA
Email: bcschipper-at-ucdavis-dot-edu
Local Organizing Chair
R. Ramanujam
Institute for Mathematical Sciences
CIT Campus, Taramani
Chennai 600 113, India.
Email: tark2013org at gmail dot com
Chair of the TARK Conference Series
Joe Halpern
Cornell University
Computer Science Department
--
----------------------------------------------------------
[View Less]
(重複して受け取られた場合はご容赦ください)
今年の12月に宮崎で開催される LENLS 9 国際ワークショップのFinal
CFPをお送り致します。多数のご投稿をお待ちしております。
※投稿締切が ***9/9(日)*** に延長されました。
戸次大介(お茶の水女子大学)
[Apologies for multiple copies]
=================================================================
DEADLINE EXTENDED!!
=================================================================
FINAL CALL FOR PAPERS
Logic and Engineering of
Natural Language Semantics 9 (LENLS 9)
…
[View More]Workshop Site : "Amusement Zone Miyazaki (The JA-AZM Hall)"
Kirishima 1-1-1, Miyazaki, Japan.
http://www.jaazm.jp/access/english.html
Dates : December 1-3, 2012
Contact Person: Alastair Butler (PRESTO JST/Tohoku University)
Contact Email : lenls9[[at]]easychair.org
Website : http://www.is.ocha.ac.jp/‾bekki/lenls/
=================================================================
Chair: Alastair Butler (PRESTO JST/Tohoku University)
Co-chair: Daisuke Bekki (Ochanomizu University/
National Institute of Informatics)
Eric McCready (Aoyama Gakuin University)
Invited Speaker(s):
- Hans Kamp (University of Stuttgart)
Call For Papers:
================
LENLS is an annual international workshop focusing on formal semantics
and pragmatics. It will be held as one of the workshops of
the third JSAI International Symposia on AI (isAI2012)
(http://www.ai-gakkai.or.jp/jsai-isai/2012/)
sponsored by the Japan Society for Artificial Intelligence (JSAI)
(http://www.ai-gakkai.or.jp/jsai/english.html).
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-theoretic and utility-theoretic
approaches)
- Substructural expansion of Lambek Lambda Calculi
- Many-valued/Fuzzy and other non-classical logics and natural language
Submissions:
============
Abstracts (up to 4 pages, including figures, bibliography, apendices)
must be submitted electronically in PDF format at:
https://www.easychair.org/conferences/?conf=lenls9
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.
Selected Papers
===============
A selection of the accepted/invited papers will be published as a
portion of a volume "New Frontiers in Artificial Intelligence,
JSAI-isAI2012 selected papers", Lecture Notes in Artificial
Intelligence (LNAI) series, Springer Verlag.
Important dates:
================
Abstract submission deadline: September 9, 2012 (EXTENDED!!)
Notification of acceptance: October 10, 2012
Deadline for camera-ready copy: October 31, 2012
Deadline for onsite registration: November 24, 2012
LENLS9: December 01-02, 2012
Tutorial Lecture (by Hans Kamp): December 03, 2012
Workshop Organizers/Program Committee:
======================================
- Alastair Butler (PRESTO JST/Tohoku University)
- Daisuke Bekki (Ochanomizu University/
National Institute of Informatics)
- Eric McCready (Aoyama Gakuin University)
- Koji Mineshima (Keio University)
- Yoshiki Mori (University of Tokyo)
- Yasuo Nakayama (Osaka University)
- Katsuhiko Sano (Japan Advanced Institute of Science and Technology)
- Katsuhiko Yabushita (Naruto University of Education)
- Tomoyuki Yamada (Hokkaido University)
- Shunsuke Yatabe (National Institute of
Advanced Industrial Science and Technology)
- Kei Yoshimoto (Tohoku University)
[View Less]
CALL FOR PAPERS - INTERNATIONAL JOURNAL OF LOGIC and COMPUTATION (IJLP)
ISSN: 2180-1290
Volume 3, Issue 1
Info. at http://www.cscjournals.org/csc/journals/IJLP/journal_cfp.php?JCode=IJLP
Computer Science Journals (CSC Journals) invites researchers, editors, scientists & scholars to publish their scientific research papers in an International Journal of Logic and Computation (IJLP) Volume 3, Issue 1.
The International Journal of Logic and Computation aims to promote the growth of …
[View More]logic and computing research from the perspectives of logic, mathematics and computer science, but emphasizes semantics of programs, in contrast with the traditional treatment of formal languages as sets of strings. IJLP promote this new field with its comprehensive selection of technical scientific papers and regular contributions such as letters, reviews and discussions for logical systems using classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, logical issues in logic programming, knowledge-based systems and automated reasoning programing; logical programming issues in knowledge representation, non-monotonic reasoning, logics and semantics of programming and applications of logic in hardware and VLSI.
CSC Journals anticipate and invite papers on any of the following topics:
Applications of Logic in Hardware and VLSI
Modal Logic
Categorical Logic
Natural Language
Challenges in Natural Language and Reasoning
Non-Monotonic Reasoning
Classical and Non-Classical Logic
Programming Expressiveness
Computer Logical Reasoning
Programming Reasoning Test Collection
Constructive Logic
Reasoning Systems
Knowledge-Based Systems and Automated Reasoning Pr
Semantic Representation in Logic Programming
Logic Representation Techniques
Soft Computing Techniques
Logical Issues in Logic Programming
State-Based Semantics
Logical Programming Issues in Knowledge Representa
Type Theory
Logics and Semantics of Programming
Important Dates - IJLP CFP - Volume 3, Issue 1.
Paper Submission: September 30, 2012
Author Notification: November 15, 2012
Issue Publication: December 2012
For complete details about IJLP archives publications, abstracting/indexing, editorial board and other important information, please refer to IJLP homepage.
We look forward to receive your valuable papers. If you have further questions please do not hesitate to contact us at cscpress(a)cscjournals.org. Our team is committed to provide a quick and supportive service throughout the publication process.
A complete list of journals can be found at http://www.cscjournals.org/csc/bysubject.php
Sincerely,
J. Stewart
Computer Science Journals (CSC Journals)
B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia
Tel: + 603 6207 1607, + 603 2782 6991
Fax:+ 603 6207 1697
Url: http://www.cscjournals.org
[View Less]
(重複の場合はご容赦ください.)
皆様,
北陸先端科学技術大学院大学の千葉です.
11月に京都で開催されるICFEM 2012の参加募集を投稿させて頂きます.
是非参加をご検討下さい.
よろしくお願いします.
************************************************************
ICFEM 2012: 14th International Conference on Formal Engineering Methods
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
************************************************************
CALL FOR PARTICIPATION
REGISTRATION
------------
Registration for ICFEM 2012 is now open. …
[View More]Please visit
http://www.jaist.ac.jp/icfem2012/registration/index.html.
To take advantage of early registration, kindly register before August 31, 2012.
We encourage you to reserve your hotel rooms ASAP, since it is a peak season
in Kyoto for brilliant autumn leaves!
This year's ICFEM has four affiliated workshops and a tutorial, and three
prominent invited speakers. The program will be announced at the conference web
site shortly.
CO-LOCATED EVENTS
-----------------
- FTSCS 2012 : First International Workshop on Formal Techniques for
Safety-Critical Systems, http://www.ftscs12.org/
- WSOFL 2012 : 2nd Workshop on SOFL, http://icfem-fema.org/sofl/
- Event-B 2012 : DS-Event-B-2012: Workshop on the experience of and advances in
developing dependable systems in Event-B, http://research.nii.ac.jp/eventb2012/
- Japanese Workshop on Industrial Applications of Formal Methods
- CbC-Depend: Correct-by-Construction Development of Dependable Systems,
Tutorial, http://www.rodintools.org/tutorial.html
INVITED SPEAKERS
----------------
- Darren Cofer (Rockwell Collins, USA), "Formal Methods in the Aerospace
Industry: Follow the Money"
- Robert Shostak (Vocera Communications, Inc., USA), "Applying Term Rewriting
to Speech Recognition of Numbers"
- Mario Tokoro (Sony Computer Science Laboratories, Inc., Japan), "Toward
Practical Application of Formal Methods in Software Lifecycle Processes"
ACCEPTED PAPERS
---------------
The list of accepted papers may be found at:
http://www.jaist.ac.jp/icfem2012/acceptedPapers/index.html
ORGANIZATION COMMITTEE
-----------------------
General Chairs:
Kokichi Futatsugi, JAIST, Japan
Shaoying Liu, Hosei Uni., Japan
Conference Chair:
Hitoshi Ohsaki, AIST, Japan
Program Chairs:
Kenji Taguchi, AIST, Japan
Toshiaki Aoki, JAIST, Japan
--
Yuki Chiba
Japan Advanced Institute of Science and Technology (JAIST)
http://www.jaist.ac.jp/~chiba/index.html
chiba(a)jaist.ac.jp
[View Less]
皆様、
『日本学術振興会・フランスANR CHORUSプログラム(平成23年度選定事業)
「真と偽を超えて:確信の度合い」』の高橋達二さんから、
以下のような講演会があることをお知らせしてほしいとの依頼で転送します。
ご興味のおありの方は、問い合わせ先に直接ご連絡ください。
塩谷賢
> ------------------------------------------------------------------------
> David Over 教授・Jean Baratgin 教授 講演会
> 「思考研究の新パラダイム」
>
> 日時: 2012年9月6日 15:00-17:30
> 場所: 立命館大学 朱雀キャンパス1F 多目的室
> 〒604-8520 京都市中京区西ノ京朱雀町1
> (JR・地下鉄「二条」徒歩2分,阪急「大宮」徒歩10分)
> http://www.ritsumei.jp/accessmap/accessmap_suzaku_j.html
> プログラム:
> 0. イント…
[View More]ロダクション
> 1. Jean Baratgin教授(パリ第8大学)講演
> 「新パラダイム推論心理学と三値論理」
> 2. David Over教授(英国ダーラム大学)講演
> 「作用域曖昧性・様相錯誤と新パラダイム推論心理学」
> 3. ディスカッション
> 参加: 申込み不要・入場無料>
>
> 講演要旨:
>
> New paradigm psychology of reasoning and three-valued logic
>
> Jean Baratgin (Paragraphe [Universite Paris 8, Saint-Denis]
> & Institut Jean Nicod [ENS, Paris])
>
> Two bodies of research in the psychology of reasoning support the new
> paradigm. The first result is that most people judge the probability of
> a conditional sentence to be equal to the conditional probability of
> the consequent on the antecedent (as implied by the Ramsey test). The
> second result is very old. It is the existence of a so-called defective
> truth table in which people judge irrelevant (`I') the two cases where
> the antecedent is false. Our presentation focuses on this second point.
> Uncertainty is a hallmark of the new paradigm. Thus if `I' is considered
> as a third value there is no defective table but rather a coherent table
> in which a third truth value that represents uncertainty is introduced.
> However a variety of three-valued systems of logic are available. We
> examine their descriptive adequacy for the usual connectives, including
> the conditional. Within this framework the so-called defective
> truth-table in which participants choose a third truth value when the
> antecedent of the conditional is false becomes an explainable and
> coherent response. Our main result is that the logic of de Finetti (and
> only this one) has a very good descriptive adequacy when uncertainty
> takes place as a third truth-value.
>
>
> Scope ambiguities, modal fallacies, and new paradigm psychology of
> reasoning
>
> David Over (Psychology Department, Durham University)
>
> There is a new Bayesian / probabilistic paradigm in the psychology of
> reasoning. It depends on experiments in which participants respond that
> the probability of the natural language indicative conditional P(if p
> then q) is the conditional probability of q given p. Once this result,
> P(if p then q) = P(q|p), is fully established, a Bayesian account of
> conditional reasoning, and so of reasoning in general, is sure to
> follow. However, the result depends on the participants applying the
> probability operator to the whole conditional, in a wide scope
> interpretation, and not to its consequent, in a narrow scope
> interpretation. The problem is that modal operators like probability can
> cause scope ambiguities in natural language and modal fallacies. Scope
> ambiguities and the associated modal fallacies are a well researched
> topic in logic and philosophy. Yet the psychology of reasoning has paid
> little attention to this topic, in spite of its intrinsic interest and
> relevance to the new paradigm. We will illustrate how modal fallacies
> have been committed by supporters of old paradigm psychology of
> reasoning in their response to the evidence for P(if p then q) = P(q|p).
> An experimental programme will be described supporting the conclusion
> that the probability operator is generally given wide, and not narrow,
> scope in conditionals.
>
>
> 主催: 立命館大学人間科学研究所
> 文部科学省 私立大学戦略的研究基盤形成支援事業(平成22年度選定事業)
> 「大学を模擬社会空間とした自立支援のための持続的対人援助モデルの構築」
> 共催: 日本学術振興会・フランスANR CHORUSプログラム(平成23年度選定事業)
> 「真と偽を超えて:確信の度合い」
> 共催: 関西思考研究会
>
> 問い合わせ先:
> 山 祐嗣(大阪市大) yama(a)lit.osaka-cu.ac.jp
> 服部雅史(立命館大) hat(a)lt.ritsumei.ac.jp
> ------------------------------------------------------------------------
[View Less]
(重複して受け取られた場合はご容赦ください)
今年の12月に宮崎で開催される LENLS 9 国際ワークショップの2nd CFP をお
送り致します。多数のご投稿をお待ちしております。
矢田部俊介
[Apologies for multiple copies]
=================================================================
SECOND CALL FOR PAPERS
Logic and Engineering of
Natural Language Semantics 9 (LENLS 9)
Workshop Site : "Amusement Zone Miyazaki (The JA-AZM Hall)"
Kirishima 1-1-1, Miyazaki, Japan.
http://www.jaazm.jp/access/…
[View More]english.html
Dates : December 1-3, 2012
Contact Person: Alastair Butler (PRESTO JST/Tohoku University)
Contact Email : lenls9[[at]]easychair.org
Website : http://www.is.ocha.ac.jp/~bekki/lenls/
=================================================================
Chair: Alastair Butler (PRESTO JST/Tohoku University)
Co-chair: Daisuke Bekki (Ochanomizu University/
National Institute of Informatics)
Eric McCready (Aoyama Gakuin University)
Invited Speaker(s):
- Hans Kamp (University of Stuttgart)
Call For Papers:
================
LENLS is an annual international workshop focusing on formal semantics
and pragmatics. It will be held as one of the workshops of
the third JSAI International Symposia on AI (isAI2012)
(http://www.ai-gakkai.or.jp/jsai-isai/2012/)
sponsored by the Japan Society for Artificial Intelligence (JSAI)
(http://www.ai-gakkai.or.jp/jsai/english.html).
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-theoretic and utility-theoretic
approaches)
- Substructural expansion of Lambek Lambda Calculi
- Many-valued/Fuzzy and other non-classical logics and natural language
Submissions:
============
Abstracts (up to 4 pages, including figures, bibliography, apendices)
must be submitted electronically in PDF format at:
https://www.easychair.org/conferences/?conf=lenls9
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: September 1, 2012
Notification of acceptance: October 10, 2012
Deadline for camera-ready copy: October 31, 2012
Deadline for onsite registration: November 24, 2012
LENLS9: December 01-02, 2012
Tutorial Lecture (by Hans Kamp): December 03, 2012
Workshop Organizers/Program Committee:
======================================
- Alastair Butler (PRESTO JST/Tohoku University)
- Daisuke Bekki (Ochanomizu University/
National Institute of Informatics)
- Eric McCready (Aoyama Gakuin University)
- Koji Mineshima (Keio University)
- Yoshiki Mori (University of Tokyo)
- Yasuo Nakayama (Osaka University)
- Katsuhiko Sano (Japan Advanced Institute of Science and Technology)
- Katsuhiko Yabushita (Naruto University of Education)
- Tomoyuki Yamada (Hokkaido University)
- Shunsuke Yatabe (National Institute of
Advanced Industrial Science and Technology)
- Kei Yoshimoto (Tohoku University)
[View Less]
名大量子情報・量子基礎論ワークショップのご案内
London School of Economics and Political Science の Miklos Redei 教授を
お招きして、「代数的場の量子論における量子情報と量子基礎論」
に関する連続講演会およびワークショップを開催致します.
ふるってご参加ください.
日時:2012年8月22日(水)13:30―8月26日(日)17:00
会場:名古屋大学大学院情報科学研究科棟1階第1講義室
http://www.is.nagoya-u.ac.jp/intro/contact.html
『連続講演会(2012年8月22日(水)― 8月24日(金)) 』
講師: Miklos Redei (London School of Economics and Political Science)
http://phil.elte.hu/redei/
題目: An introduction to quantum information and foundations in algebraic quantum field …
[View More]theory
内容:
第1回(8月22日(水)13:30-15:00)
Some general remarks about the axiomatic approach to physical
theories, to QM+AQFT in particular, commenting on Hilbert's 6th problem
and von Neumann's interpretation of it.
第2回(8月22日(水)15:30-17:00)
Recalling some facts from the theory of von Neumann algebras,
portraying it as non-commutative measure theory that serves the same
role as classical measure theory serves for classical probability
theory.
第3回(8月23日(木)13:30-15:00)
The basics of AQFT (axioms + some of the consequences, including
violation of Bell's inequality in AQFT).
第4回(8月23日(木)15:30-17:00)
The Common Cause Principle and its status in AQFT.
第5回(8月24日(金)10:30-12:00)
The notions of independence in AQFT, their hierarchy, and their
status in AQFT, including operational independence.
『ワークショップ(2012年8月25日(土)― 8月26日(日))』
講演募集中
参加申し込み:
参加費無料でどなたでも参加できますが,会場準備の都合上予め下記まで,
氏名,所属,職,参加希望日程をご連絡ください.ワークショップでの講演申し込みも
受け付けますので,タイトル,講演希望日を添えて申し込んでください.
学部生,大学院生の参加を歓迎します.旅費援助希望の方はその旨ご連絡ください.
連絡先:小澤正直(名古屋大学大学院情報科学研究科)
ozawa(a)is.nagoya-u.ac.jp
本ワークショップは,科研費(萌芽)「量子論の実在論的解釈を目指した
量子集合論の研究(課題番号:24654021)」の援助を受けています.
お知り合いでご関心をお持ちのかたがいらっしゃいましたら,本案内を転送して
くださいますようお願い致します.
--
Masanao Ozawa
Graduate School of Information Science
Nagoya University
Chikusa-ku, Nagoya 464-8601, JAPAN
Email: ozawa(a)is.nagoya-u.ac.jp
Phone & Fax: +81-52-789-3075
[View Less]
皆様、
(重複してお受け取りになられた場合はご容赦ください)
産業技術総合研究所の武山と申します。この場をお借りしまして
来年1月22日にPOPL 2013に併設して開催される国際ワークショップ
PLPV 2013のCFPをご案内させていただきます。
プログラミング言語とプログラム検証に跨る話題について、
幅広く多くの研究コミュニティーからの論文投稿をお待ちしておりますので、
ご検討いただけますようよろしくお願い申し上げます。
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
The Seventh ACM SIGPLAN Workshop
on
Programming Languages meets Program Verification (PLPV 2013)
http://plpv.tcs.ifi.lmu.de/…
[View More]
22nd January, 2013
Rome, Italy
(Affiliated with POPL 2013)
Call for Papers
Overview
The goal of PLPV is to foster and stimulate research at the
intersection of programming languages and program verification, by
bringing together experts from diverse areas like types, contracts,
interactive theorem proving, model checking and program analysis. Work
in this area typically attempts to reduce the burden of program
verification by taking advantage of particular semantic or structural
properties of the programming language. One example are dependently
typed programming languages, which leverage a language's type system
to specify and check rich specifications. Another example are
extended static checking systems which incorporate contracts with
either static or dynamic contract checking.
We invite submissions on all aspects, both theoretical and practical,
of the integration of programming language and program verification
technology. To encourage interaction between different
communities, we seek a broad scope for PLPV. In particular,
submissions may have diverse foundations for verification (based on
types, Hoare-logic, abstract interpretation, etc), target
different kinds of programming languages (functional, imperative,
object-oriented, etc), and apply to diverse kinds of program
properties (data structure invariants, security properties, temporal
protocols, resource constraints, etc).
Important Dates
Submission 8th October, 2012 (Monday)
Notification 1st November, 2012 (Thursday)
Final Version 8th November, 2012 (Thursday)
Workshop 22nd January, 2013 (Tuesday)
Submissions
We seek submissions of up to 12 pages related to the above
topics; shorter submissions are also welcome. Submissions may describe
new work, propose new challenge problems for language-based
verification techniques, or present a known idea in an elegant way
(i.e., a pearl).
Submissions should be prepared with SIGPLAN two-column conference
format. Submitted papers must adhere to the SIGPLAN republication
policy. Concurrent submissions to other workshops, conferences,
journals, or similar forums of publication are not allowed.
To submit a paper, access the online submission site at
http://www.easychair.org/conferences/?conf=plpv2013.
Publication
Accepted papers will be published by the ACM and will appear in the
ACM Digital library.
Program Committee
Andreas Abel Ludwig-Maximilians-University Munich (co-chair)
Robert Atkey University of Strathclyde
Harley Eades The University of Iowa
Chung-Kil Hur Max Planck Institute for Software Systems
Brigitte Pientka McGill University
Andrew Pitts University of Cambridge
François Pottier INRIA
Tim Sheard Portland State University (co-chair)
Makoto Takeyama Advanced Industrial Science and Technology
--
Makoto Takeyama <makoto.takeyama(a)aist.go.jp>
AIST/RISEC (National Institute of Advanced Industrial Science and Technology /
Research Institute for Secure Systems)
tel: +81-6-6494-8045
[View Less]
皆様:
神戸大学の酒井拓史と申します.
8月1日(水)に開催される
Kobe Colloquium on Logic, Statistics and Informatics
のアナウンスをさせていただきます.
ご興味をお持ちの方は是非ご参加ください:
------------------------------------------------------
Kobe Colloquium on Logic, Statistics and Informatics:
------------------------------------------------------
August 1, 2012 (Wed.) 16:30 - 18:00 (teabreak: 15:30 -)
``Topological Set Theory''
Dr. Andreas Fackler (LMU Munich)
Abstract
The idea behind positive set theory is to weaken the naive comprehension …
[View More]
principle by omitting all instances in which negation occurs. For example, the
universal class V is a set while the Russell class is not. Surprisingly, this
approach leads to a theory in which V is a topological space in a natural way.
Inspired by that fact, topological set theory TS instead of a comprehension
principle has as its axioms several topological statements about V. Topological
and positive set theory are closely related and in both of them there is an
interesting interplay between the set theoretic and topological properties of
V. Many basic theorems of TS remain true even without the axiom that the
universal class V is a set, although one decisive statement about the ordinal
numbers goes missing. Instead, a surprising connection to another familiar set
theory arises ...
In my talk, I will present this family of axiom systems and give an overview of
results about their implications, their consistency strengths, and their
interrelations. We will also look briefly at their (known) models --
topological structures called hyperuniverses -- and at methods to construct
such objects.
------------------------------------------------------------------------------
The talk will be given in the presentation room of the group of Logic,
Statistics and Informatics (inside the glass door with "Fuchino group"
(written in Japanese) on the 4th floor in the Sience and Technology Building 3
http://kurt.scitec.kobe-u.ac.jp/~brendle/Forcing2012/university.jpg
in Rokkodai Campus of Kobe University)
There will be a dinner after the talk.
酒井 拓史
神戸大学大学院
システム情報学研究科 講師
e-mail: hsakai(a)people.kobe-u.ac.jp
tel: 078-803-6245
[View Less]
筑波大学の石川竜一郎さんからの依頼により、代理でご案内を投稿します。
国際ワークショップ:
International Workshop on Game Theory, Epistemic Logic, & Related Topics
が8月27日から30日まで、筑波大学で開かれます。
詳しくは
http://infoshako.sk.tsukuba.ac.jp/~ishikawa/gamelogic12/
をご覧ください。
宜しくお願い致します。
鈴木信行@静岡大学
Logic-ml $B$N3'MM!$(B
$B$3$s$P$s$O!$ElKLBg3X$NKYH*2B9($G$9!%(B
7$B7n(B20$BF|!J6b!K$KElKLBg3X$K$F2<5-%;%_%J!<$r9T$$$^$9$N$G!$6=L#$N$"$kJ}$O$<$R$4;22C$/$@$5$$!%(B
$BFs9V1i$4$6$$$^$9!%(B
*************************************************************************
$BF|;~!'(B7$B7n(B20$BF|!J6b!K(B15:30$B!A(B17:00
$B>l=j!'ElKLBg3X(B $BKL@DMU;3%-%c%s%Q%9(B $BM}3X9gF1Eo(B 1201$B9f<<(B
$B-!(B15:30$B!A(B16:00
$B9V1i<T!'(B $B;3:j!!Ip(B $B!J(B $…
[View More]BElKLBg3XBg3X1!!&M}3X8&5f2J(B $B!K(B
$B%?%$%H%k!'(B The Optimal Bounded Marriage Theorem
$B%"%V%9%H%i%/%H!'(B
J. Hirst showed that WKL_0 is equivalent over RCA_0 to the assertion
that every bounded marriage problem satisfying Hall condition has a
solution. In this talk, arranging the result, we mainly prove that
ACA_0 is equivalent over RCA_0 to the assertion that every bounded
marriage problem of the finite total utility satisfying Hall condition
has an optimal solution.
$B-"(B16:00$B!A(B17:00
$B9V1i<T!'(B $B2,K\(B $B7=;K(B $B!J@gBf9bEy@lLg3X9;!&Am9g2J3X7O!K(B
$B%?%$%H%k!'(B $BL?BjMMAj&L7W;;$N0l3,3HD%$K$D$$$F(B
$B%"%V%9%H%i%/%H!'(B
$BK\H/I=$G$O!$0l3,MMAj&L7W;;(B($BL?BjMMAj&L7W;;$N0l3,3HD%(B)$B$H$=$N<~JU>u67$K$D$$$F2r@b$9$k!%$^$:!$0l3,MMAj&L7W;;$r9=C[$9$k$K;j$kGX7J$H$7$F!$7A<0<jK!$K$D$$$F=R$Y$k!%(B
$B<!$K!$L?BjMMAj&L7W;;$H0l3,=R8lO@M}$r9g$o$;$F!$0l3,MMAj&L7W;;$rDj5A$9$k!%$=$N8e!$0l3,MMAj&L7W;;$N@-<A$N$&$A!$40A4@-$HI=8=NO$K$D$$$F=R$Y$k!%$5$i$K!$0l3,MMAj&L7W;;$NE,MQNc$H$7$F!$%;%^%U%)$K$h$kAj8_GS=|$NBEEv@->ZL@$r>R2p$9$k!%:G8e$K!$$^$H$a$H4XO"2]Bj$N>R2p$r9T$&!%(B
*************************************************************************
$B0J>e$G$9!%(B
$B%;%_%J!<>pJs$N>\:YEy$O2<5-@gBf%m%8%C%/$N%[!<%`%Z!<%8$+$i$b$4Mw$$$?$@$1$^$9!%(B
https://sites.google.com/site/sendailogichomepage/
$BKYH*!!2B9((B
-- --
$BElKLBg3XBg3X1!!!M}3X8&5f2J(B
$B?t3X@l96!!;:3X41O"7H8&5f0w(B
E-mail: higurashi3873(a)yahoo.co.jp
[View Less]
logic-ml の皆様、
北陸先端科学技術大学院大学の佐野勝彦と申します。
9/10-9/14 に金沢で開催されるLATD 2012 の Call for participation をお送りいたします。
重複してお受け取りの場合はどうぞご容赦ください。
佐野勝彦
=====================================================================
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
Call for participation
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center …
[View More]for Integrated Science [2],
Japan Advanced Institute of Science and Technology [3].
We invite interested researchers to participate in the conference. The
program has been settled and can be found at the web page
http://www.jaist.ac.jp/rcis/latd12/index.php?program
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Program:
Invited Speakers and the respective titles (abstracts on the web page):
. Rostislav Horčík (Academy of Sciences, Czech Republic)
Quasiequational Theory of Square-increasing Residuated Lattices
is Undecidable
. Emil Jeřábek (Academy of Sciences, Czech Republic)
Admissibility and unification with parameters
. Daniele Mundici (University of Florence, Italy)
When every principal congruence is an intersection of maximal congruences
. Greg Restall (University of Melbourne, Australia)
Exotic Sequent Calculi for Truth Degrees
. Luca Spada (University of Salerno, Italy)
The multifarious representations of MV-algebras
Tutorial:
. Felix Bou (University of Barcelona, Spain)
(Un)Decidability in Monadic Fuzzy Predicate Logics
Contributed talks:
. Stefano Aguzzoli, Tommaso Flaminio and Enrico Marchioni
Finite Forests. Their Algebras and Logics
. Majid Alizadeh, Mohammad Ardeshir and Wim Ruitenburg
Modal Basic Propositional Logic
. Conrad Asmus
Towards Many Valued Dependence Logics
. Matthias Baaz and Agata Ciabattoni
Proof theory for non-classical logics: negative results
. Paolo Baldi, Agata Ciabattoni and Lara Spendier
Standard completeness for extensions of MTL: an automated approach
. Libor Behounek
Feasibility of program runs in fuzzified Propositional Dynamic Logic
. Marjon Blondeel, Tommaso Flaminio and Lluís Godo
Relating fuzzy autoepistemic logic and Łukasiewicz KD45 modal logic
. Felix Bou, Francesc Esteva and Lluis Godo
On possibilistic modal logics over Gödel logic
. Félix Bou, Marco Cerami and Francesc Esteva
Concept Satisfiability in finite-valued Fuzzy Description Logics is
PSPACE-complete
. Rodica Ceterchi
The Decomposition of Linearly Ordered Pseudo-Hoops
. Petr Cintula, Rostislav Horcík and Carles Noguera
A basic fuzzy logic which is really basic and fuzzy
. Oliver Fasching and Matthias Baaz
An analytic calculus for Gödel logics with an operator that shifts
truth values
. Christian Fermüller and Christoph Roschger
Extending Giles's Game for Lukasiewicz Logic to Fuzzy Quantification
. Nikolaos Galatos
The finite embeddability property for varieties of distributive,
integral residuated lattices
. Sándor Jenei
Recent results on involute FLe-monoids
. Michiro Kondo
States on bounded commutative residuated lattices
. Tomasz Kowalski
BCK is not structurally complete
. Michał Kozak
Double Negation in Intuitionistic Style Sequent Systems for Residuated
Lattices
. Tomas Kroupa and Ondrej Majer
Nash Equilibria in a Class of Zero-Sum Games Represented by McNaughton
Functions
. Jan Kühr
BCK-algebras and triple construction
. Antonio Ledda, Tomasz Kowalski and Francesco Paoli
On independent varieties and some related notions
. Leonardo Manuel Cabrer and Vincenzo Marra
Advances on Unification in MV-algebras
. Vincenzo Marra and Stefano Aguzzoli
Betting on events observed over an interval of time: de Finetti's
Dutch-Book argument for Goedel logic
. Yoshihiro Maruyama
Diagonals, Paradoxes, and the Edge of Consistency: classical, quantum,
and fuzzy
. Yuri Movsisyan and Diana Davidova
Representation theorem for interlaced q-bilattices
. Petra Murinová
Structure of generalized intermediate syllogisms
. Liu Doing Ning and Zhe Lin
Proof Theoretical Investigations on Substructure Modal Logic
. Hitoshi Omori and Katsuhiko Sano
Generalizing Functional Completeness in Belnap-Dunn's Four Valued System
. Jan Paseka and Michal Botur
Tense MV-algebras and related operators
. Milan Petrík
Algebraic webs on more general structures
. James Raftery
Inconsistency lemmas in algebraic logic
. Umberto Rivieccio
Implicative twist-structures
. Takahiro Seki
Disjunction Property of Non-Associative Substructural Logics
. Shawn Standefer
Revision theory and Field's theory of truth
. Nobu-Yuki Suzuki
Remarks on Ono's Two Problems: Existence and Disjunction Properties
in Super-Intuitionistic Predicate Logics
. Peter Verdée
Paraconsistent logic and degrees of believe
. Thomas Vetterlein
Construction methods for finite commutative tomonoids
. Shunsuke Yatabe
A constructive naive set theory and the $\omega$-rule
. William Young
Free MV-algebras inside Free Abelian l-groups
Registration:
Registration is required and can be done at
http://www.jaist.ac.jp/rcis/latd12/index.php?registration
Conference dates:
The scientific program will start Monday morning (10 September) and finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd12(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
(重複して受け取られた場合はご容赦ください)
名古屋大学の中村と申します。
法情報学に関する国際ワークショップ JURISIN2012 の CFP をお送りします。
今年の11月30日から12月1日にかけて宮崎で開催されます。
多数のご投稿をお待ちしております。
[Apologies for multiple copies]
---------------------------------------------------
Call for Papers:
Sixth International Workshop on Juris-informatics (JURISIN 2012)
Nov.30 - Dec. 1, 2012
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
Amusement Zone Miyazaki (The JA-AZM Hall)
Kirishima 1-1-1, Miyazaki, Japan
with a support of The Japanese Society for …
[View More]Artificial Intelligence in
association with Fourth JSAI International Symposia on AI (JSAI-isAI 2012)
**** Submission Deadline: September 17, 2012 ****
**** Aims and scope ****
Juris-informatics is a new research area which studies legal issues
from the perspective of informatics. The purpose of this workshop is
to discuss both the fundamental and practical issues for
juris-informatics among people from the various backgrounds such as
law, social science, information and intelligent technology, logic and
philosophy, including the conventional "AI and law" area. We solicit
unpublished papers on theories, technologies and applications on
juris-informatics.
**** Topics ****
Relevant topics include, but are not limited to, the following:
* Legal reasoning
* Argumentation/Argumentation agent
* Legal term ontology
* Formal legal knowledge-base/Intelligent management of legal
knowledge-base
* Translation of legal documents
* Computer-aided law education
* Use of Informatics and AI in law
* Legal issues on ubiquitous computing/multi-agent system/the Internet
* Social implications of use of informatics and AI in law
**** Submissions ****
We welcome and encourage the submission of high quality, original
papers, which are not simultaneously submitted for publication
elsewhere except as a submission to JURIX 2012 (The 25th International
Conference on Legal Knowledge and Information Systems). The double
submission policy with JURIX 2012 is as follows:
1. Papers being submitted both to JURISIN2012 and JURIX2012 must note
this on the title page.
2. A paper to be presented at JURISIN2012 must be withdrawn from
JURIX2012 and vice versa according to the choice by the authors.
3. If the authors do not follow this double submission policy, the paper
by the authors will not be included in the proceedings of JURISIN 2012.
Papers should be written in English, formatted according to the
Springer Verlag LNCS style in a pdf form, which can be obtained from
http://www.springeronline.com, and not exceed 14 pages including
figures, references, etc.
If you use a word file, please follow the instruction of the format
designated at the workshop page, and then convert it into a pdf form
and submit it at the paper submission page.
If a paper is accepted, at least one author of the paper must register
the workshop and present it.
**** Proceedings ****
A printed volume of the proceedings with ISBN will be available at the
workshop.
**** Post Proceedings****
The chair of JSAI-IsAI 2012 is now negotiating with Springer Verlag to
publish selected papers of the workshop in the JSAI-isAI 2012
post-proceedings as a volume of LNAI. If it is the case, the authors
of papers presented at the workshop will be asked to extend their
contributions, possibly incorporating the results of the workshop
discussion, to be included in the workshop post-proceedings, after
another round of refereeing.
Note that the selected papers of the previous workshops were publisehd
as volumes of LNAI4914(JURISIN 2007), LNAI5447(JURISIN 2008),
LNAI6284(JURISIN 2009), LNAI6797(JURISIN2010) and LNAI7258(JURISIN2011),
respectively.
**** Financial Support for Students ****
We have received from JSAI partical economical support for travelling
costs for promising foreign students whose papers have been accepted
to be presented at JURISIN2012. The amount of the whole support is
250,000 yen and we divide it to students who need a support. The
actual support will vary based on the number of applicants and where
students come from. Please contact the chairperson (mnakamur ((at))
law.nagoya-u.ac.jp) for details.
**** Important Dates ****
Submission Deadline: September 17, 2012
Notification: October 15, 2012
Camera Ready Copy due: October 29, 2012
JURISIN 2012: November 30 - December 1, 2012
**** Workshop Chair ****
Makoto Nakamura, Nagoya University, Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Organizing Committee Members ****
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST),
Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Programme Committee Members ****
Thomas Agotnes, University of Bergen, Norway
Phan Minh Dung, AIT, Thailand
Tom Gordon, Franfoher FOKUS, Germany
Guido Governatori, The University of Queensland, Australia
Tokuyasu Kakuta, Nagoya University, Japan
Takehiko Kasahara, Toin University of Yokohama, Japan
Masahiro Kozuka, Kanazawa University, Japan
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Paulo Novais, University of Minho, Portugal
Jeremy Pitt, Imperial College, UK
Henry Prakken, University of Utrecht & Groningen, The Netherlands
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Akira Shimazu, Japan Advanced Institute of Science and Technology, Japan
Fumihiko Takahashi, Meiji Gakuin University, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology, Japan
Katsuhiko Toyama, Nagoya University, Japan
Radboud Winkels, The University of Amsterdam, the Netherlands
Shin-ichi, Yoro, Osaka University, Japan
John Zeleznikow, Victoria University, Australia
**** Home page of JURISIN 2012 ****
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
**** preivous JURISIN workshops ****
JURISIN2007 http://research.nii.ac.jp/~ksatoh/jurisin.html
JURISIN2008 http://www.ntt.dis.titech.ac.jp/jurisin2008/
JURISIN2009 http://research.nii.ac.jp/~ksatoh/jurisin2009.html
JURISIN2010 http://research.nii.ac.jp/~ksatoh/jurisin2010.html
JURISIN2011 http://research.nii.ac.jp/~ksatoh/jurisin2011.html
For any inquiry, please send it to "jurisin2012 ((at)) kl.i.is.nagoya-u.ac.jp".
--
中村 誠@名古屋大学大学院法学研究科附属法情報研究センター
Makoto Nakamura ( mnakamur(a)law.nagoya-u.ac.jp )
Japan Legal Information Institute,
Graduate School of Law, Nagoya University
TEL:(052)789-5145 / FAX:(052)789-3800
[View Less]
$B3'MM!"(B
$B5~ETBg3XBg3X1!M}3X8&5f2J$G$O!"0J2<$NFbMF$G=8Cf9V5A!JA4#42s!K(B
$B$rM=Dj$7$F$*$j$^$9!#9V;U$O!"El5~Bg3X$NO!Hx0lO:@h@8$G$9!#(B
$BM>Be?t$NM}O@$N7W;;5!2J3X$X$N1~MQ$K$D$$$F!"=iJb$+$i>\$7$/2r@b(B
$B$7$FD:$1$k$H;G$C$F$*$j$^$9!J7wO@$K4X$9$kM=HwCN<1$OITMW!"$H$N(B
$B$3$H$G$9!K!#(B
$BM}3X8&5f2J$N3+9V2JL\$G$9$,!"4X?4$r$*;}$A$NJ}$O$I$J$?$G$b$*5$(B
$B7Z$K$4MhD02<$5$$!#ITL@$JE@$,$"$j$^$7$?$i!"D9C+@n$^$G$*Ld$$9g(B
$B$o$;$/$@$5$$!#(B
$BD9C+@n???M(B <…
[View More]hassei at kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
$B5~ETBg3XBg3X1!M}3X8&5f2J?t3X!&?tM}2r@O@l96?tM}2r@O7O(B
$B?tM}2r@OFCJL9V5A#1(B $B7W;;5!2J3X!J=8Cf9V5A!K(B
$B!V(BCategorical Algebra and Coalgebra:
An Instance of Category Theory in Computer Science$B!W(B
$B9V(B $B;U!'O!Hx(B $B0lO:(B $B;a(B $B!JEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J(B $B9V;U!K(B
$BF|(B $B;~!'#2#0#1#2G/#77n#1#9F|!#0F|!#1F|!Wn#1F|(B $B#1#4;~!A(B
$B>l(B $B=j!'Am9g8&5f#29f4[#43,(B $B#4#7#89f<<(B
$B!JCm!'KLIt$N?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!#I4K|JW$NFnElB&$G$9!#(B
$BCO?^$O(B http://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg $B!K(B
Abstract
Category theory is an abstract mathematical language that is used in
many different branches of mathematics. It has also found successful
applications in computer science - in fact, in many different
ways. The classic example is in the semantics of functional
programming, where types are objects and programs are arrows. In this
course we focus on another eminent use of categories in computer
science, namely categorical algebra and coalgebra.
The bottom-line here is: a coalgebra is a categorical abstraction of
dynamics, i.e. a state-based system like an automaton; and an algebra
(especially an initial one) is an abstraction of syntax, i.e. the set
of well-formed programs. Plotkin's structural operational semantics -
connecting syntax and dynamics - also allows an elegant categorical
modeling via a distributive law.
After exhibiting these basics of the (co)algebraic modeling in
computer science, we proceed to a more advanced categorical structure
of presheaf categories. We introduce the necessary categorical
machineries - (co)end, Kan extension, Yoneda lemma, etc. - as well as
demonstrate their applications in name-passing calculi like the
pi-calculus.
No preliminary knowledge in category theory is assumed. The course
materials will be announced at the course website.
$B0u:~MQ0FFb!'(B
http://www.kurims.kyoto-u.ac.jp/~hassei/hasuo2012.pdf
[View Less]
*Call for Papers*
TARK 2013
14th Conference on Theoretical Aspects of Rationality and Knowledge
January 7-9, 2013
The Institute of Mathematical Sciences, Chennai, India
Conference website: http://www.imsc.res.in/tark/
About the Conference
The mission of the TARK conferences is to bring together researchers
from a wide variety of fields, including Artificial Intelligence,
Cryptography, Distributed Computing, Economics and Game Theory,
Linguistics, Philosophy, and Psychology, in order to …
[View More]further our
understanding of interdisciplinary issues involving reasoning about
rationality and knowledge. Topics of interest include, but are not
limited to, semantic models for knowledge, belief, awareness and
uncertainty, bounded rationality and resource-bounded reasoning,
commonsense epistemic reasoning, epistemic logic, epistemic game
theory, knowledge and action, applications of reasoning about
knowledge and other mental states, belief revision, and foundations of
multi-agent systems.
Invited Speakers
Pierpaolo Battigalli, Bocconi University
Lin Fangzhen, Hong Kong University of Science and Technology
Rineke Verbrugge, University of Groningen
Submissions are now invited to TARK 2013. Extended Abstracts can be
submitted here:
https://www.easychair.org/conferences/?conf=tark2013
Strong preference will be given to papers whose topic is of interest
to an interdisciplinary audience, and papers should be accessible to
such an audience. Papers will be held to the usual high standards of
research publications. In particular, they should 1) contain enough
information to enable the program committee to identify the main
contribution of the work; 2) explain the significance of the work --
its novelty and its practical or theoretical implications; and 3)
include comparisons with and references to relevant literature.
Abstracts should be no longer than ten double-spaced pages (4,000
words). Optional technical details such as proofs may be included in
an appendix. An email address of the contact author should be
included. Papers arriving late or departing significantly from these
guidelines risk immediate rejection. One author of each accepted
paper will be expected to present the paper at the conference.
Economists should be aware that special arrangements have been made
with certain economics journals (in particular, with International
Journal of Game Theory, Games and Economic Behavior, Journal of
Economic Theory, and Mathematical Social Sciences, so that publication
of an extended abstract in TARK will not prejudice publication of a
full journal version.
TARK 2013 will precede the Indian Conference on Logics and
Applications (ICLA) held from January 10 - 12, 2013, also at the
Institute for Mathematical Sciences in Chennai, India.
TARK 2013 is the 14th conference of the TARK conference series.
Previous conferences have been held bi-annually around the world. The
most recent conference was held 2011 at the University of Groningen,
Netherlands, see http://www.philos.rug.nl/TARK2011/. The proceedings
of all previous TARK conferences can be accessed here
http://www.tark.org/.
TARK 2013 is the first TARK conference to be held in India. It is also
the first TARK conference to be held in January.
Key Dates for TARK 2013
Submission of abstracts: September 3, 2012
Notification of authors: October 29, 2012
Camera ready copy of accepted papers: November 30, 2012
Conference: January 7 - 9, 2013, Institute of Mathematical Sciences,
Chennai, India
Program Committee
Samson Abramsky, Oxford University
Thomas Agotnes, Universitetet i Bergen
Hans van Ditmarsch, Universidad de Sevilla
Amanda Friedenberg, Arizona State University
Aviad Heifetz, The Open University of Israel
Jerome Lang, CNRS and Université Paris-Dauphine
Fenrong Liu, Tsinghua University
Larry Moss, Indiana University, Bloomington
Antonio Penta, University of Wisconsin-Madison
Andres Perea, Maastricht University
Ramaswamy Ramanujam, Institute for Mathematical Sciences, Chennai
Olivier Roy, Ludwig-Maximilians-Universität München
Burkhard C. Schipper, University of California, Davis
Marciano Siniscalchi, Northwestern University
Giacomo Sillari, Scuola Normale Superiore, Pisa
Nobuyuki Suzuki,Shizuoka University
Jonathan Zvesper, London
Local Organizing Committee
Sujata Ghosh, Indian Statistical Institute, Chennai
Kamal Lodaya, Institute of Mathematical Sciences, Chennai
R. Ramanujam, Institute of Mathematical Sciences, Chennai
S. P. Suresh, Chennai Mathematical Institute
Program Chair
Burkhard C. Schipper
University of California, Davis
Department of Economics
One Shields Avenue
Davis, CA 95616, USA
Email: bcschipper-at-ucdavis-dot-edu
Local Organizing Chair
R. Ramanujam
Institute for Mathematical Sciences
CIT Campus, Taramani
Chennai 600 113, India.
Email: tark2013org at gmail dot com
Chair of the TARK Conference Series
Joe Halpern
Cornell University
Computer Science Department
[View Less]
Kobe Colloquium on Logic, Statistics and Informatics
以下の要領でコロキウムを開催します。
日時:2012年6月28日(木)15:10-16:40
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
講演者:Paul Larson (Miami University, Oxford, Ohio)
========================================================================
題目:Models of size aleph_1 in abstract elementary classes
アブストラクト:
We will present some applications of set theoretic techniques to the study
of models of
cardinality aleph_1 in various abstract elementary classes. The impetus for
this …
[View More]work was the still-open
question of absoluteness of aleph_1-categoricity for the class of models of
a fixed sentence of L_{omega_1, omega}.
Most of our results apply to the class of analytically presented AEC's,
those whose restriction to countable models is analytic.
These classes have been studied for many years under various names. Time
permitting, connections with Vaught's
Conjecture will also be discussed. This is joint work with Baldwin and
Shelah.
========================================================================
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」
行きに乗車,「神大本部工学部前」停留所下車,徒歩すぐ.
http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm
連絡先:ブレンドレ ヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp
[View Less]
AiML-2012: CALL FOR PARTICIPATION
9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
COPENHAGEN, 22-25 AUGUST, 2012
http://hylocore.ruc.dk/aiml2012.html
Advances in Modal Logic is an initiative aimed at presenting
the state of the art in modal logic and its various applications. The
initiative consists of a conference series together with volumes based on
the conferences. Information about the AiML series can be obtained at
http://www.aiml.net. AiML-2012 is the ninth …
[View More]conference in the series.
REGISTRATION: Please see http://hylocore.ruc.dk/aiml2012/registration.php
NOTE THAT THE DEADLINE FOR EARLY REGISTRATION IS JUNE 29.
ACCEPTED PAPERS: Please see http://hylocore.ruc.dk/aiml2012/accepted.php
CONFERENCE LOCATION
Advances in Modal Logic 2012 will be held at
the IDA conference centre in downtown Copenhagen:
http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx
This is in easy walking distance from Copenhagen Central Station and a
number of reasonably priced hotels.
INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Lars Birkedal (IT University of Copenhagen, Denmark)
Patrick Blackburn (Roskilde University)
Balder ten Cate (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)
SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic
allowing to refer explicitly to states of the model in the syntax of formulas.
There will be a special session of AiML devoted to papers on hybrid logic.
The scope of the special session is standard hybrid-logical machinery like
nominals, satisfaction operators, and the downarrow binder, but also other
extensions of modal logic can be considered.
SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a
special session of AiML devoted to papers and talks in honour of Larisa
Maksimova, in recognition of her many outstanding contributions to modal
logic.
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Università di Bologna, Italy)
Giovanna D'Agostino (Università di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Robert Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Rosalie Iemhoff (University of Utrecht, The Netherlands)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schröder (Friedrich-Alexander-Universität Erlangen-Nürnberg)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (Sofia University, Bulgaria)
Yde Venema (ILLC, University of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)
ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Braüner (Roskilde University, Denmark)
FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/
ENQUIRIES. E-mail enquiries should be directed to aiml2012(a)easychair.org
[View Less]
We will hold the 4th 「論数哲」(PhilLogMath) workshop. Our aim is to
provide opportunities of detailed discussions among philosophers,
logicians, mathematicians and linguists. We focus on theoretical and
computational linguistics this time. Everyone is welcome.
website url: http://researchmap.jp/jopyjeyia-21098/#_21098
Date : July 16 (Mon) National holiday (海の日)
Place: Seiryo Kaikan (Nagata-cho, Tokyo)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Time table
…
[View More] 10:00-12:00 上垣渉(MIT)
尺度推意(scalar implicature)、その材料とレシピ
13:30-15:00 八木沢敬 (カルフォルニア州立大学)
可能世界を超える可能性
15:30-17:00 上出哲広 (サイバー大学)
An embedding-based method for non-classical logics
Every slots consists of 60 minutes talk and 30 minutes discussion basically.
Abstracts:
上垣渉 尺度推意(scalar implicature)、その材料とレシピ
自然言語の文は、ときに、それに含まれる語彙を「字義通り」に解釈した意味よりも強い(取り消し可能な)解釈を生み出すことがある。例えば、日本語母語話者は、日本語において選言に対応するとされる「pまたはq」は、「pかつq、ではない」(あるいは「pかつqであるとは話者は知らない」)という解釈をもつという直観をもつ。Grice(1975)
以降、このような事実は、文が表す意味を「字義通りの意味(literal
meaning)」と「推意(implicature)」に分け、前者は言語に固有の文法的メカニズムによって生み出され、後者は言語に限らないコミュニケーション一般における推論によって字義通りの意味から導きだされるとする考えが言語学においては一般的である。ただ、後者の推意を生み出すメカニズムがどのようなものであるかに関しては、近年まで理論的な精緻化は比較的乏しく、推意は伝統的な意味論的分析を守るために分析と事実の齟齬を放り込んでおくためのある種のブラックボックス(あるいは「語用論的ゴミ箱(pragmatic
wastebasket)」)として機能していた傾向がある。ところが、推意とくに尺度推意(scalar
implicature)の近年の研究の展開において、字義通りの意味から推意が導かれる具体的なメカニズムの理論が精緻化されてきている(例えば、Jäger(2011),
Franke (2009) によるゲーム理論的モデル、Goodman & Stuhlmuller
(2012)によるベイズ理論を用いたモデル、Chierchia (2004), Chierchia, Fox & Spector
(2011)による尺度推意を文法自体に組み込むモデルなど)。本発表では、この理論的展開において重要な意義をもつ二つの問題、すなわち
(i)推意を生み出すのは「文法外」のメカニズムに限られるのか、(ii)推意の導出の際に用いられる代替発話(alternative
utterances)の集合はいかにして規定されるのか、についての最近の研究を紹介する。そして、(i)の問題については、推意を文法に組み込む仮説がその主要な証拠としてきた「埋め込まれた尺度推意(embedded
scalar implicature)」が、必ずしも推意に関する語用論的な見方と矛盾しないこと、(ii)の問題については、談話における「議題となる疑問(Question
under Discussion)」が代替発話を規定するのに重要な役割を果たすことを議論したい。
八木沢敬 可能世界を超える可能性
標準的な可能世界の枠組みでは、すべての可能性は何らかの可能世界での実現として理解される。本論では、この理解を批判する。まず、標準的な可能世界の枠組みによる様相の理解の根底にあるアイデアを「別域の方法」(method
of alternatives)として同定し、次に、それを可能世界を擁する論理空間そのものに関する様相言明に適用することによって、可能世界での実現としては理解できない可能性の概念を明らかにする。それにあたって、現実世界についての様相、信念の様相、背理法の使用、思考の様相などを考察する。
上出哲広 An embedding-based method for non-classical logics
An embedding-based proof method for some non-classical logics is
presented. This method can uniformly prove the
cut-elimination,completeness, decidability and Craig interpolation
theorems for some non-classical logics including some paraconsistent
and temporal logics. This method is based on two theorems for
syntactically and semantically embedding the required non-classical
logic into its negation-less or time-less fragment. Firstly in this
talk, some results on Nelson's paraconsistent logic and its neighbors,
which have recently been obtained by Kamide and Wansing, are
presented. Secondly, some results on linear-time temporal logic and
its neighbors are presented.
Workshop organizer:
Yuko Murakami
Shunsuke Yatabe ( shunsuke.yatabe(a)aist.go.jp )
Takuro Onishi ( takuro.onishi(a)gmail.com )
[View Less]
Logic-ml $B$N3'MM!$(B
$B$3$s$P$s$O!$ElKLBg3X$NKYH*2B9($G$9!%(B
$B2<5-$NMWNN$G!$ElKLBg3X!JEDCf0lG78&!K$K$F8&5f2q$r9T$$$^$9$N$G!$6=L#$N$"$kJ}$O$<$R$4;22C$/$@$5$$!%(B
$B;09V1i$4$6$$$^$9!%(B
*************************************************************************
Sendai Logic Workshop
$BF|;~!'(B6$B7n(B1$BF|!J6b!K(B14:00$B!A(B17:30
$B>l=j!'ElKLBg3X(B $BKL@DMU;3%-%c%s%Q%9(B $BM}3X9gF1Eo(B 1201$B9f<<(B
$B-!(B14:00$B!A(B15:00
$B9V1i<T!'</…
[View More]Eg(B $BN<(B $B!JEl5~9)6HBg3XBg3X1!(B $B>pJsM}9)3X8&5f2J!K(B
$B%?%$%H%k!'(BCTL$B$H<~JU$NO@M}$N8xM}2=$K$D$$$F(B
$B%"%V%9%H%i%/%H!'(B
Computation Tree Logic (CTL) $B$O!$;~4V$N?d0\$KH<$C$F>uBV$,JQ2=$9$k%7%9%F%`$N5-=R$KMQ$$$i$l$kMMAjO@M}!J;~AjO@M}!K$NBeI=$G$"$k!#(B
$BK\9V1i$NL\E*$O!$(BCTL$B$H$=$N<~JU$NO@M}$KBP$9$k%R%k%Y%k%HN.8xM}2=$H40A4@-$K$D$$$F=iJb$+$i2r@b$7!$9V1i<T$N:G6a$N;E;v!J(BECTL$B$N8xM}2=!K$d<h$jAH$_$?$$LdBj!JMMAj&L7W;;$N40A4@-$NJL>ZL@!K$K$D$$$F@bL@$9$k$3$H$G$"$k!#(B
$BM=HwCN<1$O8EE5L?BjO@M}$N40A4@-DjM}DxEY$G==J,$NM=Dj!#(B
$B-"(B15:15$B!A(B16:15
$B9V1i<T!':,85(B $BB?2B;R(B $B!JKLN&@hC<2J3X5;=QBg3X1!Bg3X(B $B>pJs2J3X8&5f2J!K(B
$B%?%$%H%k!'(BWadge $B%2!<%`$N%P%j%(!<%7%g%s$H(B Wadge $B3,AX(B
$B%"%V%9%H%i%/%H!'(B
Wadge [3] $B$K$h$jDj5A$5$l$?(B Wadge $B3,AX$OO"B34X?t$K$h$k5UA|$K$D$$$FJD$8$?%/%i%9$N@.$93,AX$G!"(BBorel $B3,AX$d(B
Hausdorff $B$N=89g:9$K$h$k3,AX$h$j$b$h$j:Y$+$$=89g$N3,AX$rM?$($k!#(B
$B$3$N3,AX$N3F%/%i%9$N=89gA`:n$K$h$k5-=R$O(B Louveau [2] $B$K$h$jM?$($i$l$?$,!"(B $BHs>o$KHQ;($G$"$k!#(B
Wadge $B3,AX$G??$KF1$8<!?t$r$b$D=89g$O(B Wadge $B%2!<%`$K$h$jFCD'$E$1$i$l$k$,!"(BDuparc [1]
$B$G$O$3$N%2!<%`$N%P%j%(!<%7%g%s$K$h$j(B Wadge $B%/%i%9$N<!?t$N5-=R$N4JN,2=$rM?$((B
$B$F$$$k!#(B
$BK\9V1i$G$O(B [1] $B$NFbMF$rCf?4$K!"(BWadge $B%2!<%`$H(B Wadge $B3,AX$K4X$9$k8&5f$r>R2p$9$k!#(B
$B;29MJ88%!'(B
[1] J. Duparc, Wadge Hierarchy and Veblen Hierarchy. Part I: Borel
Sets of Finite Rank. Journal of Symbolic Logic 66(1), pp. 56-86, 2001
[2] A. Louveau, Some results in the Wadge hierarchy of Borel sets,
Cabal seminar 79-81, Lecture
Notes in Mathematics, vol. 1019, Springer Verlag, 1983, pp. 28-55.
[3] W.W. Wadge, Reducibility and determinateness on the Baire space.,
Ph.D. thesis, Berkeley, 1984.
$B-#(B16:30$B!A(B17:30
$B9V1i<T!'O!Hx(B $B0lO:(B $B!JEl5~Bg3XBg3X1!(B $B>pJsM}9)3X7O8&5f2J!K(B
$B%?%$%H%k!'(BProgramming with Infinitesimals: A While-Language for Hybrid
System Modeling
(Joint Work with Kohei Suenaga, Kyoto University)
$B%"%V%9%H%i%/%H!'(B
We add, to the common combination of a WHILE-language and a
Hoare-style program logic, a constant dt that represents an
infinitesimal (i.e. infinitely small) value. The outcome is a
framework for modeling and verification of hybrid systems: hybrid
systems exhibit both continuous and discrete dynamics and getting them
right is a pressing challenge. We rigorously define the semantics of
programs in the language of nonstandard analysis, on the basis of
which the program logic is shown to be sound and relatively complete.
If the time allows, our recent prototype automatic prover will also be
demonstrated.
$B;29MJ88%!'(B
Kohei Suenaga and Ichiro Hasuo.
Programming with Infinitesimals: A While-Language for Hybrid System Modeling.
Proc. ICALP 2011, Track B. LNCS 6756, p. 392-403. Springer-Verlag.
*************************************************************************
$B0J>e$G$9!%(B
$B%;%_%J!<>pJs$O2<5-@gBf%m%8%C%/$N%[!<%`%Z!<%8$+$i$b$4Mw$$$?$@$1$^$9!%(B
https://sites.google.com/site/sendailogichomepage/
$BKYH*!!2B9((B
-- --
$BElKLBg3XBg3X1!!!M}3X8&5f2J(B
$B?t3X@l96!!;:3X41O"7H8&5f0w(B
E-mail: higurashi3873(a)yahoo.co.jp
[View Less]
$B3'MM!"(B
$B0J2<$NFbMF$G#2#8F|!J7n!K$K9V1i$rFs7oM=Dj$7$F$$$^$9!#(B
Herbelin$B$5$s$N9V1i$O(BFLOPS2012$B$N$*OC$N3HD%HG$G$9!#(B
$B$I$&$>$4MhD0$/$@$5$$!#(B
$BD9C+@n???M(B <hassei(a)kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
====================================================
Date: 28 May 2012 (Monday) 14:30-17:00
14:30-15:30 talk by Vivek Nigam
16:00-17:00 talk by Hugo Herbelin
Venue: Room 478, General Research Building No.2, Kyoto University
(Access …
[View More]information & map:
http://www.kyoto-u.ac.jp/en/accesshttp://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg)
$BCm!'?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!#(B
$BI4K|JW$N$=$P$NAm9g8&5fFs9f4[$N(B4$B3,$G$9!#(B
====================================================
Speaker: Vivek Nigam (Ludwig Maximilian University of Munich)
Title: An Extended Framework for Specifying and Reasoning about Proof Systems
Abstract:
It has been shown that linear logic can be successfully used as a
framework for both specifying proof systems for a number of logics,
as well as proving fundamental properties about the specified systems.
In this paper, we show how to extend the framework with subexponentials
in order to be able to declaratively encode a wider range of proof systems,
including a number of non-trivial proof systems such as
a multi-conclusion intuitionistic logic, classical modal logic S4, and
intuitionistic Lax logic. Moreover, we propose methods for checking
whether an encoded proof system has important properties, such as if it
admits cut-elimination, the completeness of atomic identity rules,
and the invertibility of its inference rules. Finally, we present a tool
implementing some of these specification/verification methods.
This is a joint work with Giselle Reis and Elaine Pimentel.
====================================================
Speaker: Hugo Herbelin
(Laboratoire PPS, CNRS, INRIA & Universite Paris Diderot)
Title: Classical call-by-need sequent calculi: The unity of semantic artifacts
Abstract:
We systematically derive a classical call-by-need sequent calculus,
which does not require an unbounded search for the standard redex,
by using the unity of semantic artifacts proposed by Danvy et al.
The calculus serves as an intermediate step toward the generation of an
environment-based abstract machine. The resulting abstract machine is
context-free, so that each step is parametric in all but one component.
The context-free machine elegantly leads to an environment-based CPS
transformation. This transformation is observationally different from a
natural classical extension of the transformation of Okasaki et al., due to
duplication of un-evaluated bindings. We further demonstrate the usefulness
of a systematic approach by deriving an abstract machine and
CPS for an alternative classical call-by-need calculus.
(Joint work with Zena M. Ariola, Paul Downen, Keiko Nakata & Alexis Saurin)
====================================================
[View Less]
(重複して受け取られた場合はご容赦ください)
今年の12月に宮崎で開催される LENLS 9 国際ワークショップのCFPをお
送り致します。多数のご投稿をお待ちしております。
戸次大介(お茶の水女子大学)
[Apologies for multiple copies]
=================================================================
FIRST CALL FOR PAPERS
Logic and Engineering of
Natural Language Semantics 9 (LENLS 9)
Workshop Site : "Amusement Zone Miyazaki (The JA-AZM Hall)"
Kirishima 1-1-1, Miyazaki, Japan.
http://www.jaazm.jp/access/…
[View More]english.html
Dates : December 1-3, 2012
Contact Person: Alastair Butler (PRESTO JST/Tohoku University)
Contact Email : lenls9[[at]]easychair.org
Website : http://www.is.ocha.ac.jp/‾bekki/lenls/
=================================================================
Chair: Alastair Butler (PRESTO JST/Tohoku University)
Co-chair: Daisuke Bekki (Ochanomizu University)
Eric McCready (Aoyama Gakuin University)
Invited Speaker(s):
- Hans Kamp (University of Stuttgart)
Call For Papers:
================
LENLS is an annual international workshop focusing on formal semantics
and pragmatics. It will be held as one of the workshops of
the third JSAI International Symposia on AI (isAI2012)
(http://www.ai-gakkai.or.jp/jsai-isai/2012/)
sponsored by the Japan Society for Artificial Intelligence (JSAI)
(http://www.ai-gakkai.or.jp/jsai/english.html).
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-theoretic and utility-theoretic
approaches)
- Substructural expansion of Lambek Lambda Calculi
- Many-valued/Fuzzy and other non-classical logics and natural language
Submissions:
============
Abstracts (up to 4 pages, including figures, bibliography, apendices)
must be submitted electronically in PDF format at:
https://www.easychair.org/conferences/?conf=lenls9
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: September 1, 2012
Notification of acceptance: October 10, 2012
Deadline for camera-ready copy: October 31, 2012
Deadline for onsite registration: November 24, 2012
LENLS 9: December 01-02, 2012
Tutorial Lecture (by Hans Kamp): December 03, 2012
Workshop Organizers/Program Committee:
======================================
- Alastair Butler (PRESTO JST/Tohoku University)
- Daisuke Bekki (Ochanomizu University)
- Eric McCready (Aoyama Gakuin University)
- Koji Mineshima (Keio University)
- Yoshiki Mori (University of Tokyo)
- Yasuo Nakayama (Osaka University)
- Katsuhiko Sano (Japan Advanced Institute of Science and Technology)
- Katsuhiko Yabushita (Naruto University of Education)
- Tomoyuki Yamada (Hokkaido University)
- Shunsuke Yatabe (National Institute of
Advanced Industrial Science and Technology)
- Kei Yoshimoto (Tohoku University)
[View Less]
The deadline for submitting to CPP 2012 is June 8, 2012.
The Second International Conference on
Certified Programs and Proofs (CPP 2012)
CALL FOR PAPERS
Kyoto, Japan
December 13-15 2012
http://cpp12.kuis.kyoto-u.ac.jp/
co-located with APLAS 2012
http://aplas12.kuis.kyoto-u.ac.jp/
CPP is a new international forum on theoretical and …
[View More]practical topics
in all areas, including computer science, mathematics, and education,
that consider certification as an essential paradigm for their work.
Certification here means formal, mechanized verification of some sort,
preferably with production of independently checkable certificates.
We invite submissions on topics that fit under this rubric.
The first CPP conference was held in Kenting, Taiwan during December
7-9, 2011. As with the first meeting, the proceedings will be
published in Springer-Verlag's Lecture Notes in Computer Science
series.
Suggested, but not exclusive, specific topics of interest for
submissions include: certified or certifying programming, compilation,
linking, OS kernels, runtime systems, and security monitors; program
logics, type systems, and semantics for certified code; certified
decision procedures, mathematical libraries, and mathematical
theorems; proof assistants and proof theory; new languages and tools
for certified programming; program analysis, program verification, and
proof-carrying code; certified secure protocols and transactions;
certificates for decision procedures, including linear algebra,
polynomial systems, SAT, SMT, and unification in algebras of interest;
certificates for semi-decision procedures, including equality,
first-order logic, and higher-order unification; certificates for
program termination; logics for certifying concurrent and distributed
programs; higher-order logics, logical systems, separation logics, and
logics for security; teaching mathematics and computer science
with proof assistants; and "Proof Pearls" (elegant, concise, and
instructive examples).
IMPORTANT DATES:
Authors are required to submit a paper title and a short abstract
before submitting the full paper. The submission should include when
necessary a url where to find the formal development assessing the
essential aspects of the work. All submissions will be electronic.
All deadlines are at midnight (GMT).
Abstract Deadline: Friday, June 8, 2012
Paper Submission Deadline: Friday, June 15, 2012
Author Notification: Monday, August 27, 2012
Camera Ready: Monday, September 17, 2012
Conference: December 13-15, 2012
PROGRAM CO-CHAIRS:
Chris Hawblitzel (Microsoft Research Redmond)
Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique)
GENERAL CHAIR:
Jacques Garrigue (Nagoya University)
PROGRAM COMMITTEE:
Stefan Berghofer (secunet Security Networks AG)
Wei-Ngan Chin (National University of Singapore)
Adam Chlipala (MIT)
Mike Dodds (University of Cambridge)
Amy Felty (University of Ottawa)
Xinyu Feng (University of Science and Technology of China)
Herman Geuvers (Radboud University, Nijmegen)
Robert Harper (Carnegie Mellon University)
Chris Hawblitzel (Microsoft Research Redmond)
Gerwin Klein (NICTA)
Laura Kovacs (Vienna University of Technology)
Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique)
Rupak Majumdar (UCLA, Max Planck Institute for Software Systems)
Lawrence Paulson (University of Cambridge)
Frank Piessens (KU Leuven)
Randy Pollack (Harvard and Edinburgh University)
Bow-Yaw Wang (Academia Sinica)
Santiago Zanella Béguelin (IMDEA Software Institute)
ORGANIZING COMMITTEE:
Jacques Garrigue and Atsushi Igarashi
Email: cpp2012oc(a)math.nagoya-u.ac.jp
CPP STEERING COMMITTEE:
Andrew Appel (Princeton University)
Nikolaj Bjørner (Microsoft Research Redmond)
Georges Gonthier (Microsoft Research Cambridge)
John Harrison (Intel Corporation)
Jean-Pierre Jouannaud (co-Chair) (INRIA and Tsinghua University)
Gerwin Klein (NICTA)
Tobias Nipkow (Technische Universität München)
Zhong Shao (co-Chair) (Yale University)
SUBMISSION INSTRUCTIONS:
Papers should be submitted electronically online via the conference
submission web page at URL:
http://www.easychair.org/conferences/?conf=cpp2012
Acceptable formats are PostScript or PDF, viewable by Ghostview or
Acrobat Reader. Submissions should not exceed 16 pages in LNCS format,
including bibliography and figures. Submitted papers will be judged on
the basis of significance, relevance, correctness, originality, and
clarity. They should clearly identify what has been accomplished and
why it is significant. The proceedings of the symposium will be
published as a volume in Springer-Verlag’s Lecture Notes in Computer
Science series.
Each submission must be written in English and provide sufficient
detail to allow the program committee to assess the merits of the
paper. It should begin with a succinct statement of the issues, a
summary of the main results, and a brief explanation of their
significance and relevance to the conference, all phrased for the
non-specialist. Technical and formal developments directed to the
specialist should follow. Whenever appropriate, the submission should
come along with a formal development, using whatever prover, e.g.,
Agda, Coq, Elf, HOL, HOL-Light, Isabelle, Matita, Mizar, NQTHM, PVS,
Vampire, etc. References and comparisons with related work should be
included. Papers not conforming to the above requirements concerning
format and length may be rejected without further consideration.
The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other published conferences
or workshops. The PC chairs should be informed of closely related work
submitted to a conference or journal in advance of submission.
Original formal proofs of known results in mathematics or computer
science are among the targets. One author of each accepted paper is
expected to present it at the conference.
[View Less]
East-Asian School on Logic, Language, and Computation
(EASLLC 2012)
Southwest University, Chongqing, China, August
27-31, 2012
http://home.hib.no/prosjekter/easllc2012/
This is a school for graduate students and postdoctoral scholars,
similar
in spirit to the annual ESSLLI summer schools in Europe and also to the
Sino-European Summer School on Logic, Language, and Computation, which
took
place in Guangzhou, China in December 2010.
-…
[View More] The program of EASLLC 2012 will consist of nine courses in three
different tracks: logic, language, and computation.
· Logic Track: Fenrong Liu (Tsinghua University), Rohit
Parikh (Brooklyn
College of CUNY and CUNY Graduate Center), Jouko Väänänen
(University of
Helsinki and University of Amsterdam)
· Language Track: Pauline Jacobson (Brown University),
Geoffrey K.
Pullum (University of Edinburgh and Brown University), Dag Westerståhl
(Stockholm University)
· Computation Track: Krzysztof R. Apt (CWI and University of
Amsterdam), Phokion G. Kolaitis (University of California Santa Cruz and
IBM Research ? Almaden), Moshe Y. Vardi (Rice University)
- There will be student sessions in the late afternoon/early
evening of
some days of the School in which students will give short
presentations of
work in progress. Students are invited to submit an abstract of
maximum
3 pages on any topic in logic, language and computation. The abstract
should be written properly in English, and must be in PDF format
and be
submitted to our EasyChair
website<https://www.easychair.org/conferences/?conf=easllc2012stus>.
* Important Dates:*
May 28, 2012 - deadline for short abstracts of papers (at
most 3 pages)
June 10, 2012 - notification date of acceptance/rejection of
the papers
Detailed information about the student session can be found at
http://home.hib.no/prosjekter/easllc2012/stusess.asp
EASSLC 2012 is an ASL-Sponsored Meeting. ASL offers student travel
awards ?
for details, please see http://aslonline.org/studenttravelawards.html
- Prior to the School, an International Conference will take place on
August 25 and 26,
Scientific Organization:
- Program Committee Chair: Phokion G. Kolaitis
- Program Committee co-Chairs: Xiangdong He (Southwest
University), Jouko
Väänänen, Dag Westerståhl
Local Organization:
- Meiyun Guo (Southwest University), Minghui Ma (Southwest
University),
Jing Wang (Southwest University), Xiaojia Tang (Southwest University)
Student Program Organization:
- Chair: Yi Wang (Bergen University College)
- Co-Chair: Fan Yang (University of Helsinki)
[View Less]
みなさま,
こんにちは! 東京大学の蓮尾と申します.
来週 5/15(火)に,現在滞在中の Bart Jacobs さん (Radboud U. Nijmegen)
にご講演いただきます.
詳細は下記のとおりです.タイトルに「量子」とありますが,
量子論理等の知識がなくても,categorical logic の話として聞いて
いただけるはずです.ぜひ!
参加登録等は必要ありませんが,部屋の都合で人数の見積もりをしたいので,
- 当研究室のセミナーにはじめておいでになる方は,
- こちら http://www.doodle.com/7zsyhidh2r478xyk に参加表明をいただけると
うれしいです.(ペンネームでかまいません)
お目にかかれること,楽しみにしております.それでは!
蓮尾 一郎
東京大学大学院 情報理工学系研究科 コンピュータ科学専攻
http://www-mmm.is.s.u-tokyo.ac.jp
==================================================================…
[View More]=====
Tue 15 May 2012, 16:40-18:10
Bart Jacobs (Radboud U. Njimegen, http://www.cs.ru.nl/~bart/)
New directions in quantum logic
場所: 東京大学 本郷キャンパス 理学部7号館1階 102教室
(アクセス: http://www-mmm.is.s.u-tokyo.ac.jp/ の一番下を見てください)
The talk will use categorical techniques to give a new way of
representing predicates that is especially suited for "quantitative"
predicate logic. The relevant structure is illustrated for classical,
probabilistic and quantum logic. These new predicates give rise to
fibred/indexed categories. In the quantum case the Born rule appears
as a form of substitution. Predicates can also be used to specify
measurements in this setting.
[View Less]
皆様、
今月末RTA併設の、高階書換系ワークショップHOR'12の参加ご案内です。
今年はスペシャルセッションとして、停止性自動検証ツールの最新成果
のセッションを設けました。特に応用として
- Haskell
- Isabelle
のプログラムの停止性検証ツール、および高階書換え系の停止性ツール制
作者に、実装とその理論を発表していただきます。
また論文発表の一つには、IBMでの実際のコンパイラにおける高階書換え
の応用プロジェクト(Kristoffer Rose氏)の話題などもあり、
関数型言語、定理証明系などの利用者にも有用な情報になると思いますの
で、関連研究者の皆様は、ぜひ参加をご検討ください。
レギュラーレジストレーション〆切は明日5/9ですが、直接会場での参加
費払いも可能です。ワークショップのみでも参加可能で、でしたら当日で
も参加費はほとんど変わりませんし、RTA参加者でしたら同じです。同日
併設のツリーオートマタのTTATTワークショップ登録の方は、両方参加で
きますので、部分的な参加でも歓迎です。
-- 浜名 誠/群馬大学
=========…
[View More]============================================================
Call for Participation
6th International Workshop on Higher-Order Rewriting
HOR 2012
June 2, 2012, Nagoya, Japan
Colocated with RTA'12
http://www.cs.gunma-u.ac.jp/events/hor/
======================================================================
Invited speaker
---------------
* Zhenjiang Hu (National Institute of Informatics, Japan)
Can Graph Transformation be Bidirectionalized?
-- Bidirectional Semantics of Structural Recursion on Graphs --
Special Session: Current Status of Higher-Order Termination Tools
-----------------------------------------------------------------
* Carsten Fuhs: Haskell termination tool
* Rene Thiemann: Isabelle termination tool
* Aoto,Yamada: Simply-typed TRS termination tool
* Cynthia Kop: WANDA, termination tool for AFS
Accepted papers
----------------
* Beniamino Accattoli and Delia Kesner: The permutative lambda-calculus
(The original paper was presented at LPAR'12, LNCS 7180, pp.381-395)
* Thibaut Balabonski: A Unified Approach to Fully Lazy Sharing
(The original paper was presented at POPL'12, pp.233-246)
* Yuki Chiba and Takahito Aoto: Pattern Matching Algorithm for Higher Order Program Transformations
* Jean-Pierre Jouannaud and Jian-Qi Li: Termination of higher-order rewriting in dependent type calculi
* Vincent van Oostrom: Confluence via Critical Valleys
* Kristoffer Rose: Higher Order Rewriting for Real Programmers
[View Less]
$B3'MM!"(B
$B0J2<$NFbMF$G(BChung-chieh Shan$B$5$s$N9V1i$rM=Dj$7$F$*$j$^$9!#(B
$B4X?4$r$*;}$A$NJ}$O!"@'Hs$*5$7Z$K$4;22C$/$@$5$$!#(B
$B$I$&$>$h$m$7$/$*4j$$$$$?$7$^$9!#(B
$BD9C+@n???M(B
$B5~ETBg3X?tM}2r@O8&5f=j(B
--
$BF|;~(B 2012$BG/(B5$B7n(B15$BF|!J2P!K(B11:00$B!A(B12:00
$B>l=j(B $B5~ETBg3XAm9g8&5f(B2$B9f4[!J5HED%-%c%s%Q%9K\It9=Fb!K(B4$B3,(B478$B9f<<(B
Room 478, General Research Building No.2, Kyoto University
(Access information …
[View More]& map:
http://www.kyoto-u.ac.jp/en/accesshttp://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg )
$B9V1i<T(B Chung-chieh Shan$B;a(B (Cornell$BBg(B/$BC^GHBg(B)
$BBj(B Functional modularity in the lambda calculus
$B%"%V%9%H%i%/%H(B
(I (B (I (BA module is a part of a _description_ of a system, not necessarily
(I (B (I (Ba physical part. (I (BFor example, a program that is stored only in
(I (B (I (Bcompiled form by the computer running it may nevertheless be better
(I (B (I (Bdescribed by source code, so the program may have source modules
(I (B (I (Bthat are hard to recover at run time. (I (BThis functional notion of
(I (B (I (Bmodularity is relevant for organisms, species, and scientists
(I (B (I (Bbecause they all need to adapt to changes in the environment without
(I (B (I (Bre-learning, re-evolving, or re-discovering each new system from
(I (B (I (Bscratch.
(I (B (I (BLambda calculi and type systems offer expressive ways to describe
(I (B (I (Bnatural language and thus carve out its modules. (I (BIn particular,
(I (B (I (Blambda calculi can express modules that operate on other modules,
(I (B (I (Band type systems can circumscribe information flow among modules
(I (B (I (Bwhose operation is tightly intertwined. (I (BI will illustrate the use
(I (B (I (Bof this expressivity with two examples: (I (BFirst, Abstract Categorial
(I (B (I (BGrammars can carve out sound and meaning as a collection of modules
(I (B (I (Bmediated by syntax. (I (BSecond, monad transformers can carve out side
(I (B (I (Beffects such as continuations and state as a collection of modules
(I (B (I (Bmediated by lexical items.
$B!JLd$$9g$o$;@h!'D9C+@n!K(B
--
$BD9C+@n???M(B <hassei(a)kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
[View Less]
We will hold the 3rd 「論数哲」(PhilLogMath) workshop. Our aim is to
provide opportunities of detailed discussions among philosophers,
logicians, mathematicians and linguists. We focus on theoretical and
computational linguistics this time. Everyone is welcome.
website url: http://researchmap.jp/jopmokbbr-21098/#_21098
Date : May 17 (Thu)
Place: Seiryo Kaikan (Nagata-cho, Tokyo)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Time table
10:00-13:00 "…
[View More]Author meets Critics" meeting on Takuro Onishi's Doctor thesis
14:30-16:00 Daisuke Bekki (Ochanomizu University) and Hiroko Ozaki
(Ochanomizu University)
"Sub-directional Combinatory Logic (SDCL) and Categorial Grammar"
16:15-17:45 Chung-chieh Shan (Cornell Unversity/ Tsukuba University)
"Interpreting generic statements in topological spaces"
Two afternoon slots consists of 60 minutes talk and 30 minutes
discussion basically.
Author meets Critics meeting is in Japanese, and two afternoon
talks are in English.
Abstracts:
*Daisuke Bekki and Hiroko Ozaki "Sub-directional Combinatory Logic
(SDCL) and Categorial Grammar"
Sub-directional Combinatory Logic (SDCL) is a class of substructural
combinatory logic that distinguishes two types of implications (/ and
¥) as in Lambek calculus, which is intended to establish a
correspondence between combinatory categorial grammar (CCG) and logic.
In this talk, we will introduce some of our recent developments
concerning SDCL, including the relation between extraction and the
deduction theorem (Ozaki and Bekki (2012)), and the application of
SDCL to normal form parsing (Ozaki(2012)).
*Chung-chieh Shan "Interpreting generic statements in topological
spaces" (joint work with Adam Bjorndahl and Will Starr at Cornell
University)
Generic statements, such as "lions have manes and give birth to live
young", are statements about kinds. But what are kinds, and what does
it take for a kind to satisfy a property that applies to members of
the kind? We claim that a kind is a topological space, a property is a
set of points in the space, and a property holds of a kind generically
iff the set of points is "large" in a topological (and qualitative)
sense. This "large" modality accounts for several inference patterns
of generic statements. However, it leaves open the issue of how the
space is constituted by cognition and updated in dialogue.
Workshop organizer (please replace [at] to @):
Yuko Murakami
Shunsuke Yatabe ( shunsuke.yatabe[at]aist.go.jp )
Takuro Onishi ( takuro.onishi[at]gmail.com )
[View Less]
8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University,
DENMARK
Third Announcement and Call for Papers
The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner,
Denmark, 20-21 August 2012.
After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.
As …
[View More]with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.
TOPICS
The scope of SLS 2012 is broad, ranging over the whole area of mathematical and philosophical logic, and logical methods in computer science. Suitable topics include (but are not limited to):
* Proof Theory and Constructivism
* Model Theory (including Finite Model Theory)
* Set Theory
* Computability Theory
* Categorical Logic
* Logic and Provability
* Logic and Computer Science
* Logic and Linguistics
* Modal, Hybrid, Temporal, and Description Logic
* Logics of Games, Dynamics and Interaction
* Philosophy of Mathematics
* Philosophy of Computation
* Philosophy of Logic
* Philosophical Logic
PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:
7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968
The proceedings of several of these meetings have been published in book form.
INVITED SPEAKERS
The Program Committee is delighted to announce the names of the four invited speakers:
* Nikolaj Bjorner<http://research.microsoft.com/en-us/people/nbjorner/>
* Rosalie Iemhoff<http://www.phil.uu.nl/%7Eiemhoff/> (sponsored by The Danish Network for the History and Philosophy of Mathematics)
* Per Martin-Löf<http://en.wikipedia.org/wiki/Per_Martin-L%C3%B6f>
* Boban Velickovic<http://www.logique.jussieu.fr/%7Eboban/>
<http://research.microsoft.com/en-us/people/nbjorner/>
SLS TUTORIALS
On August 22nd, the day after the symposium finishes, a number of tutorials for PhD-students (or anyone else who is interested) will be given. These are intended to start from a relatively elementary level and lead on to current research problems.
The following tutorial lectures have been confirmed so far:
* Lars Kristiansen<http://folk.uio.no/larsk/> - "Honest subrecursive degree theory"
* Sara Negri <http://www.helsinki.fi/%7Enegri/> - "Labelled proof systems for modal logic"
* M. H. Sørensen<http://www.formalit.dk/> - "Curry-Howard Isomorphism"
RELATED EVENTS:
Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL:http://hylocore.ruc.dk/aiml2012/
PROGRAM COMMITTEE
Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)
Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist, (Vienna)
Jouko Väänänen (Helsinki)
ORGANISING COMMITTEE
Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)
SUBMISSIONS
Abstracts of talks should be submitted by May 1, 2012** using the EasyChair system
https://www.easychair.org/conferences/?conf=sls2012
The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.
**UPDATE:
SUBMISSION DATE has been extended: 1 June
NOTIFICATION OF ACCEPTANCE: 15 June
STUDENT GRANTS
We are happy to announce that the ASL is sponsoring SLS2012. Among other things, this means that student ASL members may apply for ASL travel funds that are available for sponsored meetings.
(see http://www.aslonline.org/studenttravelawards.html).
LOCATION
Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.
ACCOMMODATION
Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.
REGISTRATION
The conference website will be found at:
http://scandinavianlogic.weebly.com/
Details concerning registration will be posted there in due course.
[View Less]
# 重複の場合はご容赦ください.
神戸大学の田村と申します.
メーリングリストをお借りして,5月23〜25日に神戸大学で開催されます
FLOPS 2012 の Call For Participation をお送りします.
日本で定期的に開催される(関数型と論理型を含む)宣言的プログラミング全般
の国際会議の一つです.
Early registration の〆切は 4月25日(水)となっております.皆様のご参加を
お待ちしております.
--
田村直之 (tamura(a)kobe-u.ac.jp) 神戸大学 情報基盤センター
〒657-8501 神戸市灘区六甲台町1-1
Phone: 078-803-5364, Fax: 078-803-5375
=======================================================================================
CALL FOR PARTICIPATION: FLOPS 2012
===============================…
[View More]===
Eleventh International Symposium on Functional and Logic Programming
May 23-25, 2012
Takikawa Memorial Hall, Kobe University,
Kobe, Japan
http://www.org.kobe-u.ac.jp/flops2012/
*Early Registration: April 25 (Wed)*
FLOPS is a forum for research on all issues concerning declarative
programming, including functional programming and logic programming,
and aims to promote cross-fertilization and integration between the
two paradigms.
The 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) and satellite workshops including WFLP 2012
will be held in the week after FLOPS at Nagoya, Japan.
Invited Speakers @ FLOPS
================
- Tachio Terauchi (Graduate School of Information Science, Nagoya University).
Automated Verification of Higher-order Functional Programs
- Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev).
Programming with Boolean Satisfaction
- Stephanie Weirich (School of Engineering and Applied Science, University of Pennsylvania).
Dependently-typed programming in GHC
See the full program at http://www.org.kobe-u.ac.jp/flops2012/program.html
Register now at http://www.org.kobe-u.ac.jp/flops2012/index.html#REGISTRATION
CONFERENCE ORGANIZERS
GENERAL CHAIR
=============
- Naoyuki Tamura (Kobe University, Japan)
PROGRAM CO-CHAIRS
=================
- Tom Schrijvers (Ghent University, Belgium)
- Peter Thiemann (University of Freiburg, Germany)
CONFERENCE SPONSORS
===================
- Japan Society for Software Science and Technology (JSSST) SIGPPL
- Information Science and Technology Center, Kobe University
IN COOPERATION WITH
===================
- ACM SIGPLAN
- Asian Association for Foundation of Software (AAFS)
- Association for Logic Programming (ALP)
=======================================================================================
[View Less]
(重複の場合はご容赦ください.)
皆様,
北陸先端科学技術大学院大学の千葉です.
ICFEM 2012の投稿締め切りが再度延長されましたのでお知らせいたし
します.アブストラクトの締め切りは過ぎておりますが新たな投稿も
受付中です.
是非投稿をご検討下さい.
よろしくお願いします.
----------
The deadlines of full paper submissions to ICFEM 2012 have been extended
again as follows.
Full Paper Submission Deadline (Extended): 30th April, 2012
We are looking forward to your submissions.
************************************************************
ICFEM 2012:
14th International Conference on Formal Engineering Methods
CALL …
[View More]FOR PAPERs
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
************************************************************
ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has
been serving as an international forum for researchers and practitioners
who have been seriously applying formal methods to practical applications.
Researchers and practitioners, from industry, academia, and government,
are encouraged to attend, and to help advance the state of
the art. We are interested in work that has been incorporated into
real production systems, and in theoretical work that promises to
bring practical and tangible benefit.
ICFEM 2012 will be hosted by National Institute of Advanced
Industrial Science and Technology (AIST) and Japan Advanced Institute of
Science and Technology (JAIST), which will be held in
Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find
many historical sites which have been designated as World Heritage there.
We are looking forward to your submissions.
AREA AND TOPICS
Submissions related to the following principal themes are encouraged, but
any topics relevant to the field of formal methods and their practical
applications will also be considered:
* Abstraction and refinement
* Formal specification and modelling
* Software verification
* Program analysis
* Software model checking
* Formal approaches to software testing
* Formal methods for object and component systems
* Formal methods for cloud computing/robotics/cyber-physical systems/
medical devices/aeronautics/railway
* Formal methods for self-* systems
* Formal methods for software safety, security, reliability and dependability
* Experiments involving verified systems
* Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc)
* Formal model-based development and code generation
SUBMISSION AND PUBLICATION
Submissions to the conference must not have been published or be concurrently
considered for publication elsewhere. All submissions will be judged on the
basis of originality, contribution to the field, technical and presentation
quality, and relevance to the conference. The proceedings will be published
in the Springer Lecture Notes in Computer Science series.
Papers should be written in English and not exceed 16 pages in LNCS
format (see http://www.springer.de/comp/lncs/authors.html for
details). Submission should be done through the ICFEM 2012 submission page
(https://www.easychair.org/conferences/?conf=icfem2012), handled by the
EasyChair conference system.
IMPORTANT DATES
Full Paper Submission Deadline (Extended): 30th April, 2012
Acceptance/Rejection Notification: 18th June, 2012
Camera Ready Copy Due: 16th July, 2012
Conference: 12th-16th, November, 2012.
ORGANIZATION COMMITTEE
General Chairs:
Kokichi Futatsugi, JAIST, Japan
Shaoying Liu, Hosei Uni., Japan
Conference Chair:
Hitoshi Ohsaki, AIST, Japan
Program Chairs:
Kenji Taguchi, AIST, Japan
Toshiaki Aoki, JAIST, Japan
Steering Committee:
Keijiro Araki, Kyushu University, Japan
Michael Butler, University of Southampton, UK
Jin Song Dong, National University of Singapore, Singapore
He Jifeng, East China Normal University, China
Shaoying Liu (Chair), Hosei University, Japan
Jeff Offutt, George Mason University, USA
Shengchao Qin, University of Teesside, UK
Program Committee:
Bernhard K. Aichernig (Graz University of Technology, Austria)
Cyrille Artho (AIST, Japan)
Richard Banach (University of Manchester, UK)
Nikolaj Bjorner(Microsoft Research Redmond, USA)
Jonathan P. Bowen (University of Westminster, UK)
Michael Butler (University of Southampton, UK)
Sagar Chaki (CMU/SEI, USA)
Rance Cleaveland (University of Maryland/Reactive Systems, USA)
Jim Davies (Oxford University, UK)
Zhenhua Duan (Xidian University, China)
Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain)
Andy Galloway (University of York, UK)
Stefania Gnesi (ISTI-CNR, Italy)
Wolfgang Grieskamp (Google, USA)
Klaus Havelund (NASA JPL, USA)
Daniel Jackson (MIT, USA)
Thierry Jeron (INRIA, France)
Gerwin Klein (NICTA, Australia)
Weiqiang Kong (Kyushu University, Japan)
Kim G. Larsen (Aalborg University, Denmark)
Peter Gorm Larsen (Engineering College of Aarhus, Denmark)
Insup Lee (University of Pennsylvania, USA)
Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany)
Xuandong Li (Nanjing University, China)
Yuan-Fang Li (Monash University, Australia)
Zhiming Liu (UNU/IIST, Macau)
Dominique Mery (Nancy University and LORIA, France)
Stephan Merz (INRIA Nancy & LORIA, France)
Huaikou Miao (Shanghai University, China)
Alexandre Mota (CIn-UFPE, Brasil)
Shin Nakajima (NII, Japan)
Kazuhiro Ogata (JAIST, Japan)
Jose Nuno Oliveira (Universidade do Minho, Portugal)
Jun Pang (University of Luxembourg, Luxembourg)
Shengchao Qin (Teesside University, UK)
Zongyan Qiu (Peking University, China)
S. Ramesh (General Motors India, India)
Alexander Romanovsky (Newcastle University, UK)
Wuwei Shen (Western Michigan University, USA)
Marjan Sirjani (Reykjavik University, Iceland)
Greame Smith (The University of Queensland, Australia)
Jing Sun (University of Auckland, New Zealand)
Jun Sun (Singapore University of Technology and Design, Singapore)
Yih-Kuen Tsay (National Taiwan University, Taiwan)
Viktor Vafeiadis (MPI-SWS, Germany)
Hai H. Wang (Aston University, UK)
Ji Wang (National University of Defense Technology, China)
Wang Yi (Uppsala University, Sweden)
Jian Zhang (Chinese Academy of Sciences, China)
Huibiao Zhu (East China Normal University, China)
-----------------------------------
Yuki Chiba
Japan Advanced Institute of Science and Technology (JAIST)
http://www.jaist.ac.jp/~chiba/index.html
chiba(a)jaist.ac.jp
[View Less]
みなさま,
こんにちは! 東京大学の蓮尾です.
7月のバークレー,CAV 併設ワークショップ LfSA のご案内です.
- (***New!***) 締切りが延長されて,
Abstract submission: April 27
Paper submission: May 4
となりました.
- トピックは(広い意味での)論理を用いたシステム検証で,
- まだ新しいワークショップ(2回目)で正式なプロシーディングス
もありませんが,専門家が集うので「出席して役に立つ」会合である
と考えます.ぜひ投稿をご検討ください.(3カテゴリあります)
それでは!
蓮尾 一郎
東京大学 大学院情報理工学系研究科 コンピュータ科学専攻
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
================================================
Call for Papers
------------------------------------------------…
[View More]--
LfSA'12 -- Logics for System Analysis
http://www.ls.cs.cmu.edu/LfSA12
--------------------------------------------------
Workshop Affiliated with CAV 2012
July 7th, 2012, Berkeley, USA
Safety-critical systems frequently occur as real-time systems,
embedded systems, hybrid systems, distributed systems, and
cyber-physical systems. They are also becoming more and more important
in many application domains, including aviation, automotive, railway,
robotic, or medical applications, where both safety and security are
relevant aspects. To ensure the correct functioning of safety-critical
systems it is necessary to model and reason about hardware, software,
communication aspects, physical properties, and the system
environment.
LfSA’12 is the second workshop on Logics for System Analysis, devoted
to the systematic theoretical study, practical development, and
applied use of logics for system analysis. The purpose of the LfSA
workshop is to bring together researchers and practitioners interested
in studying practically relevant systems or in developing the logical
foundations and analysis tools for their study.
Topics include
* Logics for safety-critical systems (real-time, embedded, hybrid,
distributed, stochastic, cyber-physical)
* Logic-based methods for development of safety-critical systems
* Logics to study security aspects of systems or protocols
* System representations using logics, automata, modeling languages,
state charts, Petri nets, dataflow models
* Theories, decision procedures, and calculi for system analysis
* Model checking, theorem proving, and systematic testing
* Case studies for logical system analysis
* Applications of system analysis to industrial problems
In particular, we invite contributions that bridge the gap between
theory and practice or that combine different application domains.
Submission Categories
---------------------
* Regular papers (up to 15 pages), which should present previously
unpublished work (completed or in progress), including descriptions
of research, tools, and applications.
* Short papers (up to 5 pages), which describe work in progress or aim
at initiating discussions.
* Presentation-only papers, i.e., papers already submitted or
presented at a conference or another workshop; such papers will not
be included in the LfSA proceedings but will be presented during the
workshop.
In addition to informal and electronic workshop proceedings, we
consider the option of a special issue in a journal after the workshop
Workshop/Programme Chairs
-------------------------
Andre Platzer
Carnegie Mellon University
Philipp Ruemmer
Uppsala University
Programme Committee
-------------------
A. Banerjee (IMDEA Madrid)
R. Barbosa (U. Coimbra)
F. S. de Boer (CWI Amsterdam)
A. Cimatti (IRST Trento)
M. Dam (KTH Stockholm)
S. Demri (CNRS Cachan)
M. Giese (U. of Oslo)
I. Hasuo (U. Tokyo)
F. Ivancic (NEC Lab. Princeton)
E. B. Johnsen (U. of Oslo)
V. Sofronie-Stokkermans (U. Koblenz)
U. Waldmann (MPI Saarbrücken)
Important Dates/Deadlines
-------------------------
Abstract submission: April 27
Paper submission: May 4
Notification: June 8, 2012
Final version: June 29, 2012
Workshop: July 7, 2012
Workshop Webpage
----------------
http://www.ls.cs.cmu.edu/LfSA12
Submission via Easychair
------------------------
https://www.easychair.org/conferences/?conf=lfsa12
[View Less]
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
Extension of deadline
=== EXTENDED Deadline for contributed talks: 29 April 2012 ===
=== Grants for travel available - please apply! ===
The deadline for submissions to LATD 2012 has been extended to
29 April 2012
Please hurry to submit your abstract (2-4 pages) at
http://www.easychair.org/conferences/?conf=latd2012
Travel/Participation grants
===========================
If there are …
[View More]economical reasons *not* to submit a contribution to the
conference, please consider applying for a grant with the following
information to latd12(a)jaist.ac.jp:
- name, affilitation
- amount of money needed
- title of your contribution (no grant without presentation)
- reason/explanation of need for grant
We will let you know the result of our decision on grant support
soon after the decision on the contributions.
========== Original Call for Contributions follows ==============
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science
[2],
Japan Advanced Institute of Science and Technology [3].
Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The assumption that 'truth
comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.
The main goal of this meeting is to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic, and to promote
communication and cooperation with members of neighbouring fields.
The featured topics include, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.
We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued
logics
in general).
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Invited Speakers:
. Rostislav Horčík (Academy of Sciences, Czech Republic)
. Emil Jeřábek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)
Tutorial:
. Felix Bou (University of Barcelona, Spain)
If you are interested in presenting a paper, please submit a 2-4 pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012(a)jaist.ac.jp
The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.
Registration:
Registration has not started by now, but we appreciate your email
informing us on your participation plans. Registration fee is likewise
not determined by now.
Grants:
There is a limited amount of grants available for participants. Please
contact us as soon as possible including the following information:
- name, affilitation
- amount of money needed
- title of your contribution (no grant without presentation)
- reason/explanation of need for grant
Conference dates:
The scientific program will start Monday morning (10 September) and
finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located
in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd2012(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
The third「論数哲」"Ron-Suu-Tetsu" (PhilLogMath) workshop
We will hold the 3rd 「論数哲」(PhilLogMath) workshop.
Our aim is to provide opportunities of detailed discussions among
philosophers, logicians, mathematicians and linguists.
We focus on theoretical and computational linguistics this time.
Everyone is welcome.
Date : May 17 (Thu)
Place: Seiryo Kaikan (Nagata-cho, Tokyo)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Speaker:
*Daisuke Bekki (Ochanomizu …
[View More]University) and Hiroko Ozaki
(Ochanomizu University),
*Chung-chieh Shan (Cornell Unversity/ Tsukuba
University)
Two afternoon slots consists of 60 minutes talk and 30 minutes
discussion basically. Author meets Critics meeting is in Japanese, and
two afternoon talks are in English.
The details will be updated at our website url:
http://researchmap.jp/jopmokbbr-21098/#_21098
Workshop organizer (please replace [at] to @):
* Yuko Murakami
* Shunsuke Yatabe ( shunsuke.yatabe[at]aist.go.jp )
* Takuro Onishi ( takuro.onishi[at]gmail.com )
[View Less]
皆様
合流性 (チャーチ・ロッサ性) に関するワークショップ IWC 2012 の参加者募集と
合流性自動証明ツールのコンペティション CoCo 2012 の参加ツール募集
の案内をお知らせ致します。IWCの早期参加申し込み締切りは4月25日になって
おります。
廣川 直(北陸先端科学技術大学院大学)
======================================================================
Call for Participation
IWC 2012
1st International Workshop on Confluence
29 May 2012, Nagoya, Japan, collocated with RTA 2012
http://cl-informatik.uibk.ac.at/events/iwc-2012/
==…
[View More]====================================================================
Recently there is a renewed interest in confluence research, resulting
in new techniques, tool support as well as new applications. The
workshop aims at promoting further research in confluence and related
properties. The workshop is collocated with the 23rd International
Conference on Rewriting Techniques and Applications (RTA 2012). During
the workshop the 1st Confluence Competition (CoCo 2012) takes place
(see below).
IMPORTANT DATES:
* early registration April 25, 2012 JST (GMT+9)
* registration May 9, 2012 JST (GMT+9)
* workshop May 29, 2012 JST (GMT+9)
Please register at:
https://apollon.nta.co.jp/rta2012/
INVITED SPEAKERS:
* Vincent van Oostrom Utrecht University
* Yoshihito Toyama Tohoku University
ACCEPTED PAPERS:
* Bertram Felgenhauer:
A Proof Order for Decreasing Diagrams
* Dominik Klein and Nao Hirokawa:
Confluence of Non-Left-Linear TRSs via Relative Termination (Extended Abstract)
* Christian Nemeth, Harald Zankl and Nao Hirokawa:
IaCOP - Interface for the Administration of COPS
* Kristoffer Rose:
A Case for Completion Modulo Equivalence
* Thomas Sternagel, René Thiemann, Harald Zankl and Christian Sternagel:
Recording Completion for Finding and Certifying Proofs in Equational Logic
* Hans Zantema:
Automatically Finding Non-Confluent Examples in Abstract Rewriting
ORGANISING COMMITTEE:
* Nao Hirokawa JAIST
* Aart Middeldorp University of Innsbruck
* Naoki Nishida Nagoya University
======================================================================
Second Call for Provers
CoCo 2012
1st Confluence Competition
http://coco.nue.riec.tohoku.ac.jp/2012/
======================================================================
Recently, several new implementations of confluence proving/disproving
tools are reported and interest for proving/disproving confluence
"automatically" has been grown. CoCo aims to foster the development of
techniques for proving/disproving confluence automatically by setting
up a dedicated and fair confluence competition among confluence
proving/disproving tools.
The 1st Confluence Competition (CoCo 2012) runs during the 1st
International Workshop on Confluence (IWC 2012), which is collocated
with the 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) at Nagoya University, Japan. In this
competition a category for first-order term rewrite systems will be
run. Other categories (e.g., higher-order) will be considered if there
are tools and problems.
IMPORTANT DATES:
* registration April 1, 2012 - May 15, 2012
* system description April 15, 2012 - May 15, 2012
* tool submission May 1, 2012 - May 15, 2012
* competition May 29, 2012
REGISTRATION/SUBMISSION:
Registration and tool submission will be via the email address:
coco-sc [AT] jaist.ac.jp
Tools must be able to read input files written in the old TPDB format.
The output of the tools must contain an answer in the first line
followed by some proof argument understandable for human experts.
Valid answers are YES (the input is confluent) and NO (the input is
not confluent). Every other answer is interpreted as the tool could
not determine the status of the input. For more information including
competition rules, see
http://coco.nue.riec.tohoku.ac.jp/
All registered tool authors are asked to submit a one-page system
description paper in EasyChair style. Submission is via EasyChair at
https://www.easychair.org/account/signin.cgi?conf=iwc2012
These papers will appear in the proceedings of IWC 2012.
ORGANISING COMMITTEE:
* Takahito Aoto Tohoku University (chair)
* Nao Hirokawa JAIST
* Harald Zankl University of Innsbruck
[View Less]
Please distribute this call to everybody you think intrested 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 (…
[View More]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 starts annually in the winter term. Applications for 2012
have to be electronically submitted on the Webpage
http://www.epcl-study.eu/, before the
=======================================
Application Deadline on 15 May 2012
=======================================
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).
--
Dr.rer.nat.habil. Bertram Fronhöfer
TU Dresden
Department of Computer Science
International Center for Computational Logic
01062 Dresden, Germany
Tel.: +49 (0)351 463 39095
[View Less]
セミナーのご案内
日時:4月19日(木)16:30から
場所:東京工業大学 大岡山西8号館W棟11階 W1101セミナー室
会場までの交通案内はこちらから:
http://www.titech.ac.jp/about/campus/index.html
話者:蓮尾 一郎 (東京大学コンピュータ科学専攻)
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
題目:Programming with Infinitesimals: A While-Language for Hybrid System Modeling
(Joint Work with Kohei Suenaga, Kyoto University)
概要:
We add, to the common combination of a WHILE-language and a
Hoare-style program logic, a constant dt that represents an
infinitesimal (i.e. infinitely small) value. …
[View More]The outcome is a
framework for modeling and verification of hybrid systems: hybrid
systems exhibit both continuous and discrete dynamics and getting them
right is a pressing challenge. We rigorously define the semantics of
programs in the language of nonstandard analysis, on the basis of
which the program logic is shown to be sound and relatively complete.
If the time allows, our recent prototype automatic prover will also be
demonstrated.
参考文献:
Kohei Suenaga and Ichiro Hasuo.
Programming with Infinitesimals: A While-Language for Hybrid System Modeling.
Proc. ICALP 2011, Track B. LNCS 6756, p. 392-403. Springer-Verlag.
Ichiro Hasuo and Kohei Suenaga.
Exercises in Nonstandard Static Analysis of Hybrid Systems.
To appear in Proc. CAV 2012.
問い合わせ先:
鹿島 亮(東京工業大学 数理・計算科学専攻)
kashima(a)is.titech.ac.jp
[View Less]
$B3'MM!"(B
$B:#=5$NLZMK$K5~Bg$G(BPaul-Andre Mellies$B$5$s$N9V1i$rM=Dj$7$F$$$^$9!#(B
$B4X?4$r$*;}$A$NJ}$O$I$&$>$*5$7Z$K$4;22C$/$@$5$$!#(B
$BD9C+@n???M(B
$B5~ETBg3X?tM}2r@O8&5f=j(B
------
$BF|;~(B: 19 April 2012 (Thursday) 11:00-12:00
$B>l=j(B: $B5~ETBg3XAm9g8&5f(B2$B9f4[(B478$B9f<<(B
Room 478, General Research Building No.2, Kyoto University
(Access information & map:
http://www.kyoto-u.ac.jp/en/accesshttp://www.kurims.kyoto-u.ac.…
[View More]jp/~hassei/map-2.jpg )
$B9V1i<T(B: Paul-Andre Mellies (CNRS, Paris VII)
$BBj(B: Braided notions of dialogue categories
$B35MW(B:
A dialogue category is a monoidal category equipped with an
exponentiating object. In this talk, I will introduce a notion
of braided dialogue category, and explain how this notion
provides a functorial bridge between proof theory and knot
theory.
($BLd$$9g$o$;(B: $BD9C+@n(B <hassei(a)kurims.kyoto-u.ac.jp>)
--
Masahito Hasegawa
Research Institute for Mathematical Sciences, Kyoto University
[View Less]
みなさま,
こんにちは! 東京大学の蓮尾と申します.
急なご案内ですが,講演を2件,お知らせさせてください.
木曜日のご講演は暗号理論の専門家によるものですが,内容は
暗号プロトコルの形式検証(計算論的安全性)に動機づけられた
ものです.形式検証の人向けに話してもらえるよう,お願いしてあります.
金曜日は線形論理・ゲーム意味論の専門家によるご講演です.
NII でも明日お話されるようですので,ぜひあわせてどうぞ.
会場のアクセスは,
http://www-mmm.is.s.u-tokyo.ac.jp/index.html
をご覧下さい.
みなさまのお越しをお待ちしております.それでは!
蓮尾 一郎
東京大学 コンピュータ科学専攻
http://www-mmm.is.s.u-tokyo.ac.jp
Thu 12 Apr 2012, 16:40-18:10
David Galindo <http://www.dgalindo.es/> (U. Luxembourg),
Encryption Schemes Secure in the Presence of …
[View More]Key Cycles
理学部7号館5階 511教室 Room 511, School of Science Bldg. No. 7
Traditionally the security of encryption schemes has relied
on the assumption that the decryption keys are not accessible to the
attacker neither directly (e.g. some parts of the decryption key might
have been leaked) nor indirectly (e.g. never encrypt messages that
depend on the decryption key). However this assumption has been
challenged in different contexts in the last decade. The main sources
have been side-channel attacks and formal cryptography.
In this talk we will give an introduction to the traditional security
notions for encryption schemes as well as the new notion of security
in the presence of key cycles. We will explain why the latter notion
is difficult to achieve using previous techniques. Finally we will
introduce the first practical encryption scheme achieving the latter
security notion (appeared at CRYPTO 2008).
Fri 13 Apr 2012, 16:40-18:10
Paul-Andre Mellies <http://www.pps.jussieu.fr/%7Emellies/> (U. Paris VII),
Tensorial logic: a type-theoretic foundation for game semantics
理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7
Tensorial logic is a primitive logic of tensor and negation which refines
linear logic by relaxing the hypothesis that negation is involutive. I will
explain how the logic provides a type-theoretic foundation to game
semantics, and how it may be extended with algebraic effects in order to
recover specific categories of games and strategies.
[View Less]
Dr. Paul-Andre Mellies Lecture at NII Logic Seminar
Date: April 11, 2012, 13:30--15:30
Place: National Institute of Informatics, Room 1904 (19th floor)
場所: 国立情報学研究所 19階 1904室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Speaker: Dr. Paul-Andre Mellies (CNRS and Paris 7 Univ)
Title: Tensorial logic in string diagrams
Abstract:
In this talk, I will describe how to resolve the schism between game
semantics and linear logic by …
[View More]introducing a primitive logic of tensor
and linear negation, called tensorial logic. I will then explain how
to depict the proofs of tensorial logic as surfaces formulated in the
3-categorical language of string diagrams -- this offering a natural
synthesis of interactive strategies and proof-nets.
問合せ先:
龍田 真 (国立情報学研究所)
e-mail: tatsuta(a)nii.ac.jp
http://research.nii.ac.jp/~tatsuta
[View Less]
(重複の場合はご容赦ください.)
皆様,
北陸先端科学技術大学院大学の千葉です.
ICFEM 2012の投稿締め切りが延長されましたのでお知らせします.
是非投稿をご検討下さい.
--------------------------------------------------
The deadlines of abstract submissions and paper submissions to ICFEM 2012
have been extended as follows.
Abstract Submission Deadline (Extended): 16th April, 2012
Full Paper Submission Deadline (Extended): 23th April, 2012
We are looking forward to your submissions.
************************************************************
ICFEM 2012:
…
[View More]14th International Conference on Formal Engineering Methods
CALL FOR PAPERs
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
************************************************************
ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has
been serving as an international forum for researchers and practitioners
who have been seriously applying formal methods to practical applications.
Researchers and practitioners, from industry, academia, and government,
are encouraged to attend, and to help advance the state of
the art. We are interested in work that has been incorporated into
real production systems, and in theoretical work that promises to
bring practical and tangible benefit.
ICFEM 2012 will be hosted by National Institute of Advanced
Industrial Science and Technology (AIST) and Japan Advanced Institute of
Science and Technology (JAIST), which will be held in
Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find
many historical sites which have been designated as World Heritage there.
We are looking forward to your submissions.
AREA AND TOPICS
Submissions related to the following principal themes are encouraged, but
any topics relevant to the field of formal methods and their practical
applications will also be considered:
* Abstraction and refinement
* Formal specification and modelling
* Software verification
* Program analysis
* Software model checking
* Formal approaches to software testing
* Formal methods for object and component systems
* Formal methods for cloud computing/robotics/cyber-physical systems/
medical devices/aeronautics/railway
* Formal methods for self-* systems
* Formal methods for software safety, security, reliability and dependability
* Experiments involving verified systems
* Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc)
* Formal model-based development and code generation
SUBMISSION AND PUBLICATION
Submissions to the conference must not have been published or be concurrently
considered for publication elsewhere. All submissions will be judged on the
basis of originality, contribution to the field, technical and presentation
quality, and relevance to the conference. The proceedings will be published
in the Springer Lecture Notes in Computer Science series.
Papers should be written in English and not exceed 16 pages in LNCS
format (see http://www.springer.de/comp/lncs/authors.html for
details). Submission should be done through the ICFEM 2012 submission page
(https://www.easychair.org/conferences/?conf=icfem2012), handled by the
EasyChair conference system.
IMPORTANT DATES
Abstract Submission Deadline (Extended): 16th April, 2012
Full Paper Submission Deadline (Extended): 23th April, 2012
Acceptance/Rejection Notification: 18th June, 2012
Camera Ready Copy Due: 16th July, 2012
Conference: 12th-16th, November, 2012.
ORGANIZATION COMMITTEE
General Chairs:
Kokichi Futatsugi, JAIST, Japan
Shaoying Liu, Hosei Uni., Japan
Conference Chair:
Hitoshi Ohsaki, AIST, Japan
Program Chairs:
Kenji Taguchi, AIST, Japan
Toshiaki Aoki, JAIST, Japan
Steering Committee:
Keijiro Araki, Kyushu University, Japan
Michael Butler, University of Southampton, UK
Jin Song Dong, National University of Singapore, Singapore
He Jifeng, East China Normal University, China
Shaoying Liu (Chair), Hosei University, Japan
Jeff Offutt, George Mason University, USA
Shengchao Qin, University of Teesside, UK
Program Committee:
Bernhard K. Aichernig (Graz University of Technology, Austria)
Cyrille Artho (AIST, Japan)
Richard Banach (University of Manchester, UK)
Nikolaj Bjorner(Microsoft Research Redmond, USA)
Jonathan P. Bowen (University of Westminster, UK)
Michael Butler (University of Southampton, UK)
Sagar Chaki (CMU/SEI, USA)
Rance Cleaveland (University of Maryland/Reactive Systems, USA)
Jim Davies (Oxford University, UK)
Zhenhua Duan (Xidian University, China)
Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain)
Andy Galloway (University of York, UK)
Stefania Gnesi (ISTI-CNR, Italy)
Wolfgang Grieskamp (Google, USA)
Klaus Havelund (NASA JPL, USA)
Daniel Jackson (MIT, USA)
Thierry Jeron (INRIA, France)
Gerwin Klein (NICTA, Australia)
Weiqiang Kong (Kyushu University, Japan)
Kim G. Larsen (Aalborg University, Denmark)
Peter Gorm Larsen (Engineering College of Aarhus, Denmark)
Insup Lee (University of Pennsylvania, USA)
Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany)
Xuandong Li (Nanjing University, China)
Yuan-Fang Li (Monash University, Australia)
Zhiming Liu (UNU/IIST, Macau)
Dominique Mery (Nancy University and LORIA, France)
Stephan Merz (INRIA Nancy & LORIA, France)
Huaikou Miao (Shanghai University, China)
Alexandre Mota (CIn-UFPE, Brasil)
Shin Nakajima (NII, Japan)
Kazuhiro Ogata (JAIST, Japan)
Jose Nuno Oliveira (Universidade do Minho, Portugal)
Jun Pang (University of Luxembourg, Luxembourg)
Shengchao Qin (Teesside University, UK)
Zongyan Qiu (Peking University, China)
S. Ramesh (General Motors India, India)
Alexander Romanovsky (Newcastle University, UK)
Wuwei Shen (Western Michigan University, USA)
Marjan Sirjani (Reykjavik University, Iceland)
Greame Smith (The University of Queensland, Australia)
Jing Sun (University of Auckland, New Zealand)
Jun Sun (Singapore University of Technology and Design, Singapore)
Yih-Kuen Tsay (National Taiwan University, Taiwan)
Viktor Vafeiadis (MPI-SWS, Germany)
Hai H. Wang (Aston University, UK)
Ji Wang (National University of Defense Technology, China)
Wang Yi (Uppsala University, Sweden)
Jian Zhang (Chinese Academy of Sciences, China)
Huibiao Zhu (East China Normal University, China)
-----------------------------------
Yuki Chiba
Japan Advanced Institute of Science and Technology (JAIST)
http://www.jaist.ac.jp/~chiba/index.html
chiba(a)jaist.ac.jp
[View Less]
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
Second Call for Papers
=== Deadline for contributed talks: 22 April 2012 ===
=== Application for grants available ===
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science
[2],
Japan Advanced Institute of …
[View More]Science and Technology [3].
Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The assumption that 'truth
comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.
The main goal of this meeting is to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic, and to promote
communication and cooperation with members of neighbouring fields.
The featured topics include, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.
We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued
logics
in general).
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Invited Speakers:
. Rostislav Horčík (Academy of Sciences, Czech Republic)
. Emil Jeřábek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)
Tutorial:
. Felix Bou (University of Barcelona, Spain)
If you are interested in presenting a paper, please submit a 2–4 pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012(a)jaist.ac.jp
The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.
Registration:
Registration has not started by now, but we appreciate your email
informing us on your participation plans. Registration fee is likewise
not determined by now.
Grants:
There is a limited amount of grants available for participants. Please
contact us as soon as possible including the following information:
- name, affilitation
- amount of money needed
- title of your contribution (no grant without presentation)
- reason/explanation of need for grant
Conference dates:
The scientific program will start Monday morning (10 September) and
finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located
in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd2012(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
Second Call for Papers
=== Deadline for contributed talks: 22 April 2012 ===
=== Application for grants available ===
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science [2],
Japan Advanced Institute of Science and Technology [3].
Mathematical …
[View More]Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The assumption that 'truth comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.
The main goal of this meeting is to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic, and to promote
communication and cooperation with members of neighbouring fields.
The featured topics include, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.
We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued logics
in general).
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Invited Speakers:
. Rostislav Horčík (Academy of Sciences, Czech Republic)
. Emil Jeřábek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)
Tutorial:
. Felix Bou (University of Barcelona, Spain)
If you are interested in presenting a paper, please submit a 2–4 pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012(a)jaist.ac.jp
The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.
Registration:
Registration has not started by now, but we appreciate your email
informing us on your participation plans. Registration fee is likewise
not determined by now.
Grants:
There is a limited amount of grants available for participants. Please
contact us as soon as possible including the following information:
- name, affilitation
- amount of money needed
- title of your contribution (no grant without presentation)
- reason/explanation of need for grant
Conference dates:
The scientific program will start Monday morning (10 September) and finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd2012(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
(重複の場合はご容赦ください)
7月にWarwickで開催される古典論理と計算に関するワークショップの
論文募集です.締切りが大幅に延長されておりますので,是非,投稿を
ご検討ください.
中澤
International Workshop on Classical Logic and Computation (CL&C'12)
http://www.doc.ic.ac.uk/~svb/CLaC12
July, 8 2012
Warwick, England
CL&C'12 is a satellite workshop of ICALP'12.
IMPORTANT DATES
Abstract submission (canceled)
Deadline for submission: April, 23, 2012 (new)
Notification of acceptance: June, …
[View More]18, 2012 (new)
Final version due: June, 28, 2012 (new)
Workshop date: July, 8, 2012
INTRODUCTION
CL&C'12 is the fourth of a conference series on Classical Logic and
Computation. It intends to cover all work aiming to explore computational
aspects of classical logic and mathematics. This year CL&C will be held as
satellite workshop of ICALP'12 in Warwick:
http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/
CL&C is focused on the interplay between program extraction from classical
the exploration of the computational content of mathematical and logical
principles. The scientific aim of this workshop is to bring together
researchers from both fields and exchange ideas.
SCOPE OF CL&C
This workshop aims to support a fruitful exchange of ideas between the
various lines of research on Classical Logic and Computation. Topics of
interest include, but are not limited to,
- version of lambda calculi adapted to represent classical logic;
- design of programming languages inspired by classical logic;
- cut-elimination for classical systems;
- proof representation and proof search for classical logic;
- translations of classical to intuitionistic proofs;
- constructive interpretation of non-constructive principles;
- witness extraction from classical proofs;
- constructive semantics for classical logic (e.g. game semantics);
- case studies (for any of the previous points).
SUBMISSION AND PUBLICATION.
This is intended to be an informal workshop. Participants are encouraged to
present work in progress, overviews of more extensive work, and programmatic /
position papers, as well as completed projects. We therefore ask for
submission both of short abstracts and of longer papers.
All submitted papers will be reviewed to normal standards. The PC recognises
two kinds of papers: it will distinguish between accepted (full) papers that
contain unpublished results not submitted elsewhere, and presentations
of (short) papers about work in progress. The accepted papers will appear
in EPTCS.
In order to make a submission:
- Format your file using the LNCS guidelines; there is a 15 page limit.
- Use the submission instructions at
https://www.easychair.org/conferences/?conf=clc2012
A participants' proceedings will be distributed at the workshop.
PROGRAMME COMMITTEE
* Herman Geuvers (Nijmegen) - chair
* Stefano Berardi (Turin)
* Steffen van Bakel (Imperial College London)
* Silvia Ghilezan (Novi Sad)
* Koji Nakazawa (Kyoto Univeristy)
* Ugo de'Liguoro (Turin)
CONTACT
deligu(a)di.unito.it
[View Less]
東北大学の赤間陽二さんの依頼により投稿します。 小野寛晰
----------------------------------------------------------------------------------------------
Seminar Announcement
Anyone can come!
Speaker: Norbert Preining (JAIST)
Title: Goedel Logics, Continuous Embeddability and Fraisse's
Conjecture
Date: Wednesday, 4 April, 16:00---17:40
Venue: 802, Rigaku Sogo-to (Godo-to), 8F, Science Campus, Tohoku
University
Key words: many-valued logic, order theory, semantics
In this talk we present a family …
[View More]of many-valued logics introduced
by Kurt Goedel to approximate Intuitionistic Logic. Later on these
were extended to first order and have exhibited connections to
temporal logics, Kripke frames based logics, fuzzy logics in the
sense of Hajek (t-norm based logics).
These logics are based on selecting a closed subset of the real
interval [0,1], and collecting all formulas evaluating to true
for all valuations into this truth value set. Due to the specific
truth functions different truth values sets might generate the
same logics (as sets of formulas).
During the search for the total number of logics we took up old
conjecture of Fraisse (theorem of Laver) on the behaviour of
scattered linear orderings. We consider continuous embeddability
in the reals and prove a generalized Fraisse conjecture stating
the the closed subsets of the real [0,1] interval with continuous
embeddability are better-quasi-ordered. Using this result we
can show that surprisingly the total number of different Goedel
logics is countable.
This discrepancy - on the one hand uncountable many equivalence
classes of the above mentioned ordering, and countable many
Goedel logics on the other hand - leaves us still without an
"intensional definition" of Goedel logics in the sense that if
two semantical objects (to be found or defined) are different,
then the respective logics are different, too. This does not hold
for equality of the truth value sets, since there are different
truth value sets creating the same logic, as well as for the above
mentioned continuous embeddability induced equivalence.
========================================
Short biography of Norbert Preining
* Graduated from Vienna University of Technology under the
auspicies of the president of the Republic of Austria in 2003
* Postdoc in Siena, Italy as European Community Marie Curie Fellow
* Project leader of a research project of the Austrian Research Fund
(FWF)
(paralleling the JSPS)
* Currently Associate Professor at the JAIST
* Secretary of the Kurt Goedel Society, responsible for the Kurt
Goedel Research Prize Fellowship
* Spare time activities are montaineering, typography, TeX, and Debian
Contact: Yohji Akama (Mathematical Institute, Tohoku University)
akama(a)m.tohoku.ac.jp, 022-795-7708
For the access, See map on http://www.math.tohoku.ac.jp/access/index.html
or http://www.math.tohoku.ac.jp/english/access-e.html (english).
For the building of the venue, see map on http://www.math.tohoku.ac.jp/map/http://www.math.tohoku.ac.jp/english/campus-e.html (english)
[View Less]
8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University,
DENMARK
Second Announcement and Call for Papers
The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner,
Denmark, 20-21 August 2012.
After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.
As …
[View More]with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.
TOPICS
The scope of SLS 2012 is broad, ranging over the whole area of mathematical and philosophical logic, and logical methods in computer science. Suitable topics include (but are not limited to):
* Proof Theory and Constructivism
* Model Theory (including Finite Model Theory)
* Set Theory
* Computability Theory
* Categorical Logic
* Logic and Provability
* Logic and Computer Science
* Logic and Linguistics
* Modal, Hybrid, Temporal, and Description Logic
* Logics of Games, Dynamics and Interaction
* Philosophy of Mathematics
* Philosophy of Computation
* Philosophy of Logic
* Philosophical Logic
PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:
7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968
The proceedings of several of these meetings have been published in book form.
INVITED SPEAKERS
The Program Committee is delighted to announce the names of the four invited speakers:
* Nikolaj Bjorner<http://research.microsoft.com/en-us/people/nbjorner/>
* Rosalie Iemhoff<http://www.phil.uu.nl/%7Eiemhoff/> (sponsored by The Danish Network for the History and Philosophy of Mathematics)
* Per Martin-Löf<http://en.wikipedia.org/wiki/Per_Martin-L%C3%B6f>
* Boban Velickovic<http://www.logique.jussieu.fr/%7Eboban/>
<http://research.microsoft.com/en-us/people/nbjorner/>
SLS TUTORIALS
On August 22nd, the day after the symposium finishes, a number of tutorials for PhD-students (or anyone else who is interested) will be given. These are intended to start from a relatively elementary level and lead on to current research problems.
The following tutorial lectures have been confirmed so far:
* Lars Kristiansen<http://folk.uio.no/larsk/> - "Honest subrecursive degree theory"
* Sara Negri <http://www.helsinki.fi/%7Enegri/> - "Labelled proof systems for modal logic"
* M. H. Sørensen<http://www.formalit.dk/> - "Curry-Howard Isomorphism"
RELATED EVENTS:
Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL: http://hylocore.ruc.dk/aiml2012/
PROGRAM COMMITTEE
Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)
Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist, (Vienna)
Jouko Väänänen (Helsinki)
ORGANISING COMMITTEE
Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)
SUBMISSIONS
Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system
https://www.easychair.org/conferences/?conf=sls2012
The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.
LOCATION
Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.
ACCOMMODATION
Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.
REGISTRATION
The conference website will be found at:
http://scandinavianlogic.weebly.com/
Details concerning registration will be posted there in due course.
[View Less]
*Call for Papers*
TARK 2013
14. Conference on Theoretical Aspects of Rationality and Knowledge
January 7-9, 2013
Institute of Mathematical Sciences, Chennai, India
Conference website: http://www.imsc.res.in/tark/
About the Conference
The mission of the TARK conferences is to bring together researchers
from a wide variety of fields, including Artificial Intelligence,
Cryptography, Distributed Computing, Economics and Game Theory,
Linguistics, Philosophy, and Psychology, in order to further …
[View More]our
understanding of interdisciplinary issues involving reasoning about
rationality and knowledge. Topics of interest include, but are not
limited to, semantic models for knowledge, belief, awareness and
uncertainty, bounded rationality and resource-bounded reasoning,
commonsense epistemic reasoning, epistemic logic, epistemic game
theory, knowledge and action, applications of reasoning about
knowledge and other mental states, belief revision, and foundations of
multi-agent systems.
Submissions are now invited to TARK 2013. Extended Abstracts can be
submitted here:
https://www.easychair.org/conferences/?conf=tark2013
Strong preference will be given to papers whose topic is of interest
to an interdisciplinary audience, and papers should be accessible to
such an audience. Papers will be held to the usual high standards of
research publications. In particular, they should 1) contain enough
information to enable the program committee to identify the main
contribution of the work; 2) explain the significance of the work --
its novelty and its practical or theoretical implications; and 3)
include comparisons with and references to relevant literature.
Abstracts should be no longer than ten double-spaced pages (4,000
words). Optional technical details such as proofs may be included in
an appendix. An email address of the contact author should be
included. Papers arriving late or departing significantly from these
guidelines risk immediate rejection. One author of each accepted paper
will be expected to present the paper at the conference.
Economists should be aware that special arrangements have been made
with certain economics journals (in particular, with International
Journal of Game Theory, Games and Economic Behavior, Journal of
Economic Theory, and Mathematical Social Sciences, so that publication
of an extended abstract in TARK will not prejudice publication of a
full journal version.
TARK 2013 will precede the Indian Conference on Logics and
Applications (ICLA) held from January 10 - 12, 2013, also at the
Institute of Mathematical Sciences in Chennai, India.
TARK 2013 is the 14th conference of the TARK conference series.
Previous conferences have been held bi-annually around the world. The
most recent conference was held 2011 at the University of Groningen,
Netherlands, see http://www.philos.rug.nl/TARK2011/. The proceedings
of all previous TARK conferences can be accessed here
http://www.tark.org/
TARK 2013 is the first TARK conference to be held in India. It is also
the first TARK conference to be held in January.
Key Dates for TARK 2013
Submission of abstracts: September 3, 2012
Notification of authors: October 29, 2012
Camera ready copy of accepted papers: November 30, 2012
Conference: January 7 - 9, 2013, Institute of Mathematical Sciences,
Chennai, India
Program Committee
Samson Abramsky, Oxford University
Thomas Agotnes, Universitetet i Bergen
Hans van Ditmarsch, Universidad de Sevilla
Amanda Friedenberg, Arizona State University
Aviad Heifetz, The Open University of Israel
Jerome Lang, Université Paris-Dauphine and Université Paul Sabatier
Fenrong Liu, Tsinghua University
Larry Moss, Indiana University, Bloomington
Antonio Penta, University of Wisconsin-Madison
Andres Perea, Maastricht University
R. Ramanujam, Institute for Mathematical Sciences, Chennai
Oliver Roy, Ludwig-Maximilians Universität München
Burkhard C. Schipper, University of California, Davis
Marciano Siniscalchi, Northwestern University
Giacomo Sillari, Scuola Normale Superiore, Pisa
Nobuyuki Suzuki,Shizuoka University
Jonathan Zvesper, London
Program Chair
Burkhard C. Schipper
University of California, Davis
Department of Economics
One Shields Avenue
Davis, CA 95616, USA
Email: bcschipper ad ucdavis dot edu
Local Organizing Chair
R. Ramanujam
Institute of Mathematical Sciences
CIT Campus, Taramani
Chennai 600 113, India
Email: tark2013org at gmail dot com
Chair of the TARK Conference Series
Joe Halpern
Cornell University
Computer Science Department
[View Less]
みなさま,
東京大学の蓮尾です.ドイツの博士学生・ポスドクの求人,
念のため転送します.Lutz Schröder さんは
modal logic/coalgebra/computational effect の文脈で
大活躍の方です.
それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
---------- Forwarded message ----------
From: Lutz Schröder <lutz.schroeder(a)cs.fau.de>
Date: Wed, Mar 28, 2012 at 5:25 AM
Subject: PhD/Postdoc Positions in Theoretical Computer Science at FAU
Erlangen-Nürnberg
[I would be grateful for further distribution of the job advertisement below]
In the newly founded …
[View More]Theoretical Computer Science group (Chair 8) at
the University of Erlangen-Nürnberg, several research positions are
available that can be filled at the doctoral or post-doctoral level.
These include project positions of up to two years, in the TV-L E13 or
E14 pay scale depending on qualification of the applicant; project
topics include
- coalgebraic logic
- probabilistic description logic
- formal methods in mechanical engineering.
Additionally, at least one position is available that is not tied to a
specific research project but does carry a teaching obligation of 5h
per week; in this case, research work can be positioned in any of the
core fields of the group including
- modal logic
- knowledge representation
- coalgebra
- formal methods
- program semantics
- applications of semantic technologies
Such positions can be filled at TV-L E13 for an initial appointment of
three years, with a possibility of extension for another three years
subject to provisions by German laws on temporal employment in
academia; postdoctoral applicants from EU countries can be appointed
at the A13 payscale ("akademischer Rat") (which pays better and has
better benefits) for two periods of three years, with a possible
extension of two periods of two years at the A14 payscale
("akademischer Oberrat") for candidates who successfully complete a
habilitation during the first six years.
Please send applications consisting of a cover letter, resume, and
contact details of three references by email to
lutz.schroeder(a)cs.fau.de. There is no particular application deadline;
positions will be filled when suitable candidates are found.
Best regards,
Lutz
--
--------------------------------------
Prof. Dr. Lutz Schröder
Chair of Theoretical Computer Science
Department of Computer Science
Friedrich-Alexander-Universität
Erlangen-Nürnberg
lutz.schroeder(a)informatik.uni-erlangen.de
lutz.schroeder(a)cs.fau.de
--------------------------------------
[View Less]
Prof. Dieter Spreen Lecture at NII Logic Seminar
Date: April 4, 2012, 13:30--15:30
Place: National Institute of Informatics, Room 1213 (12th floor)
場所: 国立情報学研究所 12階 1213室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Speaker: Prof. Dieter Spreen (University of Siegen)
Title: A refined model construction for the polymorphic lambda calculus
Abstract:
We present and discuss a stable model for the polymorphic lambda
calculus. The domains …
[View More]are enriched by an approximation structure.
This allows to put additional requirements on the morphisms of the
underlying category. Moreover, a totality notion can be introduced
such that in the induced model the polymorphic booleans are
interpreted by the two-element set {True, False}.
問合せ先:
龍田 真 (国立情報学研究所)
e-mail: tatsuta(a)nii.ac.jp
http://research.nii.ac.jp/~tatsuta
[View Less]
皆様
5月30日に名古屋大学で行われます書換えに関する国際会議 RTA 2012 の
参加者募集をご案内致します。皆様のご参加を心よりお待ち申し上げます。
廣川 (JAIST)
+===================================================================+
| |
| CALL FOR PARTICIPATION |
| |
| International Conference on Rewriting Techniques and Applications |
| …
[View More] |
| RTA 2012 |
| |
| May 30 - June 1, 2012 |
| Nagoya, Japan |
| |
| http://rta2012.trs.cm.is.nagoya-u.ac.jp/ |
| |
+===================================================================+
---------------------------------------------------------------------
-- REGISTRATION --
---------------------------------------------------------------------
For online registration visit:
https://apollon.nta.co.jp/rta2012/
* Early registration closes on April 25 JST(GMT+9).
* Online registration closes on May 9 JST(GMT+9).
---------------------------------------------------------------------
-- ABOUT RTA --
---------------------------------------------------------------------
RTA 2012 is the 23rd International Conference on Rewriting
Techniques and Applications, collocated with five satellite
workshops, IFIP WG 1.6, IWC, WFLP, HOR and TTATT.
---------------------------------------------------------------------
-- CONFERENCE VENUE --
---------------------------------------------------------------------
Noyori Memorial Hall, Higashiyama Campus of Nagoya University
---------------------------------------------------------------------
-- RTA 2012 INVITED SPEAKERS --
---------------------------------------------------------------------
* Hirokazu Anai (FUJITSU LABORATORIES LTD / Kyushu University)
* Claude Kirchner (INRIA & LORIA)
* Sebastian Maneth (NICTA & University of New South Wales)
---------------------------------------------------------------------
-- WORKSHOPS --
---------------------------------------------------------------------
* IFIP WG 1.6 IFIP Working Group 1.6 on Term Rewriting
* IWC 1st International Workshop on Confluence
* WFLP 21st International Workshop on Functional and
(Constraint) Logic Programming
* HOR 6th International Workshop on Higher-Order Rewriting
* TTATT 1st International Workshop on Trends in Tree Automata
and Tree Transducers
---------------------------------------------------------------------
-- SCHEDULE --
---------------------------------------------------------------------
* May 28 IFIP WG 1.6
* May 29 IWC, WFLP
* May 30 - June 1 RTA
* June 2 HOR, TTATT
---------------------------------------------------------------------
-- ASSOCIATED EVENTS --
---------------------------------------------------------------------
FLOPS 2012 11th International Symposium on Functional and Logic
Programming
May 23 - 25, Kobe, Japan
http://www.org.kobe-u.ac.jp/flops2012/
* It takes about 70 minutes to go from Nagoya to Kobe by Shinkansen.
---------------------------------------------------------------------
-- HOST CITY: NAGOYA, JAPAN --
---------------------------------------------------------------------
Nagoya is located at the center of Honshu (the main island of
Japan) with a population of 2.24 million. Thanks to the rich water
resources of the Kisogawa, Nagaragawa and Ibigawa Rivers, the
fertile land which enjoy the blessings of the rivers, and other
advantages including good transportation links, its people have
lived affluent lives since early days.
Nagoya has a long history and is the birthplace of three notable
feudal lords, Oda Nobunaga, Toyotomi Hideyoshi and Tokugawa Ieyasu.
Also in Nagoya, traditional industries like ceramics and textiles,
and today's key industries like automobiles, aviation and machine
tools have developed, and Nagoya has an important role in Japan's
industrial society.
Furthermore, the Central Japan International Airport (Centrair)
opened in February 2005, and in March 2005, Expo 2005 Aichi Japan
started. Centrair has flight connections with Frankfurt, Helsinki,
Detroit, Tokyo Narita, etc. Today, Nagoya grabs attention and
keeps on developing as a Japanese international city.
You can see more detailed information from the website of Nagoya
Convention & Visitors Bureau:
http://www.ncvb.or.jp/en/contents/
For travel and accommodation information, please consult the RTA
2012 website:
http://rta2012.trs.cm.is.nagoya-u.ac.jp/
RTA 2012 is organized by Nagoya University, Graduate School of
Information Science and will take place in Higashiyama campus of
Nagoya University.
---------------------------------------------------------------------
-- REGISTRATION (again) --
---------------------------------------------------------------------
For online registration visit:
https://apollon.nta.co.jp/rta2012/
* Early registration closes on April 25.
* Online registration closes on May 9.
---------------------------------------------------------------------
-- CONTACT --
---------------------------------------------------------------------
See http://rta2012.trs.cm.is.nagoya-u.ac.jp/
[View Less]
AiML-2012: FINAL CALL FOR PAPERS (WITH DEADLINE EXTENSION)
9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
COPENHAGEN, 22-25 AUGUST, 2012
http://hylocore.ruc.dk/aiml2012.html
Advances in Modal Logic is an initiative aimed at presenting
the state of the art in modal logic and its various applications. The
initiative consists of a conference series together with volumes based on
the conferences. Information about the AiML series can be obtained at
http://www.aiml.net. AiML-…
[View More]2012 is the ninth conference in the series.
TOPICS
We invite submission on all aspects of modal logic, including:
- history of modal logic
- philosophy of modal logic
- applications of modal logic
- computational aspects of modal logic (complexity and decidability of
modal and temporal logics, modal and temporal logic programming,
model checking, model generation, theorem proving for modal logics)
- theoretical aspects of modal logic (algebraic/categorical perspectives
on modal logic, coalgebraic modal logic, completeness and canonicity,
correspondence and duality theory, many-dimensional modal logics,
modal fixed point logics, model theory of modal logic, proof theory
of modal logic)
- specific instances and variations of modal logic (description logics,
modal logics over non-boolean bases, dynamic logics and other process
logics, epistemic and deontic logics, modal logics for agent-based
systems, modal logic and game theory, modal logic and grammar
formalisms, provability and interpretability logics, spatial and
temporal logics, hybrid logic, intuitionistic logic, substructural
logics, computationally light fragments of all such logics)
Papers on related subjects will also be considered.
CONFERENCE LOCATION
Advances in Modal Logic 2012 will be held at
the IDA conference center in downtown Copenhagen:
http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx
This is in easy walking distance from Copenhagen Central Station and a number of
reasonably priced hotels.
PAPER SUBMISSIONS
There will be two types of submissions to AiML-2012: (1) Full papers
for publication in the proceedings and presentation at the
conference. (2) Short presentations intended for presentation at AiML
but not for the published proceedings. All submissions should be submitted
electronically using our EasyChair page
http://www.easychair.org/conferences/?conf=aiml2012
At least one author of each accepted paper or short presentation must register for,
and attend, the conference.
(1) FULL PAPERS. Authors are invited to submit, for presentation at the conference
and publication in the proceedings, full papers reporting on original research
and not submitted elsewhere. The proceedings of AiML'2012 will be published
by College Publications (http://www.collegepublications.co.uk) in a volume
to be made available at the conference. The submissions should be at
most 15 pages, with an optional technical appendix of up to 5 pages, together
with a plain-text abstract of 100-200 words. The submissions must be typeset in
LaTeX, using the style files and template provided on the AiML'2012
website (click "Paper Submissions").
We also ask authors of full papers to submit the abstract in plain text to the
EasyChair page by 30 March.
(2) SHORT PRESENTATIONS. These should be at most 5 pages. They may describe preliminary
results, work in progress etc., and will be subject to light reviewing. The
accepted submissions will be made available at the conference, and the authors will
have the opportunity to make short presentations (of up to 15 minutes) on
them.
SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic
allowing to refer explicitly to states of the model in the syntax of formulas.
There will be a special session of AiML devoted to papers on hybrid logic.
The scope of the special session is standard hybrid-logical machinery like
nominals, satisfaction operators, and the downarrow binder, but also other
extensions of modal logic can be considered.
SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a
special session of AiML devoted to papers and talks in honour of Larisa
Maksimova, in recognition of her many outstanding contributions to modal
logic.
SPECIAL SESSION ON MODALITES FOR TYPES. Recent years have witnessed significant
growth of interest in constructive type-theoretical modalities, in particular
modalities ensuring productivity and type safety of (co-)recursive definitions in
reactive programming. Some earlier examples include the use of modalities for staged
computation, metaprogramming or in computational lambda-calculus. In order to boost
interaction between programming, type-theoretical and modal communities, AiML 2012
will host a special session on these topics.
Papers for the special sessions should be submitted to the EasyChair site along with
others.
INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Lars Birkedal (IT University of Copenhagen, Denmark)
Patrick Blackburn (Roskilde University)
Balder ten Cate, (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Università di Bologna, Italy)
Giovanna D'Agostino (Università di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Robert Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Rosalie Iemhoff (University of Utrecht, The Netherlands)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schröder (Friedrich-Alexander-Universität Erlangen-Nürnberg)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (Sofia University, Bulgaria)
Yde Venema (ILLC, University of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)
ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
IMPORTANT DATES
[Please notice that the deadline for full papers submission has moved to April 7, 2012;
authors should however submit an abstract by the old deadline of March 30, 2012 to
speed up PC paper selection.]
Abstract of Full papers submission deadline: 30 March 2012
Full papers submission deadline: 7 April 2012
Full papers acceptance notification: 18 May 2012
Short presentations submission deadline: 1 June, 2012
Short presentations acceptance notification: 7 June, 2012
Final version of full papers and short presentations due: 15 June 2012
Conference: 22-25 August, 2012.
FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/
ENQUIRIES. E-mail enquiries should be directed respectively to
the PC co-chairs, sent to aiml2012(a)easychair.org
[View Less]
(重複の場合はご容赦ください.)
皆様,
北陸先端科学技術大学院大学の千葉です.
11月に京都で開催されるICFEM 2012の案内を再度送らせて頂きます.
http://www.jaist.ac.jp/icfem2012
ICFEMは形式手法とその実用的応用に関する国際会議です.
ぜひ投稿をご検討下さい.
アブストラクトの締め切りは4月9日です.
よろしくお願いします.
************************************************************
ICFEM 2012:
14th International Conference on Formal Engineering Methods
CALL FOR PAPERs
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
*******************************************************…
[View More]*****
ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has
been serving as an international forum for researchers and practitioners
who have been seriously applying formal methods to practical applications.
Researchers and practitioners, from industry, academia, and government,
are encouraged to attend, and to help advance the state of
the art. We are interested in work that has been incorporated into
real production systems, and in theoretical work that promises to
bring practical and tangible benefit.
ICFEM 2012 will be hosted by National Institute of Advanced
Industrial Science and Technology (AIST) and Japan Advanced Institute of
Science and Technology (JAIST), which will be held in
Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find
many historical sites which have been designated as World Heritage there.
We are looking forward to your submissions.
AREA AND TOPICS
Submissions related to the following principal themes are encouraged, but
any topics relevant to the field of formal methods and their practical
applications will also be considered:
* Abstraction and refinement
* Formal specification and modelling
* Software verification
* Program analysis
* Software model checking
* Formal approaches to software testing
* Formal methods for object and component systems
* Formal methods for cloud computing/robotics/cyber-physical systems/
medical devices/aeronautics/railway
* Formal methods for self-* systems
* Formal methods for software safety, security, reliability and dependability
* Experiments involving verified systems
* Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc)
* Formal model-based development and code generation
SUBMISSION AND PUBLICATION
Submissions to the conference must not have been published or be concurrently
considered for publication elsewhere. All submissions will be judged on the
basis of originality, contribution to the field, technical and presentation
quality, and relevance to the conference. The proceedings will be published
in the Springer Lecture Notes in Computer Science series.
Papers should be written in English and not exceed 16 pages in LNCS
format (see http://www.springer.de/comp/lncs/authors.html for
details). Submission should be done through the ICFEM 2012 submission page
(https://www.easychair.org/conferences/?conf=icfem2012), handled by the
EasyChair conference system.
IMPORTANT DATES
Abstract Submission Deadline: 9th April, 2012
Full Paper Submission Deadline: 16th April, 2012
Acceptance/Rejection Notification: 18th June, 2012
Camera Ready Copy Due: 16th July, 2012
Conference: 12th-16th, November, 2012.
ORGANIZATION COMMITTEE
General Chairs:
Kokichi Futatsugi, JAIST, Japan
Shaoying Liu, Hosei Uni., Japan
Conference Chair:
Hitoshi Ohsaki, AIST, Japan
Program Chairs:
Kenji Taguchi, AIST, Japan
Toshiaki Aoki, JAIST, Japan
Steering Committee:
Keijiro Araki, Kyushu University, Japan
Michael Butler, University of Southampton, UK
Jin Song Dong, National University of Singapore, Singapore
He Jifeng, East China Normal University, China
Shaoying Liu (Chair), Hosei University, Japan
Jeff Offutt, George Mason University, USA
Shengchao Qin, University of Teesside, UK
Program Committee:
Bernhard K. Aichernig (Graz University of Technology, Austria)
Cyrille Artho (AIST, Japan)
Richard Banach (University of Manchester, UK)
Nikolaj Bjorner(Microsoft Research Redmond, USA)
Jonathan P. Bowen (University of Westminster, UK)
Michael Butler (University of Southampton, UK)
Sagar Chaki (CMU/SEI, USA)
Rance Cleaveland (University of Maryland/Reactive Systems, USA)
Jim Davies (Oxford University, UK)
Zhenhua Duan (Xidian University, China)
Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain)
Andy Galloway (University of York, UK)
Stefania Gnesi (ISTI-CNR, Italy)
Wolfgang Grieskamp (Google, USA)
Klaus Havelund (NASA JPL, USA)
Daniel Jackson (MIT, USA)
Thierry Jeron (INRIA, France)
Gerwin Klein (NICTA, Australia)
Weiqiang Kong (Kyushu University, Japan)
Kim G. Larsen (Aalborg University, Denmark)
Peter Gorm Larsen (Engineering College of Aarhus, Denmark)
Insup Lee (University of Pennsylvania, USA)
Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany)
Xuandong Li (Nanjing University, China)
Yuan-Fang Li (Monash University, Australia)
Zhiming Liu (UNU/IIST, Macau)
Dominique Mery (Nancy University and LORIA, France)
Stephan Merz (INRIA Nancy & LORIA, France)
Huaikou Miao (Shanghai University, China)
Alexandre Mota (CIn-UFPE, Brasil)
Shin Nakajima (NII, Japan)
Kazuhiro Ogata (JAIST, Japan)
Jose Nuno Oliveira (Universidade do Minho, Portugal)
Jun Pang (University of Luxembourg, Luxembourg)
Shengchao Qin (Teesside University, UK)
Zongyan Qiu (Peking University, China)
S. Ramesh (General Motors India, India)
Alexander Romanovsky (Newcastle University, UK)
Wuwei Shen (Western Michigan University, USA)
Marjan Sirjani (Reykjavik University, Iceland)
Greame Smith (The University of Queensland, Australia)
Jing Sun (University of Auckland, New Zealand)
Jun Sun (Singapore University of Technology and Design, Singapore)
Yih-Kuen Tsay (National Taiwan University, Taiwan)
Viktor Vafeiadis (MPI-SWS, Germany)
Hai H. Wang (Aston University, UK)
Ji Wang (National University of Defense Technology, China)
Wang Yi (Uppsala University, Sweden)
Jian Zhang (Chinese Academy of Sciences, China)
Huibiao Zhu (East China Normal University, China)
[View Less]
皆様、
高階書換え系ワークショップ HOR'12 の投稿〆切延長のご案内です。
新〆切は来週 3月26日 です。
トピックスは、書換え研究はもちろんのこと、
λ計算、関数型言語、プログラム変換、証明変換、自動証明技術などの
広い意味での高階書換えもカバーしますので、
ぜひ日本の関連研究者の投稿をお待ちしています。
すでに発表済み論文の紹介発表もOKとなっていますので、名古屋の
RTA'12に参加予定の方は、ぜひHORへの投稿もご検討ください。
--
浜名 誠/群馬大学
=====================================================================
Call for papers
6th International Workshop on Higher-Order Rewriting
HOR 2012
June 2, 2012,…
[View More] Nagoya, Japan
Colocated with RTA'12
http://www.cs.gunma-u.ac.jp/events/hor/
======================================================================
HOR is a forum to present work concerning all aspects of
higher-order rewriting. The aim is to provide an informal and friendly
setting to discuss recent work and work in progress concerning higher-order
rewriting. The following is a non-exhaustive list of topics for the workshop:
* Applications:
proof checking, type checking, theorem proving, functional programming,
declarative programming, program transformation, using some notions of
higher-order rewriting.
* Foundations:
pattern matching, unification, strategies, termination, syntactic properties,
type theory, for higher-order rewriting.
* Frameworks:
graph rewriting, net rewriting, comparisons of different formats.
* Implementation:
explicit substitution, rewriting tools, compilation techniques.
* Semantics:
semantics of higher-order rewriting, higher-order abstract syntax,
categorical rewriting.
Important dates
---------------
Paper submission: ** EXTENDED: March 26, 2012 **
Notification: April 20, 2012
Final version: May 10, 2012
Workshop: June 2, 2012
Invited speakers
----------------
* Zhenjiang Hu (National Institute of Informatics, Japan)
Can Graph Transformation be Bidirectionalized?
-- Bidirectional Semantics of Structural Recursion on Graphs --
* Another speaker to be annouced
Submissions
-----------
Two categories of papers are solicited:
- Category A: Extended abstracts of new results, describing work in
progress, or problems in higher-order rewriting.
- Category B: Short versions of recently published or submitted
elsewhere articles on higher-order rewriting. Papers in this category
are for presentation only, and not considered as candidates for the
post-workshop proceedings.
Papers in both categories should be between 2 and 5 pages, and should note
the category (either A or B). Papers are formatted according to EPTCS style,
and submitted electronically via the EasyChair submission website. Papers
will be judged on relevance, originality, correctness and usefulness.
Please address your questions to the PC chair: hamana at cs.gunma-u.ac.jp.
Proceedings
-----------
The proceedings of HOR 2012 will be made available on the HOR 2012 web page,
and a printed version will be distributed at the workshop. Post-workshop
proceedings of extended abstracts of selected contributions is planned to be
published as a volume of EPTCS.
Program Committee
-------------------
Andreas Abel (Ludwig-Maximilians-University Munich, Germany)
Frederic Blanqui (INRIA, France)
Makoto Hamana (Gunma University, Japan) (chair)
Stefan Kahrs (University of Kent, UK)
Fer-Jan de Vries (University of Leicester, UK)
Program and Organizing Chair
----------------------------
Makoto Hamana (Gunma University, Japan)
[View Less]
みなさま,
こんにちは! 東京大学の蓮尾です.
7月のバークレー,CAV 併設ワークショップ LfSA のご案内です.
- トピックは(広い意味での)論理を用いたシステム検証で,
- まだ新しいワークショップ(2回目)で正式なプロシーディングス
もありませんが,専門家が集うので「出席して役に立つ」会合である
と考えます.ぜひ投稿をご検討ください.(3カテゴリあります)
それでは!
蓮尾 一郎
東京大学 大学院情報理工学系研究科 コンピュータ科学専攻
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
================================================
Call for Papers
--------------------------------------------------
LfSA'12 -- Logics for System Analysis
http://www.ls.cs.cmu.edu/LfSA12
---------------…
[View More]-----------------------------------
Workshop Affiliated with CAV 2012
July 7th, 2012, Berkeley, USA
Safety-critical systems frequently occur as real-time systems,
embedded systems, hybrid systems, distributed systems, and
cyber-physical systems. They are also becoming more and more important
in many application domains, including aviation, automotive, railway,
robotic, or medical applications, where both safety and security are
relevant aspects. To ensure the correct functioning of safety-critical
systems it is necessary to model and reason about hardware, software,
communication aspects, physical properties, and the system
environment.
LfSA’12 is the second workshop on Logics for System Analysis, devoted
to the systematic theoretical study, practical development, and
applied use of logics for system analysis. The purpose of the LfSA
workshop is to bring together researchers and practitioners interested
in studying practically relevant systems or in developing the logical
foundations and analysis tools for their study.
Topics include
* Logics for safety-critical systems (real-time, embedded, hybrid,
distributed, stochastic, cyber-physical)
* Logic-based methods for development of safety-critical systems
* Logics to study security aspects of systems or protocols
* System representations using logics, automata, modeling languages,
state charts, Petri nets, dataflow models
* Theories, decision procedures, and calculi for system analysis
* Model checking, theorem proving, and systematic testing
* Case studies for logical system analysis
* Applications of system analysis to industrial problems
In particular, we invite contributions that bridge the gap between
theory and practice or that combine different application domains.
Submission Categories
---------------------
* Regular papers (up to 15 pages), which should present previously
unpublished work (completed or in progress), including descriptions
of research, tools, and applications.
* Short papers (up to 5 pages), which describe work in progress or aim
at initiating discussions.
* Presentation-only papers, i.e., papers already submitted or
presented at a conference or another workshop; such papers will not
be included in the LfSA proceedings but will be presented during the
workshop.
In addition to informal and electronic workshop proceedings, we
consider the option of a special issue in a journal after the workshop
Workshop/Programme Chairs
-------------------------
Andre Platzer
Carnegie Mellon University
Philipp Ruemmer
Uppsala University
Programme Committee
-------------------
A. Banerjee (IMDEA Madrid)
R. Barbosa (U. Coimbra)
F. S. de Boer (CWI Amsterdam)
A. Cimatti (IRST Trento)
M. Dam (KTH Stockholm)
S. Demri (CNRS Cachan)
M. Giese (U. of Oslo)
I. Hasuo (U. Tokyo)
F. Ivancic (NEC Lab. Princeton)
E. B. Johnsen (U. of Oslo)
V. Sofronie-Stokkermans (U. Koblenz)
U. Waldmann (MPI Saarbrücken)
Important Dates/Deadlines
-------------------------
Abstract submission: April 13, 2012
Paper submission: April 20, 2012
Notification: June 8, 2012
Final version: June 29, 2012
Workshop: July 7, 2012
Workshop Webpage
----------------
http://www.ls.cs.cmu.edu/LfSA12
Submission via Easychair
------------------------
https://www.easychair.org/conferences/?conf=lfsa12
[View Less]
Dear Sir/Madam,
May I introduce myself, I am Dr Richard Dietz. I was recently appointed
as a Lecturer the Department of Philosophy at the University of Tokyo (
Hongo Campus). I just founded a new discussion for analytic
philosophy, which is going to be launched in April. It is called the
Tokyo Forum for Analytic Philosophy (TFAP). For further information,
please see: http://tf-ap.com
On this note, I wanted to ask you whether you circulate the news of the
upcoming launching of TFAP in …
[View More]your logic mailing list. This would be
very helpful.
Also, if this is possible, I would be grateful if I could join your
mailing list.
Thank you very much.
I look forward to hearing from you.
With best regards,
Richard Dietz
[View Less]
合流性 (チャーチ・ロッサ性) に関するワークショップ IWC 2012 の投稿期限延長を
お知らせ致します。IWC 2012 は名古屋で行われます RTA 2012 に併設される
ワークショップです。ご投稿・ご参加を検討して頂ければ幸いです。
廣川 直(北陸先端科学技術大学院大学)
======================================================================
Second Call for Papers
(* extended deadline *)
IWC 2012
1st International Workshop on Confluence
29 May 2012, …
[View More]Nagoya, Japan, collocated with RTA 2012
http://cl-informatik.uibk.ac.at/events/iwc-2012/
======================================================================
Recently there is a renewed interest in confluence research, resulting
in new techniques, tool support as well as new applications. The
workshop aims at promoting further research in confluence and related
properties. The workshop is collocated with the 23rd International
Conference on Rewriting Techniques and Applications (RTA 2012). During
the workshop the 1st Confluence Competition (CoCo 2012)
http://coco.nue.riec.tohoku.ac.jp/2012/
takes place.
IMPORTANT DATES:
* submission March 26, 2012 (extended)
* notification April 9, 2012
* final version April 30, 2012
* workshop May 29, 2012
TOPICS:
The workshop solicits short papers/extended abstracts on the following
topics:
* confluence and related properties (unique normal forms, commutation,
ground confluence)
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence
ORGANISING COMMITTEE:
* Nao Hirokawa JAIST
* Aart Middeldorp University of Innsbruck
* Naoki Nishida Nagoya University
PROGRAM COMMITTEE:
* Takahito Aoto Tohoku University
* Nao Hirokawa JAIST (co-chair)
* Aart Middeldorp University of Innsbruck (co-chair)
* Femke van Raamsdonk VU University Amsterdam
* Aaron Stump The University of Iowa
* Rakesh M. Verma University of Houston
SUBMISSION:
We solicit short papers or extended abstracts of at most five pages.
There will be no formal reviewing. In particular, we welcome short
versions of recently published articles and papers submitted elsewhere.
The program committee checks relevance and may provide additional
feedback. The accepted papers will be made available electronically
before the workshop. In addition, we plan to distribute a printed
version of the proceedings at the workshop.
The page limit for papers is 5 pages in EasyChair style. Submission
will be via EasyChair at
https://www.easychair.org/account/signin.cgi?conf=iwc2012
[View Less]
皆様、
高階書換え系のワークショップ HOR'12 のご案内です。
6月のRTA'12に併設開催予定で、今年で6回目となります。
バリバリの書換え研究から、証明支援系やプログラミング言語への
応用まで、高階書換えに関係する論文を広く募集いたします。
今年はさらにすでに発表された論文の発表枠も設け、盛上げたく思っ
ておりますので、ぜひ投稿をご検討ください。
なおポストプロシーディングスは、EPTCSから出版予定です。
--
浜名 誠/群馬大学
=====================================================================
Call for papers
6th International Workshop on Higher-Order Rewriting
HOR 2012
June 2, 2012, Nagoya, Japan
…
[View More] Colocated with RTA'12
http://www.cs.gunma-u.ac.jp/events/hor/
======================================================================
HOR is a forum to present work concerning all aspects of
higher-order rewriting. The aim is to provide an informal and friendly
setting to discuss recent work and work in progress concerning higher-order
rewriting. The following is a non-exhaustive list of topics for the workshop:
* Applications:
proof checking, type checking, theorem proving, functional programming,
declarative programming, program transformation, using some notions of
higher-order rewriting.
* Foundations:
pattern matching, unification, strategies, termination, syntactic properties,
type theory, for higher-order rewriting.
* Frameworks:
graph rewriting, net rewriting, comparisons of different formats.
* Implementation:
explicit substitution, rewriting tools, compilation techniques.
* Semantics:
semantics of higher-order rewriting, higher-order abstract syntax,
categorical rewriting.
Important dates
---------------
Paper submission: March 19, 2012
Notification: April 20, 2012
Final version: May 10, 2012
Workshop: June 2, 2012
Submissions
-----------
Two categories of papers are solicited:
- Category A: Extended abstracts of new results, describing work in
progress, or problems in higher-order rewriting.
- Category B: Short versions of recently published or submitted
elsewhere articles on higher-order rewriting. Papers in this category
are for presentation only, and not considered as candidates for the
post-workshop proceedings.
Papers in both categories should be between 2 and 5 pages, and should note
the category (either A or B). Papers are formatted according to EPTCS style,
and submitted electronically via the EasyChair submission website. Papers
will be judged on relevance, originality, correctness and usefulness.
Please address your questions to the PC chair: hamana at cs.gunma-u.ac.jp.
Proceedings
-----------
The proceedings of HOR 2012 will be made available on the HOR 2012 web page,
and a printed version will be distributed at the workshop. Post-workshop
proceedings of extended abstracts of selected contributions is planned to be
published as a volume of EPTCS.
Program Committee
-------------------
Andreas Abel (Ludwig-Maximilians-University Munich, Germany)
Frederic Blanqui (INRIA, France)
Makoto Hamana (Gunma University, Japan) (chair)
Stefan Kahrs (University of Kent, UK)
Fer-Jan de Vries (University of Leicester, UK)
Program and Organizing Chair
----------------------------
Makoto Hamana (Gunma University, Japan)
[View Less]
JAIST先端レクチャー・シリーズ(第6回)の開
催について
来る3月13日(火)に,下記の講演会を開催します。
ホットなトピックスに
ついての分かりやすい講演ですので,多数の皆様(特に学生の方)に参加
いただきたく,ご案内申し上げます。
記
1.日 時 平成24年3月13日
(火)15:00〜17:00
2.場 所 JAIST 知識科学研究科 中講義室
3.講演題目 “Ontology-Based Data Access and Constraint
Satisfaction”
http://www.jaist.ac.jp/rcis/seminar/advanced/6
4.講 演 者 Frank Wolter 客員教授
(リヴァプール大学 教授)
5.担当教員 小野寛晰
JAIST 先端融合領域研究院: http://www.jaist.ac.jp/rcis/l
ogic-activities
-------…
[View More]------------------------------------------------------------------
We would like to inform you of the JAIST Advanced Lecture Series 6 by
a guest professor of JAIST as follows.
DATE:March 13, 2012 15:00-17:00
PLACE:JAIST KS Lecture Hall
TITLE:“Ontology-Based Data Access and Constraint
Satisfaction”
SPEAKER:Prof. Frank Wolter
(Univ. of Liverpool, Guest Professor of JAIST)
ABSTRACT:
In recent years, the use of ontologies to access instance data has
become increasingly popular. The general idea is that an ontology
provides a vocabulary or conceptual model for the application domain,
which can then be used as an interface for querying instance data and
to derive additional facts.
In this presentation, I will first introduce ontology-based data
access (OBDA). I will focus on ontologies given in description logics
or, equivalently, the web ontology language OWL. I will then establish
a very close link between OBDA and constraint satisfaction problems
with finite templates (CSP). Rather surprisingly, for the basic
description logic ALC (=modal logic) OBDA and CSP turn out to be
essentially equivalent. This result has a large number of consequences
for ALC and OBDA in general.
I will focus on the following non-uniform complexity problem: what is
the complexity of query answering for a fixed ontology? I will present
general conditions under which this problem is in PTime and,
respectively, coNP-hard. Using the CSP connection is shown that for
ALC there is a P/coNP dichotomy for conjunctive query answering if, and
only if, the famous, and still open, Feder/Vardi dichotomy conjecture
for CSP holds.
The talk is based on joint work with Carsten Lutz.
[View Less]
The second「論数哲」"Ron-Suu-Tetsu" (PhilLogMath) workshop
We will hold the 2nd 「論数哲」(PhilLogMath) workshop. Our aim is to provide
opportunities of detailed discussions among philosophers, logicians and
mathematicians. Everyone is welcome.
website url: http://researchmap.jp/jovzjd6b4-21098/#_21098
Date : March 14 (Wed)
Place: Seiryo Kaikan (Nagata-cho, Tokyo) Room 4A and 4B (floor 4)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Time table
…
[View More] 9:00-10:30 Takuro Onishi (Kyoto University) "BHK-interpretation
and Bilateralism"
10:30-12:00 Katsuhiko Sano (JAIST)
"An `Impossibility' Theorem in Radical Inquisitive Semantics"
13:30-15:00 Masahiko Sato (Kyoto University) "Bootstrapping
Mathematics"
15:15-16:45 Richard Dietz (The University of Tokyo) "Comparative
Concepts"
17:00-18:30 Conrad Asmus (JAIST) " Vagueness and Revision Sequences"
Any slot consists of 60 minutes talk and 30 minutes discussion basically.
All talks are in English.
Abstracts:
* Takuro Onishi "BHK-interpretation and Bilateralism"
In this talk, H.Wansing's inferentialist semantics for Bi-intuitionist logic
is examined.Bi-intuitionist Logic (a.k.a. Heyting-Brouwer logic) is an
extension of Intuitionist Logic with a connective dual to implication. It is
sort of an amalgamation of intuitionist and dual-intuitionist logic.
Accordingly, BHK-like, inferentialist, or proof-theoretic semantics for the
logic would be a bilateralist one appealing to not only "proof" but
also"dual proof (disproof)" as primitive notions. In his "Proofs,disproofs
and their duals" (2010),Wansing gives a correctness (soundness) proof of a
display system for bi-intuitionist logic in terms of the bilateralist
semantics. I point out that his proof involves controversial assumptions
concerning the relation between proofs and dual proofs and present an
alternative view on how they get together. (Although Wansing discuss a
BHK-like interpretation for strong negation and its dual as well, I will
concentrate on logics without them in this talk.)
*Katsuhiko Sano "An `Impossibility' Theorem in Radical Inquisitive Semantics"
An aim of this talk is to show that it is impossible to provide a `natural'
Kripke semantics with radical inquisitive semantics, recently proposed by
Jeroen Groenendijk and Floris Roelofsen. Inquisitive semantics is a new
formal framework for the semantics of both declarative and interrogative
sentences. One of the main features of this semantics is that we assume
there is no type distinction between the declarative and the interrogative,
but we provide both classical and inquisitive meanings with each sentence.
For example, the declarative sentence `Taro will drink tea or coffee.'
proposes two alternatives `Taro will drink tea' and `Taro will drink
coffee'. Inquisitive meaning captures such information of the alternatives.
In conservative (non-radical) inquisitive semantics (Groenendijk and
Roelofsen 2009), intuitionistic Kripke semantics captures how our group
knowledge increases though a conversation, and also allows us to derive the
inquisitive meaning of a sentence from the classical meaning. In the example
above, we could give a reply `Taro won't drink tea or coffee' to the
speaker. In conservative inquisitive semantics, however, we cannot cover
such a negative reaction. Radical inquisitive semantics is an extension of
conservative one such that we can provide with each sentence the positive
and negative inquisitive meanings as well as the classical meaning. My
contribution of this talk is to establish that *any* `natural' Kripke
semantics fails to capture a link between the classical meaning and the
negative inquisitive meaning.
*Masahiko Sato "Bootstrapping Mathematics"
It is well-known that any formal mathematical system can be faithfully
encoded within PRA (Primitive Recursive Arithmetic). It is also commonly
accepted that any well-established part of mathematics can be presented as a
formal system. Thus, it seems that we can bootstrap mathematics, within a
computer, simply by implementing PRA in it. However, we will show that this
view is too naiive both from computer science point of view and from
foundational point of view. We also discuss an alternative approach to this
problem by giving an overview of a proof assistant system we are developing.
*Richard Dietz "Comparative Concepts"
Comparative concepts (such as ‘greener than’ or ‘higher than’)are
fundamental to our grasp of associated categorical concepts (‘green’,
‘high’, respectively). Some comparative concepts seem natural, whereas other
ones seem rather gerrymandered---e.g., compare ‘x is greener than y’ and ‘x
and y are such that either (i) x and y are inspected before midday and x is
greener than y, or (ii) x and y are inspected after midday and x is bluer
than y’. What kind of cognitive structures under your ability to order
objects? And why do we order objects the way we do,and not in other ways?
The aim of this talk is to outline an account of comparative concepts within
a conceptual spaces framework. The account bears for one on the account of
naturalness for comparative concepts.For another, it bears on the theory of
gradable concepts, i.e., the type of categorical concepts expressed by
gradable terms in natural language.The approach is novel in that it carries
some basic assumptions from Peter Gärdenfors' conceptual spaces account of
categorical concepts over to comparative concepts (in his monograph
‘Conceptual Spaces’ [2000]).The offered approach is more general both (i) in
that it supplies a framework for motivating various types of categorisation
rules for gradable concepts, and (ii) in that it gives a model that subsumes
ungraded categorisation as a limiting case.
*Conrad Asmus "Vagueness and Revision Sequences"
Theories of truth and vagueness are closely connected; in this article, I
draw another connection between these areas of research. Gupta and Belnap’s
Revision Theory of Truth is converted into an approach to vagueness. I show
how revision sequences from a general theory of definitions can be used to
understand the nature of vague predicates. The revision sequences show how
the meaning of vague predicates are interconnected with each other. The
approach is contrasted with the similar supervaluationist approach.
*Workshop organizer (please replace [at] to @):
Yuko Murakami
Shunsuke Yatabe ( shunsuke.yatabe[at]aist.go.jp )
Takuro Onishi ( takuro.onishi[at]gmail.com )
--
Shunsuke Yatabe <shunsuke.yatabe(a)aist.go.jp>
AIST/CVS (National Institute of Advanced Industrial Science and Technology /
Research Center for Verification and Semantics)
tel: +81-6-4863-5031 fax: +81-6-4863-5052
[View Less]
-------------------------------------------------------------------------
「論理・数学的論証と認知のダイナミクス」研究集会のご案内(2月25日土曜日)
("Logical-Mathematical Proofs and Cognition" Meeting, 25th feb 2012)
慶應義塾大学三田キャンパス Mita Campus, Keio University
**************************************************************************
2月23日24日の学際オントロジー国際集会の後の2月25日に次のような会合を予定しています。参加自由です.
(topics: 論証のSurveyability, 幾何学的認知プロセスのfMRI脳研究、図形推論の証明論、プラトン・テアイテトスとlogic of relativism)
Up-dated information は次のURLに掲示いたします。
http://abelard.…
[View More]flet.keio.ac.jp/dolc12/
(重複して受け取られた方にお詫び申し上げます。慶応大哲学岡田光弘)
PLACE ROOM 323 (2nd Floor) of the Graduate School Building, Mita Campus of Keio University (5 minutes walk from JR-Tamachi Station or Subway-Mita Station or Subway-Akabanebashi Station)
場所 慶應義塾大学 三田キャンパス 「大学院棟」2階323番教室
JR田町駅、地下鉄三田駅、地下鉄赤羽橋駅から徒歩約5分
キャンパスマップ(Campus Map)
http://www.keio.ac.jp/en/maps/mita.html
23−24日オントロジー会議と25日論理学研究会の会場建物が異なりますのでご注意ください。
(Associated to the Interdisciplinary Ontology Meeting (23rd-34th Feb), an international Logic Meeting on demontrations/proofs (logical and mathematical) and cognition
is scheduled, including the topics of surveyability of proofs, fMRI-brain study on geometrical processing、the logic of relativism and Theaetetus,
diagrammatic proofs).
また、2月23日24日に(分析形而上学、医学生命情報学、AI, 情報科学を含む)学際オントロジー会議を予定しています。
(学際オントロジー会議のURL:、For the 23rd-24th Interdisciplinary Ontology,
see
http://abelard.flet.keio.ac.jp/ontology/index.php?InterOntology12)
2012年2月25日土曜日午前10時から午後5時まで
慶應義塾大学第3校舎(大学院棟)3階323番教室
慶應義塾大学論理学とフォーマルオントロジーオープンリサーチセンター論理学部門主催
*****論理:数学的論証と認知のダイナミズム*******
数学の哲学、分析哲学、実験哲学、現象学、認知心理学、分析形而上学系、数学基礎論系を含むDiscussants,Main participantsをゲストにお招きして
インフォーマルな形で提題講演及びディスカッションを行います。
提題者、参加者は次の方たちを含みます。
Berit Brogaard (Departments of Philosophy and Psychology, Center for Neurodynamics, University of Missouri, USA, Phenomenplogy, Cogmitive Science,)
Mathieu Marion (Department of Philosophy, Universite de Quebec a Montreal, Logical Philosophy)
Maureen Donnelly (Department of Philosophy, The University at Buffalo, Analytic metaphysics, Logic)
Mark Ressler (Department of Philosophy, The University at Buffalo, Analytic metaphysics, Logic, others)
Sam Sanders (currently visiting Department of Mathematics, Tohoku university, Foundations of mathematics, Non-standard analysis, etc)
Hiroyuki Miyoshi (Department of Computer science, Kyoto Sangyo University, Informatics, Logic)
and others
Discussion-Coordinator 岡田光弘 (Mitsu Okada)
10:00AM
Mathieu Marion (department of Philosophy, Universite de Quebec a Montreal, Canada)
による提題、Surverability of mathematical proofs in Wittgenstein,)
12;30 PM-14:00PM Meeting Lunch
14:00PM
Mark Ressler (Department of Philosophy, University of buffalo, USA)
Logic of relativism
15:30PM
Berit Brogaard (Berit Brogaard (Departments of Philosophy and Psychology, Center for Neurodynamics, University of Missouri, USA)
Seeing mathematics: perceptual experience and brain activity in
acquired synesthesia
---------------------------------------------------------------------
2月25日のこの研究会の
Up-dated information は次のURLに掲示しています。
http://abelard.flet.keio.ac.jp/dolc12/
主催: Open Research Centre for Logic and Formal Ontology, Keio University
責任者 岡田光弘
-------------------------------------------------------------------------
また23日24日のオントロジー学際会議のupdated情報はhttp://abelard.flet.keio.ac.jp/ontology/index.php?InterOntology12にあります。
---------------------------------------------------------------------
[View Less]
みなさま,
東京大学の蓮尾です.ワークショップ ICE 2012 のご案内です.
若手が集まってやっている印象です.また,査読の過程で
「Wiki による,PC,査読者,筆者による議論」があります.
どうか投稿・参加をご検討ください.それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
-------------------------------------------------------------------------------------
[- Apologies for multiple copies -]
ICE 2012
5th Interaction and Concurrency Experience
June 16, 2012, Stockholm, Sweden
http://www.artist-embedded.org/artist/-ICE-…
[View More]2012-.html
Satellite workshop of DisCoTec 2012
http://discotec.ict.kth.se/
=== Highlights ===
- Invited talks: Marcello Bonsangue
Ichiro Hasuo
- Innovative selection procedure
- Special issue of Scientific Annals of Computer Science
(http://www.info.uaic.ro/bin/Annals/)
=== Important Dates ===
30 March 2012................Abstract submission
04 April 2012................Full paper submission
18 April - 12 May 2012.......Reviews, rebuttal and PC discussion
16 May 2012..................Notification to authors
30 May 2012..................Camera-ready for pre-proceedings
16 June 2012.................ICE in Stockholm
15 Sept 2012.................Camera-ready for post-proceedings
=== Scope ===
Interaction and Concurrency Experiences (ICEs) is a series of
international scientific meetings oriented to theoretical computer
science researchers with special interest in models, verification,
tools and programming primitives for complex interactions.
The general scope of the venue includes theoretical and applied
aspects of interactions and the synchronization mechanisms used among
components of concurrent/distributed systems, but every experience focuses
on a different specific topic (see "Previous Editions" at the end of
this call) related to several areas of computer science in the broad
spectrum ranging from formal specification and analysis to studies
inspired by emerging computational models.
The theme of ICE 2012 is
***Distributed coordination, execution models, and resilient interaction***.
Topics of interest include, but are not limited to:
- Process algebra and coordination: transformation, analysis and implementation
- Models for distributed coordination and semantics
- Techniques and tools for specification, analysis, verification of
resilient interaction
- Languages, protocols and mechanisms for sound distributed coordination
- Logics and types for interactions
- Comparison among different coordination and/or execution models
- Expressive power of coordination languages and execution models
- Formal semantics of coordination languages
- Formal verification of distributed coordinated architectures
- Relating different semantic models for coordination languages
=== Selection Procedure ===
Since its 1st edition in 2008, the distinguishing feature of ICE has
been an innovative paper selection mechanism based
on an interactive discussion amongst authors and PC members.
During the review phase, each submitted paper is published on a Wiki
and associated with a discussion forum whose access will be restricted
to the authors and all the PC members who do not have a conflict of
interests with the paper.
The PC members post comments/questions that the authors shall reply
to.
As witnessed by the past four editions of ICE, this procedure considerably
improves the accuracy of the feedback from reviews, the fairness of
the selection, the quality of camera-ready papers, and the discussion
during the workshop.
=== The Public Wiki ===
After the notification, the accepted papers will be published on a public
forum, in order to initiate public discussions that will trigger and
stimulate the scientific debate at the workshop. We believe that this
will drive the workshop discussions and let prospective participants
interact with each other much earlier than in more traditional events.
=== Submission Guidelines ===
Papers must report previously unpublished work and not be
simultaneously submitted to other conferences/workshops with
refereed proceedings. The ICE 2012 post-proceedings will be
published in Electronic Proceedings in Theoretical Computer Science
(http://eptcs.org/).
Submissions must be made electronically in PDF format via EasyChair
(http://www.easychair.org/conferences/?conf=ice2012) and should not
exceed 15 pages with the EPTCS style (http://style.eptcs.org/).
Accepted papers must be presented at the workshop by one of the
authors.
=== Special Issue ===
Full versions of the best papers selected by the PC will be invited
to appear in a special issue of the journal of Scientific Annals of
Computer Science (http://www.info.uaic.ro/bin/Annals/).
Such contributions will be regularly peer-reviewed according to the
standard journal policy, but they will be handled in a shorter time
than regular submissions.
=== Program Committee ===
Lucia Acciai (University of Firenze, Italy)
Luca Aceto (Reykjavik University, Iceland)
Massimo Bartoletti (University of Cagliari, Italy)
Simon Bliudze (EPFL, Switzerland)
Laura Bocchi (University of Leicester, United Kingdom)
Filippo Bonchi (CNRS, France)
Roberto Bruni (University of Pisa, Italy)
Marco Carbone (co-chair)
Vincenzo Ciancia (University of Amsterdam, The Netherlands)
Pierre-Malo Denielou (Imperial College, United Kingdom)
Cinzia Di Giusto (CEA, France)
Tobias Heindel (CEA, France)
Tom Hirschowitz (CNRS, France)
Bartek Klin (Warsaw University, Poland)
Ivan Lanese (University of Bologna/INRIA, Italy)
Alberto Lluch Lafuente (IMT Lucca, Italy)
Bas Luttik (Technische Universiteit Eindhoven, The Netherlands)
Manuel Mazzara (Newcastle University, United Kingdom)
Mohammadreza Mousavi (Technische Universiteit Eindhoven, The Netherlands)
Damien Pous (CNRS, France)
Jens-Wolfhard Schicke-Uffmann (TU Braunschweig, Germany )
Alexandra Silva (co-chair)
Ana Sokolova (University of Salzburg, Austria)
Francesco Tiezzi (IMT Lucca, Italy)
Emilio Tuosto (University of Leicester, United Kingdom)
Erik de Vink (Technische Universiteit Eindhoven, The Netherlands)
=== ICEcreamers ===
- Marco Carbone (IT University of Copenhagen, Denmark; co-chair)
- Ivan Lanese (University of Bologna/INRIA, Italy)
- Alexandra Silva (Radboud University Nijmegen & CWI, The Netherlands;
HasLab / INESC TEC, Portugal; co-chair)
- Ana Sokolova (University of Salzburg, Austria)
=== Contact ===
ice2012(a)easychair.org
=== Previous editions ===
The previous four editions of ICE have been held on
* July 6th, 2008 in Reykjavik, Iceland with focus on
Synchronous and Asynchronous Interactions in Concurrent/
Distributed Systems, co-located with ICALP'08.
The post-proceedings were published in ENTCS (vol.229-3).
* August 31st, 2009 in Bologna, Italy with focus on
Structured Interactions, co-located with CONCUR'09.
The post-proceedings were published in EPTCS (vol.12)
and a special issue of MSCS is in preparation.
* June 10th, 2010 in Amsterdam, The Netherlands with focus
on Guaranteed Interactions, co-located with DisCoTec'10.
The post-proceedings were published in EPTCS (vol.38)
and selected papers appeared in a joint special issue of SACS (with
CAMPUS'10 and
CS2BIO'10, Vol. XXI).
* June 9th, 2011 in Reykjavik, Iceland with focus on Reliable and
Contract-based Interactions, co-located with DisCoTec'11.
The post-proceedings were published in EPTCS (vol.59)
and a special issue of SACS is now in preparation.
[View Less]
8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK
First Announcement and Call for Papers
The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner, Denmark, 20-21 August 2012.
After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.
As …
[View More]with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.
Related events:
A post-SLS tutorial day will be organized on August 22
Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL: http://hylocore.ruc.dk/aiml2012/ .
TOPICS
The scope of SLS 2012 is broad, ranging over the whole area of
mathematical and philosophical logic, and logical methods in computer science. Suitable topics
include (but are not limited to) Proof Theory and Constructivism, Model Theory (including Finite
Model Theory), Set Theory, Computability Theory, Categorical Logic, Logic and Provability,
Logic and Computer Science, Logic and Linguistics, Modal, Hybrid, Temporal and Description
Logic, Logics of Games, Dynamics and Interaction, and Philosophical Logic.
PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:
7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968
The proceedings of several of these meetings have been published in book form.
INVITED SPEAKERS
To be announced
PROGRAM COMMITTEE
Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)
Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist (Vienna)
Jouko Väänänen (Helsinki)
ORGANISING COMMITTEE
Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)
SUBMISSIONS
Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system
https://www.easychair.org/conferences/?conf=sls2012
The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.
LOCATION
Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.
ACCOMMODATION
Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.
REGISTRATION
The conference website will be found at:
http://scandinavianlogic.weebly.com/
Details concerning registration will be posted there in due course.
[View Less]
(重複の場合はご容赦ください.)
皆様,
北陸先端科学技術大学院大学の千葉です.
11月に京都で開催されるICFEM 2012の案内を送らせて頂きます.
http://www.jaist.ac.jp/icfem2012
ICFEMは形式手法とその実用的応用に関する国際会議です.
ぜひ投稿をご検討下さい.
よろしくお願いします.
************************************************************
ICFEM 2012:
14th International Conference on Formal Engineering Methods
CALL FOR PAPERs
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
************************************************************
ICFEM will …
[View More]come back to Japan in 2012 again! Since 1997, ICFEM has
been serving as an international forum for researchers and practitioners
who have been seriously applying formal methods to practical applications.
Researchers and practitioners, from industry, academia, and government,
are encouraged to attend, and to help advance the state of
the art. We are interested in work that has been incorporated into
real production systems, and in theoretical work that promises to
bring practical and tangible benefit.
ICFEM 2012 will be hosted by National Institute of Advanced
Industrial Science and Technology (AIST) and Japan Advanced Institute of
Science and Technology (JAIST), which will be held in
Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find
many historical sites which have been designated as World Heritage there.
We are looking forward to your submissions.
AREA AND TOPICS
Submissions related to the following principal themes are encouraged, but
any topics relevant to the field of formal methods and their practical
applications will also be considered:
* Abstraction and refinement
* Formal specification and modelling
* Software verification
* Program analysis
* Software model checking
* Formal approaches to software testing
* Formal methods for object and component systems
* Formal methods for cloud computing/robotics/cyber-physical systems/
medical devices/aeronautics/railway
* Formal methods for self-* systems
* Formal methods for software safety, security, reliability and dependability
* Experiments involving verified systems
* Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc)
* Formal model-based development and code generation
SUBMISSION AND PUBLICATION
Submissions to the conference must not have been published or be concurrently
considered for publication elsewhere. All submissions will be judged on the
basis of originality, contribution to the field, technical and presentation
quality, and relevance to the conference. The proceedings will be published
in the Springer Lecture Notes in Computer Science series.
Papers should be written in English and not exceed 16 pages in LNCS
format (see http://www.springer.de/comp/lncs/authors.html for
details). Submission should be done through the ICFEM 2012 submission page
(https://www.easychair.org/conferences/?conf=icfem2012), handled by the
EasyChair conference system.
IMPORTANT DATES
Abstract Submission Deadline: 9th April, 2012
Full Paper Submission Deadline: 16th April, 2012
Acceptance/Rejection Notification: 18th June, 2012
Camera Ready Copy Due: 16th July, 2012
Conference: 12th-16th, November, 2012.
ORGANIZATION COMMITTEE
Conference Chair:
Hitoshi Ohsaki (AIST, Japan)
Program Chairs:
Kenji Taguchi (AIST, Japan)
Toshiaki Aoki (JAIST, Japan)
General Chairs:
Kokichi Futatsugi (JAIST, Japan)
Shaoying Liu (Hosei Uni., Japan)
Steering Committee
Keijiro Araki, Japan
Jin Song Dong, Singapore
Jifeng He, China
Shaoying Liu (Chair), Japan
Program Committee
(TBD)
-----------------------------------
Yuki Chiba
Japan Advanced Institute of Science and Technology (JAIST)
http://www.jaist.ac.jp/~chiba/index.html
chiba(a)jaist.ac.jp
[View Less]
各位、
重複して受け取られた場合はどうぞご容赦ください。
現在、北陸先端科学技術大学院大学、情報科学研究科では、
JAIST Spring School 2012
- Formal Reasoning: Theory and Application -
http://www.jaist.ac.jp/~hirokawa/jss12.html
chair 東条 敏 (JAIST)
を
平成24年3月5日から3月9日まで
於、金沢県立美術館
の日程で開催する予定です。これにあたり、本スプリングスクールへの参加に関心のある、日本国内の大学院生・ポスドク(学部・研究科は問いません)を10名程度募集いたします(なお、参加費(一万円程度、昼食代と懇親会代を含みます)が必要です)。会場のキャパシティに限りがございますので、参加に興味がおありの方は、下記のApplication
Form に必要事項を記入の上(日本語可)、
jss2012-oc(a)jaist.ac.jp
まで件名 "…
[View More]JSS2012 Domestic Application" でご返信ください。締切は
平成24年2月17日(金)
と致します。
************************************************************
*** JAIST Spring School 2012 Application Form ***
*** Deadline: 17th February 2012 ***
*** Reply to "jss2012-oc(a)jaist.ac.jp" ***
*** with subject-line "JSS2012 Domestic Application" ***
************************************************************
1) Family (last) Name:
2) Middle Name (if any):
3) Given (first) Name:
4) Sexuality: (male/female)
5) Age:
6) Nationality:
7) Affiliation:
8) E-mail address:
9) Home page URL (if you have):
10) Status (choose one):
- graduate student (indicate grade)
- postdoc (indicate when you became postdoc)
- others (indicate your status)
11) Sketch your main motivation (in a few lines) to attend JAIST
Spring School 2012, research interests, and past research achievements.
If you have already published some research papers, indicate them.
12) If you are a student, indicate the following:
Supervisor's name:
Supervisor's title and affiliation:
Supervisor's e-mail address:
13) Any special dietary requirements or food allergies?:
************************************************************
********************** end end end *************************
************************************************************
[View Less]
AiML-2012: FINAL CALL FOR PAPERS
9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
COPENHAGEN, 22-25 AUGUST, 2012
http://hylocore.ruc.dk/aiml2012.html
Advances in Modal Logic is an initiative aimed at presenting
the state of the art in modal logic and its various applications. The
initiative consists of a conference series together with volumes based on
the conferences. Information about the AiML series can be obtained at
http://www.aiml.net. AiML-2012 is the ninth …
[View More]conference in the series.
TOPICS
We invite submission on all aspects of modal logic, including:
- history of modal logic
- philosophy of modal logic
- applications of modal logic
- computational aspects of modal logic (complexity and decidability of
modal and temporal logics, modal and temporal logic programming,
model checking, model generation, theorem proving for modal logics)
- theoretical aspects of modal logic (algebraic/categorical perspectives
on modal logic, coalgebraic modal logic, completeness and canonicity,
correspondence and duality theory, many-dimensional modal logics,
modal fixed point logics, model theory of modal logic, proof theory
of modal logic)
- specific instances and variations of modal logic (description logics,
modal logics over non-boolean bases, dynamic logics and other process
logics, epistemic and deontic logics, modal logics for agent-based
systems, modal logic and game theory, modal logic and grammar
formalisms, provability and interpretability logics, spatial and
temporal logics, hybrid logic, intuitionistic logic, substructural
logics, computationally light fragments of all such logics)
Papers on related subjects will also be considered.
CONFERENCE LOCATION
Advances in Modal Logic 2012 will be held at
the IDA conference centre in downtown Copenhagen:
http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx
This is in easy walking distance from Copenhagen Central Station and a
number of reasonably priced hotels.
PAPER SUBMISSIONS
There will be two types of submissions to AiML-2012: (1) Full papers
for publication in the proceedings and presentation at the
conference. (2) Abstracts for short presentation only. Both types of
papers should be submitted electronically using the EasyChair submission
page at
http://www.easychair.org/conferences/?conf=aiml2012
At least one author of each accepted paper of abstract must register for,
and attend, the conference to present his or her work.
(1) FULL PAPERS. Authors are invited to submit, for presentation at the conference
and publication in the proceedings, full papers reporting on original research
and not submitted elsewhere. The proceedings of AiML'2012 will be published
by College Publications (http://www.collegepublications.co.uk) in a volume
to be made available at the conference. The submissions should be at
most 15 pages, with an optional technical appendix of up to 5 pages, together
with a plain-text abstract of 100-200 words. The submissions must be typeset in
LaTeX, using a style file and template that will be provided on the AiML'2012
website.
(2) ABSTRACTS. These should be at most 5 pages. They may describe preliminary
results, work in progress etc., and will be subject to light reviewing. The
accepted abstracts will be made available at the conference, and the authors will
have the opportunity to make short presentations (of up to 15 minutes) on
them.
SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic
allowing to refer explicitly to states of the model in the syntax of formulas.
There will be a special session of AiML devoted to papers on hybrid logic.
The scope of the special session is standard hybrid-logical machinery like
nominals, satisfaction operators, and the downarrow binder, but also other
extensions of modal logic can be considered.
SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a
special session of AiML devoted to papers and talks in honour of Larisa
Maksimova, in recognition of her many outstanding contributions to modal
logic.
SPECIAL SESSION ON MODALITIES FOR TYPES. Recent years have witnessed
significant growth of interest in constructive type-theoretical modalities, in particular
modalities ensuring productivity and type safety of (co-)recursive definitions in
reactive programming. Some earlier examples include the use of modalities for staged
computation, metaprogramming or in computational lambda-calculus. In order to boost
interaction between programming, type-theoretical and modal communities, AiML 2012
will host a special session on these topics. Papers for this session should be
submitted to the EasyChair site along with others.
Papers for the special sessions should be submitted to the EasyChair site along with
others.
INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Lars Birkedal (IT University of Copenhagen, Denmark)
Patrick Blackburn (Roskilde University)
Balder ten Cate, (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Università di Bologna, Italy)
Giovanna D'Agostino (Università di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Robert Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Rosalie Iemhoff (University of Utrecht, The Netherlands)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schröder (DFKI GmbH and University of Bremen, Germany)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (Sofia University, Bulgaria)
Yde Venema (ILLC, University of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)
ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
IMPORTANT DATES
Full papers submission deadline: 30 March 2012
Full papers acceptance notification: 18 May 2012
Short presentations submission deadline: 1 June, 2012
Short presentations acceptance notification: 18 June, 2012
Final version of full papers and abstracts due: 15 June 2012
Conference: 22-25 August, 2012.
FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/
ENQUIRIES. E-mail enquiries should be directed respectively to
the PC co-chairs, sent to aiml2012(a)easychair.org
[View Less]
皆様
ETAPS 2012 で非明示計算量に関するワークショップ DICE 2012 が行われます。
その extended abstract 募集をご案内致します。このカテゴリは既発表の内容も
投稿可能です。ETAPS 参加の方はぜひ投稿をご検討下さい。
廣川
===============================================================
CALL FOR EXTENDED ABSTRACTS
DICE 2012
3rd Workshop on Developments in Implicit Complexity
Tallinn (Estonia), March 31st and April 1st, 2012
(Affiliated with ETAPS 2012)
http://dice2012.cs.unibo.it/
===============================================================
SCOPE
The area of Implicit …
[View More]Computational Complexity (ICC) has grown out
from several proposals to use logic and formal methods to provide
languages for complexity-bounded computation (e.g. polytime or
logspace computation). It aims at studying computational
complexity without referring to external measuring conditions or
a particular machine model, but only by considering language
restrictions or logical principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather
than descriptive methods). In this approach one relates complexity
classes to restrictions on programming paradigms (functional
programs, lambda calculi, rewriting systems), such as ramified
recurrence, weak polymorphic types, linear logic and linear types,
and interpretative measures. The two main objectives of this area
are:
* to find natural implicit characterizations of various complexity
classes of functions, thereby illuminating their nature and
importance;
* to design methods suitable for static verification of program
complexity.
Therefore ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis. The
workshop will be open to contributions on various aspects of ICC
including (but not exclusively):
* types for controlling complexity,
* logical systems for implicit computational complexity,
* linear logic,
* semantics of complexity-bounded computation,
* rewriting and termination orderings,
* interpretation-based methods for implicit complexity,
* programming languages for complexity-bounded computation,
* certification of complexity properties of programs,
* application of implicit complexity to other programming paradigms
(e.g. imperative or object-oriented languages).
The first two DICE workshops were held in 2010 in Cyprus and in 2011
in Germany, both as part of ETAPS conferences. Before that, several
meetings on this topic had already been held with success in Paris
(WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit
computational complexity).
_______________________________________________________________
INVITED TALKS
* Ulrich Schoepp (LMU Munich)
Computation by Interaction for Structuring Resource Bounded Computation
* Neelakantan R. Krishnaswami (MPI)
tba
_______________________________________________________________
SUBMISSION
* Submission (extended abstracts): February 18th, 2012
* Notification (extended abstracts): February 28th, 2012
Extended abstracts for short presentations (not included in the
proceedings) are of up to 3 pages and authors have to add
"(Extended Abstract)" to the title. Papers must be submitted
electronically, as pdf files, at the following page:
https://www.easychair.org/conferences/?conf=dice2012.
We welcome short versions of recently published articles and
papers submitted elsewhere.
_______________________________________________________________
PROGRAM COMMITTEE
* Guillaume Bonfante (Nancy)
* Ugo Dal Lago (Bologna, chair)
* Marco Gaboardi (Bologna and UPenn)
* Nao Hirokawa (JAIST)
* Martin Hofmann (Munchen)
* Olivier Laurent (ENS Lyon)
* Jean-Yves Moyen (Paris Nord)
* Isabel Oitavem (Lisboa)
* German Puebla (Madrid)
* Simona Ronchi Della Rocca (Torino)
_______________________________________________________________
[View Less]
皆様
明日2月9日(木)に JAIST で行われます Yijia Chen 教授の計算量理論に関する
講演をご案内致します。どうぞお気軽にお越しください。
http://www.ldl.jaist.ac.jp/svrcenter/event.html#20120209
廣川 直(北陸先端科学技術大学院大学)
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Seminars of Research Center for Software Verification, JAIST
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Date:
9th Feb (Thu) 13:00-15:00
Place:
JAIST IS school collaboration room 7 (5F)
Speaker:
Prof.Yijia Chen (…
[View More]Shanghai Jiao Tong University)
Title:
A Logic for PTIME and a Parameterized Halting Problem
Abstract:
Whether there is a logic for polynomial time (PTIME) is the central
problem in finite model theory. When formalizing this problem,
Gurevich (1988), together with Blass, actually proposed a logic
LFP_inv, which is a version of least fixed-point logic plus some
additional invariance condition. Although they don't believe that
LFP_inv captures PTIME, no proof was given. Later, in a work of
Nash, Remmel, and Vianu (2005), it was shown that whether LFP_inv
captures PTIME is equivalent to the parameterized complexity of a
halting problem:
input: A nondeterministic Turing machine M and a natural number n in unary.
parameter: |M|, i.e., the size of M
question: does M accept the empty input in at most n steps?
Our recent work (2010-11) reveals that it is even equivalent to an
open problem in proof complexity, i.e., whether there is a
polynomial optimal proof system for the set TAUT of tautologies of
propositional logic.
In this talk, I will discuss all these equivalences and their
extensions to some other complexity classes beside PTIME. It turns
out that Levin's optimal inverters (1973) play a central role in
the proofs.
This is joint work with Joerg Flum.
[View Less]
AiML-2012: FINAL CALL FOR PAPERS
ADVANCES IN MODAL LOGIC IX
COPENHAGEN, 22-25 AUGUST, 2012 http://hylocore.ruc.dk/aiml2012
Advances in Modal Logic is an initiative aimed at presenting the state
of the art in modal
logic and its various applications. The initiative consists of a
conference series together with
volumes based on the conferences. Information about the AiML series
can be obtained at http:
//www.aiml.net. AiML-2012 is the ninth …
[View More]conference in the series.
TOPICS. We invite submission on all aspects of modal logic, including:
- history and philosophy of modal logic;
- applications of modal logic;
- computational aspects of modal logic (complexity and decidability of
modal and temporal logics,
modal and temporal logic programming, model checking, model
generation, theorem proving
for modal logics);
- theoretical aspects of modal logic (algebraic/categorical
perspectives on modal logic, coalgebraic
modal logic, completeness and canonicity, correspondence and duality
theory, manydimensional
modal logics, modal xed point logics, model theory of modal logic,
proof theory
of modal logic);
- specific instances and variations of modal logic (description
logics, modal logics over non-boolean
bases, dynamic logics and other process logics, epistemic and deontic
logics, modal logics for
agent-based systems, modal logic and game theory, modal logic and
grammar formalisms,
provability and interpretability logics, spatial and temporal logics,
hybrid logic, intuitionistic
logic, substructural logics, computationally light fragments).
Papers on related subjects will also be considered.
CONFERENCE LOCATION. Advances in Modal Logic 2012 will be held at the
IDA conference
center in downtown Copenhagen: http://ida.dk/sites/moedecenter/english/Sider/
EnglishForside.aspx This is in walking distance from Copenhagen
Central Station and many
reasonably priced hotels.
PAPER SUBMISSIONS. There will be two types of submissions to
AiML-2012: (1) Full papers
for publication in the proceedings and presentation at the conference.
(2) Abstracts for short
presentation only. Both types of papers should be submitted
electronically using the EasyChair
submission page at http://www.easychair.org/conferences/?
conf=aiml2012. At least one author of
each accepted paper or abstract must register for, and attend, the
conference to present
his or her work.
(1) FULL PAPERS. Authors are invited to submit, for presentation at
the conference and publication
in the proceedings, full papers reporting on original research and not
submitted elsewhere.
The proceedings of AiML'2012 will be published (in a volume to be made
available at the conference)
by College Publications http://www.collegepublications.co.uk. The
submissions should be at most 15
pages, with an optional technical appendix of up to 5 pages, together
with a plain-text abstract of
100-200 words. The submissions must be typeset in LaTex, using a style
file and template that will
be provided on the AiML'2012 website.
(2) ABSTRACTS. These should be at most 5 pages. They may describe
preliminary results, work
in progress etc., and will be subject to light reviewing. The accepted
abstracts will be made
available at the conference, and the authors will make short (up to 15
min) presentations on them.
SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal
logic allowing to refer
explicitly to states of the model in the syntax of formulas. There
will be a special session of AiML
devoted to papers on hybrid logic. The scope of the special session is
standard hybrid-logical
machinery like nominals, satisfaction operators, and the downarrow
binder, but also other extensions
of modal logic can be considered. Papers for this session should be
submitted the same way as others.
SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will also be a
special session of AiML
devoted to papers and talks in honour of Larisa Maksimova, in
recognition of her many outstanding
contributions to modal logic.
SPECIAL SESSION ON MODALITES FOR TYPES. Recent years have witnessed
significant growth of interest
in constructive type-theoretical modalities, in particular modalities
ensuring productivity and type
safety of (co-)recursive definitions in reactive programming. Some
earlier examples include the use
of modalities for staged computation, metaprogramming or in
computational lambda-calculus. In order
to boost interaction between programming, type-theoretical and modal
communities, AiML 2012 will
host a special session on these topics. Papers for this session should
be submitted to the EasyChair site
along with others.
INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Patrick Blackburn (Roskilde University)
Balder ten Cate (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Univ. Nac. de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Universit a di Bologna, Italy)
Giovanna D'Agostino (Universit a di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Silvio Ghilardi (Universit a di Milano, Italy)
Robert Goldblatt (Victoria Univ. of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Lawrence Moss (Indiana University, USA)
Hiroakira Ono (Japan Adv. Inst. of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, Univ. of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schroder (DFKI GmbH & Univ. of Bremen, Germany)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (So a University, Bulgaria)
Yde Venema (ILLC, Univ. of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Universit degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)
ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
IMPORTANT DATES
Full papers submission deadline: 30 March 2012
Full papers acceptance noti cation: 18 May 2012
Abstracts submission deadline: 1 June, 2012
Abstracts acceptance noti cation: 7 June, 2012
Final version of full papers and abstracts due: 15 June 2012
Conference: 22-25 August, 2012.
FURTHER INFORMATION. See the AiML 2012 website hylocore.ruc.dk/aiml2012
ENQUIRIES. E-mail enquiries should be directed respectively to the PC
co-chairs, sent to
aiml2012(a)easychair.org
[View Less]
確率モデル検査で著名な
Marta Kwiatkowska先生(University of Oxford)の
ご講演の案内です。(2件あります。)
===
日時: 2月15日(水) 15:30〜
場所: 東京大学理学部7号館007
A Framework for Verification of Software with Time and Probabilities
Marta Kwiatkowska, University of Oxford
(joint work with Gethin Norman and David Parker)
Quantitative verification techniques are able to establish system
properties such as "the probability of an airbag failing to deploy on
demand'' or "the expected time for a network protocol to successfully
send a message …
[View More]packet''. In this paper, we describe a framework for
quantitative verification of software that exhibits both real-time and
probabilistic behaviour. The complexity of real software, combined with
the need to capture precise timing information, necessitates the use of
abstraction techniques. We outline a quantitative abstraction refinement
approach, which can be used to automatically construct and analyse
abstractions of probabilistic, real-time programs. As a concrete example
of the potential applicability of our framework, we discuss the
challenges involved in applying it to the quantitative verification of
SystemC, an increasingly popular system-level modelling language.
===
日時: 2月17日(金) 15:30〜
場所: 東京大学理学部7号館007
Design and Analysis of DNA Strand Displacement Devices
using Probabilistic Model Checking
Marta Kwiatkowska, University of Oxford
(joint work with Matthew Lakin, David Parker, Luca Cardelli and Andrew
Phillips, to appear in Journal of the Royal Society Interface)
Designing correct, robust DNA devices is difficult because
of the many possibilities for unwanted interference
between molecules in the system. DNA strand displacement
has been proposed as a design paradigm for DNA
devices, and the DSD programming language has been
developed as a means of formally programming and analysing
these devices to check for unwanted interference.
We demonstrate, for the first time, the use of formal verification
techniques, in particular model checking and
probabilistic model checking, to analyse the correctness,
reliability and performance of DNA devices during the
design phase. We use the probabilistic model checker
PRISM, in combination with the DSD language, to design
and debug DNA strand displacement components
and to investigate their kinetics. We show how our techniques
can be used to identify design flaws and to evaluate
the merits of contrasting design decisions, even on
devices comprising relatively few inputs. We then demonstrate
the use of these components to construct a
DNA strand displacement device for approximate majority
voting. Finally, we discuss some of the challenges
and possible directions for applying these methods to
more complex designs.
[View Less]
Asian Workshop on Philosophical Logic
"Asian Workshop on Philosophical Logic" will be organized by Research
Center for Integrated
Science (RCIS), Japan Advanced Institute of Science and Technology
(JAIST) and held at the
Ishikawa Hightech Ceter near JAIST from 15th to 17th February, 2012.
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:
…
[View More]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. We welcome
your participation in both talks and special session.
For the details, see http://www.jaist.ac.jp/rcis/awpl/
===============
Organizers
Hiroakira Ono
Norbert Preining
Research Center for Integrated Science
http://www.jaist.ac.jp/rcis/
Japan Advanced Institute of Science and Technology
Nomi, Ishikawa, 923-1292 Japan
===============
[View Less]
Seventh NII Type Theory Workshop
Date: February 6, 2012, 13:00--17:00
Place: National Institute of Informatics, Room 2005 (20th floor)
場所: 国立情報学研究所 20階 2005室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Program:
13:00--13:30 Daisuke Kimura (National Institute of Informatics)
Title: A generalized modal lambda calculus
13:30--14:00 Kazuyuki Asada (National Institute of Informatics)
Title: Semantics of Multi-rooted Graph with Ordered …
[View More]Branch
14:00--14:20 Tea Break
14:20--15:00 Makoto Tatsuta (National Institute of Informatics)
Title: Type Inference for Bimorphic Recursion
15:00--15:40 Yukiyoshi Kameyama (University of Tsukuba)
Title: Pseudo-Classical Modal Logic for Staged Computation
15:40--16:00 Tea Break
16:00--17:00 Stefano Berardi (Torino University)
Title: A Game Semantic for various Subclassical Logics
Abstracts:
----------------------------------------------------------------------
Daisuke Kimura (National Institute of Informatics)
Title: A generalized modal lambda calculus
Abstract: In this talk, we introduce a lambda calculus with modal
types. The types of this system contain information of possible worlds
explicitly. This information can be considered as a position which is
an abstraction of time or place. The feature of our calculus is that
we can change the property of modalities by changing information about
the relationship between positions. The aim of our research is the
following: (1) To clarify the computational meaning of necessity and
possibility modal operators. (2) To give a uniform framework that can
treat several calculi with modal types.
----------------------------------------------------------------------
Kazuyuki Asada (National Institute of Informatics)
Title: Semantics of Multi-rooted Graph with Ordered Branch
Abstract: Buneman et al. introduced a graph transformation language
UnCAL, where graph has bisimilarity semantics. There structural
recursion plays an important role, and in order to define it, they
introduced multi-rooted graph and its algebraic representation. In
this talk we give coalgebraic semantics for multi-rooted graph, and
see that such final coalgebras has some call-by-value structure. Then
we introduce a CBV equational theory. Next we modify the results of
graph with un-ordered branch to that with ordered branch, which is
important for application to XML. For this ordered graphs,
bisimilarity is defined in some subtle way, but we can use the ordered
version of above CBV equational theory for reasoning of the
bisimilarity between ordered graphs.
----------------------------------------------------------------------
Makoto Tatsuta (National Institute of Informatics)
Title: Type Inference for Bimorphic Recursion
Abstract: This talk proposes bimorphic recursion, which is restricted
polymorphic recursion such that every recursive call in the body of a
function definition has the same type. Bimorphic recursion allows us
to assign two different types to a recursively defined function: one
is for its recursive calls and the other is for its calls outside its
definition. Bimorphic recursion in this talk can be nested. This
talk shows bimorphic recursion has principal types and decidable type
inference. Hence bimorphic recursion gives us flexible typing for
recursion with decidable type inference. This talk also shows that
its typability becomes undecidable because of nesting of recursions
when one removes the instantiation property from the bimorphic
recursion. This is a joint work with Ferruccio Damiani.
----------------------------------------------------------------------
Yukiyoshi Kameyama (University of Tsukuba)
Title: Pseudo-Classical Modal Logic for Staged Computation
Abstract: In this talk, we study a pseudo-classical modal logic, which
corresponds to the staged calculus with control operators introduced
by our earlier work. Staged computation is a means for run-time code
generation, and has been proved useful in improving efficiency and
maintainability of software. We are interested in the use of control
operators in staged computation, since they play an essential role to
avoid the code duplication problem. Combining a staged calculus with
control operators in a naive way results in an unsound calculus, and
we need a restriction on the typing rule for lambda. We show that
this restriction has a logical counterpart similar to Nakano's
catch/throw calculus.
----------------------------------------------------------------------
Stefano Berardi (Torino University)
Title: A Game Semantic for various Subclassical Logics
Abstract: In this talk we describe the state of the art of game
semantics for Logic and lambda-calculus, and the motivations for
having a game semantics. Then we define a game semantic for
Intuitionism extending both Coquands and Hyland-Ongs game
semantics. The semantics refines a paper of TLCA 2007. We have two
kind of results: (1) (Soundness and Completeness) The recursive
winning strategy of our game semantics are isomorphic to the cut-free
proofs of some variant of HA-omega (Infinitary Intuitionistic
Arithmetic) (2) (Cut Elimination) Any debate between two terminating
strategies terminates. This is an ongoing joint work with M. Tatsuta.
----------------------------------------------------------------------
連絡先
龍田 真 (国立情報学研究所)
[View Less]
みなさま,
ETAPS 2012 附設ワークショップ
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
のご案内です.
ワークショップですが,歴史を持つトピックだけあり,選りすぐりで
かっちりした論文が揃っています.
せっかくタリンにおいでならば,ぜひご出席ください!
蓮尾 一郎 (東大情報理工)
https://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
---------- Forwarded message ----------
From: Paul Levy <P.B.Levy(a)cs.bham.ac.uk>
Date: Thu, Jan 26, 2012 at 11:38 PM
Subject: categories: MSFP 2012 call for participation
To: categories list <categories(a)mta.ca>
Please note the deadline for early …
[View More]registration, including discounted
hotel bookings:
*Sunday 29 January*
===========================
Fourth Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
25 March, Tallinn, Estonia
A satellite workshop of ETAPS 2012
http://cs.ioc.ee/msfp/msfp2012/
The fourth workshop on Mathematically Structured Functional
Programming is devoted to the derivation of functionality from
structure. It is a celebration of the direct impact of Theoretical
Computer Science on programs as we write them today. Modern
programming languages, and in particular functional languages, support
the direct expression of mathematical structures, equipping
programmers with tools of remarkable power and abstraction. Where
would Haskell be without monads? Functional reactive programming
without arrows? Call-by-push-value without adjunctions? Type theory
without universes? The list goes on. This workshop is a forum for
researchers who seek to reflect mathematical phenomena in data and
control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010.
Invited Talks:
=================
Dependently typed continuation monads as models in Logic
Danko Ilik, Goce Delčev University of Štip, Republic of Macedonia
Fibred Data Types
Neil Ghani, University of Strathclyde, UK
Accepted Papers
==================
• A Formal Comparison of Approaches to Datatype-Generic Programming
José Pedro Magalhães and Andres Löh
• An Investigation of the Laws of Traversals
Mauro Jaskelioff and Ondrej Rypacek
• Evaluation strategies for monadic computations
Tomas Petricek
• From Mathematics to Abstract Machine: A formal derivation of an
executable Krivine machine
Wouter Swierstra
• Irrelevance, Heterogenous Equality, and Call-by-value Dependent Type Systems
Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley
D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump and
Stephanie Weirich
• Parametric Compositional Data Types
Tom Hvitved and Patrick Bahr
• Step-Indexed Normalization for a Language with General Recursion
Chris Casinghino, Vilhelm Sjöberg and Stephanie Weirich
• Tracing monadic computations and representing effects
Maciej Piróg and Jeremy Gibbons
ETAPS:
======
European Joint Conferences on Theory and Practice of Software (ETAPS)
is the primary European forum for academic and industrial researchers
working on topics relating to software science. ETAPS, established in
1998, is a confederation of six main annual conferences (one of them,
POST, being new in 2012), accompanied by satellite workshops. ETAPS
2012 is the fifteenth event in the series.
http://www.etaps.org/2012
Host City:
==========
Tallinn, a city of 412,000 people, is the capital and largest city of
Estonia, a small EU member country in Northern Europe, bordering
Russia to the East and Latvia to the south. Located in the north of
the country, on the southern shores of the Gulf of Finland, opposite
Helsinki in Finland, Tallinn is most well known for its picturesque
medieval Old Town, a UNESCO World Heritage site. But it also has a
vivid cultural scene, outperforming most European centres of similar
size. In 2011, Tallinn, along with Turku in Finland, is the Cultural
Capital of Europe.
Tallinn is easy to travel to. Estonia is part of Schengen and the
Eurozone. The Lennart Meri International Airport of Tallinn /TLL) is
only 4km from the city centre.
Programme Committee:
====================
* James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia
* Paul Blain Levy (co-chair), University of Birmingham, UK
* Thorsten Altenkirch, University of Nottingham, UK
* Robert Atkey, University of Strathclyde, Glasgow, UK
* Nils Anders Danielsson, Chalmers University and University of Gothenburg,
Sweden
* Martin Escardo, University of Birmingham, UK
* Ichiro Hasuo, University of Tokyo, Japan
* Ralf Hinze, University of Oxford, UK
* Neelakantan Krishnaswami, Microsoft Research, Cambridge, UK
* Daniel R. Licata, Carnegie Mellon University, Pittsburgh, PA
* Ulrich Schoepp, LMU Munich, Germany
* Alex Simpson, University of Edinburgh, UK
* Matthieu Sozeau, INRIA, Paris, France
* Sam Staton, University of Cambridge, UK
Further Information:
====================
For more information about the workshop, go to:
http://cs.ioc.ee/msfp/msfp2012/
With any other questions please do not hesitate to contact the
co-chairs at msfp2012(a)easychair.org.
[View Less]
------------------------------------------------------------------
The International Interdisciplinary Conference
Philosophy, Mathematics, Linguistics: Aspects of Interaction 2012
(PhML 2012)
St. Petersburg, Russia, May 22-25, 2012
http://www.pdmi.ras.ru/EIMI/2012/PhML/index.htm
------------------------------------------------------------------
AIM and SCOPE
=============
The PhML 2012 is a sequel in the series of conferences
"…
[View More]Philosophy, Mathematics, Linguistics: Aspects of Interaction"
intended to provide a forum for presentation of current
researches, and to stimulate a dialogue between mathematicians,
logicians, philosophers, linguists and computer scientists who
share an interest in cross-disciplinary research. The conference
will have plenary sessions to present the latest researches. In
addition to plenary sessions, the conference will feature a panel
discussion entitled "The Heritage of Kant and Contemporary Formal
Logic". Apart from plenary sessions, there will also be parallel
sessions of thematic sections to present contributed papers.
The PhML 2012 will be held on May 22$BK(J5, 2012, at the Euler
International Mathematical Institute (EIMI), which is a part of
the St. Petersburg Department of Steklov Mathematical Institute
(PDMI).
PLENARY SPEAKERS
================
Theodora Achourioti (University of Amsterdam, the Netherlands)
Michel De Glas (CNRS - University Paris$BK%(Jiderot, France)
Dmitry Grigoriev (CNRS - University Lille 1, France)
Gerhard Heinzmann (Archives Henri-Poincare (UMR 7117)
University of Lorraine/CNRS, France)
Jaakko Hintikka (Boston University, USA)
Edward Karavaev (St. Petersburg State University, Russia)
Michiel van Lambalgen (University of Amsterdam, the Netherlands)
Yuri Manin (Max Planck Institute for Mathematics, Germany)- to be
confirmed
Grigori Mints (Stanford University, USA)
Andrey Patkul (St. Petersburg State University, Russia)
Jeff Pelletier (University of Alberta, Canada)
Graham Priest (City University of New York, USA,
University of Melbourne, Australia)
Oleg Prosorov (PDMI, St. Petersburg, Russia)
Andrei Rodin (University Paris$BK%(Jiderot, France)
Gabriel Sandu (University of Helsinki, Finland)
Anatol Slissenko (University Paris$BK&(Jst Cr$BqU(Jeil, LACL, France)
CALL for PAPERS
===============
The PhML 2012 invites to submit papers relating to the interplay
between philosophy, mathematics and linguistics for presentation
at thematic sections. Each presentation of a contributed paper
will be allotted 25 min, including 5 min for discussion.
Presentations should be given in English. Papers from any
tradition and from a wide variety of perspectives are welcome,
including but in no way limited to the following topics:
- New trends in the foundations of mathematics today;
- Ontology of mathematics and the nature of mathematical truth;
- The problem of abstract entities in mathematics, philosophy and
linguistics;
- Formalization of Kant's logic and theory of judgments;
- The mathematical concept of a function: from the notions of
mapping, transformation towards the notion of an algorithm;
- Complexity of finite objects: limited possibilities of man and
computer;
- Novel computational models and paradigms;
- Philosophical and mathematical aspects of informatics;
- Philosophical aspects of the use of natural language in
mathematics;
- Mathematical investigation of natural language structures;
- Mathematical models in the study of language.
PAPER SUBMISSION
================
Papers should be prepared in LaTeX or MS Word using style files of
PhML format and be submitted electronically as pdf and source
files via e-mail:
PhML_2012(a)pdmi.ras.ru
IMPORTANT DATES:
================
- Submission deadline for contributed papers: March 1st, 2012
- Notification of acceptance: March 15th, 2012
- Final date for camera-ready copy: April 22nd, 2012
- Conference: May 22-25, 2012
- Panel discussion: May 23, 2012
PROCEEDINGS
===========
The proceedings of PhML 2012 will be published by PDMI in the
local series with ISBN no.
ORGANIZING / PROGRAM COMMITTEE
==============================
Edward Karavaev (St. Petersburg State University, Russia),
Elena Lisanyuk (St. Petersburg State University, Russia),
Ivan Mikirtumov (St. Petersburg State University, Russia),
Yuri Nechitajlov (St. Petersburg State University, Russia),
Vladimir Orevkov (PDMI, St. Petersburg, Russia), co-chair,
Oleg Prosorov (PDMI, St. Petersburg, Russia), co-chair,
Anatol Slissenko (University Paris$BK&(Jst Cr$BqU(Jeil, LACL, France).
PARTICIPATION
=============
For registration and further practical information, see:
http://www.pdmi.ras.ru/EIMI/2012/PhML/index.htm
[View Less]
みなさま
今週木曜日に催されるセミナーのご案内をさせていただきます。
どうぞお気軽にお越しください。
照井
---
RIMS-CS website
http://www.kurims.kyoto-u.ac.jp/~cs/
=====
Speaker:
Stefano Berardi (University of Torino)
Title:
A Topology over a set of Knowledge States and a Fixed Point Problem
Date:
11.00 -, February 2nd (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/…
[View More]access/campus/map6r_y.htm
Abstract:
We give an abstract formulation of the termination problem
for realizer of Heyting Arithmetic plus various subsystem of classical
logic. This termination problem is expressed as the existence of a
fixed point for a class of continuous maps in a suitable topology.
------------------------------------------
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/
[View Less]
logic-mlの皆様,
量子情報のポスドク募集に関する代理投稿を
させていただきます.
大阪府立大学理学系研究科
西村治道
-------------------------------------------------------------------------------
立命館の山下茂と申します.
Masaryk University, Brno, Czech Republik での以下のポスドクの募集案内を日本
国内の量子情報関連MLへの配布を依頼されましたので、MLへ通して下記の案内
をさせてください。複数お受け取りになったらご容赦ください。
Postdoc position in Quantum Information at Faculty of Informatics,
Masaryk University, Brno, Czech Republik
A 2-year (with possible extension to 3 years) postdoctoral position in
Quantum
Information …
[View More]Processing Theory is opening in Faculty of Informatics, Masaryk
University, starting with September 2012, in the group of prof. Jozef
Gruska
(http://www.fi.muni.cz/quantum).
Possible research areas includes - but are not restricted to - models of
quantum computations, quantum algorithms, quantum cryptography, quantum
entanglement, quantum (pseudo-telepathic) games.
The successful candidate will be member of the Quantum information
processing
and cryptography laboratory that has currently 8 members including two
postdocs.
The group has close and intensive contacts with quantum groups in Bratislava
and Vienna,
Faculty of Informatics has more than 2500 students (http://www.fi.muni.cz)
and close contacts with Departments of mathematics and Physics of the
Faculty
of Natural sciences.
Applicants must hold a PhD - or be about to obtain one - in informatics,
physics or mathematics and should be able to demonstrate very good English
and strong research track record.
Once application is successful, position should be taken during the period
August 15 - September 1, 2012.
The following information should be provided in an application:
* CV
* PhD diploma
* A proof of good English (outcomes of TOEFL, CAE or an equivalent test).
* Statement of research interest
* Lists of publications and presentations
* Two representative publications
* Two letters of recommendations
Electronic publications are preferred. They should be sent via email to
gruska(a)fi.muni.cz or via postal mail to
Prof. Jozef Gruska
Faculty of Informatics
Masaryk University
Botanicka 68a
60200 Brno, Czech Republic
For the official web side of the whole postdocs programs and conditions
see http://www.mu.cz/research/postdoctoral
`
An applicant will receive 55000 Kc per month (what corresponds concerning
exchange rate to about 2200 EUR (and with respect to the living costs to
about
3000-3300 EUR in Western Europe). In addition, he/she will receive standard
health care insurance for himself/herself) Reasonable traveling and
office money are also available
[View Less]
皆様、こんにちは!
産総研の北村崇師です。
下記の通り、産総研組み込みシステム技術連携体(@尼崎)は、計算機言語談話
会 (CLC:Computer Language Colloquium)を開催します。
どなたでも無料で参加できます。皆様のご参加お待ちしております。
また参加の際は、事前に北村( t.kitamura(a)aist.go.jp )までメールによるご
連絡をお願いいたします。
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
日時:平成 24 年 2 月 1 日(水) 16:00--17: 30
場所:(独)産総研関西センター尼崎事業所 E 棟 2 階 セミナー室
http://cfv.jp/cvs/access/index.html
演題:Automatic Specification-Based Program Testing
講演者:Prof. Shaoying Liu (Hosei University, Tokyo, Japan)…
[View More]
梗概:
Automatic specification-based testing (ASBT) is a potentially effective
and efficient technique for detecting errors in programs and attractive
to industry due to its potential in saving time and cost. In this talk,
after presenting the goals of the testing technique I will introduce a
decompositional functional scenario-based testing technique, a specific
ASBT, by explaining the strategy and criteria for test set generation,
test oracle for test result analysis, and test process for tool support.
I will also discuss the challenges and future research directions.
Bio.:
Shaoying Liu is Professor at Hosei University, Japan. He received a Ph.D
in Computer Science from the University of Manchester, U.K in 1992. His
research interests include Formal Engineering Methods,
Specification-based Inspection and Testing, and Intelligent Software
Engineering Environments. He has published a book titled "Formal
Engineering for Industrial Software Development" with Springer-Verlag,
four edited conference proceedings, and over 120 academic papers in
refereed journals and international conferences. He is the chair of
Steering Committee for ICFEM conference, and on the editorial board for
the Journal of Software Testing, Verification and Reliability (STVR) and
for ISRN Software Engineering Journal. He is a Fellow of British
Computer Society, Senior member of IEEE Computer Society, and member of
Japan Society for Software Science and Technology.
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
以上よろしくお願いいたします。
--------------------------
北村崇師 PhD <t.kitamura(a)aist.go.jp>
特別研究員
(独)産業技術総合研究所
組込みシステム技術連携研究体
〒661-0974 兵庫県尼崎市若王寺3-11-46
Tel: 06-6494-8054
Fax: 06-6494-8073
[View Less]
みなさま
1月31日(火)と2月9日(木)にJAISTで行われます、計算量・組合せ理論についての
2つセミナーをご案内致します。どうぞお気軽にお越しください。
http://www.jaist.ac.jp/is/labs/ogawa-lab/vs12.html
廣川
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Seminars of Research Center for Software Verification, JAIST
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
== Seminar I ==
Date: 31st Jan (Tue) 13:00-17:00 (closing time is flexible)
Place: JAIST IS school collaboration room 7 (5F)
1. Prof.Yijia Chen …
[View More](Shanghai Jiao Tong University)
"Parameterized complexity of SAT"
Many natural computational problems are NP-hard, hence they have no
polynomial time algorithms assuming NP \ne P. The traditional
approaches for coping with such problems are heuristic and
approximation algorithms. Nevertheless, the heuristic algorithms
often lack a rigorous analysis, while the approximation algorithms
cannot guarantee exact solutions. Parameterized algorithms offer
another approach which achieves both criteria. The key observation
is that many natural problem instances come with some parameters
which can be expected to be small, e.g., the size of a vertex
cover, the length of a database query, and the tree width of a
graph. If an exponential time algorithm has its superpolynomial
behavior restricted by the parameters, it might well be efficient
in practice. As an example, there is an algorithm for SAT which is
exponential in the tree width tw(\alpha) of a given instance \alpha
and at the same time linear in the size of \alpha. Therefore, if
there is a constant upper bound on tw(\alpha), we can solve the
corresponding SAT in linear time.
In this talk I will survey some major tools for designing
parameterized algorithms, including bounded search tree,
kernelization, tree width method, and algorithmic meta-theorems,
etc, with a focus on applications to SAT. In passing, I will also
discuss some corresponding lower bound results.
2. Dr. Yohji Akama (Tohoku University)
"A new order theory of set systems, WQO and BQO"
A set system over a set $T$, a subfamily of the power set $P(T)$,
is a topic of (extremal) combinatorics, as well as a target of an
algorithm to learn in computational learning theory of languages.
A well quasi-ordering (WQO for short) is introduced by Higman and
employed in algebra, combinatorics, formal language theory, and so
on. A better quasi-ordering (BQO for short) is introduced by
Nash-Williams and employed in infinitary combinatorics and
verification of infinite-state systems.
We generalize WQOs and BQOs by using set systems, define the order
type of a set system from game-theoretic viewpoint and study
nondeterministic, combinatorial operations on set systems, such as
monotone (continuous) image and unbounded unions of set systems.
The motivating examples are the union of two colored arithmetical
progressions, and the discolorization, and new useful examples are
shuffle-product and shuffle-closure from formal language theory
Furthermore, we provide a neat correspondence :
quasi-orderings vs finitely branching simulations, and
set systems vs linear, monotone, continuous functions.
Next, we introduce a set system that has order type and corresponds
to a BQO. We prove that the class of set systems corresponding to
BQOs is closed by any monotone function. In (Shinohara and
Arimura. ``Inductive inference of unbounded unions of pattern
languages from positive data.'', Theoretical Computer Science,
pp.191-209, 2000), for any set system $L$, they considered the class
of arbitrary (finite) unions of members of $L$. From viewpoint of
WQOs and BQOs, we characterize the set systems $L$ such that the
class of arbitrary (finite) unions of members of $L$ has order type.
== Seminar II ==
Date: 9th Feb (Thu) 13:00-15:00 (closing time is flexible)
Place: JAIST IS school collaboration room 7 (5F)
* Prof.Yijia Chen (Shanghai Jiao Tong University)
"A Logic for PTIME and a Parameterized Halting Problem"
Whether there is a logic for polynomial time (PTIME) is the central
problem in finite model theory. When formalizing this problem,
Gurevich (1988), together with Blass, actually proposed a logic
LFP_inv, which is a version of least fixed-point logic plus some
additional invariance condition. Although they don't believe that
LFP_inv captures PTIME, no proof was given. Later, in a work of
Nash, Remmel, and Vianu (2005), it was shown that whether LFP_inv
captures PTIME is equivalent to the parameterized complexity of a
halting problem:
input: A nondeterministic Turing machine M and a natural number n
in unary.
parameter: |M|, i.e., the size of M
question: does M accept the empty input in at most n steps?
Our recent work (2010-11) reveals that it is even equivalent to an
open problem in proof complexity, i.e., whether there is a
polynomial optimal proof system for the set TAUT of tautologies of
propositional logic.
In this talk, I will discuss all these equivalences and their
extensions to some other complexity classes beside PTIME. It turns
out that Levin's optimal inverters (1973) play a central role in
the proofs.
This is joint work with Joerg Flum.
[View Less]
皆様、
1月23日(月)に開催されるセミナーのご案内をさせて頂きます。
どうぞお気軽にお越し下さい。
長谷部浩二@筑波大学
---------------------------------------------
Date:14:00-15:00, Jan 23, 2012
Place: Room SB-911-1 (Laboratory of Advanced Research-B, 9th floor),
Tsukuba-campus, University of Tsukuba
http://www.tsukuba.ac.jp/english/access/tsukuba_access.htmlhttp://www.tsukuba.ac.jp/english/access/map_central.html
(筑波大学 筑波キャンパス,総合研究棟B,9階,911-1号室)
http://www.tsukuba.ac.jp/access/tsukuba_access.htmlhttp://www.tsukuba.ac.…
[View More]jp/access/map_central.html
Speaker: Thomas Ågotnes, Department of Information Science and Media Studies, University of Bergen
Title: Group Announcement Logic
Abstract:
Public announcement logic is used to reason about the epistemic pre- and post-conditions of actions in the form of public announcements. In the talk I will present Group Announcement Logic (GAL), an extension of public announcement logic with constructs (well known from coalition logic) of the form <G>phi, where G is a group of agents. In GAL, the meaning of <G>phi is that there exists an announcement that the members of G can jointly and truthfully make, and after that announcement is made public phi will be true. After introducing GAL I will discuss how it can be used to express properties such as "there is a sequence of truthful public announcements by agents in G, after which phi is true"; the distinction between "agent i knows *that* phi can be achieved by a public announcement" and "agent i knows *how* phi can be achieved by a public announcement"; and meta-logical properties such as axiomatization, expressivity and the complexity of the model checking problem. The talk is based on joint work with Philippe Balbiani, Hans van Ditmarsch and Pablo Seban.
---------------------------------------------
[View Less]
Asian Workshop on Philosophical Logic
http://www.jaist.ac.jp/rcis/awpl/
"Asian Workshop on Philosophical Logic" will be organized by Research
Center for Integrated
Science (RCIS), Japan Advanced Institute of Science and Technology
(JAIST) and held at the
Ishikawa Hightech Ceter near JAIST from 15th to 17th February, 2012.
Originally, the Workshop
was planned to be held in March of the last year.
Our aim is to promote mutual understandings among …
[View More]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
The following is a preliminary list of speakers:
Phan Minh Dung (Asian Institute of Technology, Bangkok)
Shier Ju (Sun Yat-sen University, Guangzhou)
Xin Li (JAIST, Ishikawa)
Fenrong Liu (Tsinghua University, Beijing)
Hu Liu (Sun Yat-sen University, Guangzhou)
Yutaka Miyazaki (Osaka University of Economics and Law, Osaka)
Katsuhiko Sano (JAIST, Ishikawa)
Takahiro Seki (Niigata University, Niigata)
Kaile Su (Griffith University, Queensland)
Wen-fang Wang (National Yang Ming University, Taipei)
Chin-mu Yang (National Taiwan University, Taipei)
Xishun Zhao (Sun Yat-sen University, Guangzhou)
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 the morning of 15th February and will end
in the afternoon of 17th.
We welcome your participation in both talks and discussions from all
areas and all levels, but ask
to inform us if possible in advance of your participation.
===============
Organizing Committee
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
===============
[View Less]
Kobe Colloquium on Logic, Statistics and Informatics
以下の要領でセミナー(3つの発表)を開催します。
日時:2012年1月16日(月)13:20-14:50
2012年1月18日(水)13:20-14:50
2012年1月19日(木)15:10-16:40
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
講演者:Frank Tall (University of Toronto, Canada)
========================================================================
題目:Classic Lindelöf problems and selection principles (talk 1 and 2)
時間:16日(月)と18日(水)1:20-2:50
アブストラクト:
There are many connections between classical topological problems
concerning …
[View More]Lindelöf spaces and selection principles, such as
(generalizations of) Rothberger, Menger, and Hurewicz properties.
In the first talk, we will discuss these connections.
In the second talk, we will pursue further some of the topics introduced in
the first talk, but it is not necessary to have gone to the first talk in
order
to understand the second.
========================================================================
題目:PFA(S)[S]: a useful model (talk 3)
時間:19日(木)3:10-4:40
アブストラクト:
We introduce a model in which important consequences of PFA hold
but also some combinatorics that follow from V=L. This talk is
quite technical and assumes familiarity with proper forcing with
elementary submodels as side conditions.
========================================================================
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」
行きに乗車,「神大本部工学部前」停留所下車,徒歩すぐ.
http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm
連絡先:ブレンドレ ヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp
[View Less]
各位、
重複して受け取られた場合はどうぞご容赦ください。現在、北陸先端科学技術大学院大学、情報科学研究科では、
JAIST Spring School 2012
- Formal Reasoning: Theory and Application -
http://www.jaist.ac.jp/~hirokawa/jss12.html
chair 東条 敏 (JAIST)
を
平成24年3月5日から3月9日まで
於、金沢県立美術館
の日程で開催する予定です。これにあたり、本スプリングスクールへの参加に関心のある、日本国内の大学院生・ポスドク(学部・研究科は問いません)を10名程度募集いたします(なお、参加費(一万円程度)が必要です)。会場のキャパシティに限りがございますので、参加に興味がおありの方は、下記の
Application Form に必要事項を記入の上(日本語可)、
jss2012-oc(a)jaist.ac.jp
まで件名 "JSS2012 Domestic Application" でご返信ください。締切は
平成24年2月17日(金)
…
[View More]と致します。
また、本スプリングスクールの最終日に
数理論理学の諸科学への発展と展開
平成24年3月9日
石川県立美術館広坂別館
主催:文部科学省・北陸先端科学技術大学院大学 情報科学研究科
後援:日本数学会・日本応用数理学会・統計関連学会連合・科学技術振興機構
http://www.jaist.ac.jp/~hirokawa/ml12.html
chair 石原 哉 (JAIST)
を開催いたします。招待講演者等、詳細が決まり次第、再度アナウンスをお送りいたしますが、こちらのワークショップにはどなた様もご参加いただけます。
************************************************************
*** JAIST Spring School 2012 Application Form ***
*** Reply to "jss2012-oc(a)jaist.ac.jp" ***
*** with subject-line "JSS2012 Domestic Application" ***
************************************************************
1) Family (last) Name:
2) Middle Name (if any):
3) Given (first) Name:
4) Sexuality: (male/female)
5) Age:
6) Nationality:
7) Affiliation:
8) E-mail address:
9) Home page URL (if you have):
10) Status (choose one):
- graduate student (indicate grade)
- postdoc (indicate when you became postdoc)
- others (indicate your status)
11) Sketch your main motivation (in a few lines) to attend JAIST
Spring School 2012, research interests, and past research achievements.
If you have already published some research papers, indicate them.
12) If you are a student, indicate the following:
Supervisor's name:
Supervisor's title and affiliation:
Supervisor's e-mail address:
13) Any special dietary requirements or food allergies?:
************************************************************
********************** end end end *************************
************************************************************
[View Less]
みなさま
今週木曜日に催されるセミナーのご案内をさせていただきます。
どうぞお気軽にお越しください。
照井
---
RIMS-CS website
http://www.kurims.kyoto-u.ac.jp/~cs/
=====
Speaker:
Jean-Yves Girard (IML Marseille & RIMS Kyoto)
Title:
A SECOND LOOK AT PROOF-NETS
Date:
11.00 -, January 12th (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…
[View More]Abstract:
In logic, we have a reasonable answer to the question :
"What is a typable object?"
but none so far to the question :
"What is a typed object?"
By a second look at proof-nets, especially the ones involving quantifiers,
we shall propose an answer to the second question.
------------------------------------------
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/
[View Less]
Prof. Kwangkeun Yi Lecture at NII Logic Seminar
Date: January 10, 2012, 15:00--17:00
Place: National Institute of Informatics, Lecture Room 1208 (12th floor)
場所: 国立情報学研究所 12階 1208室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Speaker: Prof. Kwangkeun Yi (Seoul National University)
Title: Static Analysis of Multi-Staged Programs via Unstaging Translation
Abstract:
Static analysis of multi-staged programs is challenging because the
…
[View More]basic assumption of conventional static analysis no longer holds: the
program text itself is no longer a fixed static entity, but rather a
dynamically constructed value. This article presents a
semantic-preserving translation of multi-staged call-by-value programs
into unstaged programs and a static analysis framework based on this
translation. The translation is semantic-preserving in that every
small-step reduction of a multi-staged program is simulated by the
evaluation of its unstaged version. Thanks to this translation we can
analyze multi-staged programs with existing static analysis techniques
that have been developed for conventional unstaged programs: we first
apply the unstaging translation, then we apply conventional static
analysis to the unstaged version, and finally we cast the analysis
results back in terms of the original staged program. Our translation
handles staging constructs that have been evolved to be useful in
practice (typified in Lisp's quasi-quotation): open code as values,
unrestricted operations on references and intentional
variable-capturing substitutions. This article omits references for
which we refer the reader to our companion technical report. This is
a joint work with Wontae Choi, Baris Aktemur, and Makoto Tatsuta.
問合せ先:
龍田 真 (国立情報学研究所)
e-mail: tatsuta(a)nii.ac.jp
http://research.nii.ac.jp/~tatsuta
[View Less]
(重複して受け取られた場合はご容赦ください)
名古屋集合論セミナーのご案内:
日時:2012年1月11日(水) 午後2時15分~4時(途中15分休憩)
場所:名古屋大学大学院情報科学研究科棟 322号室
(名古屋市地下鉄名城線名古屋大学駅1番出口より徒歩数分、下記のキャンパスマップのA4にある建物です。)
http://www.nagoya-u.ac.jp/global-info/access-map/higashiyama/
講演者:Franklin D. Tall (トロント大学)
題目:A useful model of set theory
アブストラクト:
I will sketch a method for getting mutually consistent consequences of PFA and V = L.
The talks are unavoidably technical, and assume acquaintance with the method of proper forcing
with elementary submodels as …
[View More]side conditions. The hope is that although listeners are unlikely to
be able to follow all the details presented, they will get enough of the ideas so that they can more
easily study the research papers if they are interested.
多数のご参加をお待ちしております。
名古屋大学大学院情報科学研究科
吉信康夫
[View Less]
logic-ml の皆様,
黒田@群馬県立女子大学です.
Proof complexity の ML にポスドク募集の案内が流れてきましたので,
こちらに流します.
すでにご覧になっている場合はご容赦ください.
---------- Forwarded message ----------
From: Jakob Nordstrom <jakobn(a)kth.se>
Date: 2011/12/20
Subject: [Proof Complexity] Postdoc position in proof complexity at KTH
To: proof-complexity(a)math.cas.cz
Dear colleagues,
This is just to ask for your help in advertising an open postdoc position
in proof complexity at KTH Royal Institute of Technology. The formal
deadline is …
[View More]January 31, but candidates are encouraged to apply already
now. The intended start date is August-September 2012.
I would be very grateful if you could help spread this information. For
more details, see the enclosed PDF flyer, which is also available at
http://www.csc.kth.se/~jakobn/openings/PostdocAug12Flyer.pdf . The full,
formal announcement can be found at
http://www.csc.kth.se/~jakobn/openings/D-2011-0603-Eng.php .
As advertised before on this list, I am also looking for two PhD students,
and here the formal announcement is
http://www.csc.kth.se/~jakobn/openings/D-2011-0503-Eng.php .
Informal enquiries about the postdoc or PhD positions are welcome.
With best regards,
Jakob Nordstrom
Jakob Nordström, Assistant Professor
KTH Royal Institute of Technology
Osquars backe 2, SE-100 44 Stockholm, Sweden
Phone: +46 8 790 69 19 (office), +46 70 742 21 98 (cell)
http://www.csc.kth.se/~jakobn/
_______________________________________________
Proof-Complexity mailing list
Proof-Complexity(a)math.cas.cz
http://list.math.cas.cz/listinfo/proof-complexity
--
Satoru Kuroda
Gunma Prefectural Women's University
[View Less]
Dear colleagues,
The deadline for MSFP 2012 has been extended by one week to FRIDAY 23
DECEMBER. See details below.
Best regards,
James Chapman and Paul Blain Levy
MSFP 2012 co-chairs
--
Fourth Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
25 March, Tallinn, Estonia
A satellite workshop of ETAPS 2012
http://cs.ioc.ee/msfp/msfp2012/
The fourth workshop on Mathematically Structured Functional
Programming is devoted to the derivation of functionality from
structure. It …
[View More]is a celebration of the direct impact of Theoretical
Computer Science on programs as we write them today. Modern
programming languages, and in particular functional languages, support
the direct expression of mathematical structures, equipping
programmers with tools of remarkable power and abstraction. Where
would Haskell be without monads? Functional reactive programming
without arrows? Call-by-push-value without adjunctions? Type theory
without universes? The list goes on. This workshop is a forum for
researchers who seek to reflect mathematical phenomena in data and
control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010.
Important Dates:
================
Submission of papers: 23 December 2011
Notification: 25 January 2012
Final versions due: 6 Feburary 2012
Workshop: 25 March 2012
Invited Speakers:
=================
Danko Ilik, Goce Delčev University of Štip, Republic of Macedonia
Neil Ghani, University of Strathclyde, UK
Submission:
===========
Papers must report previously unpublished work and not be submitted
concurrently to another conference with refereed proceedings. Accepted
papers must be presented at the workshop by one of the authors.
There is no specific page limit, but authors should strive for brevity.
Accepted regular papers will be published in the Electronic
Proceedings in Theoretical Computer Science (EPTCS). After the
workshop, there might be an opportunity to publish selected papers in
a journal special issue.
All submissions must be in PDF format and use the EPTCS style
files. Submissions can be made through the EasyChair website, at
http://www.easychair.org/conferences/?conf=msfp2012
ETAPS:
======
European Joint Conferences on Theory and Practice of Software (ETAPS)
is the primary European forum for academic and industrial researchers
working on topics relating to software science. ETAPS, established in
1998, is a confederation of six main annual conferences (one of them,
POST, being new in 2012), accompanied by satellite workshops. ETAPS
2012 is the fifteenth event in the series.
http://www.etaps.org/2012
Host City:
==========
Tallinn, a city of 412,000 people, is the capital and largest city of
Estonia, a small EU member country in Northern Europe, bordering
Russia to the East and Latvia to the south. Located in the north of
the country, on the southern shores of the Gulf of Finland, opposite
Helsinki in Finland, Tallinn is most well known for its picturesque
medieval Old Town, a UNESCO World Heritage site. But it also has a
vivid cultural scene, outperforming most European centres of similar
size. In 2011, Tallinn, along with Turku in Finland, is the Cultural
Capital of Europe.
Tallinn is easy to travel to. Estonia is part of Schengen and the
Eurozone. The Lennart Meri International Airport of Tallinn /TLL) is
only 4km from the city centre.
Programme Committee:
====================
* James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia
* Paul Blain Levy (co-chair), University of Birmingham, UK
* Thorsten Altenkirch, University of Nottingham, UK
* Robert Atkey, University of Strathclyde, Glasgow, UK
* Nils Anders Danielsson, Chalmers University and University of Gothenburg,
Sweden
* Martin Escardo, University of Birmingham, UK
* Ichiro Hasuo, University of Tokyo, Japan
* Ralf Hinze, University of Oxford, UK
* Neelakantan Krishnaswami, Microsoft Research, Cambridge, UK
* Daniel R. Licata, Carnegie Mellon University, Pittsburgh, PA
* Ulrich Schoepp, LMU Munich, Germany
* Alex Simpson, University of Edinburgh, UK
* Matthieu Sozeau, INRIA, Paris, France
* Sam Staton, University of Cambridge, UK
Further Information:
====================
For more information about the workshop, go to:
http://cs.ioc.ee/msfp/msfp2012/
With any other questions please do not hesitate to contact the
co-chairs at msfp2012(a)easychair.org.
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
[View Less]
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
First Call for Papers
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science [2],
Japan Advanced Institute of Science and Technology [3].
Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The …
[View More]assumption that 'truth comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.
The main goal of this meeting is to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic, and to promote
communication and cooperation with members of neighbouring fields.
The featured topics include, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.
We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued logics
in general).
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Invited Speakers:
. Rostislav Horčík (Academy of Sciences, Czech Republic)
. Emil Jeřábek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)
Tutorial:
. Felix Bou (University of Barcelona, Spain)
If you are interested in presenting a paper, please submit a 2–4 pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012(a)jaist.ac.jp
The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.
Conference dates:
The scientific program will start Monday morning (10 September) and finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd2012(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
(本案内を重複してお受け取りの際はご容赦ください)
Logic-ml の皆様,
東北大学の江口と申します.
下記の要領で東北大学ロジックセミナー(田中一之研究室)を開催いたします.
興味のある方は参加をご検討ください.
日時:12月26日(月),16時から.
場所:東北大学北青葉山キャンパス理学総合棟1201号室
発表者:新井 敏康 (千葉大学 大学院理学研究科)
タイトル:Searching witnesses of $\Sigma^{0}_{2}$-formulas in proofs
アブストラクト:
We can find a witness of a PA-provable $\Sigma^{0}_{2}$-formula
as limits of an elementary recursive function,
whose convergence is ensured by weakly descending chains of ordinals.
東北大学ロジックセミナーの詳細につきましては下記をご参照ください.
https://sites.google.com/…
[View More]site/sendailogichomepage/
--
江口 直日
東北大学 大学院理学研究科 数学専攻
産学官連携研究員
980-8578 宮城県仙台市青葉区荒巻字青葉6ー3
E-mail: eguchi(a)math.tohoku.ac.jp
[View Less]
We announce the following talk in Kobe Colloquium on Logic, Statistics and
Informatics:
-------------------------------------------------------------------------
Date and time: Dec. 12, 2011 (Mon.), 15:10 -- 16:40
Place: Presentation Room of "Fuchino Group"
on the 4th Floor of Science and Technology Research Building 3 (Shizenkagakutou Sangokan)
(see: http://www.kobe-u.ac.jp/en/access/rokko/campus.htm)
Speaker: Professor Dr. Peter Vojtas
(Department of Software Engineering of …
[View More]the Charles University in Prague)
Title of the talk: Soundness and completeness of fuzzy Prolog/Datalog.
-------------------------------------------------------------------------
Abstract:
We start with using user preference search as a motivation for
a many valued (fuzzy) model of Prolog/Datalog/Querying. We mention
problems of classical approach with refutation and clausal rules. We
base our semantics on implicative rules and many valued modus ponens. We
prove soundness and completeness of our semantics. We discuss also
clausal approach and fuzzy resolution.
--
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/
-------------------------------------------------------------------------
[View Less]
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
First Call for Papers
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science
[2],
Japan Advanced Institute of Science and Technology [3].
Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of …
[View More]comparative truth. The assumption that 'truth
comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.
The main goal of this meeting is to foster collaboration between
researchers
in the area of Mathematical Fuzzy Logic, and to promote communication
and
cooperation with members of neighbouring fields.
The featured topics included, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Renyi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.
We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued
logics
in general).
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIS, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Invited Speakers:
. Rostislav Horcik (Academy of Sciences, Czech Republic)
. Emil Jerabek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)
Tutorial:
. Felix Bou (CICS, Spain)
If you are interested in presenting a paper, please submit a 2–4
pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012(a)jaist.ac.jp
The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.
Conference dates:
The scientific program will start Monday morning (10 September) and
finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located
in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd2012(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
[View Less]
皆様
桔梗宏孝@神戸大学システム情報学研究科です.
2011年12月1日(木)の 17:00 から下記のように Lyon 1 大学の Amador Martin-Pizarro 氏による
モデル理論におけるMorleyの定理に関する神戸情報数理コロキウムの講演を予定しております.
講演者の Amador Martin-Pizarro 氏には,モデル理論の専門の方だけでなくロジック全般の
general audience 向けの講演になるよう,お願いしてあります.興味のある方は御参加ください.
なお,この回の次の神戸コロキウムでは,2011年12月12日 15:10 から Professor
Peter Vojtas (Charles Univ. (プラハ大学)) による many valued Prolog に
関する講演を予定しております.これについては改めてご案内いたします.
----------------------------------------------------------------------------------
神戸情報数理コロキウム
日時:…
[View More]2011年12月1日(木)17:00 〜 18:30
場所:神戸大学自然科学総合研究棟3号館4階421室(渕野グループ内プレゼンテーション室)
講演者: Amador Martin-Pizarro (リヨン1大学)
題目: Morley's theorem and Geometric Model Theory
アブストラクト:A countable theory is uncountably categorical if it only has a
unique model (up to isomorphism) on each
uncountable cardinal. Morley proved that a theory is uncountably
categorical if it is categorical on cardinality the continuum.
His proof uses the fact that every model can be built from basic
bricks, called strongly minimal sets (which generalise the
concept of an absolutely irreducible algebraic curve). The goal of
this talk is to give an overview (to a general audience) of
some of the ideas of the proof based on examples. Moreover, we will
link the classification of strongly minimal sets to results
in other areas of mathematics, specially number theory, such as the
existence of infinite Mersenne primes and Schanuel's
conjecture.
-------------------------------------------
神戸大学自然科学総合研究棟3号館への行き方:
http://kurt.scitec.kobe-u.ac.jp/~kikyo/seminar/scitec3.pdf
[View Less]
(重複して受け取られた場合はどうぞご容赦ください。)
京都大学の末永と申します。
来年1月に POPL 2012 と併設で開催される
PEPM 2012 のご案内をお送りいたします。
今回も日本からの4本の論文を含む
見所満載のプログラムになっております。
Early registration は12月24日までとなっております。
POPL ともども皆様の参加をお待ち申し上げております。
京都大学
末永幸平
ksuenaga(a)sato.kuis.kyoto-u.ac.jp
--
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation
http://www.program-transformation.org/PEPM12
January 23-24, 2012. Philadelphia, PA, USA (co-located with POPL'12)
Call For Participation
Online registration is open …
[View More]at
https://regmaster3.com/2012conf/POPL12/register.php
Early registration deadline is December 24, 2011
The PEPM Symposium/Workshop series brings together researchers
and practitioners working in the broad area of program
transformation, which spans from refactoring, partial evaluation,
supercompilation, fusion and other metaprogramming to model-driven
development, program analyses including termination, inductive
programming, program generation and applications of machine learning
and probabilistic search. PEPM focuses on techniques, supporting
theory, tools, and applications of the analysis and manipulation of
programs.
In addition to the presentations of regular research papers, the PEPM
program includes tool demonstrations and `short paper' presentations
of exciting if not fully polished research.
PEPM has established a Best Paper award. The winner will be
announced at the workshop.
INVITED TALKS
Compiling Math to High Performance Code
Markus Pueschel (ETH Zuerich, Switzerland)
http://www.inf.ethz.ch/~markusp/index.html
Specification and verification of meta-programs
Martin Berger (University of Sussex, UK)
http://www.informatics.sussex.ac.uk/users/mfb21/
ACCEPTED PAPERS
Regular research papers:
Naoki Kobayashi, Kazutaka Matsuda and Ayumi Shinohara.
Functional Programs as Compressed Data
Kazutaka Matsuda, Kazuhiro Inaba and Keisuke Nakano.
Polynomial-Time Inverse Computation for Accumulative Functions with
Multiple Data Traversals
Dana N. Xu.
Hybrid Contract Checking via Symbolic Simplification
Susumu Katayama.
An Analytical Inductive Functional Programming System that Avoids
Unintended Programs
Roberto Giacobazzi, Neil Jones and Isabella Mastroeni.
Obfuscation by Partial Evaluation of Distorted Interpreters
Michael Gorbovitski, Yanhong A. Liu, Scott Stoller and Tom Rothamel.
Composing Transformations for Instrumentation and Optimization
Elvira Albert, Jesus Correas Fernandez, German Puebla and
Guillermo Roman-Diez.
Incremental Resource Usage Analysis
Takumi Goto and Isao Sasano.
An approach to completing variable names for implicitly typed
functional languages
Martin Hirzel and Bugra Gedik.
Streams that Compose using Macros that Oblige
Vlad Ureche, Tiark Rompf, Arvind Sujeeth, Hassan Chafi and Martin Odersky.
StagedSAC: A Case Study in Performance-Oriented DSL Development
Markus Degen, Peter Thiemann and Stefan Wehr.
The Interaction of Contracts and Laziness
Surinder Kumar Jain, Chenyi Zhang and Bernhard Scholz.
Translating Flowcharts to Non-Deterministic Languages
Francisco Javier Lopez-Fraguas, Enrique Martin-Martin and
Juan Rodriguez-Hortala.
Well-typed Narrowing with Extra Variables in Functional-Logic Programming
Geoff Hamilton and Neil Jones.
Superlinear Speedup by Distillation: A Semantic Basis
Short papers:
Jacques Carette and Aaron Stump.
Towards Typing for Small-Step Direct Reflection
Janis Voigtlaender.
Ideas for Connecting Inductive Program Synthesis and Bidirectionalization
Tool demonstration papers:
Edvard K. Karlsen, Einar W. Hoest and Bjarte M. Oestvold.
Finding and fixing Java naming bugs with the Lancelot Eclipse plugin
Adriaan Moors, Tiark Rompf, Philipp Haller and Martin Odersky.
Scala-Virtualized
Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gomez-Zamalloa
and German Puebla.
COSTABS: A Cost and Termination Analyzer for ABS
[View Less]
各位
今年の12/1-2に高松でJSAI-IsAIの一部として開催される
法律と情報学のワークショップJURISIN2011
http://research.nii.ac.jp/~ksatoh/jurisin2011.html
のプログラムをお送り致します。多数の方のご参加をお待ちしております。
登録は、
http://www.ai-gakkai.or.jp/jsai-isai/2011/#registration
の情報をご覧ください。
12/1には法言語学(Forensic Linguistics)研究で有名な明治大学法学部の堀田秀吾教授
12/2にはIJCAIでResearch Excellence Awardを受賞したKowaski教授の招待講演があります。
どうぞよろしくお願いいたします。
佐藤 健
国立情報学研究所
===============================================================
JURISIN 2011 Program
Dec. 1, 2011
12:45-13:00 Opening …
[View More]Remark:
Ken Satoh (National Institute of Informatics and Sokendai)
13:00-14:00 Invited Talk I
Implications of Forensic Linguistics for Juris-informatics
Syugo Hotta (Meiji University)
14:00-14:30 Document Structure Analysis with Syntactic Model and
Parsers: Application to Legal Judgments
Hirokazu Igari, Akira Shimazu and Koichiro Ochimizu
14:30-15:00 Recall-Oriented Evaluation Metrics for Consistent
Translation of Japanese Legal Sentences
Yasuhiro Ogawa, Masaki Mori and Katsuhiko Toyama
15:00-15:30 Using Classification to Support Legal Knowledge Engineers
in the Eunomos Legal Document Management System
Luigi Di Caro, Llio Humphreys and Guido Boella
15:30-16:00 Coffee Break
16:00-16:30 Prerequisite-Effect Structure on Intuitionistic Kripke Model
Katsuhiko Sano, Shingo Hagiwara and Satoshi Tojo
16:30-17:00 The Concept and Definition of Software Accountability in
Legal Engineering
Ryo Hayasaka and Koichiro Ochimizu
Dec. 2, 2011
9:30-10:30 Invited Talk II
WUENIC: A Case Study in Rule-based Knowledge Representation
and Reasoning
Robert Kowalski(Imperial College London) and Anthony Burton
10:30-11:00 Coffee Break
11:00-11:30 A Substance-Field based Argumentation Framework
Wachara Fungwacharakorn, Nuanwan Soonthornphisaj
and Boonserm Kijsirikul
11:30-12:00 Deliberation Process Support System for Citizen Judge Trial
Based on Structure of Factors
Takanori Sato, Shogo Okada and Katsumi Nitta
12:00-12:30 A Semantics of Argumentation under Incomplete Information
Ken Satoh and Kazuko Takahashi
12:30-12:45 Concluding Remark:
Ken Satoh (National Institute of Informatics and Sokendai)
[View Less]
(重複して受け取られた場合はご容赦ください)
今年の12/1-3に高松で開催される LENLS8 国際ワークショップのプログラ
ムをお送り致します。多数の方のご参加をお待ちしております。
12/3にはアムステルダム大学のFrank Veltman先生、青山学院大学のEric
McCready先生によるチュートリアル講演を予定しています。
戸次大介(お茶の水女子大学)
照会先:lenls8 [[at]] easychair.org
[Apologies for multiple copies]
=================================================================
CALL FOR PARTICIPATION
Logic and Engineering of
Natural …
[View More]Language Semantics 8 (LENLS8)
Workshop Site : "Sunport Hall Takamatsu",
Takamatsu 2-1, Sunport, Takamatsu-shi, Kagawa-ken, Japan
Information/Registration: 5th Floor
Conference Rooms: 5th and 6th Floor
Dates : December 1-3, 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):
Frank Veltman (University of Amsterdam)
Kentaro Inui (Tohoku University)
Information on Takamatsu:
http://www.takamatsu.or.jp/eng/http://www.city.takamatsu.kagawa.jp/english/access/http://www.my-kagawa.jp/eg/
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).
Registration
============
The proceedings of the workshop will be available at the
conference site for registered persons. Please follow the link
below and register yourself until 24th November 2011.
http://www.ai-gakkai.or.jp/jsai-isai/2011/index.html#registration
Program
=======
December 1st (Thu), 2011
-------------------------
09:00-10:00: Reception
10:00-10:10: Opening Remarks
10:10-11:40: Session 1
* Yoshiki Mori
"Back To the Future, Back From the Future
- To and Fro For the Counterfactual Future In the Past -"
* Yurie Hara, Yuli Feng and Shigeto Kawahara
"Emphatic Stress as Epistemic Conflict: A case study of Mandarin Chinese"
* Chungmin Lee
"Dynamic Perspective Shifts in Evidentials: Evidence from Korean"
11:40-13:00: Lunch
13:00-15:00: Session 2
* Mauricio Hernandes
"Players who don't know how to play.
An Haskell implementation of unawareness."
* Oleg Prosorov
"A Sheaf-Theoretic Framework for Dynamic Semantics"
* Margot Colinet and Gre'goire Winterstein
"Linking probabilistic accounts: polarity items and discourse markers"
* Hiroko Ozaki and Daisuke Bekki
"Extractability as Deduction Theorem in Subdirectional Combinatory Logic"
15:00-15:30: Coffee break
15:30-16:30: Session 3
* Gre'goire Winterstein
"Ludics and Presupposition Projection"
* Nicholas Asher and Jason Quinley
"Begging Questions, Getting Answers and Basic Cooperativity"
16:30-17:30: Invited Talk 1
* Frank Veltman (University of Amsterdam)
"(TBA)"
December 2nd (Fri), 2011
-------------------------
08:30-09:00: Reception
09:00-10:30: Session 4
* Yo Sato and Wai Lok Tam
"Underspecified types and the semantic bootstrapping of common nouns
and adjectives: a simulation with a robot's sensory data "
* David Yoshikazu Oshima
"The Japanese particle yo in declaratives:
Relevance, priority, and blaming"
* Katsuhiko Yabushita
"Japanese NPI Dare-mo as Unrestricted Universal Quantifier"
10:30-11:00: Coffee break
11:00-12:00: Session 5
* J.-R. Hayashishita and Daisuke Bekki
"Conjoined nominal expressions in Japanese: Interpretation through monad"
* Christina Unger
"Dynamic semantics as monadic computation"
12:00-13:30: Lunch
13:30-15:00: Session 6
* Satoru Suzuki
"Measurement-Theoretic Foundations of Gradable-Predicate Logic"
* Tzu-Keng Fu
"Universal Logic and the Logical Many-valuedness"
* Alastar Butler and Kei Yoshimoto
"Towards a self-selective and self-healing evaluation"
15:00-15:30: Coffee break
15:30-16:30: Invited Talk 2
* Kentaro Inui (Tohoku University)
"Toward Deep Processing of Language in the Era of Large-scale
Knowledge Resources: Time for Formal Semantics to Meet NLP Again"
Alternates
----------
* Eric Mccready
"Trust in Evidential Testimony"
December 3rd (Sat), 2011
-------------------------
On the 3rd December, there will also be special tutorial lectures
at the workshop venue by Frank Veltman (University of Amsterdam)
and Eric McCready (Aoyama Gakuin University).
Lecturer:
- Frank Veltman (University of Amsterdam)
- Eric McCready (Aoyama Gakuin University)
Location:
"Sunport Hall Takamatsu",
Takamatsu 2-1, Sunport, Takamatsu-shi, Kagawa-ken, Japan
Time Table (Tentative):
10:00-12:00 Session 1: Tutorial Lecture by Eric McCready
Title: (TBA)
12:00-13:30 Lunch
13:30-17:30 Session 2: Tutorial Lecture by Frank Veltman
Title: "Or else, what?"
Abstract: In this talk I will present the theory of imperatives
that I have developed in the past five years and apply it to a
number of problems involving disjunction. In particular I will
use it to analyse pseudo-imperatives and a variant of the Miners
Paradox.
Organizing Committee
====================
Alastair Butler (Chair)
Daisuke Bekki
Eric McCready
Yoshiki Mori
Yasuo Nakayama
Katsuhiko Yabushita
Tomoyuki Yamada
Shunsuke Yatabe
Kei Yoshimoto
Contact
=======
lenls8 [[at]] easychair.org
[View Less]
(Apologies for multiple copies)
Call for papers
*** Non-classical Modal and Predicate Logics ***
special issue of Logic Journal of IGPL
Modalities and predicates have since ancient time been central
notions in 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 …
[View More]quantification and modalities and their accommodation
in these non-classical settings. In response, various modal and
predicate variants of non-classical logics have been introduced
and studied in the past decades.
This special issue is solely dedicated to modal and predicate
non-classical logics. Its aim is to bring together papers from
various branches of non-classical logics, not only to present
recent advances in the 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 encourage to submit papers on the above logics from any
branches of mathematical logic (proof-theory, model theory,
game theory, complexity, etc.), be it purely theoretical or
about applications in the foundation of mathematics, computer
science, linguistics, and philosophy.
== Deadline ==
31 March 2012
== Submissions ==
Papers should be submitted to ncmpl(a)cs.cas.cz. Please also
use this email to express interest in submitting a paper.
== A related conference ==
This special issue is related with the conference Non-classical
Modal and Predicate Logics, organized Guangzhou (Canton), China,
5-9 December, 2011. http://logic.sysu.edu.cn/ncmpl2011
Petr Cintula, Rosalie Iemhoff, Shier Ju
guest editors
[View Less]
NIIレクチャーシリーズのお知らせ
国立情報学研究所(NII)では、海外の情報学に関係する著名研究者を招聘し、レクチャーシリーズを行っております。
今回は、論理学によるマルチエージェントシステム、ゲーム理論の定式化を研究されているノルウェーのベルゲン大学のThomas Agostnes先生の連続レクチャーのお知らせです。
講師:Professor Thomas Agotnes from University of Bergen, Norway.
講義名 :Social Laws for Multi-Agent Systems: Logic and Games
詳しい講演の内容は、 http://www.nii.ac.jp/en/calendar/2011/121302/
をご覧ください。
場所:国立情報学研究所 20階 2001 または2010室
講義日:2011年 12/13, 20, 27, 2012年1/10, 17, 24, 31
時間: 15:30-17:00
出席は無料で、どなたでも参加できます。
なお、CTL(computational tree …
[View More]logic)に興味をお持ちの方に対しては、本講義の中にこの論理の紹介およびマルチエージェントへの応用などが含まれており特に有用であると思います。
また、この連続講演の一部は、Ali Mili先生のソフトウェア工学関連の連続講演(http://www.nii.ac.jp/en/calendar/2011/1213/)
の後に行われるので、1日で2つの講演を連続して聞くことができます。
参加のご検討よろしくお願いします。
佐藤 健
国立情報学研究所および総研大
==========
- Lecture Series:
Social Laws for Multi-Agent Systems: Logic and Games
Lecturer:
Professor Thomas Agotnes, University of Bergen
Thomas Agotnes is a professor at the Department of Information Science and
Media Studies at the University of Bergen, Norway. Since his PhD in 2004
form University of Bergen, Agotnes has worked and published extensively in
multi-agent systems and related areas. In 2009, he won best paper award at
AAMAS 2009 on logical analysis of normative systems. Agotnes is an active
member of the international multi-agent systems community. He is a member of
the board of directors of the European Association for Multi-Agent Systems
(EURAMAS), was the general chair of STAIRS 2010, and has served on the
program committees of the main conferences and workshops in his field,
including the senior program committees of AAMAS and IJCAI.
Schdeule
Lecture 1: Specifying and verifying state-transition models for multi-agent
Systems
Place: National Institute of Informatics, Lecture room 2001, 20F
Date: 15:30-17:00, December 13, 2011
Lecture 2: Social laws for coordination
Place: National Institute of Informatics, Lecture room 2001, 20F
Date: 15:30-17:00, December 20, 2011
Lecture 3: Dealing with non-compliance
Place: National Institute of Informatics, Lecture room 2001, 20F
Date: 15:30-17:00, December 27, 2011
Lecture 4: Coordinating self-interested agents
Place: National Institute of Informatics, Lecture room 2001, 20F
Date: 15:30-17:00, January 10, 2012
Lecture 5: Social laws design as an optimisation problem, and as a mechanism
design problem
Place: National Institute of Informatics, Lecture room 2010, 20F
Date: 15:30-17:00, January 17, 2012
Lecture 6: Reasoning about social laws
Place: National Institute of Informatics, Lecture room 2010, 20F
Date: 15:30-17:00, January 24, 2012
Lecture 7: Strategic reasoning under imperfect information
Place: National Institute of Informatics, Lecture room 2010, 20F
Date: 15:30-17:00, January 31, 2012
[View Less]
Sixth NII Type Theory Workshop
Date: November 14, 2011, 11:00--17:00
Place: National Institute of Informatics, Room 2005 (20th floor)
場所: 国立情報学研究所 20階 2005室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/introduce/access1-j.shtml)
Program:
11:00--11:30 Takayuki Koai (National Institute of Informatics)
Title: Verification of Substitution Theorem Using HOL
11:30--12:00 Mauricio Hernandes (The Graduate University for Advanced Studies)
Title: Game theory from a …
[View More]logician perspective
12:00--13:40 Lunch Break
13:40--14:10 Takanori Hida (Kyoto University)
Title: A computational interpretation of the axiom of determinacy
14:10--14:40 Makoto Tatsuta (National Institute of Informatics)
Title: Non-Commutative Infinitary Peano Arithmetic
14:40--15:00 Tea Break
15:00--16:00 Neil D. Jones (University of Copenhagen)
Title: Termination Analysis of the Untyped lambda-Calculus
16:00--17:00 Stefano Berardi (Torino University)
Title: A Topology over a set of Knowledge States and a Fixed Point Problem
Abstracts:
----------------------------------------------------------------------
Takayuki Koai (National Institute of Informatics)
Title: Verification of Substitution Theorem Using HOL
Abstract: Substitution Theorem is a new theorem in untyped lambda
calculus, which was proved in 2006. This theorem states that for a
given lambda term and given free variables in it, the term becomes
weakly normalizing when we substitute arbitrary weakly normalizing
terms for these free variables, if the term becomes weakly normalizing
when we substitute a single arbitrary weakly normalizing term for
these free variables. This paper formalizes and verifies this theorem
by using higher-order theorem prover HOL. A control path, which is
the key notion in the proof, explicitly uses names of bound variables
in lambda terms, and it is defined only for lambda terms without bound
variables renaming. The lambda terms without bound variable renaming
are formalized by using the HOL package based on contextual
alpha-equivalence. The verification uses 10119 lines of HOL code and
326 lemmas. This is a joint work with Makoto Tatsuta.
----------------------------------------------------------------------
Mauricio Hernandes (The Graduate University for Advanced Studies)
Title: Game theory from a logician perspective
Abstract: I intend in this talk to introduce a few concepts in game
theory like Nash Equilibrium and Backward-Induction, and then express
those ideas with some modal logic.
----------------------------------------------------------------------
Takanori Hida (Kyoto University)
Title: A computational interpretation of the axiom of determinacy
Abstract: Axiom of determinacy(AD) is a central topic in descriptive
set theory and there are a number of research on this axiom. In this
talk, we approach to the computational content of negative translation
of AD using realizability interpretation due to Berardi, Bezem and
Coquand (1998).
----------------------------------------------------------------------
Makoto Tatsuta (National Institute of Informatics)
Title: Non-Commutative Infinitary Peano Arithmetic
Abstract: Does there exist any sequent calculus such that it is a
subclassical logic and it becomes classical logic when the exchange
rules are added? The first contribution of this paper is answering
this question for infinitary Peano arithmetic. This paper defines
infinitary Peano arithmetic with non-commutative sequents, called
non-commutative infinitary Peano arithmetic, so that the system
becomes equivalent to Peano arithmetic with the omega-rule if the the
exchange rule is added to this system. This system is unique among
other non-commutative systems, since all the logical connectives have
standard meaning and specifically the commutativity for conjunction
and disjunction is derivable. This paper shows that the provability
in non-commutative infinitary Peano arithmetic is equivalent to
Heyting arithmetic with the recursive omega rule and the law of
excluded middle for Sigma-0-1 formulas. Thus, non-commutative
infinitary Peano arithmetic is shown to be a subclassical logic. The
cut elimination theorem in this system is also proved. The second
contribution of this paper is introducing infinitary Peano arithmetic
having antecedent-grouping and no right exchange rules. The first
contribution of this paper is achieved through this system. This
system is obtained from the positive fragment of infinitary Peano
arithmetic without the exchange rules by extending it from a positive
fragment to a full system, preserving its 1-backtracking game
semantics. This paper shows that this system is equivalent to both
non-commutative infinitary Peano arithmetic, and Heyting arithmetic
with the recursive omega rule and the Sigma-0-1 excluded middle. This
is a joint work with Stefano Berardi and was presented at CSL 2011.
----------------------------------------------------------------------
Neil D. Jones (University of Copenhagen)
Title: Termination Analysis of the Untyped lambda-Calculus
Abstract: An algorithm is developed that, given an untyped
lambda-expression, can certify that its call-by-value evaluation will
terminate. It works by an extension of the ``size-change principle''
earlier applied to first-order programs. The algorithm is sound (and
proven so) but not complete: some lambda-expressions may in fact
terminate under call-by- value evaluation, but not be recognised as
terminating. The intensional power of size-change termination is
reasonably high: It certifies as terminating all primitive recursive
programs, and many interesting and useful general recursive algorithms
including programs with mutual recursion and parameter exchanges, and
Colson's ``minimum'' algorithm. Further, the approach allows free use
of the Y combinator, and so can identify as terminating a substantial
subset of PCF. (joint work with Nina Bohr; in Logical Methods in
Computer Science, 2008, Issue 1)
----------------------------------------------------------------------
Stefano Berardi (Torino University)
Title: A Topology over a set of Knowledge States and a Fixed Point Problem
Abstract: We give an abstract formulation of the termination problem
for realizer of Heyting Arithmetic plus various subsystem of classical
logic. This termination problem is expressed as the existence of a
fixed point for a class of continuous maps in a suitable topology.
----------------------------------------------------------------------
[View Less]
皆様
線型論理関連ワークショップ(11月7日−11日、京都大学)について、
アブストラクト入りのプログラムが出来上がりましたのでご案内をさせていただきます。
※11月9日(水)の懇親会に参加希望の方は7日(月)までにお申し込みください。
--------------------
Workshop on Linear Logic
(Geometry of Interaction, Traced Monoidal Categories and Implicit Complexity)
* Date: 7th - 11th, November
(11th reserved for free discussion)
* Location: Room 110, Faculty of Science Building No.3, Kyoto University
http://www.kyoto-u.ac.jp/en/access/campus/north.htm
京都大学理学部3号館110号室
http://www.kyoto-u.ac.jp/ja/access/…
[View More]campus/map6r_n.htm
※数理解析研究所ではありませんのでご注意ください。
* Workshop Dinner
18:30-, 9th November.
Izakaya Anji Fuchomae (Annex)
http://www.anji-gr.com/futyoumae/index.html
Students 3,000yen, Others 5,000yen
※Please inform us by 7th Monday if you would like to participate.
* Organizers
Michele Basaldella: mbasalde(a)kurims.kyoto-u.ac.jp
Kazushige Terui: terui(a)kurims.kyoto-u.ac.jp
Claudia Faggian
* Program with abstracts
http://www.kurims.kyoto-u.ac.jp/~terui/wsprogram.pdf
-------------------------------------
Registration Form
1. Your name, affiliation, status
2. You participate in the workshop during ?th - ?th November.
3. You do/do not participate in the social dinnter on 9th.
(Inform us if you have any dietary option.)
--------------------------------------
------------------------------------------
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/
[View Less]
来年2月に行われます停止性に関するワークショップの論文投稿募集の
案内をお送り致します。今年はオーストリアのオーバーグルグルで
開催されます。投稿を見当して頂けますと幸いです。
廣川 直(北陸先端科学技術大学院大学)
======================================================================
First Call for Papers
WST 2012
12th International Workshop on Termination
Feb 19 - 23, 2012, Obergurgl, Innsbruck
http://cl-informatik.uibk.ac.at/users/georg/events/wst2012/
==========================================================…
[View More]============
The goal of the Workshop on Termination is to be a venue for
presentation and discussion of all topics in and around termination.
In this way, the workshop tries to bridge the gaps between different
communities interested and active in research in and around
termination.
We will work very hard to attain the same friendly atmosphere as in
past workshops, which enabled fruitful exchanges leading to joint
research and subsequent publications.
IMPORTANT DATES:
* submission December 18, 2012
* notification January 15, 2012
* final version January 29, 2012
* workshop February 19 - 23, 2012
TOPICS:
The 12th International Workshop on Termination welcomes contributions
on all aspects of termination and complexity analysis.
Contributions from the imperative, constraint, functional, and logic
programming communities, and papers investigating applications of
complexity or termination (for example in program transformation or
theorem proving) are particularly welcome.
Areas of interest to the workshop include, but are not limited to,
the following:
* Termination of programs
* Termination of rewriting
* Termination analysis of transition systems
* Complexity of programs
* Complexity of rewriting
* Implicit computational complexity
* Implementations of termination and complexity analysis methods
* Certification of termination and complexity proofs
* Termination orders, well-founded orders, and reduction orders
* Termination methods for theorem provers
* Strong and weak normalization of lambda calculi
* Termination analysis for different language paradigms
* Challenging termination problems/proofs
* Applications to program transformation and compilation
* Other applications of termination methods
* Comparisons and classification of termination methods
* Non-termination and loop detection
* Termination in distributed systems
* Proof methods for liveness and fairness
* Well-quasi-order theory
* Ordinal notations
* Subrecursive hierarchies
PROGRAM COMMITTEE:
* Ugo Dal Lago University of Bologna
* Danny De Schreye K.U. Leuven
* Samir Genaim The Complutense University
* Nao Hirokawa JAIST
* Georg Moser University of Innsbruck (chair)
* Albert Rubio Universitat Politecnica de Catalunya
* Peter Schneider-Kamp University of Southern Denmark
* Rene Thiemann University of Innsbruck
SUBMISSION:
Submissions are short papers/extended abstract which should not exceed
5 pages. There will be no formal reviewing. The accepted papers will
be made available electronically before the workshop.
Papers should be submitted electronically via the submission page:
http://www.easychair.org/conferences/?conf=wst2012
Final versions should be created using LaTeX and the style file
LIPIcs (http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz).
[View Less]
数理解析研究所 特定研究員の宮部です。
重複して受け取られた場合はご容赦ください.
RIMSでは、2週間に1度、GCOE tea timeを行っています。
http://www.kurims.kyoto-u.ac.jp/~kenkyubu/gcoe/2008teatime.html
来週、2011年11月1日(火)、第48回 GCOE tea timeでは、
Micheleが話をします。
時間のご都合がよろしければ是非ご参加ください.
講演者:
Michele BASALDELLA (数理解析研究所 研究員)
タイトル:
Dilators: a gentle introduction
講演の概要:
We aim to recall some basic aspects of the concept of dilator, a
notion which has been introduced in proof-theory (a branch of
mathematical logic) by J.-Y. Girard about 30 years ago.
…
[View More]Essentially, a dilator is a certain kind of endofunctor of the category
of the ordinal numbers, which can be thought as an abstract counterpart
of the more concrete system of ordinal notation which are abundant in
proof-theory.
In this introductory talk, we recall the notion of denotation system (a
kind of generalization of the Cantor normal form representation of the
ordinal numbers), the notion of dilator, and show a correspondence
between them.
なお、この講演は英語で行われます。
時間(Time):15:00-16:00
場所(Place):数理解析研究所402号室(RIMS, Room 402)
--
Kenshi Miyabe
email: kmiyabe(a)kurims.kyoto-u.ac.jp
Researcher
Research Institute for Mathematical Sciences, Kyoto University
Kyoto 606-8502 Japan
Tel: +81-75-753-7202 / Fax: +81-75-753-7272
[View Less]