-------------------------------------------------------------------
The International Interdisciplinary Conference
Philosophy, Mathematics, Linguistics: Aspects of Interaction 2014
(PhML-2014)
St. Petersburg, Russia, April 21--25, 2014
<http://www.pdmi.ras.ru/EIMI/2014/PhML/index.html>
-------------------------------------------------------------------
CONFERENCE DESCRIPTION
======================
The conference PhML-2014 will be held on April 21--25, 2014 at the
Euler International Mathematical Institute (EIMI), which is a
research unit of the St. Petersburg Department of Steklov
Institute of Mathematics of the Russian Academy of Sciences (PDMI
RAS). The conference PhML-2014 is endorsed by the American
National Committee of the Division of Logic, Methodology and
Philosophy of Science (DLMPS) of the International Union of the
History and Philosophy of Science (IUHPS), the Japan Association
for Philosophy of Science, the Swedish National Committee for
Logic, Methodology and Philosophy of Science.
The conference PhML-2014 is a sequel in the series of conferences
intended to provide a forum for philosophers, mathematicians,
linguists, logicians, and computer scientists who share an
interest in cross-disciplinary research. Presentations will be
given in English.
PROGRAM COMMITTEE
=================
Toshiyasu Arai, Chiba University
Edward Hirsch, PDMI RAS
Wilfrid Hodges, Queen Mary University of London
Makoto Kanazawa, National Institute of Informatics, Japan
Alexander Leitsch, Vienna University of Technology
Angus Macintyre, Queen Mary University of London
Klaus Mainzer, University of Munich
Per Martin-Lo"f, Stockholm University
Ivan Mikirtumov, St. Petersburg State University
Grigori Mints, University of Stanford -- chair
Grigory Olkhovikov, Ural Federal University
Vladimir Orevkov, PDMI RAS
Rohit Parikh, The City University of New York
Barbara Partee, University of Massachusetts, Amherst
Dag Prawitz, Stockholm University
Oleg Prosorov, PDMI RAS
Michael Rathjen, University of Leeds
Andrei Rodin, Institute of Philosophy RAS,
St. Petersburg State University
Vladimir Rybakov, University of Liverpool
Vladislav Shaposhnikov, Moscow State University
Albert Visser, Utrecht University
ORGANIZING COMMITTEE
====================
Vladimir Orevkov, PDMI RAS
Oleg Prosorov, PDMI RAS -- chair
Andrei Rodin, Institute of Philosophy RAS,
St. Petersburg State University
Maxim Vsemirnov, PDMI RAS
PLENARY SESSIONS
================
At present, the following plenary speakers are confirmed:
Dmitry Grigoryev, CNRS, Universite' Lille 1
Klaus Mainzer, University of Munich
Yuri Manin, Max-Planck-Institut fu"r Mathematik, Bonn
Grigori Mints, University of Stanford
Aleksei Parshin, Steklov Institute of Mathematics RAS, Moscow
Oleg Prosorov, PDMI RAS
Andrei Rodin, Institute of Philosophy RAS,
St. Petersburg State University
Gabriel Sandu, University of Helsinki
Anatol Slissenko, LACL, Universite' Paris-Est Cre'teil
Nikolai Vavilov, St. Petersburg State University
Anatoly Vershik, PDMI RAS
Each presentation of a plenary paper is allotted 55 min, which
includes 10 min for questions and discussion.
PANEL DISCUSSION
================
The conference will feature a panel discussion entitled
"Understanding complexity in cross-disciplinary research" allotted
up to 90 min. Discussion will be led by Klaus Mainzer (University
of Munich).
THEMATIC SESSIONS
=================
Apart from plenary sessions, there will also be three parallel
thematic sessions to present contributed papers:
- Mathematical and logical methods in philosophy
and in sciences of language;
- Philosophical Insights into Logic and Mathematics;
- Complexity in mathematics, philosophy, linguistics.
Each presentation of a contributed paper is allotted 25 min,
including 5 min for questions.
CALL for PAPERS
===============
For presentation at thematic sessions, the conference PhML-2014
invites the submission of contributed papers on original and
unpublished research relating to the interplay between philosophy,
mathematics and linguistics. 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;
- Complexity in mathematics, logic, linguistics;
- Ontology of mathematics and the nature of mathematical truth;
- The problem of abstract entities in mathematics, philosophy
and linguistics;
- Philosophical aspects of informatics, novel computational models
and paradigms;
- Philosophy of mathematics and philosophy of logic;
- Mathematical investigation of natural language structures.
PAPER SUBMISSION
================
Papers should be prepared in LaTeX or MS Word using style files of
PhML-2014 format and be submitted electronically as pdf and source
files via e-mail: <PhML-2014(a)pdmi.ras.ru>. For more details, see:
<http://www.pdmi.ras.ru/EIMI/2014/PhML/index_files/submission.html>.
IMPORTANT DATES
===============
- Submission deadline for contributed papers: March 1st, 2014
- Notification of acceptance: March 15, 2014
- Final date for camera-ready copy: March 31st, 2014
- Conference starts: April 21st, 2014
PROCEEDINGS
===========
The Proceedings of PhML-2014, including both invited and
contributed papers, will be published before the meeting as a volume
in the EIMI's local series and distributed to the participants.
It is planned that selected papers will be published at an
international publishing house as a special post-conference issue.
PARTICIPATION
=============
For further practical information, see:
<http://www.pdmi.ras.ru/EIMI/2014/PhML/index.html>
来年,ウィーンで開催されます FLoC の併設ワークショップになります,
合流性に関するワークショップ IWC 2014 と,IWC 開催中に行われます,
合流性自動証明システムのコンペティション CoCo 2014 のご案内です.
関連する話題をお持ちの方がおられましたら,ぜひご投稿を検討頂ければ幸いです.
青戸等人
東北大学 電気通信研究所
This is a joint call for papers and provers for IWC 2014 and CoCo 2014.
=====================================================================
First Call for Papers
IWC 2014
3rd International Workshop on Confluence
13 July 2014, Vienna, Austria,
a FLoC workshop affiliated with RTA-TLCA
http://www.nue.riec.tohoku.ac.jp/iwc2014/
=====================================================================
Confluence provides a general notion of determinism and has been conceived
as one of the central properties of rewriting. Confluence relates to many
topics of rewriting (completion, modularity, termination, commutation, etc.)
and had been investigated in many formalisms of rewriting such as
first-order rewriting, lambda-calculi, higher-order rewriting, constrained
rewriting, conditional rewriting, etc. Recently there is a renewed interest
in confluence research, resulting in new techniques, tool supports,
certification as well as new applications. The workshop aims at promoting
further research in confluence and related properties. The workshop is a
FLoC workshop affiliated with RTA-TLCA (FLoC 2014 is collocated with Vienna
Summer of Logic 2014). Previous editions of the workshop were held in Nagoya
(2012) and Eindhoven (2013). During the workshop the 3rd Confluence
Competition (CoCo 2014) takes place.
IMPORTANT DATES:
* submission April 16, 2014
* notification May 14, 2014
* final version May 28, 2014
* workshop July 13, 2014
TOPICS:
Specific topics of interest include:
* confluence and related properties (unique normal forms, commutation,
ground confluence)
* completion
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence
INVITED SPEAKERS:
* TBA
PROGRAM COMMITTEE:
* Takahito Aoto Tohoku University (co-chair)
* Thibaut Balabonski Gallium - Inria Rocquencourt
* Eduardo Bonelli Universidad Nacional de Quilmes
* Delia Kesner University Paris - Diderot (co-chair)
* Naoki Nishida Nagoya University
* Colin Riba LIP - ENS Lyon
* Pierre-Yves Strub IMDEA Software
* René Thiemann University of Innsbruck
* Ashish Tiwari SRI International
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.
The page limit for papers is 5 pages in EasyChair style. Short
papers or extended abstracts must be submitted electronically
through the EasyChair system at:
https://www.easychair.org/account/signin.cgi?conf=iwc2014
======================================================================
First Call for Provers
CoCo 2014
3rd Confluence Competition
13 July 2014, Vienna, Austria
http://coco.nue.riec.tohoku.ac.jp/2014/
======================================================================
Recently, several new implementations of confluence tools are reported
and interest for proving/disproving confluence "automatically" has been
grown. The confluence competition aims to foster the development of
techniques for proving/disproving confluence automatically by a dedicated
competition among such tools.
The 3rd Confluence Competition (CoCo 2014) will run ***live*** during the
3rd International Workshop on Confluence (IWC 2014), which is a FLoC
workshop affiliated with RTA-TLCA (FLoC 2014 is collocated with Vienna
Summer of Logic 2014). The following categories are currently planned:
* confluence of first-order term rewrite systems
* confluence of (oriented/join/semi-equational) conditional term rewrite
systems
* certification
Besides these categories, new categories will be considered if there are
tools and problems dedicated to those categories. Submissions of new
confluence problems are also welcome. For more information including
examples of new categories to be considered, platforms, competition rules
and problems, see the webpage of CoCo 2014 indicated above.
IMPORTANT DATES:
* requests for new categories March 7, 2014
* tool registration June 27, 2014
* tool submission July 4, 2014
* problem submission July 9, 2014
* competition July 13, 2014
REQUEST FOR NEW CATEGORIES:
We welcome requests for new categories. Request for new categories is via
the contact email address. Please send us the following information at your
earliest convenience:
* description of problems and semantics (rewrite steps, confluence, etc.)
together with adequate references
* a proposal of the input format (if necessary)
Requests for new categories may be rejected for technical reasons.
SUBMISSION OF NEW PROBLEMS:
Submissions of new confluence problems are welcome. Please use the web
interface of Cops (Confluence Problems) database linked from the webpage
of CoCo 2014.
REGISTRATION/SUBMISSION:
Tool registration is via the contact email address. Every tool registration
should also contain a one page system description. Tool submission will be
via StarExec.
ORGANISING COMMITTEE:
* Takahito Aoto Tohoku University (chair)
* Nao Hirokawa JAIST
* Harald Zankl University of Innsbruck
CONTACT:
coco-sc [AT] jaist.ac.jp
=======================================================
TCS 2014
8th IFIP International Conference on Theoretical Computer Science
September 1-3, 2014 Rome, Italy
http://www.cyprusconferences.org/tcs2014/
Held in conjunction with the 25th Conference on Concurrency Theory (CONCUR 2014)
AIM AND SCOPE OF THE CONFERENCE:
Under the patronage of the International Federation of Information
Processing (IFIP), since year 2000 the IFIP Technical Committee 1
(Foundations of Computer Science) has organized a series of biannual
international conferences in Theoretical Computer Science. After
Sendai (2000), Montreal (2002), Toulouse (2004), Santiago (2006),
Milano (2008), Brisbane (2010), and Amsterdam (2012), the 8th edition
will be held in Rome in September 2014, in cooperation with the IFIP
Working Group 2.2 (Formal Description of Programming Concepts) and in
conjunction with the 25th Conference on Concurrency Theory. We call
for papers in all areas of Theoretical Computer Science: they will be
evaluated by two committees:
Track A: Algorithms, Complexity and Models of Computation
Track B: Logic, Semantics, Specification and Verification
TOPICS:
Suggested, but not exclusive, topics of interest include:
Track A - analysis and design of algorithms; automata and formal
languages; cellular automata and systems; combinatorial, graph and
optimization algorithms; computational learning theory; computational
complexity; computational geometry; cryptography; descriptive
complexity; evolutionary and genetic computing; experimental
algorithms; mobile computing; molecular computing and algorithmic
aspects of bioinformatics; network computing; neural computing;
parallel and distributed algorithms; probabilistic and randomized
algorithms; quantum computing; structural information and
communication complexity.
Track B - automata theory; automated deduction; constructive and
non-standard logics in computer science; concurrency theory and
foundations of distributed and mobile computing; database theory;
finite model theory; formal aspects of program analysis, foundations
of hybrid and real-time systems; lambda and combinatory calculi;
logical aspects of computational complexity; modal and temporal
logics; model checking and verification; probabilistic systems; logics
and semantics of programs; foundations of security; term rewriting;
specifications; type, proof and category theory in computer science.
SUBMISSION GUIDELINES:
Authors are invited to submit an extended abstract of at most 15 pages
(LNCS style with at least 11-point font size) to arrive before April
27, 2014. If more space is needed, a clearly marked appendix, to be
read at the discretion of the program committee, may be included if
desired. Submission will be handled by EasyChair. Further information
and submission details can be found on the Conference web page.
Simultaneous submissions to other conferences with published
proceedings are not allowed.
PROCEEDINGS:
The conference proceedings will be published by Springer-Verlag in
Lecture Notes in Computer Science (LNCS) series. Selected papers from
TCS 2014 will be invited to a special issue of the Journal Theoretical
Computer Science.
IMPORTANT DATES:
Deadline for submission: April 27, 2014.
Notification of acceptance: June 25, 2014.
Final manuscript due: July 6, 2014.
Conference: September 1-3, 2014.
STEERING COMMITTEE:
- Giorgio Ausiello, Sapienza Univ. di Roma
- Jos Baeten, CWI Amsterdam
- Jacques Sakarovitch, CNRS/T el ecom ParisTech
CONFERENCE CO-CHAIRS:
- Daniele Gorla, Sapienza Univ. di Roma
- Rossella Petreschi, Sapienza Univ. di Roma
PROGRAM COMMITTEES:
Track A
- Cristian Calude, University of Auckland
- Josep Diaz (Chair), UPC Barcelona
- Irene Finocchi, Sapienza Univ. di Roma
- Paola Flocchini, University of Ottawa
- Aristides Gionis, Aalto University Helsinki
- Mordecai Golin, Hong Kong University of Tech.
- Juhani Karhumaki, Turku University
- Massimo Melucci, Univ. di Padova
- Elvira Mayordomo, Universidad de Zaragoza
- Friedhelm Meyer auf der Heide, Univ. of Paderborn
- Pekka Orponen, Aalto University Helsinki
- Giuseppe Persiano, Univ. di Salerno
- G eraud S enizergues, Universit e Bordeaux 1
- Olivier Serre, CNRS / Universit e Paris 7
- Paul Spirakis, University of Liverpool
- Osamu Watanabe, Tokyo Inst. of Technology
- Peter Widmayer, ETH Zurich
Track B
- Jos Baeten, CWI Amsterdam
- Lars Birkedal, Aarhus University
- Andrei Bulatov, Simon Fraser University
- James Cheney, University of Edinburgh
- Ugo Dal Lago, Univ. di Bologna
- Jos ee Desharnais, Universit e Laval
- Jorg Endrullis, Vrije Universiteit Amsterdam
- J erome Feret, ENS Paris
- Marcelo Fiore, University of Cambridge
- Silvio Ghilardi, Univ. di Milano
- Benjamin Gr egoire, INRIA Sophia
- Ichiro Hasuo, University of Tokyo
- Marieke Huisman, University of Twente
- Jean Krivine, CNRS / Universit e Paris 7
- Radha Jagadeesan, DePaul University, Chicago
- Ivan Lanese, Univ. di Bologna
- Grigore Rosu, University of Illinois at U-C
- Davide Sangiorgi (Chair), Univ. di Bologna
- Vladimiro Sassone, University of Southampton
- Igor Walukiewicz, CNRS / Universit e Bordeaux 1
9th Workshop on Games for Logic and Programming Languages (GaLoP 2014)
Grenoble, France, 12-13 April
http://www.gamesemantics.org
GaLoP is an annual international workshop on game-semantic models for
logics and programming languages and their applications. This is an
informal workshop that welcomes work in progress, overviews of more
extensive work, programmatic or position papers and tutorials.
GaLoP IX will be held in Grenoble, France on 12-13 April 2014 as a
satellite workshop of ETAPS (http://www.etaps.org/).
Areas of interest include:
* Games and other interaction-based denotational models;
* Games-based program analysis and verification;
* Logics for games and games for logics;
* Algorithmic aspects of game semantics;
* Categorical aspects of game semantics;
* Programming languages and full abstraction;
* Higher-order automata and Petri nets;
* Geometry of interaction;
* Ludics;
* Epistemic game theory;
* Logics of dependence and independence;
* Computational linguistics.
There will be no formal proceedings but the possibility of a special
issue in a journal will be considered (the 2005, 2008 and 2011
workshops led to special issues in Annals of Pure and Applied Logic).
Submission Instructions
Please submit an abstract (up to one page) of your proposed talk on
the easychair submission page below. Supplementary material may be
submitted, and will be considered at the discretion of the PC.
https://www.easychair.org/conferences/?conf=galop2014
Important Dates
Submission: January 25, 2014
Notification: February 5, 2014
Workshop: April 12-13, 2014
Program Committee
• Pierre Clairambault, Lyon
• Dan Ghica, Birmingham
• Ichiro Hasuo, Tokyo
• Jim Laird, Bath (chair)
• John Longley, Edinburgh
• Gabriel Sandu, Paris
• Alexis Saurin, Paris
Logic, Algebra and Truth Degrees 2014
http://www.logic.at/latd2014
July 16 - 19, Vienna, Austria
Call for papers
The conference "Logic, Algebra and Truth Degrees 2014" will be held on 16-19 July 2014 in Vienna,
Austria, as part of the Vienna Summer of Logic event http://vsl2014.at .
Logic, Algebra and Truth Degrees is the fourth official meeting of the EUSFLAT Working Group on
Mathematical Fuzzy Logic.
Mathematical Fuzzy Logic is the sub-discipline of Mathematical Logic that is concerned with the notion
of comparative truth. The assumption that "truth comes in degrees" has proved to be very useful in many
theoretical and applied areas of Mathematics, Computer Science, and Philosophy.
The featured topics include:
Proof theory and computational complexity
Algebraic semantics and abstract algebraic logic
First, higher-order and modal formalisms
Applications and foundational issues
Geometric and game theoretic aspects
We particularly welcome contributions on many-valued and related logical systems.
Invited speakers:
Silvio Ghilardi, Italy
Melvin Fitting, USA
George Metcalfe, Switzerland
Dale Miller, France
Dana Scott, USA
Alasdair Urquhart, Canada
Tutorials:
Franz Baader, Germany
Vincenzo Marra, Italy
Programme Committee:
Arnon Avron, Israel
Matthias Baaz (Chair), Austria
Agata Ciabattoni (Co-Chair), Austria
Petr Cintula, Czech Republic
Nikolaos Galatos, USA
Lluis Godo, Spain
Rosalie Iemhoff, The Netherlands
Nicola Olivetti, France
Hiroakira Ono, Japan
Kazushige Terui, Japan
Richard Zach, Canada
Contributed talks:
Abstracts of contributed talks, 2-4 pages, are to be prepared using the ASL abstract template and
submitted via Easychair. The accepted abstracts will be available on-line and published in the joint
volume of abstracts with the Logic Colloquium.
The deadline for contributions is 6th April 2013. The
notification of acceptance will be sent by 10th May 2013.
For more information please visit the official web page of the conference: http://www.logic.at/latd2014.
All correspondence should be directed to latd2014(a)logic.at.
Please feel free to distribute this call.
The Organizing Committee
Agata Ciabattoni (Chair), Paolo Baldi, Petr Cintula,
Bjorn Lellmann, Revantha Ramanayake, Lara Spendier
[Please circulate. Apologies for any cross-postings.]
WoLLIC 2014
21st Workshop on Logic, Language, Information and Computation
September 1st to 4th, 2014
Valparaiso, Chile
SCIENTIFIC SPONSORSHIP
Interest Group in Pure and Applied Logics (IGPL)
The Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
European Association for Theoretical Computer Science (EATCS)
European Association for Computer Science Logic (EACSL)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)
ORGANISATION
Department of Computer Science, Universidad de Chile, Chile
Department of Computer Science, Pontificia Universidad Católica de Chile, Chile
Centro de Informática, Universidade Federal de Pernambuco, Brazil
HOSTED BY
Department of Informatics, Universidad Técnica Federico Santa María, Chile
CALL FOR PAPERS
WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twentieth WoLLIC will be held at the Universidad Técnica Federico Santa María, from September 1st to 4th, 2014. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).
PAPER SUBMISSION
Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2014 EasyChair website. (Please go to http://wollic.org/wollic2014/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Mar 24, 2014, and the full paper by Mar 28, 2014 (firm date). Notifications are expected by May 2, 2014, and final papers for the proceedings will be due by May 15, 2014 (firm date).
PROCEEDINGS
The proceedings of WoLLIC 2014, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2014 issue of a scientific journal (to be confirmed).
INVITED SPEAKERS
Verónica Becher (U Buenos Aires)
Juha Kontinen (U Helsinki)
Aarne Ranta (U Gothenburg)
Kazushige Terui (U Kyoto)
Luca Viganò (King’s College London)
Thomas Wilke (U Kiel)
STUDENT GRANTS
ASL sponsorship of WoLLIC 2014 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2014). See http://www.aslonline.org/studenttravelawards.html for details.
IMPORTANT DATES
Mar 24, 2014: Paper title and abstract deadline
Mar 28, 2014: Full paper deadline
May 2, 2014: Author notification
May 15, 2014: Final version deadline (firm)
PROGRAMME COMMITTEE
Natasha Alechina (U Nottingham)
Eric Allender (Rutgers U)
Marcelo Arenas (PUC Chile)
Steve Awodey (CMU)
Julian Bradfield (U Edinburgh)
Xavier Caicedo (U de Los Andes)
Olivier Danvy (Aarhus U)
Ulrich Kohlenbach (Tech U Darmstadt) (CHAIR)
Marcus Kracht (U Bielefeld)
Michiel van Lambalgen (U Amsterdam)
Klaus Meer (Tech U Cottbus)
George Metcalfe (Bern U)
Dale Miller (INRIA Saclay / LIX)
Russell Miller (CUNY)
Sara Negri (U Helsinki)
Nicole Schweikardt (U Frankfurt)
(more to come)
STEERING COMMITTEE
Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Leonid Libkin, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira Ono, Ruy de Queiroz.
ORGANISING COMMITTEE
Pablo Barceló (Universidad de Chile) (Local chair)
Anjolina G. de Oliveira (U Fed Pernambuco)
Ruy de Queiroz (U Fed Pernambuco) (co-chair)
Juan Reutter (Pontificia Universidad Católica de Chile)
Cristián Riveros (Pontificia Universidad Católica de Chile)
FURTHER INFORMATION
Contact one of the Co-Chairs of the Organising Committee.
WEB PAGE
http://wollic.org/wollic2014/
$B3'MM!"(B
$B?t3XE*9=B$$K4p$E$/4X?t7?%W%m%0%i%_%s%08&5f$N%o!<%/%7%g%C%W(B MSFP
$B$N$40FFb$G$9!#(BETAPS'14$BJ;@_$G!:@Z$,6a$/$J$C$F$*$j$^$9$,!"(B
$B$<$REj9F$r$48!F$$/$@$5$$!#(B
$B$J$*!">7BT9V1i$N0l?M$O5~ETBg3X$N>!8T$5$s$G$9!#(B
-- $BIML>(B $B72GOBg3X(B
========================================================================
Fifth Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
12 April 2014, in Grenoble, France.
A satellite workshop of ETAPS 2014
http://www.cs.bham.ac.uk/~pbl/msfp2014/
The fifth 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 temporal logic?
Call-by-push-value without adjunctions? 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. The fourth
workshop was held in Tallinn, Estonia, as part of ETAPS 2012.
Important Dates:
================
Abstract 24 December 2013
Submission 31 December 2013
Notification 3 February 2014
Final version 10 February 2014
Workshop 12 April 2014
Invited Speakers:
=================
Bob Atkey
Shin-ya Katsumata, Kyoto Universty
Topics:
=======
Submissions are welcomed on, but by no means restricted to, topics such as:
* structured effectful computation
* structured recursion
* structured corecursion
* structured tree and graph operations
* structured syntax with variable binding
* structured datatype-genericity
* structured search
* structured representations of functions
* structured quantum computation
* structure directed optimizations
* structured types
* structure derived from programs and data
Program Committee:
==================
Andreas Abel, Chalmers and Gothenburg University
Neil Ghani, The University of Strathclyde
Makoto Hamana, Gunma University
Neelakantan R. Krishnaswami (co-chair), University of Birmingham
Paul Blain Levy (co-chair), University of Birmingham
Rasmus M$Bxg(Belberg, IT University of Copenhagen
Russell O'Connor, McMaster University
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, and
will be published under the auspices of EPTCS under a Creative Commons
license.
There is no specific page limit, but authors should strive for brevity.
The Second Asian Workshop on Philosophical Logic
12-13 April, 2014
Institute for Logic and Cognition
Sun Yat-Sen University
Guangzhou, China
All researchers working on various aspects of philosophical logic are cordially invited to submit their papers by the
submission deadline of January 20th, 2014. Authors should submit an (extended) abstract at least two pages but
no more than ten pages. Papers must be submitted as PDF files and sent to liuhu2(a)mail.sysu.edu.cn .
Each submission will be refereed.
DESCRIPTION OF THE CONFERENCE:
The Second Asian Workshop on Philosophical Logic will be held at Guangzhou, China, and is organized by
the Institute of Logic and Cognition, Sun Yat-sen University from 12th to 13th April, 2014.
The aim of the Workshop is to promote mutual understandings among researchers on logic working in Asian
countries, and to establish closer collaborations in future. The scope of the Workshop will cover:
philosophical logic, non-classical logics, algebraic logic, and their applications in computer science and
cognitive science.
IMPORTANT DATES:
Abstract submission deadline: January 20, 2014
Notification of authors: February 15, 2014
Conference: April 12-13, 2014
POST-CONFERENCE PUBLICATION:
All authors of papers presented at the conference will be encouraged to submit a full version to a post-conference
volume published by Springer at the book series "Logic in Asia". See http://www.springer.com/series/13080 .
All papers submitted to the post-conference proceedings will be refereed to high journal standards, and acceptance
as a presentation is no guarantee that the post-conference paper will be published. The details of the post-conference
proceedings will be announced later
COMMITTEE:
Chairs:
Shier Ju (Sun Yat-sen University, China)
Hiroakira Ono (JAIST, Japan)
Program Committee:
Wojciech Buszkowski (Adam Mickiewicz University, Poland)
Mihir Chakraborty (Jadavpur University, India)
Phan Minh Dung (Asian Institute of Technology, Thailand)
Fenrong Liu (Tsinghua University, China)
Jeremy Seligman (The University of Auckland, New Zealand)
Wen-fang Wang (National Yang Ming University, Taiwan, China)
Chin-mu Yang (National Taiwan University, Taiwan,China)
Xishun Zhao (Sun Yat-sen University, China)
Furthur information about the conference can be find here: http://logic.sysu.edu.cn/AWPL2014/
皆様:
以下の要領で名古屋数学基礎論セミナーを開催します。
奮って御参加下さい。
日時:12月13日(金) 15:30-
場所:名古屋大学 大学院情報科学研究科棟 1F 第2講義室
(http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でA4(3)の建物です。)
講演者:横山 啓太 (北陸先端科学技術大学院大学)
題:On the second-order categoricity of the natural number system
アブストラクト:
It is important in the foundations of mathematics that the natural
number system is characterizable as a system of 0 and a successor
function by second-order logic. In other words, the following
Dedekind's second-order categoricity theorem holds: every Peano system
(P,e,F) is isomorphic to the natural number system (N,0,S). In this
talk, I will investigate Dedekind's theorem and other similar
statements. We will first do reverse mathematics over RCA0, and then
weaken the base theory. This is a joint work with Stephen G. Simpson
and Leszek Kolodziejczyk.
皆様、
先ほど流しました研究集会の案内のメールで、ホームページのアドレスが間違っておりました。
正しいアドレスは
http://www.jaist.ac.jp/CTFM/CTFM2014/index.html
お詫びして訂正致します。
横山
************以下、再送**************
以下の要領で研究集会
Computability Theory and Foundations of Mathematics 2014
(2014年2月17日(月)〜2月20日(木),東京工業大学大岡山キャンパス)
を開催いたします.
invited speakers 等の情報については、近日中に下記のホームページにて公開致します。
http://www.jaist.ac.jp/CTFM/CTFM2014/index.html
12月15日より講演の募集を開始致しますので、宜しく参加・講演をご検討ください。
============================================================
Computability Theory and Foundations of Mathematics
(Tokyo Institute of Technology, Tokyo, Japan, February 17 - 20, 2014)
http://www.jaist.ac.jp/CTFM/CTFM2014/index.html
============================================================
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.
--------------------------------------------
Submission for Presentations:
December 15, 2013 -- January 15, 2014
--------------------------------------------
Organizing Committee:
Hajime Ishihara(JAIST)
Ryo Kashima(Tokyo Institute of Technology, local chair)
Sam Sanders (Ghent)
Stephen G. Simpson (Pennsylvania State)
Kazuyuki Tanaka (Tohoku, chair)
Keita Yokoyama (JAIST)
--------------------------------------------
Program Committee:
Kojiro Higuchi (Chiba)
Takayuki Kihara(JAIST)
Kenshi Miyabe(Tokyo)
Takako Nemoto(JAIST)
Sam Sanders (Ghent)
Takeshi Yamazaki (Tohoku)
Keita Yokoyama (JAIST, chair)
Keisuke Yoshii (Tohoku)
--------------------------------------------
どうぞよろしくお願い致します。
横山啓太
--
Keita Yokoyama
y-keita(a)jaist.ac.jp
皆様、
以下の要領で研究集会
Computability Theory and Foundations of Mathematics 2014
(2014年2月17日(月)〜2月20日(木),東京工業大学大岡山キャンパス)
を開催いたします.
invited speakers 等の情報については、近日中に下記のホームページにて公開致します。
http://www.jaist.ac.jp/CTFM/temp/CTFM2014/index.html
12月15日より講演の募集を開始致しますので、宜しく参加・講演をご検討ください。
============================================================
Computability Theory and Foundations of Mathematics
(Tokyo Institute of Technology, Tokyo, Japan, February 17 - 20, 2014)
http://www.jaist.ac.jp/CTFM/temp/CTFM2014/index.html
============================================================
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.
--------------------------------------------
Submission for Presentations:
December 15, 2013 -- January 15, 2014
--------------------------------------------
Organizing Committee:
Hajime Ishihara(JAIST)
Ryo Kashima(Tokyo Institute of Technology, local chair)
Sam Sanders (Ghent)
Stephen G. Simpson (Pennsylvania State)
Kazuyuki Tanaka (Tohoku, chair)
Keita Yokoyama (JAIST)
--------------------------------------------
Program Committee:
Kojiro Higuchi (Chiba)
Takayuki Kihara(JAIST)
Kenshi Miyabe(Tokyo)
Takako Nemoto(JAIST)
Sam Sanders (Ghent)
Takeshi Yamazaki (Tohoku)
Keita Yokoyama (JAIST, chair)
Keisuke Yoshii (Tohoku)
--------------------------------------------
どうぞよろしくお願い致します。
横山啓太
--
Keita Yokoyama
y-keita(a)jaist.ac.jp
$B$_$J$5$^(B
$BO@M}3X4X78$G;K>e:GBg$N%$%Y%s%H(B"Vienna summer of logic"$B$N0lIt$G$9!#(B
CSL-LICS$B$HF|Dx$,$+$V$C$F$$$^$9$,!"$h$m$7$1$l$P$3$A$i$X$NEj9F$b$48!F$$/$@$5$$!#(B
$B>H0f(B
Joint 25th International Conference on
REWRITING TECHNIQUES AND APPLICATIONS
and 12th International Conference on
TYPED LAMBDA CALCULI AND APPLICATIONS
July 14–17, 2014, Vienna, Austria
http://vsl2014.at/rta-tlca
======================================
IMPORTANT DATES
Abstract submission: January 28, 2014
Notification: April 9, 2014
Paper submission: February 4, 2014
Final version: April 29, 2014
Rebuttal period: March 19–21, 2014
======================================
SUBMISSION and PUBLICATION
---------------------------
Submissions presenting original work are expected at
https://www.easychair.org/conferences/?conf=rtatlca2014.
They should be at most 15 pages (10 for system descriptions) and follow
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.
The proceedings will be published in the LNCS Advanced Research in
Computing and Software Science series of Springer. One author of each
accepted paper is expected to present it at the conference.
Topics
------
This joint RTA and TLCA conference is the major forum for the presentation of research on all
aspects of rewriting and typed lambda-calculi. Areas of interest include but are not limited to:
- Foundations: string rewriting; term rewriting; graph rewriting; lambdacalculi; higher-order
rewriting; binding techniques; constrained rewriting and deduction; categorical and infinitary
rewriting; stochastic rewriting; net rewriting; Petri nets; higher-dimensional rewriting; process
calculi; explicit substitution; tree automata; confluence; termination; complexity; modularity.
- Algorithmic aspects and implementation: strategies; matching; unification; anti-unification;
narrowing; constraint solving; theorem proving; completion techniques; implementation techniques;
parallel execution; certification of rewriting properties; abstract machines; automated
(non)termination and confluence provers; automated complexity analysis; SMT solving; system
descriptions.
- Logic: proof theory; natural deduction; sequent calculi; proof assistants; cut elimination and
normalization; propositions as types; linear logic and proof nets; equational logic; rewriting
logic; rewriting calculi; proof checking; reasoning about programming languages and logics;
homotopy type theory;
type-theoretic aspects of complexity; implicit computational complexity.
- Types: dependent types; polymorphism; intersection types and related approaches; subtyping; type
inference and type checking; types in databases.
- Semantics: denotational semantics; operational semantics; game semantics; realisability; domain
theory; categorical models; universal algebra.
- Programming: foundational aspects of functional programming, object oriented programming, and
other programming paradigms; flow analysis
of higher-type computation; program equivalence; program transformation;
program optimization; program refactoring; rewriting models of programs;
rule-based (functional and logic) programming; control operators; symbolic and algebraic
computation; system synthesis and verification; XML queries and transformations; types in program
analysis and verification; analysis of cryptographic protocols; systems biology; linguistics.
Programme Committee
--------------------
Andreas Abel (Gothenburg)
Beniamino Accattoli (Bologna)
Zena Ariola (Oregon)
Steffen van Bakel (Imperial College)
Pierre Clairambault (CNRS)
Ugo Dal Lago (Bologna)
Gilles Dowek (Inria)
Santiago Escobar (Valencia)
Amy Felty (Ottawa)
Maribel Fernandez (King$B!G(Bs college)
Adria Gascon (SRI International)
Jeroen Ketema (Imperial College)
Christopher Lynch (Clarkson)
Masahito Hasegawa (Kyoto)
Olivier Hermant (MINES ParisTech)
Paul-Andre Mellies (CNRS)
Alexandre Miquel (UdelaR)
Cesar Munoz (NASA)
Vivek Nigam (Para$(D)E(Bba)
Luke Ong (Oxford)
Brigitte Pientka (McGill)
Femke van Raamsdonk (Amsterdam)
Jakob Rehof (Dortmund)
David Sabel (Frankfurt)
Gernot Salzer (Wien)
Sylvain Salvati (Inria)
Aleksy Schubert (Warszawa)
Peter Selinger (Dalhousie)
Paula Severi (Leicester)
Christian Sternagel (JAIST)
Kazushige Terui (Kyoto)
Mateu Villaret (Girona)
Fer-Jan de Vries (Leicester)
Harald Zankl (Innsbruck)
Programme Chair
---------------
Gilles Dowek
Conference Chair
----------------
Gernot Salzer
------------------------------------------
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/
$B$_$J$5$^(B
$B1"7W;;NLM}O@$N%o!<%/%7%g%C%W$N$40FFb$r$5$;$F$$$?$@$-$^$9!#(B
$B1"7W;;NL$H$$$&$H$+$J$j8BDj$5$l$?OCBj$G$9$,(B
$BO@M}$d%W%m%0%i%_%s%08@8l$H7W;;NLMm$_$NOC$J$i$"$kDxEY<u$1F~$l$F$/$l$k5$$5$/$J%o!<%/%7%g%C%W$G$9!#(B
$B$J$*!":#G/EY$OElBg$N2OB<>4@1@h@8$,>7BT9V1i$r$5$l$^$9!#(B
$B$h$m$7$1$l$P$<$REj9F!&;22C$r$48!F$$/$@$5$$!#(B
$B>H0f(B
DICE 2014
Fifth Workshop on Developments in Implicit Computational Complexity
====================================================================
http://dice14.tcs.ifi.lmu.de
Grenoble, France
April 5-6, 2014
(a satellite event of ETAPS 2014)
Invited Speakers
-----------------
* Akitoshi Kawamura (University of Tokyo)
* Georg Moser (University of Innsbruck)
Important Dates
----------------
* Abstract Submission: January 5, 2014
* Notification: January 20, 2014
* Final version: February 10, 2014
Scope
------
The area of Implicit Computational Complexity (ICC) has grown from
several proposals for using logic and formal methods to provide
languages for complexity-bounded computation (e.g. PTIME, LOGSPACE
computation). Its aim is to study computational complexity without
reference to external measuring conditions or particular machine
models, but only in terms of language restrictions or
logical/computational 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 connects both to the study of complexity classes and to
static program analysis. The workshop is 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
* theoretical foundations of program complexity analysis
* application of implicit complexity to security
Submission
-----------
Authors are invited to submit an extended abstract of up to 5 pages.
Accepted abstracts will be presented at the workshop. Submissions will
be judged on originality, relevance, interest and clarity. Preference
will be given to abstracts describing work (including work in
progress) that has not been published elsewhere before the workshop.
Any previous publication or submission of submitted work should be
clearly indicated in the submission. The workshop will not have
formal proceedings and is not intended to preclude later publication
at another venue.
Abstracts should be written in English and can be submitted in PDF
form to the DICE 2014 EasyChair page:
https://www.easychair.org/account/signin.cgi?conf=dice2014
Submissions of abstracts by PC members are allowed and encouraged.
Program Committee
------------------
* Martin Avanzini (University of Innsbruck)
* Amir Ben-Amram (Tel-Aviv Academic College)
* Pierre Clairambault (CNRS & ENS Lyon)
* Daniel de Carvalho (Datalogisk Institut, K(IC8(Bbenhavns Universitet)
* David Nowak (CNRS & Lille 1 University)
* Michele Pagani (LIPN $Bc`(B Universit(IC)(B de Paris 13)
* Romain P(IC)(Bchoux (Universit(IC)(B de Lorraine)
* Brian Redmond (Grande Prairie Regional College, Canada)
* Ulrich Sch(IC6(Bpp (LMU Munich) (Chair)
* Kazushige Terui (RIMS, Kyoto University)
Steering Committee
-------------------
* Patrick Baillot (ENS Lyon, CNRS)
* Ugo Dal Lago (Universit(IC(B di Bologna)
* Martin Hofmann (Ludwig-Maximilians-Universit(IC$(Bt M(IC<(Bnchen)
* Jean-Yves Marion (Loria - INPL Nancy)
* Simona Ronchi Della Rocca (Universit(IC(B di Torino)
------------------------------------------
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/
山形@産総研です。
皆様、下記のような論文募集が出ております。形式手法などとも関係深いワークショップですので、投稿をご検討いただければ幸いです。(同様のCFPを重複して受け取られた方はご容赦下さい)
==================================================
3rd International Workshop on
Engineering Safety and Security Systems
May 12, 2014, Singapore
Co-located with FM 2014 in Singapore, May 12-26, 2014
More information:
http://pat.sce.ntu.edu.sg/esss14/
===================================================
Important dates
-----------------
* February 10th, 2014: Submission deadline
* March 17th, 2014: Notification of acceptance/rejection
* May 12th, 2014: 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=esss2014.
We invite two types of submissions:
--Regular papers (up to 15 pages) describing original and unpublished
work within the scope of the workshop.
--Short papers (up to 6 pages) describing work in progress or less
mature results.
Case studies and tool papers are welcome as well. All submissions must
be prepared in LATEX using the EPTCS macro package.
The final versions of accepted regular and short papers will be
published as a volume of Electronic Proceedings in Theoretical
Computer Science (EPTCS). Furthermore, authors of a selection of the
accepted papers will be invited to submit an extended version of their
articles to a special issue of a high-quality journal, after the
workshop. 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
Toalue Chen, Middelsex University, UK
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/
*** Apologies for cross-postings ****
AiML-2014: CALL FOR PAPERS
10th INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC,
GRONINGEN, 5-8 AUGUST, 2014
http://www.philos.rug.nl/AiML2014/
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-2014 is the tenth 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.
INVITED SPEAKERS:
Franz Baader (TU Dresden, Germany)
Stephane Demri (New York University, US & CNRS, France)
Joseph Halpern (Cornell University, US)
Sara Negri (University of Helsinki, Finland)
Frank Wolter (University of Liverpool, UK)
PAPER SUBMISSIONS
There will be two types of submissions to AiML-2014:
(1) Full papers for publication in the proceedings and presentation at the conference.
(2) Short presentations intended for presentation at the conference
but not for the published proceedings.
Both types of papers should be submitted electronically using the
EasyChair submission page at
https://www.easychair.org/account/signin.cgi?conf=aiml2014
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-2014 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 that are provided on the AiML-2014 website
http://www.philos.rug.nl/AiML2014/
We also ask authors of full papers to submit the abstract in plain text via EasyChair by 14 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 give short presentations
(of up to 15 minutes) on them.
IMPORTANT DATES
Abstracts of full papers submission deadline: 14 March 2014
Full papers submission deadline: 21 March 2014
Full papers acceptance notification: 2 May 2014
Short presentations submission deadline: 12 May 2014
Short presentations acceptance notification: 2 June 2014
Final version of full papers and short presentations due: 9 June 2014
Conference: 5-8 August, 2014.
LOCAL ORGANIZING COMMITTEE
Dave Gilbert
Barteld Kooi
Bouke Kuijer
Paolo Maffezioli
Allard Tamminga
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Alexandru Baltag (ILLC, University of Amsterdam, The Netherlands)
Nick Bezhanishvili (Utrecht University, The Netherlands)
Patrick Blackburn (Roskilde University, Denmark)
Hans van Ditmarsch (LORIA, France)
David Fernández-Duque (ITAM, Mexico)
Melvin Fitting (Lehman College, CUNY, USA)
Mai Gehrke (LIAFA, Université Paris Diderot, France)
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Rob Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Guido Governatori (NICTA Queensland, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Rosalie Iemhoff (Utrecht University, The Netherlands)
Roman Kontchakov (Birkbeck College London, UK)
Barteld Kooi (University of Groningen)
Marcus Kracht (Universität Bielefeld, Germany)
Alexander Kurz (University of Leicester, UK)
Carsten Lutz (Universität Bremen, Germany)
Jakub Michaliszyn (Imperial College London, UK)
Larry Moss (Indiana University, USA)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Revantha Ramanayake (Technical University of Vienna)
Mark Reynolds (University of Western Australia)
Vladimir Rybakov (Manchester Metropolitan University, UK)
Renate Schmidt (University of Manchester, UK)
Jeremy Seligman (University of Auckland, New Zealand)
Ilya Shapirovsky (Institute for Information Transmission Problems, Moscow, Russia)
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)
Michael Zakharyaschev (Birkbeck College London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Rajeev Gore (The Australian National University, Australia)
Agi Kurucz (King's College London, UK)
FURTHER INFORMATION. Please see http://www.philos.rug.nl/AiML2014
ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs,
sent to aiml2014(a)easychair.org
みなさま,
Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。
どうぞふるってご参加ください。
問い合わせ先:
東条 敏
北陸先端科学技術大学院大学 情報科学研究科
e-mail: tojo(a)jaist.ac.jp
------------------------------
-----------------
* JAIST Logic Seminar Series *
Date: Thursday 21 November, 2013, 15:10--16:40
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Robert A. Kowalski (Imperial College London)
Title: Towards a Logic-based Framework for Computing
(Joint work with Fariba Sadri)
Abstract:
In this talk, I present a logic-based, framework for Computing,
inspired by artificial intelligence, but scaled down for practical
database and programming applications. Computation in the framework is
viewed as the task of generating a sequence of state transitions, with
the purpose of making an agent’s goals all true. States are
represented by sets of atomic sentences (or facts), representing the
values of program variables, tuples in a coordination language, facts
in relational databases, or Herbrand models.
In the model-theoretic semantics of the framework, the
entire sequence of states and events is contained in a single
model-theoretic structure, by associating time stamps with facts and
events. But in the operational semantics, facts are updated
destructively, without time stamps. We show that the model generated
by destructive updates is identical to the model generated by
reasoning with facts containing time stamps. We also extend the model
with intentional predicates and composite event predicates defined by
logic programs containing conditions in first-order logic, which query
the current state.
Speaker's bio:
Professor Robert A. Kowalski (Emeritus Professor and Distinguished
Research Fellow) at Imperial College London.
Robert Kowalski studied at the University of Chicago, the University
of Bridgeport, Stanford University, the University of Warsaw, and the
University of Edinburgh, where he completed his PhD in 1970.
Kowalski has been an advisor to the UNDP Knowledge Based Systems
Project in India and to DFKI, the German Institute for Artificial
Intelligence. He co-ordinated the European Community Basic Research
Project, Compulog, and was the founder of the European Compulog
Network of Excellence. Since 2009, he has been an advisor to the
Department of Immunization, Vaccines and Biologicals, of the World
Health Organization in Geneva.
Kowalski is a Fellow of the Association for the Advancement of
Artificial Intelligence, the European Co-ordinating Committee for
Artificial Intelligence, and the Association for Computing Machinery.
He received the IJCAI (International Joint Conference of Artificial
Intelligence) award for Research Excellence in 2011.
--
Professor Hajime Ishihara
School of Information Science
Japan Advanced Institute of Science and Technology
1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan
Tel: +81-761-51-1206
Fax: +81-761-51-1149
ishihara(a)jaist.ac.jp
http://www.jaist.ac.jp/~ishihara
Dear all,
This coming Friday we have Ugo Dal Lago (Bologna) and
Paul-Andre Mellies (Paris VII) visiting us in U Tokyo and making
talks. Feel free to join us. See you there!
Best regards,
Ichiro Hasuo
http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar
------------------------------
Fri 8 November 2013, 10:00-12:00
Paul-Andre Mellies <http://www.pps.jussieu.fr/~mellies/> (U. Paris VII),
What a geometry of reasoning would look like?
理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html
Access: http://www-mmm.is.s.u-tokyo.ac.jp/
If one proceeds by analogy with mathematical physics, it is natural to
inquire
the geometric (rather than simply symbolic) nature of logical reasoning.
In this introductory talk, I will describe how this question may be
investigated
starting from a series of recent advances at the converging point of proof
theory
and of programming language semantics. In particular, I will explain how
a careful study of linear continuations, the most elementary mechanism
common to proofs and to programs, enables one to evacuate the historical
divide
between classical and constructive logic, and reveals the existence
of a logical pulsation which regulates reasoning and whose geometry
is related to well-known structures in mathematical physics.
Ugo Dal Lago <http://www.cs.unibo.it/~dallago/> (U. Bologna),
Applicative Bisimulation for Probabilistic Lambda-Calculus
理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html
Access: http://www-mmm.is.s.u-tokyo.ac.jp/
<http://www-mmm.is.s.u-tokyo.ac.jp/>
We study bisimulation and context equivalence in a probabilistic
lambda-calculus. Firstly, we show a technique for proving congruence of
probabilistic applicative bisimilarity. While the technique follows Howe's
method, some of the technicalities are quite different, relying on
non-trivial "disentangling" properties for sets of real numbers. We then
analyze the impact the employed notion of reduction has on
full-abstraction, giving somewhat surprising results in the call-by-value
case. We finally give another unexpected result about the discriminating
power of probabilistic contexts on pure lambda-terms.
皆様
Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。
どうぞふるってご参加ください。
問い合わせ先:
東条 敏
北陸先端科学技術大学院大学 情報科学研究科
e-mail: tojo(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
Date: Thursday 21 November, 2013, 15:10--16:40
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Robert A. Kowalski (Imperial College London)
Title: Towards a Logic-based Framework for Computing
(Joint work with Fariba Sadri)
Abstract:
In this talk, I present a logic-based, framework for Computing,
inspired by artificial intelligence, but scaled down for practical
database and programming applications. Computation in the framework is
viewed as the task of generating a sequence of state transitions, with
the purpose of making an agent’s goals all true. States are
represented by sets of atomic sentences (or facts), representing the
values of program variables, tuples in a coordination language, facts
in relational databases, or Herbrand models.
In the model-theoretic semantics of the framework, the
entire sequence of states and events is contained in a single
model-theoretic structure, by associating time stamps with facts and
events. But in the operational semantics, facts are updated
destructively, without time stamps. We show that the model generated
by destructive updates is identical to the model generated by
reasoning with facts containing time stamps. We also extend the model
with intentional predicates and composite event predicates defined by
logic programs containing conditions in first-order logic, which query
the current state.
Speaker's bio:
Professor Robert A. Kowalski (Emeritus Professor and Distinguished
Research Fellow) at Imperial College London.
Robert Kowalski studied at the University of Chicago, the University
of Bridgeport, Stanford University, the University of Warsaw, and the
University of Edinburgh, where he completed his PhD in 1970.
Kowalski has been an advisor to the UNDP Knowledge Based Systems
Project in India and to DFKI, the German Institute for Artificial
Intelligence. He co-ordinated the European Community Basic Research
Project, Compulog, and was the founder of the European Compulog
Network of Excellence. Since 2009, he has been an advisor to the
Department of Immunization, Vaccines and Biologicals, of the World
Health Organization in Geneva.
Kowalski is a Fellow of the Association for the Advancement of
Artificial Intelligence, the European Co-ordinating Committee for
Artificial Intelligence, and the Association for Computing Machinery.
He received the IJCAI (International Joint Conference of Artificial
Intelligence) award for Research Excellence in 2011.
--
Professor Hajime Ishihara
School of Information Science
Japan Advanced Institute of Science and Technology
1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan
Tel: +81-761-51-1206
Fax: +81-761-51-1149
ishihara(a)jaist.ac.jp
http://www.jaist.ac.jp/~ishihara