logic-mlの皆様,
東北大学の松田です.
複数受け取られた場合はご容赦ください.
9月5〜7日にイギリスのエジンバラで開催される,
宣言的プログラミングに関する国際会議 PPDP 2016 の
論文募集のご案内をお送りいたします.
どうぞ論文の投稿をご検討いただけますと幸いです.
======================================================================
Call for papers
18th International Symposium on
Principles and Practice of Declarative Programming
PPDP 2016
Special Issue of Science of Computer Programming (SCP) -tentative-
Edinburgh, UK, September 5-7, 2016
(co-located with LOPSTR and SAS)
http://ppdp16.webs.upv.es/
======================================================================
SUBMISSION DEADLINE: 9 MAY (abstracts) / 16 MAY (papers)
----------------------------------------------------------------------
INVITED SPEAKERS
Elvira Albert, Complutense University of Madrid, Spain
----------------------------------------------------------------------
PPDP 2016 is a forum that brings together researchers from the
declarative programming communities, including those working in the
logic, constraint and functional programming paradigms, but also
embracing languages, database languages, and knowledge representation
languages. The goal is to stimulate research in the use of logical
formalisms and methods for specifying, performing, and analyzing
computations, including mechanisms for mobility, modularity,
concurrency, object-orientation, security, verification and static
analysis. Papers related to the use of declarative paradigms and tools
in industry and education are especially solicited. Topics of interest
include, but are not limited to
* Functional programming
* Logic programming
* Answer-set programming
* Functional-logic programming
* Declarative visual languages
* Constraint Handling Rules
* Parallel implementation and concurrency
* Monads, type classes and dependent type systems
* Declarative domain-specific languages
* Termination, resource analysis and the verification of declarative programs
* Transformation and partial evaluation of declarative languages
* Language extensions for security and tabulation
* Probabilistic modeling in a declarative language and modeling reactivity
* Memory management and the implementation of declarative systems
* Practical experiences and industrial application
This year the conference will be co-located with the 26th Int'l Symp.
on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) and
the 23rd Static Analysis Symposium (SAS 2016).
The conference will be held in Edinburgh, UK. Previous symposia were
held at Siena (Italy), Canterbury (UK), Madrid (Spain), Leuven
(Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal),
Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal),
Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy),
Montreal (Canada), and Paris (France). You might have a look at the
contents of past PPDP symposia, http://sites.google.com/site/ppdpconf/
Papers must describe original work, be written and presented in
English, and must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal,
conference, or workshop with refereed proceedings. Work that already
appeared in unpublished or informally published workshop proceedings
may be submitted (please contact the PC chair in case of questions).
After the symposium, a selection of the best papers will be invited to
extend their submissions in the light of the feedback solicited at the
symposium. The papers are expected to include at least 30% extra
material over and above the PPDP version. Then, after another round of
reviewing, these revised papers will be published in a special issue
of SCP with a target publication date by Elsevier of 2017 (tentative).
Important Dates
Abstract submission: 9 May, 2016
Paper submission: 16 May, 2016
Notification: 20 June, 2016
Final version of papers: 17 July, 2016
Symposium: 5-7 September, 2016
Authors should submit an electronic copy of the full paper in
PDF. Papers should be submitted to the submission website for PPDP
2016. Each submission must include on its first page the paper title;
authors and their affiliations; abstract; and three to four
keywords. The keywords will be used to assist the program committee in
selecting appropriate reviewers for the paper. Papers should consist
of the equivalent of 12 pages under the ACM formatting
guidelines. These guidelines are available online, along with
formatting templates or style files. Submitted papers will be judged
on the basis of significance, relevance, correctness, originality, and
clarity. They should include a clear identification of what has been
accomplished and why it is significant. Authors who wish to provide
additional material to the reviewers beyond the 12-page limit can do
so in clearly marked appendices: reviewers are not required to read
such appendices.
Program Committee
Sandra Alves, University of Porto, Portugal
Zena M. Ariola, University of Oregon, USA
Kenichi Asai, Ochanomizu University, Japan
Dariusz Biernacki, University of Wroclaw, Poland
Rafael Caballero, Complutense University of Madrid, Spain
Iliano Cervesato, Carnegie Mellon University
Marina De Vos, University of Bath, UK
Agostino Dovier, Universita degli Studi di Udine, Italy
Maribel Fernandez, King's College London, UK
John Gallagher, Roskilde University, Denmark, and IMDEA Software
Institute, Spain
Michael Hanus, CAU Kiel, Germany
Martin Hofmann, LMU Munchen, Germany
Gerda Janssens, KU Leuven, Belgium
Kazutaka Matsuda, Tohoku University, Japan
Fred Mesnard, Universite de la Reunion, France
Emilia Oikarinen, Finnish Institute of Occupational Health, Finland
Alberto Pettorossi, Universita di Roma Tor Vergata, Italy
Tom Schrijvers, KU Leuven, Belgium
Josep Silva, Universitat Politecnica de Valencia, Spain
Perdita Stevens, University of Edinburgh, UK
Peter Thiemann, Universitat Freiburg, Germany
Frank D. Valencia, CNRS-LIX Ecole Polytechnique de Paris, France,
and Pontificia Universidad Javeriana de Cali, Colombia
German Vidal, Universitat Politecnica de Valencia, Spain (Program Chair)
Stephanie Weirich, University of Pennsylvania, USA
Program Chair
German Vidal
Universitat Politecnica de Valencia
Camino de Vera, S/N
E-46022 Valencia, Spain
Email: gvidal(a)dsic.upv.es
Symposium Chair
James Cheney
Informatics Forum 5.29
Laboratory for Foundations of Computer Science
School of Informatics
10 Crichton Street, Edinburgh EH8 9AB, Scotland, UK
Email: jcheney(a)inf.ed.ac.uk
----------------------------------------------------------------------
皆様、
6月にポルトガルで開催されるintersection typesに関するワークショップITRS 2016の
論文募集案内をお送りします。
RTAとTLCAが合併してできたFSCD 2016の併設ワークショップです。
皆様からの論文投稿をお待ちしております
小林直樹
東京大学大学院情報理工学系研究科コンピュータ科学専攻
〒113-0033 東京都文京区本郷7-3-1
Phone: 03-5841-4124
Fax: 03-5841-4124
email: koba(a)is.s.u-tokyo.ac.jp
INTERSECTION TYPES AND RELATED SYSTEMS (ITRS 2016)
http://www-kb.is.s.u-tokyo.ac.jp/ITRS2016/
Call for Papers
===============
ITRS 2016 (the Eighth Workshop on Intersection Types and Related
Systems) will be held on 25 June, 2016, in Porto, in affiliation with
FSCD 2016 (1st International Conference on Formal Structures for
Computation and Deduction, http://fscd2016.dcc.fc.up.pt/).
ITRS 2016 workshop aims to bring together researchers working on both
the theory and practical applications of systems based on intersection
types and related approaches.
Possible topics for submitted papers include, but are not limited to:
- Formal properties of systems with intersection types.
- Results for related systems, such as union types, refinement types, or singleton types.
- Applications to lambda calculus and similar systems.
- Applications to pi-calculus and similar systems.
- Applications to programming languages and program verification.
- Applications to other areas, such as database query languages and program extraction from proofs.
- Related approaches using behavioural/intensional types to characterize computational properties.
IMPORTANT DATES
Abstract submission: 28 March, 2016
Paper submission: 31 March, 2016
Author notification: 28 April, 2016
Final version: 29 May, 2016
Workshop: 26 June, 2016
SUBMISSION AND PUBLICATION
The submission is in two stages.
(1) Before the workshop, authors are invited to submit an extended
abstract (max. 10 pages) in PDF format through EasyChair
(https://easychair.org/conferences/?conf=itrs2016). Accepted papers will be
presented at the workshop and included in preliminary proceedings.
(2) After the workshop, authors of accepted papers will be invited to submit full versions,
which will be refereed for inclusion in post-proceedings (which we plan to publish in EPTCS).
PROGRAM COMMITTEE
Steffen van Bakel (Imperial College, UK)
Giuseppe Castagna (CNRS, Paris Diderot University, France)
Joshua Dunfield (University of British Columbia, Canada)
Naoki Kobayashi (University of Tokyo, Japan), chair
Jakob Rehof (University of Dortmund, Germany)
Simona Ronchi Della Rocca (University of Tulin, Italy)
Sylvain Salvati (INRIA Bordeaux, France)
Pawel Urzyczyn (University of Warsaw, Poland)
INFORMATION
For further information, please contact Naoki Kobayashi
Email: koba AT is DOT s DOT u-tokyo DOT ac DOT jp
(* Apologies for any cross-postings. *)
[New deadline 29 February 2016,
submission deadline extended by a week.
Consider contributing.]
==================================================================
CALL FOR CONTRIBUTIONS
22nd International Conference on Types for Proofs and Programs,
TYPES 2016
23-26 May 2016
Novi Sad, Serbia
http://www.types2016.uns.ac.rs <http://www.types2016.uns.ac.rs/>
BACKGROUND
The TYPES meetings are a forum to present new and on-going work in all
aspects of type theory and its applications, especially in formalized
and computer assisted reasoning and computer programming.
The TYPES areas of interest include, but are not limited to:
* Foundations of type theory and constructive mathematics;
* Homotopy type theory;
* Applications of type theory;
* Dependently typed programming;
* Industrial uses of type theory technology;
* Meta-theoretic studies of type systems;
* Proof assistants and proof technology;
* Automation in computer-assisted reasoning;
* Links between type theory and functional programming;
* Formalizing mathematics using type theory.
We encourage talks proposing new ways of applying type theory. In the
spirit of workshops, talks may be based on newly published papers, work
submitted for publication, but also work in progress.
INVITED SPEAKERS (NEW)
Simon Gay (University of Glasgow)
Dale Miller (INRIA Saclay & LIX École Polytechnique)
Simona Ronchi della Rocca (Università di Torino)
CONTRIBUTED TALKS
We solicit contributed talks based on extended abstracts/short papers of
2 pages prepared in LaTeX and formatted with easychair.cls. The submission
site is https://easychair.org/conferences/?conf=types2016.
Important Dates:
* submission of abstracts: 29 February 2016 (extended)
* notification of acceptance: 21 March 2016
* camera-ready version of abstracts: 11 April 2016
Camera-ready versions of the accepted contributions will be published
in an informal book of abstracts for distribution at the workshop.
POST-PROCEEDINGS
Similarly to earlier TYPES conferences, we intend to publish a
post-proceedings volume in the Leibniz International Proceedings in
Informatics (LIPiCS) series. Submission to that volume would be open for
everyone. Tentative submission deadline: October 2016.
VENUE
The conference will be held at the University of Novi Sad, University
Central Building.
SATELLITE EVENT: The 9th Workshop Computational Logic and Applications -
CLA 2016 will be held on May 27-28, 2016.
PROGRAMME COMMITTEE
Thorsten Altenkirch (University of Nottingham)
Zena Ariola (University of Oregon)
Andrej Bauer (University of Ljubljana)
Marc Bezem (University of Bergen)
Malgorzata Biernacka (University of Wroclaw)
Edwin Brady (University of St Andrews)
Thierry Coquand (University of Gothenburg)
Jose Espirito Santo (University of Minho)
Ken-etsu Fujita (Gunma University)
Silvia Ghilezan (University of Novi Sad) (co-chair)
Hugo Herbelin (INRIA Paris-Rocquencourt)
Jelena Ivetic (University of Novi Sad) (co-chair)
Marina Lenisa (University of Udine)
Elaine Pimentel (Federal University of Rio Grande do Norte)
Andrew Polonsky (University Paris Diderot)
Jakob Rehof (Technical University of Dortmund)
Claudio Sacerdoti Coen (University of Bologna)
Carsten Schürmann (IT University of Copenhagen)
Dieter Spreen (University of Siegen)
Wouter Swierstra (Utrecht University)
Nicolas Tabareau (INRIA)
Tarmo Uustalu (Tallinn University of Technology)
TYPES STEERING COMMITTEE
Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph
Matthes, Bengt Nordström, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu.
ABOUT TYPES
The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of
five EU funded networking projects. Since 2009, TYPES has been run as
an independent conference series. Previous TYPES meetings were held in
Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993),
Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998),
Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002),
Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006),
Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw
(2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015).
ORGANIZERS
University of Novi Sad
Faculty of Technical Sciences
Mathematical Institute SASA
CONTACT: types2016(a)uns.ac.rs <mailto:types2016@uns.ac.rs>
=================================================
(* Apologies for any cross-postings. *)
皆様,
講演会のご案内です.
http://www.cs.gunma-u.ac.jp/~fujita/research/20160229Seminar.html
どうぞお気軽にお立ち寄りください.
問い合わせ先:
群馬大学 藤田 憲悦
****************************************************************************************************
+++ Computer Science Seminar in Kiryu +++
Programme
Monday, February 29, 2016
14:00—15:30 Lecture room J3 (the building no. 6),
Kiryu campus, Gunma University
“Automating the First-Order Theory of Rewriting for Left-Linear
Right-Ground Rewrite Systems”
Professor Aart Middeldorp (University of Innsbruck, Austria)
Abstract:
The first-order theory of rewriting is decidable for finite left-linear
right-ground rewrite systems. We present a new tool that implements the
decision procedure, which is based on tree automata techniques, for this
theory. The tool offers the possibility to synthesize rewrite systems that
satisfy properties that are expressible in the first-order theory of
rewriting. In the talk, which is based on joint work with Franziska Rapp,
we explain the decision and synthesis algorithms and demonstrate the tool.
No knowledge of term rewriting is assumed.
************************************************************************************************************
Access to Kiryu campus, Gunma University:
http://www.st.gunma-u.ac.jp/other/14.html
Map of Kiryu campus:
http://www.st.gunma-u.ac.jp/other/13.html
For more information, please contact at the following \beta-normal form:
(\lambda X. fujitX(a)cs.gunmX-u.Xc.jp)a
(Ken-etsu Fujita, Gunma University).
----------------------------------------------------------------------------------------------------------
CALL FOR PAPERS
International Journal of Computational Linguistics (IJCL)
ISSN - 2180-1266
http://www.cscjournals.org/journals/IJCL/description.php
Computational linguistics is an interdisciplinary field dealing with the
statistical and/or rule-based modeling of natural language from a
computational perspective. Today, computational language acquisition stands
as one of the most fundamental, beguiling, and surprisingly open questions
for computer science.
International Journal of Computational Linguistics (IJCL) is a peer review
open access bi-monthly journal providing a scientific forum where computer
scientists, experts in artificial intelligence, mathematicians, logicians,
cognitive scientists, cognitive psychologists, psycholinguists,
anthropologists and neuroscientists can present research and experimental
studies. The journal publishes papers that describe state-of-the-art
techniques, scientific research studies and results in computational
linguistics in general but computational models, corpus linguistics,
computational theories, information retrieval and extraction, linguistics
modeling techniques, linguistics theories, machine translation, natural
language processing, quantitative linguistics, speech analysis and speech
recognition in particular.
IJCL invite linguistic specialists, researchers and scientists from
different domains to share their understanding and contributions towards
linguistics that set scientific objectives and demonstrate the operation of
new methods in the field of computational linguistics.
EDITORIAL BOARD MEMBERS
Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan)
Dr. Pascaline Merten - HEB-ISTI (Belgium)
Dr. Pawel Dybala - Otaru University of Commerce (Japan)
Dr. John Hanhong LI - (China)
Dr. Stephen Doherty - Dublin City University (Ireland)
LIST OF TOPICS
Comparative Surveys that Critique Previously Repor
Computational Linguistics
Computational Models
Computational Theories
Corpus Linguistics
Formal Linguistics-Theoretic and Grammar Induction
Information Retrieval and Extraction
Language Generation
Language Learning
Linguistics Modeling Techniques
Linguistics Theories
Machine Translation
Models of Language Change and its Effect on Lingui
Models that Address the Acquisition of Word-order
Models that Combine Linguistics Parsing
Models that Employ Statistical/probabilistic Gramm
Models that Employ Techniques from machine learnin
Natural Language Processing
Quantitative Linguistics
Speech Analysis/Synthesis
Speech Recognition/Understanding
Spoken Dialog Systems
Web Information Extraction/Mining
IMPORTANT DATES
Paper Submission - February 29, 2016
Author Notification - March 31, 2016
Issue Publication - April 2016
PAPER SUBMISSION DETAILS
In order to submit the paper, you need to register as author and then submit
the paper through Author Dashboard. It is also important to ensure that the
manuscript must be formatted as per IJCL Manuscript Preparation Guidelines.
For further information, please refer to the following information.
IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php
Submission Guidelines -
http://www.cscjournals.org/journals/IJCL/submission-guidelines.php
Register as Author - http://www.cscjournals.org/login.php
CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php
Call for EDITORS
International Journal of Computational Linguistics (IJCL) seeks applications
from enthusiastic researchers and scholars who can oversee and maintain the
editorial direction of the journal to ensure a steady flow of engaging and
thought-provoking original research publications.
IJCL is a peer-reviewed International journal dedicated to publishing an
open access original research, reports, and reviews. For future improvement
and development, IJCL particularly seeks editors who can continue the
enduring and ongoing editorial successes to next level and introduce the
journal profile to different libraries and research centers around the
globe. IJCL welcome applications from editors with strong academic
background and Internationally recognized reputation. Applicants with
significant publishing or reviewing experience will be preferred. To qualify
for the post of editorial board member (EBM), Associate Editor-in-Chief
(AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide
experience in academic/Industry/ research and international conferences.
For more information on editorial role & responsibilities, benefits &
privileges and application criteria to apply for editorial collaborations
with IJCL-CSC Journals, please refer to the following URLs.
Editors Guidelines -
http://www.cscjournals.org/editors/editors-guidelines.php
Call For Editors -
http://www.cscjournals.org/journals/IJCL/call-for-editors.php
Please do not hesitate to contact us at cscpress(a)cscjournals.org if you
require more information prior to submission. Our team is committed to
provide quick response and support from submission to final publication.
Sincerely
Editorial Board Members
International Journal of Computational Linguistics (IJCL)
Computer Science Journals (CSC Journals)
B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia
Phone: 00603 6204 5627
Fax: 00603 6204 5628
Url: http://www.cscjournals.org
こんにちは。愛媛大学の藤田です。
次回の松山TGSAセミナーの案内を転送します。
重複してお受け取りの場合はご寛恕を願います。
--
藤田 博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp>
愛媛大学 大学院理工学研究科 数理物質科学専攻
-------- Forwarded Message --------
Subject: 松山 TGSAセミナーのお知らせ(3月2日)
Date: Sat, 13 Feb 2016 11:35:12 +0000
From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp>
To: fujita.hiroshi.mh(a)ehime-u.ac.jp
CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp
皆様、
「Matsuyama Seminar on Topology, Geometry, Set Theory and their
Applications」(松山TGSAセミナー)のお知らせです。研究の背景、動機から
講演していただきますので、お気軽にご参加ください。
*****
第19回のセミナー
日時: 2016年3月2日(水) 16:30〜17:30
場所: 愛媛大学理学部2号館2階,大演習室 (201号室)
講演者: Alejandro Dorantes-Aldama (Universidad Nacional Autonoma de Mexico, Visiting Foreign Researcher of Ehime University)
(メキシコ国立自治大学・愛媛大学外国人客員研究員)
題目: Almost irresolvable spaces
Abstract: A topological space X is almost resolvable if X is the union of a countable
collection of subsets each of them with empty interior. We prove that under the Continuum Hypothesis, the existence of a measurable cardinal is equivalent to the existence of a Baire crowded ccc almost irresolvable T_1 space. We also prove that:
(1) Every crowded ccc space with cardinality less than the first weakly inaccessible cardinal is almost resolvable.
(2) If 2^{\omega} is less than the first weakly inaccessible cardinal, then every T_2 crowded ccc space is almost resolvable.
講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ
<dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。
以上、よろしくお願い申し上げます。
世話人(五十音順)
井上友喜
尾國新一
シャクマトフ ディミトリ
野倉嗣紀
平出耕一
平田浩一
藤田博司
山内貴光
---
ウェブページ: http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html
[Apologies for multiple copies]
===================================================
SYNTAX MEETS SEMANTICS (SYSMICS 2016)
===================================================
5-9 September 2016, Barcelona (Spain)
http://sysmics-16.iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=3JrhEPnWJhwDmPZQ96mbMm4AzZ8sc_ctIquEEEp-etY-za6EzjDTCAFodHRwOi8vc3lzbWljcy0xNi5paWlhLmNzaWMuZXMv>
***** (PRELIMINARY) CALL FOR ABSTRACTS *****
Scope
---------
Substructural logics are formal reasoning systems that refine
classical logic by weakening structural rules in a Gentzen-style
sequent calculus. Intuitionistic, many-valued, linear logics, are
typical examples. Traditionally, substructural logics have been
investigated using proof theoretic and algebraic methods. In recent
years, combined approaches have started to emerge. The programme of
the SYSMICS conference will focus on interactions between syntactic
and semantic methods in substructural logics. This open conference is
the first of a series of meetings planned in the SYSMICS RISE project
(http://logica.dmi.unisa.it/sysmics/ <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=qdlC0cxPfFZ_fCN0wUjwAcIRa-ScwOLHWRs6wFFw4f0-za6EzjDTCAFodHRwOi8vbG9naWNhLmRtaS51bmlzYS5pdC9zeXNtaWNzLw..>) during 2016-2019.
Featured topics
---------------------
Contributed talks can be on any topic related to substructural logic.
This includes, but is not limited to, the following areas:
* Algebraic structures in CS
* Algebraic logic
* Coalgebraic aspects of logic
* Categorical methods in logic
* Gentzen systems
* Lattice theory
* Lattices with operators
* Linear logic
* Mathematical fuzzy logic
* Non-classical logics
* Ordered algebraic structures
* Proofs and Types
* Stone-type dualities
* Topological semantics
Programme Committee
------------------------------
Stefano Aguzzoli (University of Milano)
Nick Bezhanishvili (University of Amsterdam)
Agata Ciabattoni (Vienna University of Technology)
Petr Cintula (Czech Academy of Sciences)
Pilar Dellunde (Autonomous University of Barcelona)
Brunella Gerla (University of Insubria)
Lluis Godo (CSIC - IIIA Barcelona)
Ramon Jansana (University of Barcelona)
Jan Kühr (University of Olomouc)
Antonio Ledda (University of Cagliari)
George Metcalfe (University of Bern)
Carles Noguera (Czech Academy of Sciences)
Luca Spada (University of Salerno, chair)
Organising Committee
------------------------------
Pilar Dellunde (Autonomous University of Barcelona)
Joan Gispert (University of Barcelona)
Ramon Jansana (University of Barcelona)
Lluis Godo, (CSIC - IIIA Barcelona, Chair)
Diego Valota (CSIC - IIIA Barcelona)
Dates
---------------------------
Deadline for submissions 30 April 2016
Notification of acceptance 30 May 2016
Conference dates 5-9 September 2016
Submissions
------------------------------
The Programme Committee accepts submissions of abstracts ranging from
2 to 4 pages. The abstracts should be formatted according to EasyChair
style, instructions can be found at
http://easychair.org/publications/easychair.zip <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=I3icUbodjNiO_GfCHFENkLALHlEA8BSgN_dIoQoFWlc-za6EzjDTCAFodHRwOi8vZWFzeWNoYWlyLm9yZy9wdWJsaWNhdGlvbnMvZWFzeWNoYWlyLnppcA..> .
Abstracts can be submitted at the following address:
https://easychair.org/conferences/?conf=sysmics2016 <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=cJ7bDbGAj3zV8a4bwPMz8F93-rTaMHzOPtpe4ELlaTc-za6EzjDTCAFodHRwczovL2Vhc3ljaGFpci5vcmcvY29uZmVyZW5jZXMvP2NvbmY9c3lzbWljczIwMTY.>
A short text-only abstract will also be requested during submission.
Expression of interest
------------------------------
Expressions of interests will be greatly appreciated, please fill in
the simple form on the conference web site under "Express Interest".
This will help the Organising Committee with their planning. You can
also opt-out from receiving future announcements by following the
instructions on the web site.
More Information
-----------------------
SYSMICS 2016 web site: http://sysmics-16.iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=3JrhEPnWJhwDmPZQ96mbMm4AzZ8sc_ctIquEEEp-etY-za6EzjDTCAFodHRwOi8vc3lzbWljcy0xNi5paWlhLmNzaWMuZXMv>
Use this site for updates on the program, invited speakers and local
information, including hotel accommodations, travel information and
registration.
Any queries regarding the conference should be sent to
sysmics-oc(a)iiia.csic.es <applewebdata://B943638A-7D3E-427F-AFE9-BACDAF841E21/redir.aspx?REF=tKqFlroc_eIKlpqFgMTlQ9Xf6dfQdHH2L4kOQ4Thdgk-za6EzjDTCAFtYWlsdG86c3lzbWljcy1vY0BpaWlhLmNzaWMuZXM.>.
(sorry for multiple copies)
AiML-2016: 2ND CALL FOR PAPERS
11TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
BUDAPEST, 29 AUGUST -- 2 SEPTEMBER 2016
http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/>
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 <http://www.aiml.net/>. AiML-2016 is the 11th 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.
PAPER SUBMISSIONS
There will be two types of submissions to AiML-2016:
(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://easychair.org/conferences/?conf=aiml16 <https://easychair.org/conferences/?conf=aiml16>
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-2016 will
be published by College Publications
http://www.collegepublications.co.uk <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 will be provided on the AiML-2016 website
http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> in due time.
We also ask authors of full papers to submit the abstract in plain
text via EasyChair by 10 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.
INVITED SPEAKERS INCLUDE:
Kit Fine (New York University, USA)
Sonja Smets (ILLC, Universiteit van Amsterdam)
Yde Venema (ILLC, Universiteit van Amsterdam)
Guram Bezhanishvili (New Mexico State University)
LOCAL ORGANIZING COMMITTEE
Tamas Bitai (Eotvos University, Budapest, Hungary)
Reka Markovich (Eotvos University, Budapest, Hungary)
Andras Mate (Eotvos University, Budapest, Hungary)
Péter Mekis (Eotvos University, Budapest, Hungary)
Attila Molnar (Eotvos University, Budapest, Hungary)
Gergely Szekely (Alfred Rényi Institute of Mathematics, Hungarian Academy of Sciences)
PROGRAMME COMMITTEE
Natasha Alechina (University of Nottingham)
Carlos Areces (FaMAF, Universidad Nacional de Córdoba)
Philippe Balbiani (IRIT, Toulouse, France)
Alexandru Baltag (FNWI ILLC)
Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Serenella Cerrito (Laboratoire IBISC, Evry France)
Stéphane Demri (LSV, CNRS, ENS Cachan)
Valeria de Paiva (Nuance, USA)
David Fernandez-Duque (Instituto Tecnológico Autónomo de México)
Melvin Fitting (Lehman College, CUNY, USA)
David Gabelaia (The Free University of Tbilisi, Tbilisi, Georgia)
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Valentin Goranko (Stockholm University)
Rajeev Gore (The Australian National University)
Andreas Herzig (IRIT, Toulouse, France)
Rosalie Iemhoff (Utrecht University)
Agi Kurucz (King's College London)
Roman Kuznets (TU Wien)
Martin Lange (University of Kassel, Germany)
Carsten Lutz (Universität Bremen)
Andras Mate (Eotvos University, Budapest, Hungary)
Angelo Montanari (University of Udine)
Larry Moss (Indiana University, USA)
Sara Negri (University of Helsinki)
Sergei Odintsov (Novosibirsk State University)
Hiroakira Ono (Japan Advanced Insitute of Science and Technology)
Mark Reynolds (The University of Western Australia)
Ilya Shapirovsky (Institute for the Information Transmission Problems)
Renate Schmidt (University of Manchester)
Valentin Shehtman (Institute for the Information Transmission Problems)
Viorica Sofronie-Stokkermans (Universitat Koblenz-Landau)
Thomas Studer (Universität Bern)
Rineke Verbrugge (Groningen, NL)
Heinrich Wansing (Ruhr University Bochum)
Michael Zakharyaschev (Birkbeck College London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow)
Stephane Demri (LSV, CNRS, ENS Cachan)
IMPORTANT DATES
Abstracts of full papers submission deadline: 10 March 2016
Full papers submission deadline: 17 March 2016
Full papers acceptance notification: 14 May 2016
Short presentations submission deadline: 16 May 2016
Short presentations acceptance notification: 30 May 2016
Final version of full papers and short presentations due: 8 June 2016
Conference: 29 August -- 2 September 2016
FURTHER INFORMATION. Please see http://phil.elte.hu/aiml2016/?page=call_for_papers <http://phil.elte.hu/aiml2016/?page=call_for_papers>
ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs,
sent to aiml16(a)easychair.org <mailto:aiml16@easychair.org>
皆様,
TYPES 2016のご案内をさせていただきます.
どうぞよろしくお願い致します.
群馬大学 藤田憲悦
--------------------------
(Apologies for multiple copies of this announcement. Please circulate.)
==================================================================
CALL FOR CONTRIBUTIONS
22nd International Conference on Types for Proofs and Programs,
TYPES 2016
23-26 May 2016
Novi Sad, Serbia
http://www.types2016.uns.ac.rs <http://www.types2016.uns.ac.rs/>
BACKGROUND
The TYPES meetings are a forum to present new and on-going work in all
aspects of type theory and its applications, especially in formalized
and computer assisted reasoning and computer programming.
The TYPES areas of interest include, but are not limited to:
* Foundations of type theory and constructive mathematics;
* Homotopy type theory;
* Applications of type theory;
* Dependently typed programming;
* Industrial uses of type theory technology;
* Meta-theoretic studies of type systems;
* Proof assistants and proof technology;
* Automation in computer-assisted reasoning;
* Links between type theory and functional programming;
* Formalizing mathematics using type theory.
We encourage talks proposing new ways of applying type theory. In the
spirit of workshops, talks may be based on newly published papers, work
submitted for publication, but also work in progress.
INVITED SPEAKERS (NEW)
Simon Gay (University of Glasgow)
Dale Miller (INRIA Saclay & LIX École Polytechnique)
Simona Ronchi della Rocca (Università di Torino)
CONTRIBUTED TALKS
We solicit contributed talks based on extended abstracts/short papers of
2 pages prepared in LaTeX and formatted with easychair.cls. The submission
site is https://easychair.org/conferences/?conf=types2016.
Important Dates:
* submission of abstracts: 22 February 2016
* notification of acceptance: 21 March 2016
* camera-ready version of abstracts: 11 April 2016
Camera-ready versions of the accepted contributions will be published
in an informal book of abstracts for distribution at the workshop.
POST-PROCEEDINGS
Similarly to earlier TYPES conferences, we intend to publish a
post-proceedings volume in the Leibniz International Proceedings in
Informatics (LIPiCS) series. Submission to that volume would be open for
everyone. Tentative submission deadline: October 2016.
VENUE
The conference will be held at the University of Novi Sad, University
Central Building.
SATELLITE EVENT: The 9th Workshop Computational Logic and Applications -
CLA 2016 will be held on May 27-28, 2016.
PROGRAMME COMMITTEE
Thorsten Altenkirch (University of Nottingham)
Zena Ariola (University of Oregon)
Andrej Bauer (University of Ljubljana)
Marc Bezem (University of Bergen)
Malgorzata Biernacka (University of Wroclaw)
Edwin Brady (University of St Andrews)
Thierry Coquand (University of Gothenburg)
Jose Espirito Santo (University of Minho)
Ken-etsu Fujita (Gunma University)
Silvia Ghilezan (University of Novi Sad) (co-chair)
Hugo Herbelin (INRIA Paris-Rocquencourt)
Jelena Ivetic (University of Novi Sad) (co-chair)
Marina Lenisa (University of Udine)
Elaine Pimentel (Federal University of Rio Grande do Norte)
Andrew Polonsky (University Paris Diderot)
Jakob Rehof (Technical University of Dortmund)
Claudio Sacerdoti Coen (University of Bologna)
Carsten Schürmann (IT University of Copenhagen)
Dieter Spreen (University of Siegen)
Wouter Swierstra (Utrecht University)
Nicolas Tabareau (INRIA)
Tarmo Uustalu (Tallinn University of Technology)
TYPES STEERING COMMITTEE
Marc Bezem, Herman Geuvers (chair), Hugo Herbelin, Zhaohui Luo, Ralph
Matthes, Bengt Nordström, Andrew Polonsky, Aleksy Schubert, Tarmo Uustalu.
ABOUT TYPES
The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of
five EU funded networking projects. Since 2009, TYPES has been run as
an independent conference series. Previous TYPES meetings were held in
Antibes (1990), Edinburgh (1991), Båstad (1992), Nijmegen (1993),
Båstad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998),
Lökeberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002),
Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006),
Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw
(2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015).
ORGANIZERS
University of Novi Sad
Faculty of Technical Sciences
Mathematical Institute SASA
CONTACT: types2016(a)uns.ac.rs <mailto:types2016@uns.ac.rs>
=================================================
皆様、(重複して受け取られた場合は、御容赦ください。)
国際会議 FLOPS2016 -- Functional and Logic Programming -- の
early registration の締切が 2/10 (水) となりましたので,
参加募集を,再度お送りします。
FLOPS2016 は 関数型および論理型プログラミングに関する国際会議で,
PPL2016 の直前の 3/4-6 に、比較的近い場所で開催されます。今回の
プログラムは,上田和紀先生と Atze Dijkstra さんによる招待講演,
3件のチュートリアル,そして一般講演から構成されていて,この分野
の最新の情報を入手することができます.
多くの皆様の参加をお待ちしています。
---------------------------------------------------------------------
Call for Participation
---------------
FLOPS 2016: 13th International Symposium on Functional and Logic Programming
March 4-6, 2016, Kochi, Japan
http://www.info.kochi-tech.ac.jp/FLOPS2016/
Early registration deadline is Monday, Feb 10, 2016. (extended)
FLOPS aims to bring together practitioners, researchers and
implementers of the declarative programming, to discuss mutually
interesting results and common problems: theoretical advances, their
implementations in language systems and tools, and applications of
these systems in practice. The scope includes all aspects of the
design, semantics, theory, applications, implementations, and teaching
of declarative programming. FLOPS specifically aims to
promote cross-fertilization between theory and practice and among
different styles of declarative programming.
In addition to the presentations of regular research papers, the FLOPS
program includes tutorials, as well as the poster/demo session for
demonstrating the tools and systems described during the talks and for
presenting works-in-progress and getting the feedback.
FLOPS has established a Best Paper award. The winner will be
announced at the symposium.
INVITED TALKS
Kazunori Ueda
The exciting time and hard-won lessons of the Fifth Generation Computer Project
Atze Dijkstra
UHC: Coping with Compiler Complexity
TUTORIALS
Andreas Abel, on Agda
Atze Dijkstra, on Attribute Grammars
Neng-Fa Zhou, on programming in Picat
PROGRAMME
Mar 4
09:45 Opening, best-paper award
10:00 Invited talk (1h10)
Kazunori Ueda:
The exciting time and hard-won lessons of the Fifth Generation Computer Project
11:10 Break (0h30)
11:40 Sess 1: From proofs to programs (2x0h30)
Arthur Blot, Pierre-Evariste Dagand and Julia Lawall:
From Sets to Bits in Coq
Wouter Swierstra and Joao Alpuim:
From proposition to program: embedding the refinement calculus in Coq
12:40 Lunch (1h50)
14:30 Sess 2: Systems (2x0h30)
Markus Triska:
The Boolean Constraint Solver of SWI-Prolog: System Description
Praveen Narayanan, Jacques Carette, Wren Romano, Chung-Chieh Shan and Robert Zinkov:
Probabilistic inference by program transformation in Hakaru: System description
15:30 Break (0h30)
16:00 Sess 3: Pearls (2x0h30)
Ian Mackie and Shinya Sato:
An interaction net encoding of Godel's System T
Taus Brock-Nannestad:
Space-efficient Planar Acyclicity Constraints
17:00 Break and Posters
Mar 5
09:30 Invited talk (1h10 min)
Atze Dijkstra:
UHC: Coping with Compiler Complexity
10:40 Break (0h30)
11:10 Sess 4: Logic Programming for type systems (2x0h30)
Ki Yung Ahn and Andrea Vezzosi:
Executable Relational Specifications of Polymorphic Type Systems using Prolog
Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond:
Proof Relevant Corecursive Resolution
12:10 Lunch (1h50)
14:00 Sess 5: Reasoning about performance (2x0h30)
Jay McCarthy, Burke Fetscher, Max New, Daniel Feltey, and Robert Bruce Findler:
A Coq Library For Internal Verification of Running-Times
Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen, John Gallagher
and Manuel V. Hermenegildo:
A Transformational Approach to Parametric Accumulated-cost Static Profiling
15:00 Break (0h30)
15:30 Tutorial 1 (1h30)
Neng-Fa Zhou, on programming in Picat
17:00 End
18:30 Banquet
Mar 6
09:30 Sess 6: Generic specifications (2x0h30)
Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala:
Polymorphic Types in Erlang Function Specifications
Jeremy Yallop, David Sheets and Anil Madhavapeddy:
Declarative foreign function binding through generic programming
10:30 Break (0h30)
11:00 Sess 7: Declarative programming with algebra (2x0h30)
Akimasa Morihata:
Incremental Computing with Abstract Data Structures
Andre Van Delft and Anatoliy Kmetyuk:
Declarative Programming with Algebra
12:00 Excursion and Lunch, 2h00
14:00 Tutorial 2 (1h30)
Atze Dijkstra, on Attribute Grammars
15:30 Break (0h30)
16:00 Tutorial 3 (1h30)
Andreas Abel, on Agda
SPONSOR
Japan Society for Software Science and Technology (JSSST),
Special Interest Group on Programming and Programming Languages
(SIG-PPL)
IN COOPERATION WITH
ACM SIGPLAN
Asian Association for Foundation of Software (AAFS)
Association for Logic Programming (ALP)
CONTACT ADDRESS
flops2016 at logic.cs.tsukuba.ac.jp
---------------------------------------------------------------------
Tenth NII Type Theory Workshop
Date: February 3, 2016, 13:30--17:00
Place: National Institute of Informatics, Room 2006 (20th floor)
場所: 国立情報学研究所 20階 2006室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/about/access/)
Program:
13:30--14:10 Mahmudul faisal Al Ameen (National Institute of Informatics)
Title: Completeness for Recursive Procedures in Separation Logic
14:10--14:50 Daisuke Kimura (National Institute of Informatics)
Title: An Implementation of Cyclic Proof-Search in Separation Logic
with Inductive Definitions
14:50--15:00 Break
15:00--15:50 Makoto Tatsuta (National Institute of Informatics)
Title: Completeness of Cyclic Proofs for Symbolic Heaps
15:50--16:00 Break
16:00--17:00 Stefano Berardi (Torino University)
Title: Game Semantics and the Complexity of Interaction
Abstracts:
----------------------------------------------------------------------
Mahmudul faisal Al Ameen (National Institute of Informatics)
Title: Completeness for Recursive Procedures in Separation Logic
Abstract: This talk proves the completeness of an extension of
Hoare's logic and separation logic for pointer programs with mutual
recursive procedures. A new system will be discussed by introducing
two new inference rules, and removes an axiom that is unsound in
separation logic and other redundant inference rules for showing
completeness. It introduces a novel expression that is used to
describe complete information of a given state in a precondition. It
also uses the necessary and sufficient precondition of a program for
the abort-free execution, which enables us to utilize strongest
postconditions. Admissibility of the frame rules in the system will
also be discussed.
----------------------------------------------------------------------
Daisuke Kimura (National Institute of Informatics)
Title: An Implementation of Cyclic Proof-Search in Separation Logic
with Inductive Definitions
Abstract: The entailment problem in separation logic is important for
program verification. This talk presents a proof system for a
fragment of separation logic with inductive definitions, whose proofs
have cyclic graph structures. The system is sound for validity of
entailments, and provides a decision procedure of entailment problem
based on proof-search of its cyclic proofs. We implement this
decision procedure, and report the results evaluating our decision
procedure with benchmark files of SLCOMP14.
----------------------------------------------------------------------
Makoto Tatsuta (National Institute of Informatics)
Title: Completeness of Cyclic Proofs for Symbolic Heaps
Abstract: Separation logic is successful for software verification in
both theory and practice. Decision procedure for symbolic heaps is
one of key issues. This talk proposes a cyclic proof system for
symbolic heaps with general form of inductive definitions, and
discusses its soundness, completeness, and decidability. The decision
procedure of entailments of symbolic heaps with inductive definitions
is also discussed. Decidability of entailments of symbolic heaps with
inductive definitions is an important question. Completeness of
cyclic proof systems is also an important question. The results of
this talk tries to answer both questions. The system is based on
cyclic proof systems by Brotherston et al, and the bounded-treewidth
inductive definitions by Iosif et al. In order for obtaining the
completeness, some restrictions are added to inductive definitions, an
entailment is extended to a multiple entailment which allows
disjunction in the succeedent, and it introduces new predicates for
describing whether a given address is in the heap or not. The
inductive definitions under the restrictions are quite general, since
they covers doubly-linked lists, nested lists, and skip lists. The
main techniques are grouping for showing the local completeness of the
rule of splitting separating conjunction, and normal form of multiple
entailments, which has some upper bounds for both the number of
disjuncts and the length of spatial parts.
----------------------------------------------------------------------
Stefano Berardi (Torino University)
Title: Game Semantics and the Complexity of Interaction (about a
result of Federico Aschieri)
Abstract: We present a new abstract complexity result obtained by
F. Aschieri about Coquand and Hyland-Ong game semantics, that will
lead to new bounds on the length of first-order cut-elimination,
normalization, interaction between expansion trees and any other
dialogical process game semantics can model and apply to. In
particular, Aschieri provides a novel method to bound the length of
interactions between visible strategies and to measure precisely the
tower of exponentials defining the worst-case complexity. This study
improves the old estimates by possibly several exponentials and is
based on Berardi-de'Liguoro notion of level of backtracking.
----------------------------------------------------------------------
問合せ先 龍田 (tatsuta(a)nii.ac.jp)
皆様、
来年6月に開催される国際会議FSCD 2016の投稿締切が延長され
ましたので、ご案内させていただきます。
FSCD (Formal Structures for Computation and Deduction)は、
RTA (Rewriting Techniques and Applications)と
TLCA (Typed Lambda Calculi and Applications)を
融合・発展させた新しい会議です。
論文の投稿をご検討いただけますと幸いです。
長谷川真人
京都大学数理解析研究所
--
CALL FOR PAPERS - DEADLINE EXTENSION
First International Conference on Formal Structures for
Computation and Deduction (FSCD'16)
22 June -- 26 June 2016, Porto, Portugal
http://fscd2016.dcc.fc.up.pt/
*** ABSTRACT SUBMISSION DEADLINE EXTENDED TO: 8 FEBRUARY 2016 ***
*** PAPER SUBMISSION DEADLINE EXTENDED TO: 12 FEBRUARY 2016 ***
==========================================================================
IMPORTANT DATES
Abstract Submission: 8 February 2016
Paper Submission : 12 February 2016
Rebuttal : 21 - 23 March 2016
Notification : 6 April 2016
==========================================================================
FSCD (http://fscdconference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, proof theory and new
emerging models of computation such as quantum computing and homotopy
type theory. The name of the new conference comes from an unpublished
but important book by Gerard Huet that strongly influenced many
researchers in the area.
Suggested, but not exclusive, list of topics for submission are:
1 Calculi
* Lambda calculus
* Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.)
* Rewriting systems (string, term, higher-order, graph, conditional,
modulo, infinitary, etc.)
* Proof theory (natural deduction, sequent calculus, proof nets, etc.)
* Type theory and logical frameworks
* Homotopy type theory
2. Methods in Computation and Deduction
* Type systems (polymorphism, dependent, recursive, intersection,
session, etc.)
* Induction, coinduction
* Matching, unification, completion, orderings
* Strategies (normalization, completeness, etc.)
* Tree automata
* Model building and model checking
* Proof search (resolution, paramodulation, narrowing, focusing, etc.)
* Constraint solving and decision procedures
3. Semantics
* Operational semantics and abstract machines
* Game Semantics and applications
* Domain theory and categorical models
* Quantitative models (timing, probabilities, resources, etc.)
* Quantum computation and emerging models in computation
4. Algorithmic Analysis and Transformations of Formal Systems
* Type Inference and type checking
* Abstract Interpretation
* Complexity analysis and implicit computational complexity
* Checking termination, confluence, derivational complexity and
related properties
* Symbolic computation
5. Tools and Applications
* Programming and proof environments (proof assistants, automated
theorem prover, proof checkers, specialized provers, dependently
typed languages, etc.)
* Verification tools (abstract interpretation, termination,
confluence, specialized provers, etc.)
* Libraries for proof assistants and interactive theorem provers
(support for variable bindings, nominal, polynomial, equality, etc.)
* Case studies in proof assistants and interactive theorem provers
(formalizations, mechanizations, certifications)
* Certifications (theorems, rewriting techniques, etc.)
* Applications of formal systems inside and outside of CS (biology,
linguistics, physics, education, etc.)
INVITED SPEAKERS
Amal Ahmed (USA)
Ichiro Hasuo (Japan)
Gerard Huet (France)
Tobias Nipkow (Germany)
PROGRAM CHAIRS
Delia Kesner (Univ. Paris-Diderot)
Brigitte Pientka (McGill University)
fscd16(a)easychair.org
PROGRAM COMMITTEE
Andreas Abel (Gothenburg Univ.)
Zena Ariola (Univ. Oregon)
Patrick Baillot (CNRS & ENS Lyon)
Andrej Bauer (Univ. Ljubljana)
Eduardo Bonelli (Univ. Quilmes)
Patricia Bouyer (ENS Cachan)
Ugo Dal Lago (Univ. Bologna)
Nachum Dershowitz (Univ. Tel Aviv)
Mariangiola Dezani-Ciancaglini (Univ. Torino)
Derek Dreyer (MPI-SWS)
Santiago Figueira (Univ. Buenos Aires)
Marcelo Fiore (Univ. Cambridge)
Juergen Giesl (Univ. Aachen)
Nao Hirokawa (JAIST)
Martin Hofmann (LMU Munchen)
Delia Kesner (Univ. Paris-Diderot)
Naoki Kobayashi (Univ. Tokyo)
Dan Licata (Wesleyan Univ.)
Chris Lynch (Clarkson Univ.)
Narciso Marti-Oliet (Univ. Complutense)
Aart Middeldorp (Univ. Innsbruck)
Dale Miller (INRIA Saclay)
Cesar Munoz (NASA)
Vivek Nigam (Univ. Paraiba)
Brigitte Pientka (McGill Univ.)
Jakob Rehof (Univ. Dortmund)
Xavier Rival (ENS Paris)
Peter Selinger (Dalhousie Univ.)
Paula Severi (Univ. Leicester)
Jakob Grue Simonsen (Univ. Copenhagen)
Matthieu Sozeau (INRIA Rocquencourt)
Sophie Tison (Univ. Lille)
Femke van Raamsdonk (VU Univ. Amsterdam)
Nobuko Yoshida (Imperial College)
CONFERENCE CHAIR
Sandra Alves (University of Porto)
FSCD STEERING COMMITTEE:
Thorsten Altenkirch (Univ. Nottingham)
Gilles Dowek (INRIA)
Santiago Escobar (Univ. Politecnica de Valencia)
Maribel Fernandez (King's College London)
Masahito Hasegawa (Univ. Kyoto)
Hugo Herbelin (INRIA)
Nao Hirokawa (JAIST)
Luke Ong (Chair, Univ. Oxford)
Jens Palsberg (UCLA)
Kristoffer Rose (Two Sigma Investments)
Rene Thiemann (Univ. Innsbruck)
Pawel Urzyczyn (Univ. Warsaw)
Femke van Raamsdonk (VU Univ. Amsterdam)
PUBLICATION
The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs
proceedings are open access.
SUBMISSION GUIDELINES
Submissions can be made in two categories: regular research papers and
system descriptions.
Submissions of research papers must present original research which is
unpublished and not submitted elsewhere. They must not exceed 15 pages
(including figures and bibliography). Submissions of research papers
will be judged on originality, significance, correctness, and readability.
Submission of system descriptions must describe a working system which
has not been published or submitted elsewhere. They must not exceed 10
pages and should contain a link to a working system. System
descriptions will be judged on originality, significance, usefulness,
and readability.
Proofs of theoretical results that do not fit within the page limit,
executables of systems, code of case studies, benchmarks used to
evaluate a given system, should be made available, via a reference to
a website or in an appendix of the paper. Reviewers will be encouraged
to consider this additional material, but are not obliged
to. Submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission.
Submissions must be formatted using the LIPIcs style files using the
instructions at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
A condition of submission is that, if accepted, one of the authors
must attend the conference to give the presentation.
Papers should be submitted via easychair. The submission site is at
https://easychair.org/conferences/?conf=fscd16
CONFERENCE AWARDS
Two awards will be selected: one for the best paper and another one for
the best student paper.
SPECIAL ISSUE
After the conference, authors of selected papers will be invited to submit
extended versions of their work to a special issue published in the
open-access
journal Logical Methods in Computer Science (LMCS).
SATELLITE EVENTS
The following meetings and workshops are colocated with FSCD 2016:
CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP,
LSFA, UNIF, WPTE, WWV.
ORGANISING COMMITTEE
Sandra Alves (Univ. Porto)
Sabine Broda (Univ. Porto)
Jose Espirito-Santo (Univ. do Minho)
Mario Florido (Univ. Porto)
Nelma Moreira (Univ. Porto)
Luis Pinto (Univ. do Minho)
Rogerio Reis (Univ. Porto)
Ana Paula Tomas (Univ. Porto)
Pedro Vasconcelos (Univ. Porto)
皆様、
来年6月に開催される国際会議FSCD 2016の併設ワークショップ
Linearity 2016 のcall for papersです。
論文の投稿をご検討いただけますと幸いです。
長谷川真人
京都大学数理解析研究所
=======================================================================
Call for Papers
Fourth International Workshop on Linearity
LINEARITY'16
Porto, Portugal, 25 June 2016
Affiliated with FSCD'16
http://www.cs.cmu.edu/~linearity16
=======================================================================
SUBMISSION DEADLINE: 8 APRIL 2016
Ever since the birth of Girard's linear logic, there has been a stream of
research in Computer Science where linearity is a key issue, covering both
theoretical topics and applications, such as work on proof technology,
complexity classes and more recently quantum computation, program
analysis, expressive operational semantics, linear programming languages,
and techniques for program transformation, update analysis and efficient
implementation.
The aim of this workshop is to bring together researchers who are
currently developing theory and applications of linear calculi, to foster
their interaction and provide a forum for presenting new ideas and work in
progress, and enable newcomers to learn about current activities in this
area.
New results that make central use of linearity, ranging from foundational
work to applications in any field, are welcome. Also welcome are more
exploratory presentations, which may examine open questions and raise
fundamental concerns about existing theories and practices. Topics of
interest include, but are not limited to:
- sub-linear logics
- linear term calculi
- linear type systems
- linear proof-theory
- linear programming languages
- applications to concurrency
- interaction-based systems
- verification of linear systems
- quantum models of computation
- biological and chemical models of computation
Important Dates
Abstract submission deadline: Friday 8 April 2016
Submission deadline: Friday 15 April 2016
Notification to authors: Friday 13 May 2016
Final versions due: Friday 27 May 2016
Workshop date: Saturday 25 June 2016
Submission
Authors are invited to submit an extended abstract (8 pages max)
describing original ideas and recent results not published nor submitted
elsewhere, or a 5-page abstract presenting relevant work that has been or
will be published elsewhere, or work in progress. Preliminary proceedings
will be available at the workshop. Papers should be written in English,
and submitted in PDF format using the EPTCS style files. Submission is
through the Easychair website:
https://www.easychair.org/conferences/?conf=linearity2016
Publication
After the workshop, authors of the extended abstracts will be invited to
submit a longer version of their work (typically a 15-pages paper) for
publication in an electronic journal such as EPTCS. These submissions
will undergo a second round of refereeing. Furthermore, we envision
publication of a special issue of a journal after the event.
Programme Committee
- Emmanuel Beffara (Universite d'Aix-Marseille)
- Luis Caires (Universidade Nova de Lisboa)
- Iliano Cervesato (Carnegie Mellon University, co-chair)
- Maribel Fernandez (King's College London, co-chair)
- Marco Gaboardi (University at Buffalo, SUNY)
- Masahito Hasegawa (Kyoto University)
- Damiano Mazza (CNRS - Universite Paris 13)
- Vivek Nigam (Universidade Federal da Paraiba)
- Giselle Reis (Inria)
- Claudio Sacerdoti Coen (University of Bologna)
- Andre Scedrov (University of Pennsylvania)
Contact
Iliano Cervesato: iliano(a)cmu.edu
Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk
=======================================================================
皆様、
来年6月に開催される国際会議FSCD 2016の(final) call for papers
です。
FSCD (Formal Structures for Computation and Deduction)は、
RTA (Rewriting Techniques and Applications)と
TLCA (Typed Lambda Calculi and Applications)を融合・発展させた
新しい会議です。論文の投稿をご検討いただけますと幸いです。
長谷川真人
京都大学数理解析研究所
--
FINAL CALL FOR PAPERS
First International Conference on Formal Structures for
Computation and Deduction (FSCD'16)
22 June -- 26 June 2016, Porto, Portugal
http://fscd2016.dcc.fc.up.pt/
*** ABSTRACT SUBMISSION DUE 29 JANUARY 2016 ***
**** PAPER SUBMISSION DUE 5 FEBRUARY 2016 ****
==========================================================================
IMPORTANT DATES
Abstract Submission: 29 January 2016
Paper Submission : 5 February 2016
Rebuttal : 21 - 23 March 2016
Notification : 6 April 2016
==========================================================================
FSCD (http://fscdconference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations
to applications. Building on two communities, RTA (Rewriting
Techniques and Applications) and TLCA (Typed Lambda Calculi and
Applications), FSCD embraces their core topics and broadens their
scope to closely related areas in logics, proof theory and new
emerging models of computation such as quantum computing and homotopy
type theory. The name of the new conference comes from an unpublished
but important book by Gerard Huet that strongly influenced many
researchers in the area.
Suggested, but not exclusive, list of topics for submission are:
1 Calculi
* Lambda calculus
* Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.)
* Rewriting systems (string, term, higher-order, graph, conditional,
modulo, infinitary, etc.)
* Proof theory (natural deduction, sequent calculus, proof nets, etc.)
* Type theory and logical frameworks
* Homotopy type theory
2. Methods in Computation and Deduction
* Type systems (polymorphism, dependent, recursive, intersection,
session, etc.)
* Induction, coinduction
* Matching, unification, completion, orderings
* Strategies (normalization, completeness, etc.)
* Tree automata
* Model building and model checking
* Proof search (resolution, paramodulation, narrowing, focusing, etc.)
* Constraint solving and decision procedures
3. Semantics
* Operational semantics and abstract machines
* Game Semantics and applications
* Domain theory and categorical models
* Quantitative models (timing, probabilities, resources, etc.)
* Quantum computation and emerging models in computation
4. Algorithmic Analysis and Transformations of Formal Systems
* Type Inference and type checking
* Abstract Interpretation
* Complexity analysis and implicit computational complexity
* Checking termination, confluence, derivational complexity and
related properties
* Symbolic computation
5. Tools and Applications
* Programming and proof environments (proof assistants, automated
theorem prover, proof checkers, specialized provers, dependently
typed languages, etc.)
* Verification tools (abstract interpretation, termination,
confluence, specialized provers, etc.)
* Libraries for proof assistants and interactive theorem provers
(support for variable bindings, nominal, polynomial, equality, etc.)
* Case studies in proof assistants and interactive theorem provers
(formalizations, mechanizations, certifications)
* Certifications (theorems, rewriting techniques, etc.)
* Applications of formal systems inside and outside of CS (biology,
linguistics, physics, education, etc.)
INVITED SPEAKERS
Amal Ahmed (USA)
Ichiro Hasuo (Japan)
Gerard Huet (France)
Tobias Nipkow (Germany)
PROGRAM CHAIRS
Delia Kesner (Univ. Paris-Diderot)
Brigitte Pientka (McGill University)
fscd16(a)easychair.org
PROGRAM COMMITTEE
Andreas Abel (Gothenburg Univ.)
Zena Ariola (Univ. Oregon)
Patrick Baillot (CNRS & ENS Lyon)
Andrej Bauer (Univ. Ljubljana)
Eduardo Bonelli (Univ. Quilmes)
Patricia Bouyer (ENS Cachan)
Ugo Dal Lago (Univ. Bologna)
Nachum Dershowitz (Univ. Tel Aviv)
Mariangiola Dezani-Ciancaglini (Univ. Torino)
Derek Dreyer (MPI-SWS)
Santiago Figueira (Univ. Buenos Aires)
Marcelo Fiore (Univ. Cambridge)
Juergen Giesl (Univ. Aachen)
Nao Hirokawa (JAIST)
Martin Hofmann (LMU Munchen)
Delia Kesner (Univ. Paris-Diderot)
Naoki Kobayashi (Univ. Tokyo)
Dan Licata (Wesleyan Univ.)
Chris Lynch (Clarkson Univ.)
Narciso Marti-Oliet (Univ. Complutense)
Aart Middeldorp (Univ. Innsbruck)
Dale Miller (INRIA Saclay)
Cesar Munoz (NASA)
Vivek Nigam (Univ. Paraiba)
Brigitte Pientka (McGill Univ.)
Jakob Rehof (Univ. Dortmund)
Xavier Rival (ENS Paris)
Peter Selinger (Dalhousie Univ.)
Paula Severi (Univ. Leicester)
Jakob Grue Simonsen (Univ. Copenhagen)
Matthieu Sozeau (INRIA Rocquencourt)
Sophie Tison (Univ. Lille)
Femke van Raamsdonk (VU Univ. Amsterdam)
Nobuko Yoshida (Imperial College)
CONFERENCE CHAIR
Sandra Alves (University of Porto)
FSCD STEERING COMMITTEE:
Thorsten Altenkirch (Univ. Nottingham)
Gilles Dowek (INRIA)
Santiago Escobar (Univ. Politecnica de Valencia)
Maribel Fernandez (King's College London)
Masahito Hasegawa (Univ. Kyoto)
Hugo Herbelin (INRIA)
Nao Hirokawa (JAIST)
Luke Ong (Chair, Univ. Oxford)
Jens Palsberg (UCLA)
Kristoffer Rose (Two Sigma Investments)
Rene Thiemann (Univ. Innsbruck)
Pawel Urzyczyn (Univ. Warsaw)
Femke van Raamsdonk (VU Univ. Amsterdam)
PUBLICATION
The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs
proceedings are open access.
SUBMISSION GUIDELINES
Submissions can be made in two categories: regular research papers and
system descriptions.
Submissions of research papers must present original research which is
unpublished and not submitted elsewhere. They must not exceed 15 pages
(including figures and bibliography). Submissions of research papers
will be judged on originality, significance, correctness, and readability.
Submission of system descriptions must describe a working system which
has not been published or submitted elsewhere. They must not exceed 10
pages and should contain a link to a working system. System
descriptions will be judged on originality, significance, usefulness,
and readability.
Proofs of theoretical results that do not fit within the page limit,
executables of systems, code of case studies, benchmarks used to
evaluate a given system, should be made available, via a reference to
a website or in an appendix of the paper. Reviewers will be encouraged
to consider this additional material, but are not obliged
to. Submissions must be self-contained within the respective page
limit; considering the additional material should not be necessary to
assess the merits of a submission.
Submissions must be formatted using the LIPIcs style files using the
instructions at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
A condition of submission is that, if accepted, one of the authors
must attend the conference to give the presentation.
Papers should be submitted via easychair. The submission site is at
https://easychair.org/conferences/?conf=fscd16
CONFERENCE AWARDS
Two awards will be selected: one for the best paper and another one for
the best student paper.
SPECIAL ISSUE
After the conference, authors of selected papers will be invited to submit
extended versions of their work to a special issue published in the
open-access
journal Logical Methods in Computer Science (LMCS).
SATELLITE EVENTS
The following meetings and workshops are colocated with FSCD 2016:
CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP,
LSFA, UNIF, WPTE, WWV.
ORGANISING COMMITTEE
Sandra Alves (Univ. Porto)
Sabine Broda (Univ. Porto)
Jose Espirito-Santo (Univ. do Minho)
Mario Florido (Univ. Porto)
Nelma Moreira (Univ. Porto)
Luis Pinto (Univ. do Minho)
Rogerio Reis (Univ. Porto)
Ana Paula Tomas (Univ. Porto)
Pedro Vasconcelos (Univ. Porto)
CALL FOR PAPERS
International Journal of Computational Linguistics (IJCL)
ISSN - 2180-1266
http://www.cscjournals.org/journals/IJCL/description.php
Computational linguistics is an interdisciplinary field dealing with the
statistical and/or rule-based modeling of natural language from a
computational perspective. Today, computational language acquisition stands
as one of the most fundamental, beguiling, and surprisingly open questions
for computer science.
International Journal of Computational Linguistics (IJCL) is a peer review
open access bi-monthly journal providing a scientific forum where computer
scientists, experts in artificial intelligence, mathematicians, logicians,
cognitive scientists, cognitive psychologists, psycholinguists,
anthropologists and neuroscientists can present research and experimental
studies. The journal publishes papers that describe state-of-the-art
techniques, scientific research studies and results in computational
linguistics in general but computational models, corpus linguistics,
computational theories, information retrieval and extraction, linguistics
modeling techniques, linguistics theories, machine translation, natural
language processing, quantitative linguistics, speech analysis and speech
recognition in particular.
IJCL invite linguistic specialists, researchers and scientists from
different domains to share their understanding and contributions towards
linguistics that set scientific objectives and demonstrate the operation of
new methods in the field of computational linguistics.
EDITORIAL BOARD MEMBERS
Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan)
Dr. Pascaline Merten - HEB-ISTI (Belgium)
Dr. Pawel Dybala - Otaru University of Commerce (Japan)
Dr. John Hanhong LI - (China)
Dr. Stephen Doherty - Dublin City University (Ireland)
LIST OF TOPICS
Comparative Surveys that Critique Previously Repor
Computational Linguistics
Computational Models
Computational Theories
Corpus Linguistics
Formal Linguistics-Theoretic and Grammar Induction
Information Retrieval and Extraction
Language Generation
Language Learning
Linguistics Modeling Techniques
Linguistics Theories
Machine Translation
Models of Language Change and its Effect on Lingui
Models that Address the Acquisition of Word-order
Models that Combine Linguistics Parsing
Models that Employ Statistical/probabilistic Gramm
Models that Employ Techniques from machine learnin
Natural Language Processing
Quantitative Linguistics
Speech Analysis/Synthesis
Speech Recognition/Understanding
Spoken Dialog Systems
Web Information Extraction/Mining
IMPORTANT DATES
Paper Submission - January 31, 2016
Author Notification - February 28, 2016
Issue Publication - March 2016
PAPER SUBMISSION DETAILS
In order to submit the paper, you need to register as author and then submit
the paper through Author Dashboard. It is also important to ensure that the
manuscript must be formatted as per IJCL Manuscript Preparation Guidelines.
For further information, please refer to the following information.
IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php
Submission Guidelines -
http://www.cscjournals.org/journals/IJCL/submission-guidelines.php
Register as Author - http://www.cscjournals.org/login.php
CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php
Call for EDITORS
International Journal of Computational Linguistics (IJCL) seeks applications
from enthusiastic researchers and scholars who can oversee and maintain the
editorial direction of the journal to ensure a steady flow of engaging and
thought-provoking original research publications.
IJCL is a peer-reviewed International journal dedicated to publishing an
open access original research, reports, and reviews. For future improvement
and development, IJCL particularly seeks editors who can continue the
enduring and ongoing editorial successes to next level and introduce the
journal profile to different libraries and research centers around the
globe. IJCL welcome applications from editors with strong academic
background and Internationally recognized reputation. Applicants with
significant publishing or reviewing experience will be preferred. To qualify
for the post of editorial board member (EBM), Associate Editor-in-Chief
(AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide
experience in academic/Industry/ research and international conferences.
For more information on editorial role & responsibilities, benefits &
privileges and application criteria to apply for editorial collaborations
with IJCL-CSC Journals, please refer to the following URLs.
Editors Guidelines -
http://www.cscjournals.org/editors/editors-guidelines.php
Call For Editors -
http://www.cscjournals.org/journals/IJCL/call-for-editors.php
Please do not hesitate to contact us at cscpress(a)cscjournals.org if you
require more information prior to submission. Our team is committed to
provide quick response and support from submission to final publication.
Sincerely
Editorial Board Members
International Journal of Computational Linguistics (IJCL)
Computer Science Journals (CSC Journals)
B-5-8 Plaza Mont Kiara, Mont Kiara
50480, Kuala Lumpur, Malaysia
Phone: 00603 6204 5627
Fax: 00603 6204 5628
Url: http://www.cscjournals.org
(sorry for multiple copies)
AiML-2016: 1ST CALL FOR PAPERS
11TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
BUDAPEST, 29 AUGUST -- 2 SEPTEMBER 2016
http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/>
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 <http://www.aiml.net/>. AiML-2016 is the 11th 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.
PAPER SUBMISSIONS
There will be two types of submissions to AiML-2016:
(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://easychair.org/conferences/?conf=aiml16 <https://easychair.org/conferences/?conf=aiml16>
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-2016 will
be published by College Publications
http://www.collegepublications.co.uk <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 will be provided on the AiML-2016 website
http://phil.elte.hu/aiml2016/ <http://phil.elte.hu/aiml2016/> in due time.
We also ask authors of full papers to submit the abstract in plain
text via EasyChair by 10 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.
INVITED SPEAKERS: (to be completed)
LOCAL ORGANIZING COMMITTEE
Tamás Bitai (Eötvös University, Budapest, Hungary)
Réka Markovich (Eötvös University, Budapest, Hungary)
András Máté (Eötvös University, Budapest, Hungary)
Péter Mekis (Eötvös University, Budapest, Hungary)
Attila Molnár (Eötvös University, Budapest, Hungary)
Gergely Székely (Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences)
PROGRAMME COMMITTEE
Natasha Alechina (University of Nottingham)
Carlos Areces (FaMAF, Universidad Nacional de Córdoba)
Philippe Balbiani (IRIT, Toulouse, France)
Alexandru Baltag (FNWI ILLC)
Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow)
Thomas Bolander (Technical University of Denmark)
Torben Braüner (Roskilde University, Denmark)
Serenella Cerrito (Laboratoire IBISC, Evry France)
Stéphane Demri (LSV, CNRS, ENS Cachan)
David Fernández-Duque (Instituto Tecnológico Autónomo de México)
Melvin Fitting (Lehman College, CUNY, USA)
David Gabelaia (gabelaia at gmail dot com) (The Free University of Tbilisi, Tbilisi, Georgia)
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Valentin Goranko (Stockholm University)
Rajeev Goré (The Australian National University)
Andreas Herzig (IRIT, Toulouse, France)
Rosalie Iemhoff (Utrecht University)
Agi Kurucz (King's College London)
Roman Kuznets (TU Wien)
Martin Lange (University of Kassel, Germany)
Carsten Lutz (Universität Bremen)
András Máté (Eötvös University, Budapest, Hungary)
Angelo Montanari (University of Udine)
Larry Moss (Indiana University, USA)
Sergei Odintsov (Novosibirsk State University)
Hiroakira Ono (Japan Advanced Insitute of Science and Technology)
Mark Reynolds (The University of Western Australia)
Ilya Shapirovsky (Institute for the Information Transmission Problems)
Renate Schmidt (University of Manchester)
Valentin Shehtman (Institute for the Information Transmission Problems)
Thomas Studer (Universität Bern)
Heinrich Wansing (Ruhr University Bochum)
Michael Zakharyaschev (Birkbeck College London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Lev Beklemishev (Steklov Mathematical Institute of Russian Academy of Sciences in Moscow)
Stéphane Demri (LSV, CNRS, ENS Cachan)
IMPORTANT DATES
Abstracts of full papers submission deadline: 10 March 2016
Full papers submission deadline: 17 March 2016
Full papers acceptance notification: 14 May 2016
Short presentations submission deadline: 16 May 2016
Short presentations acceptance notification: 30 May 2016
Final version of full papers and short presentations due: 8 June 2016
Conference: 29 August -- 2 September 2016
FURTHER INFORMATION. Please see http://phil.elte.hu/aiml2016/?page=call_for_papers <http://phil.elte.hu/aiml2016/?page=call_for_papers>
ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs,
sent to aiml16(a)easychair.org <mailto:aiml16@easychair.org>