# 重複の場合はご容赦ください.
神戸大学の田村と申します.
メーリングリストをお借りして,来年7月にヘルシンキで開催されます
SAT 2013 の Call For Papers をお送りします.
--
田村直之 (tamura(a)kobe-u.ac.jp) 神戸大学 情報基盤センター
〒657-8501 神戸市灘区六甲台町1-1
Phone: 078-803-5364, Fax: 078-803-5375
http://bach.istc.kobe-u.ac.jp/tamura-jp.html COPRIS+SCALA+CSP=SOLVER
-------------------------------------------------------------------------
1st CALL FOR PAPERS
Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
Abstract submission deadline: February 1, 2013
Paper submission deadline: February 8, 2013
-------------------------------------------------------------------------
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the theory and applications of the propositional
satisfiability problem, broadly construed. Besides plain propositional
satisfiability, it includes Boolean optimization (including MaxSAT and
Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF),
Satisfiability Modulo Theories (SMT), and Constraint Programming (CP)
for problems with clear connections to Boolean-level reasoning.
Many hard combinatorial problems can be encoded as SAT instances, in the
broad sense mentioned above, including problems in formal verification
(hardware and software), artificial intelligence, and operations research.
More recently, biology, cryptology, data mining, machine learning, and
mathematics have been added to the growing list.
The SAT conference aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to satisfiability.
SAT 2013 takes place in Helsinki, the capital of Finland. Helsinki is a
vibrant Scandinavian and international city with a lot to offer to visitors.
SAT 2013 takes place during the main summer season, allowing one to
experience the whitenights during which the sun almost never sets.
IMPORTANT DATES
===============
(Follow http://sat2013.cs.helsinki.fi/ for updates.)
February 1, 2013: Abstract Submission
February 8, 2013: Paper Submission
March 18, 2013 (approx.): Response from Authors begins, lasts 72 hours
April 3, 2013: Acceptance Notifications
April 22, 2013: Final Camera-Ready Versions
July 8, 2013: Workshops begin
July 9-12, 2013: Main Conference
SCOPE
=====
SAT 2013 welcomes scientific contributions addressing different aspects of
the satisfiability problem. interpreted in a broad sense. Domains include
MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF),
Satisfiability Modulo Theories (SMT), Constraint Satisfaction Problems (CSP).
Topics include (but are not restricted to)
Theoretical advances (including exact algorithms, proof complexity, and
other complexity issues);
Practical search algorithms;
Knowledge compilation;
Implementation-level details of SAT solving tools and SAT-based systems;
Problem encodings and reformulations;
Applications (including both novel applications domains and
improvements to existing approaches);
Case studies and reports on insightful findings based on rigorous
experimentation.
OUT OF SCOPE
============
Papers claiming to resolve a major long-standing open theoretical
question in mathematics or computer science (such as those for which a
Millennium Prize is offered, see http://www.claymath.org/millennium)
are outside the scope of the conference because there is insufficient
time in the schedule to referee such papers; instead, such papers
should be submitted to an appropriate technical journal.
SUBMISSIONS
===========
Submissions to SAT 2013 are solicited in three paper categories, describing
original contributions:
REGULAR PAPERS (9 to 15 pages, excluding references)
Regular papers should contain original research, with sufficient detail
to assess the merits and relevance of the contribution.
For papers reporting experimental results, authors are strongly encouraged
to make their data and implementations available with their submission.
Submissions reporting on case studies are also encouraged, and should
describe details, weaknesses, and strengths in sufficient depth.
SHORT PAPERS (up to 8 pages, excluding references)
The same evaluation criteria apply to short papers as to regular papers.
They will be reviewed to the same standards of quality as regular papers,
but will naturally contain less quantity of new material.
Short papers will have the same status as regular papers and be eligible
for the same awards (to be announced later).
TOOL PAPERS (up to 6 pages, excluding references)
A tool paper should describe the implemented tool and its novel features.
Here "tools" are interpreted in a broad sense, including descriptions of
implementations of core SAT solving techniques (solvers, preprocessors,
etc.), systems exploiting SAT solvers or their extensions for solving
interesting problem domains, etc.
A demonstration is expected to accompany a tool presentation.
Papers describing tools that have already been presented previously are
expected to contain significant and clear enhancements to the tool.
The software for the tool should be made publicly available, for
accepted tool papers, and should at least be available to reviewers
for evaluation during the review period. Evaluation criteria will include
(but not be limited to) accurate documentation, usability, and
potential for furthering the state of the art. For the latter criterion,
availability of source code will be a significant factor.
This is an evolving category, and technical issues involving software
availability should be discussed with the program chairs.
Be sure to check the conference web page for updates on this category.
Papers describing unpublished tool-related work, providing details on a
system and the novel algorithms it implements, as well as an experimental
evaluation of the system's performance, can also be submitted as regular
papers.
For all paper categories, the page limits stated above do not include
references, but do include all other material intended to appear in the
conference proceedings. An additional technical appendix may be included,
but it must be clearly labeled as supplementary material and may or may
not be examined during review based of the considerations of individual
reviewers. The appendix may contain detailed proofs, examples, descriptions
of publicly available software related to the submission, or other
information that does not fit the page limit. However, the appendix will
not be included in the conference proceedings. The main contributions
should be made accessible within the page limits, without having to
rely on the appendix.
Submissions should not be under review elsewhere nor be submitted elsewhere
while under review for SAT 2013, and should not consist of previously
published material.
Submissions must use the Springer LNCS style without modifications,
and must be written in English. All papers submissions are done exclusively
via the SAT 2013 EasyChair Conference Service at
http://www.easychair.org/conferences/?conf=sat2013 .
PROCEEDINGS
===========
All accepted papers will be published in the proceedings of the conference,
which will be published within the Springer LNCS series.
PROGRAM CHAIRS
==============
Matti Jarvisalo University of Helsinki, Finland
Allen Van Gelder University of California at Santa Cruz, USA
PROGRAM COMMITTEE
=================
Gilles Audemard
Fahiem Bacchus
Armin Biere
Maria Luisa Bonet
Lucas Bordeaux
Uwe Bubeck
Samuel Buss
Nadia Creignou
Leonardo de Moura
John Franco
Enrico Giunchiglia
Ziyad Hanna
Marijn Heule
Holger H. Hoos
Jinbo Huang
Tommi Junttila
Matti Jarvisalo
Arist Kojevnikov
Daniel Kroening
Oliver Kullmann
Daniel Le Berre
Florian Lonsing
Ines Lynce
Joao Marques-Silva
Alexander Nadel
Jakob Nordstrom
Albert Oliveras
Ramamohan Paturi
Jussi Rintanen
Olivier Roussel
Ashish Sabharwal
Lakhdar Sais
Roberto Sebastiani
Bart Selman
Peter Stuckey
Stefan Szeider
Naoyuki Tamura
Allen Van Gelder
Toby Walsh
================================================================
$B3'MM(B
$B!v!vJ#?t<u$1<h$i$l$?J}$O$4MF<O$/$@$5$$!#!v!v(B
$B>.@n!w(BJAIST $B$G$9!#(B2013$BG/(B10$B7n$K%O%N%$$G9T$o$l$^$99q:]2q5D(BATVA$B$N(B
1st call for paper $B$r$*Aw$j$$$?$7$^$9!#O@J8Ej9FDy$a@Z$j$O(B4$B7n(B6$BF|(B
$B$H$^$@@h$G$9$,!"(B10$B7n$N%O%N%$$OAV$d$+$J;~4|$G$9!#$U$k$C$FEj9F$r(B
$B$47W2h$/$@$5$$!#(B
$B>.@n?p;K(B (JAIST)
http://www.jaist.ac.jp/~mizuhito
---------------------------------------------------------------
CALL FOR PAPERS
ATVA 2013
11th International Symposium on
Automated Technology for Verification and Analysis
October 15 - 18, 2013, Hanoi, Vietnam
====================
The ATVA series of symposia is intended to promote research in
theoretical and practical aspects of automated analysis,
verification and synthesis in Asia by providing a forum for
interaction between the regional and international research
communities and industry in the field. The previous editions of
the symposium were held in Taiwan, Beijing, Tokyo, Seoul, Macao,
Singapore, Taipei and Thiruvananthapuram. Organised by the
University of Engineering and Technology VNU Hanoi, ATVA 2013 will
be held in the campus of Vietnam National University, Hanoi from
October 15th to October 18th, 2013.
SCOPE
ATVA 2013 solicits high quality submissions in areas related to the
theory and practice of automated analysis and verification of
hardware and software systems. Topics of interest include, but are
not limited to:
- Formalisms for modeling hardware, software and embedded systems
- Specification and verification of finite-state, infinite-state and
parameterized system
- Program analysis and software verification
- Analysis and verification of hardware circuits, systems-on-chip
and embedded systems
- Analysis of real-time, hybrid, priced/weighted and probabilistic
systems
- Deductive, algorithmic, compositional and abstraction/refinement
techniques for analysis and verification
- Analytical techniques for safety, security, and dependability
- Testing and runtime analysis based on verification technology
- Analysis and verification of parallel and concurrent
hardware/software systems
- Verification in industrial practice
- Applications and case studies
Theory papers should preferably be motivated by practical problems,
and applications should be based on sound theory and should solve
problems of practical interest.
SUBMISSION
Submissions are invited in two categories: regular research papers
and tool papers. Submitted papers must present original and
unpublished work, and must not be concurrently submitted to any
other conference or journal.
Regular paper submissions are restricted to 15 pages inSpringer's
LNCS format, and tool paper submissions are restricted to 4 pages in
the same format. Proofs and details omitted due to space constraints
may be put in an appendix. Any such additional material will be read
by reviewers/program committee members at their discretion. Authors
are therefore urged to include details necessary for evaluation of
the technical merit of their work within the prescribed page limits.
Tool papers must include information about a URL from where the tool
can be downloaded or accessed on-line for evaluation. The URL must
also contain a set of examples, and a user's manual that describes
usage of the tool through examples. In case the tool needs to be
downloaded and installed, the URL must also contain a document
clearly giving instructions for installation of the tool on
Linux/Windows/MacOS.
Authors must upload PDF files of their papers throughEasyChair at:
https://www.easychair.org/conferences/?conf=atva2013
Accepted papers in both categories will be published by Springer as
a
LNCS volume. At least one author of each accepted paper must also
register for the conference and present the paper.
KEYNOTE TALKS AND TUTORIALS
Keynote talks and tutorials will be given by:
- Alessandro Cimatti (ITC-IRST, Italy)
- Marta Kiwakowska (Oxford, UK)
- Jerome Leroux (Bordeaux, France)
IMPORTANT DATES
- April 06, 2013: Paper submission deadline
- Jun 1, 2013: Paper acceptance/rejection notification
- July 5, 2013: Camera-ready copy deadline
- October 15 - 18, 2013: Main conference & Tutorials
ORGANIZING COMMITTEES
General Chair
- Nguyen Ngoc Binh (UET-VNU Hanoi, Vietnam)
Steering Committee
- E. Allen Emerson (U. of Texas-Austin, USA)
- Teruo Higashino (Osaka Univeristy, Japan)
- Insup Lee (U. of Pennsylvania, USA)
- Doron A. Peled (Bar Ilan University, Israel)
- Farn Wang (National Taiwan University, Taiwan)
- Hsu-Chun Yen (National Taiwan University, Taiwan)
Programme Committee Co-Chairs
- Hung Dang-Van (UET-VNU Hanoi, Vietnam)
- Mizuhito Ogawa (JAIST, Japan)
Publicity Chair
- Thao Dang (Verimag, France)
Finance/Registration Chair
- Thanh-Tho Quan (HCMUT, Vietnam)
Local Chair
- Hoang Truong (UET-VNU Hanoi, Vietnam)
PROGRAMME COMMITTEE
- Christel Baier (Germany)
- Jonathan Billington (Australia)
- Gianpiero Cabodi (Italy)
- Supratik Chakraborty (India)
- Wei-Ngan Chin (Singapore)
- Thao Dang (France)
- Hung Dang-Van (Vietnam, Co-chair)
- Deepak D'Souza (India)
- E.Allen Emerson (USA)
- Martin Frnzle (Germany)
- Masahiro Fujita (Japan)
- Susanne Graf (France)
- Teruo Higashino (Japan)
- Alan Hu (Canada)
- Franjo Ivancic (USA)
- Jie-Hong Roland Jiang (Taiwan)
- Joost-Pieter Katoen (Germany)
- Zurab Khasidashvili (Israel)
- Moonzoo Kim (Korea)
- Gerwin Klein (Australia)
- Fribourg Laurent (France)
- Insup Lee (USA)
- Xuandong Li (China)
- Annabelle McIver (Australia)
- Madhavan Mukund (India)
- Pham Ngoc-Hung (Vietnam)
- Thanh-Binh Nguyen (Vietnam)
- Viet-Ha Nguyen (Vietnam)
- Mizuhito Ogawa (Japan, Co-chair)
- Thanh-Tho Quan (Vietnam)
- Venkatesh R (India)
- Ganesan Ramalingam (India)
- Abhik Roychoudhury (Singapore)
- Hiroyuki Seki (Japan)
- Martin Steffen (Norway)
- Sofiene Tahar (Canada)
- Hoang Truong (Vietnam)
- Mahesh Viswanathan (USA)
- Farn Wang (Taiwan)
- Bow-Yaw Wang (China)
- Ji Wang (China)
- Hsu-Chun Yen (Taiwan)
- Wang Yi (Sweden)
- Shoji Yuen (Japan)
- Wenhui Zhang (China)
CONFERENCE VENUE
Historical Campus, Vietnam National University, 19 Le Thanh Tong
street, Hoan Kiem district, Hanoi, Vietnam.
LAST CALL FOR PAPERS
Twenty-Eighth Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS 2013)
June 25-28, 2013, New Orleans, USA
http://lii.rwth-aachen.de/lics/lics13/
LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA,
from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13
(23-25 June) and CSF13 (28-30 June).
The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic, broadly construed.
We invite submissions on topics that fit under that rubric. Suggested, but
not exclusive, topics of interest include: automata theory, automated
deduction, categorical models and logics, concurrency and distributed
computation, constraint programming, constructive mathematics, database
theory, decision procedures, description logics, domain theory, finite model
theory, theory of automatic structures, formal aspects of program analysis,
formal methods, foundations of computability, higher-order logic, lambda
and combinatory calculi, linear logic, logic in artificial intelligence, logic
programming, logical aspects of bioinformatics, logical aspects of
computational complexity, logical aspects of quantum computation,
logical frameworks, logics of programs, modal and temporal logics,
model checking, probabilistic systems, process calculi, programming
language semantics, proof theory, real-time systems, reasoning about
security, rewriting, type systems and type theory, and verification.
Important Dates:
Authors are required to submit a paper title and a short abstract of about
100 words in advance of submitting the extended abstract of the paper.
Titles & Short Abstracts Due : January 7, 2013
Extended Abstracts Due : January 14, 2013
Author Notification (approximate) : March 22, 2013
Final Versions Due for Proceedings: April 26, 2013
Deadlines are firm; late submissions will not be considered. All submissions
will be electronic via http://easychair.org/conferences/?conf=lics2013.
Submission Instructions:
Every extended abstract must be submitted in the IEEE Proceedings 2-column
10pt format and may not be longer than 10 pages, including references.
LaTeX style files will be available on the conference website. The extended
abstract must be in English and provide sufficient detail to allow the
program committee to assess the merits of the paper. It should begin with
a succinct statement of the issues, a summary of the main results, and
a brief explanation of their significance and relevance to the conference
and to computer science, all phrased for the non-specialist. Technical
development directed to the specialist should follow. References and
comparisons with related work must be included. (If necessary, detailed
proofs of technical results may be included in a clearly-labeled appendix,
to be consulted at the discretion of program committee members.) Extended
abstracts not conforming to the above requirements will be rejected without
further consideration. Papers selection will be merit-based, with no a priori
limit on the number of accepted papers. Results must be unpublished and not
submitted for publication elsewhere, including the proceedings of other
symposia or workshops. The program chair must be informed, in advance of
submission, of any closely related work submitted or about to be submitted
to a conference or journal. Authors of accepted papers are expected to sign
copyright release forms. One author of each accepted paper is expected to
present it at the conference.
Short Presentations:
A session of short presentations, intended for descriptions of student
research, works in progress, and other brief communications, is planned.
These abstracts will not be published. Dates and guidelines will be
posted on the LICS website.
Kleene Award for Best Student Paper:
An award in honor of the late Stephen C. Kleene will be given
for the best student paper(s), as judged by the program committee.
Special Issues:
Full versions of up to three accepted papers, to be selected by the program
committee, will be invited for submission to the Journal of the ACM.
Additional selected papers will be invited to a special issue of Logical
Methods in Computer Science.
Sponsorship:
The symposium is sponsored by the IEEE Technical Committee on Mathematical
Foundations of Computing and by ACM SIGACT, in cooperation with the Association
for Symbolic Logic and the European Association for Theoretical
Computer Science.
Program Chair:
Orna Kupferman, Hebrew University
Program Committee:
Parosh A. Abdulla, Uppsala University
Amal Ahmed, Northeastern Universtiy
Sergei Artemov, City University of New York
Andrei Bulatov, Simon Fraser University
Yijia Chen, Shanghai Jiao Tong University
Veronique Cortier, CNRS, Loria
Mariangiola Dezani-Ciancaglini, Univ. di Torino
Thomas Ehrhard, CNRS, Universite Paris Diderot
Javier Esparza, Technische Universitaet Muenchen
Kousha Etessami, University of Edinburgh
Maribel Fernandez, King’s College London
Santiago Figueira, University of Buenos Aires
Simon Gay, University of Glasgow
Martin Grohe, Humboldt-Universitaet zu Berlin
Martin Hofmann, LMU Munich
Petr Jancar, Technical University Ostrava
Barbara Jobstmann, CNRS, Verimag and Jasper DA
Patricia Johann, University of Strathclyde
Bakhadyr Khoussainov, The University of Auckland
Antonina Kolokolova, University of Newfoundland
Victor Marek, University of Kentucky
Angelo Morzenti, Politecnico di Milano
Lawrence Moss, Indiana University
Madhavan Mukund, Chennai Math. Institute
Anca Muscholl, Universite Bordeaux
Mogens Nielsen, Aarhus University
Catuscia Palamidessi, INRIA, Ecole Polytechnique
Luc Segoufin, INRIA, ENS Cachan
Natarajan Shankar, SRI International
Alexandra Silva, Radboud University Nijmegen
Balder ten Cate, UC Santa Cruz
Kazushige Terui, Kyoto University
Ron van der Meyden, Univ. of New South Wales
Jeannette M. Wing, Carnegie Mellon University
Nobuko Yoshida, Imperial College London
Conference Chair:
Mike Mislove, Tulane University
Workshop Chair:
Patricia Bouyer-Decitre, CNRS, ENS Cachan
Publicity Chair:
Andrzej Murawski, University of Leicester
General Chair:
Luke Ong, University of Oxford
Organizing Committee:
Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame,
Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum
Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna
Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman,
Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej
Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys,
Matt Valeriote
Advisory Board:
Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry
Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller,
John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin,
Moshe Vardi, Glynn Winskel
------------------------------------------
Kazushige TERUI
Research Institute for Mathematical Sciences,
Kyoto University.
Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN.
Phone: +81-75-753-7235
Fax: +81-75-753-7276
terui(a)kurims.kyoto-u.ac.jp
http://www.kurims.kyoto-u.ac.jp/~terui/
[Apologies for multiple copies]
======================================================
TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013)
======================================================
July 28 - August 1, 2013
Department of Mathematics, Vanderbilt
University
Nashville, Tennessee USA
http://www.math.vanderbilt.edu/~tacl2013/
The Sixth International Conference on Topology,
Algebra and Categories
in conjunction with the
28th Annual Shanks Lecture
Series
Scope
---------
Studying logics via semantics is a well-established and very active
branch of mathematical logic, with many applications, in computer
science and elsewhere. The area is characterized by results, tools and
techniques stemming from various fields, including universal algebra,
topology, category theory, order, and model theory. The program of the
conference TACL 2013 will focus on three interconnecting mathematical
themes central to the semantical study of logics and their
applications: algebraic, categorical, and topological methods. This is
the sixth conference in the series Topology, Algebra and Categories in
Logic (TACL, formerly TANCL). Earlier installments of this conference
have been organized in Tbilisi (2003), Barcelona (2005), Oxford
(2007), Amsterdam (2009), Marseilles (2011).
Confirmed invited speakers
-------------------------------------
Vladimir Voevodsky, Institute for Advanced Studies, USA (Shanks
Lecturer)
Nick Bezhanishvili, Utrecht University, The Netherlands
Leo Cabrer, University of Oxford, UK
Silvio Ghilardi, University of Milan, Italy
George Metcalfe, University of Bern, Switzerland
Alex Simpson, University of Edinburgh, UK
Featured topics
---------------------
Contributed talks can deal with any topic dealing with the use of
algebraic, categorical or topological methods in either logic or
computer science. This includes, but is not limited to, the following
areas:
* Algebraic structures in CS
* Algebraic logic
* Coalgebra
* Categorical methods in logic
* Domain theory
* Lattice theory
* Lattices with operators
* Many-valued and fuzzy logics
* Modal logics
* Non-classical logics
* Ordered topological spaces
* Ordered algebraic structures
* Pointfree topology
* Proofs and Types
* Residuated structures
* Semantics
* Stone-type dualities
* Substructural logics
* Topological semantics of modal logic
Submissions
-----------------
Contributed presentations will be of two types:
o 20 minutes long presentations in parallel sessions and
o featured, 30 minutes long, plenary presentations.
The submission of an abstract will be required to be selected for a
contributed presentation of either kind. While preference will be
given to new work, results that have already been published or
presented elsewhere will also be considered. More information on the
submission procedure, as well as a link to the EasyChair system, can
be found at the conference web site.
Important dates
----------------------
April 1, 2013: Abstract submission deadline
May 1, 2013: Notification to authors
July 28-August 1, 2013: Conference
Program Committee
---------------------------
Steve Awodey, Carnegie Mellon University
Guram Bezhanishvili, New Mexico State University
David Gabelaia, Razmadze Mathematical Institute, Tbilisi
Nick Galatos (co-chair), University of Denver
Mai Gehrke, LIAFA, University of Paris Diderot
Rob Goldblatt, Victoria University, Wellington
John Harding, New Mexico State University
Ramon Jansana, University of Barcelona
Peter Jipsen, Chapman University
Achim Jung, University of Birmingham
Alexander Kurz (co-chair), University of Leicester
Vincenzo Marra, University of Milan
Hiroakira Ono, Japan Advanced Institute of Science and Technology
Alessandra Palmigiano, University of Amsterdam
Hilary Priestley, St Anne's College, Oxford
James Raftery, University of KwaZulu-Natal, Durban
Thomas Streicher, Technical University of Darmstadt
Kazushige Terui, Kyoto University
Constantine Tsinakis, Vanderbilt University
Yde Venema, University of Amsterdam
Michael Zakharyaschev, Birkbeck College, University of London
Organizing Committee
-------------------------------
Chris Conidis, Vanderbilt University
Lianzhen Liu, Jiangnan University, China
Warren McGovern, Florida Atlantic University
Francesco Paoli, University of Cagliari
Rebecca Steiner, Vanderbilt University
Constantine Tsinakis (chair), Vanderbilt University
William Young, Vanderbilt University
Expression of interest
------------------------------
We would greatly appreciate your taking two minutes to express your
level of interest in the conference by filling out a simple form on
the conference web site under "Express Interest". This will help the
Organizing Committee with their planning. You can also opt-out from
receiving future announcements by clicking the link at the bottom of
this email.
More Information
-----------------------
TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/
Use this site for local information, including hotel accommodations,
for travel information and registration, and for submitting a request
for financial support.
Any queries for the Program Committee (such as usage of the EasyChair
conference system, abstract submission guidelines, conference program,
etc.) should be sent to tacl2013(a)gmail.com. Queries for the local
Organizing Committee (registration, hotel accommodations, financial
support and reimbursements, technology infrastructure, etc.) should be
sent to tacl2013oc(a)vanderbilt.edu.
[Apologies for multiple copies]
======================================================
TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013)
======================================================
July 28 - August 1, 2013
Department of Mathematics, Vanderbilt University
Nashville, Tennessee USA
http://www.math.vanderbilt.edu/~tacl2013/
The Sixth International Conference on Topology, Algebra and Categories
in conjunction with the
28th Annual Shanks Lecture Series
Scope
---------
Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011).
Confirmed invited speakers
-------------------------------------
Vladimir Voevodsky, Institute for Advanced Studies, USA (Shanks Lecturer)
Nick Bezhanishvili, Utrecht University, The Netherlands
Leo Cabrer, University of Oxford, UK
Silvio Ghilardi, University of Milan, Italy
George Metcalfe, University of Bern, Switzerland
Alex Simpson, University of Edinburgh, UK
Featured topics
---------------------
Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas:
* Algebraic structures in CS
* Algebraic logic
* Coalgebra
* Categorical methods in logic
* Domain theory
* Lattice theory
* Lattices with operators
* Many-valued and fuzzy logics
* Modal logics
* Non-classical logics
* Ordered topological spaces
* Ordered algebraic structures
* Pointfree topology
* Proofs and Types
* Residuated structures
* Semantics
* Stone-type dualities
* Substructural logics
* Topological semantics of modal logic
Submissions
-----------------
Contributed presentations will be of two types:
o 20 minutes long presentations in parallel sessions and
o featured, 30 minutes long, plenary presentations.
The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site.
Important dates
----------------------
April 1, 2013: Abstract submission deadline
May 1, 2013: Notification to authors
July 28-August 1, 2013: Conference
Program Committee
---------------------------
Steve Awodey, Carnegie Mellon University
Guram Bezhanishvili, New Mexico State University
David Gabelaia, Razmadze Mathematical Institute, Tbilisi
Nick Galatos (co-chair), University of Denver
Mai Gehrke, LIAFA, University of Paris Diderot
Rob Goldblatt, Victoria University, Wellington
John Harding, New Mexico State University
Ramon Jansana, University of Barcelona
Peter Jipsen, Chapman University
Achim Jung, University of Birmingham
Alexander Kurz (co-chair), University of Leicester
Vincenzo Marra, University of Milan
Hiroakira Ono, Japan Advanced Institute of Science and Technology
Alessandra Palmigiano, University of Amsterdam
Hilary Priestley, St Anne's College, Oxford
James Raftery, University of KwaZulu-Natal, Durban
Thomas Streicher, Technical University of Darmstadt
Kazushige Terui, Kyoto University
Constantine Tsinakis, Vanderbilt University
Yde Venema, University of Amsterdam
Michael Zakharyaschev, Birkbeck College, University of London
Organizing Committee
-------------------------------
Chris Conidis, Vanderbilt University
Lianzhen Liu, Jiangnan University, China
Warren McGovern, Florida Atlantic University
Francesco Paoli, University of Cagliari
Rebecca Steiner, Vanderbilt University
Constantine Tsinakis (chair), Vanderbilt University
William Young, Vanderbilt University
Expression of interest
------------------------------
We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email.
More Information
-----------------------
TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/
Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support.
Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013(a)gmail.com<mailto:[email protected]>. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc(a)vanderbilt.edu<mailto:[email protected]>.
To unsubscribe from this list, please send an email to LISTSERV(a)LIST.VANDERBILT.EDU<mailto:[email protected]> with "SIGNOFF TACL2013" as the body of message.
mlの皆様,
As asked by the Chair of the Student Seminar I am forwarding the
information below.
Regards
Mauricio Hernandes
First Call for Papers
ESSLLI 2013 STUDENT SESSION
Held during
The 25th European Summer School
in Logic, Language and Information
Düsseldorf, Germany, August 5-16, 2013
Deadline for submissions: April 1st, 2013
https://www.easychair.org/conferences/?conf=essllistus2013
*ABOUT*:
The Student Session of the 25th European Summer School in Logic, Language,
and Information (ESSLLI) will take place in *Düsseldorf, Germany on August
5-16, 2013*. We invite submissions of original, unpublished work from
students in any area at the intersection of Logic & Language, Language &
Computation, or Logic & Computation. Submissions will be reviewed by
several experts in the field, and accepted papers will be presented orally
or as posters and will appear in the student session proceedings in
Springer. This is an excellent opportunity to receive valuable feedback
from expert readers and to present your work to a diverse audience.
*A SEPARATE POSTER SESSION*: Note that this year there are two separate
kinds of submissions, one for the oral presentations and one for the
posters. This means that papers can be directly submitted as posters.
Reviewing and ranking will be done separately. We particularly encourage
submissions for posters.
More detailed guidelines regarding submission can be found on the Student
Session website: http://stus2013.loriweb.org/, (links to previous years'
proceedings are also available there).
Please direct inquiries about submission procedures or other matters
relating to the Student Session to margotcolinet(a)gmail.com
For general inquiries about ESSLLI 2013, please consult the main ESSLLI
2013 page, http://esslli2013.de/.
Kind regards,
*The ESSLLI 2013 Student Session Organization Committee*,
Chair:
Margot Colinet (Université Paris Diderot-Paris 7)
LOCO (LOgic and Computation) co-chairs:
Ronald de Haan (Technische Universität Wien)
Michał Zawidzki (Uniwersytet Łódzki)
LOLA (LOgic and LAnguage) co-chairs:
Agata Renans (Universität Potsdam)
Barbara Tomaszewicz (University of Southern California)
LACO (LAnguage and Computation) co-chairs:
Pierre Bourreau (Heinrich-Heine-Universität Düsseldorf)
Julia Zinova (Heinrich-Heine-Universität Düsseldorf)
みなさま,
念のため,明日の中田景子さんのご講演について
場所と時間の変更のご案内を再度お送りします.
どうかよろしくお願いいたします!
蓮尾 一郎
---------- Forwarded message ----------
From: Ichiro Hasuo <ichiro(a)is.s.u-tokyo.ac.jp>
Date: Thu, Dec 13, 2012 at 9:06 AM
Subject: *** Time & Venue Changed *** Talk by Keiko Nakata (Tallinn U
of Tech), Tue 18 December 2012
To: logic-ml <logic-ml(a)sato.kuis.kyoto-u.ac.jp>, sonoteno
<sonoteno(a)m.aist.go.jp>, jssst-ppl(a)kb.ecei.tohoku.ac.jp
みなさま,
こんにちは! 東京大学の蓮尾と申します.
先日お知らせした,タリン工科大学の中田景子さんによるご講演ですが,
** 時間と場所を変更 ** させてください.(日程は同じです)
急なお知らせで申し訳ありません.
また,会場の国立情報学研究所では,中田さんのご講演の前(13:30-15:30)に
ToPS セミナーが開催されます.そちらにも是非どうぞ!
http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
=============================================
Tue 18 December 2012, 16:00-17:30
Keiko Nakata (Tallinn University of Technology), 2 Talks
国立情報学研究所 12階 1208号室 Rm. 1208, 12F, National Institute of Informatics
Access: http://www.nii.ac.jp/en/about/access
*** 場所・時間が変わりました *** *** The time and venue have been changed ***
中田さんのご講演の前(13:30-15:30)に,同じ場所で ToPS
セミナーが開催されます.そちらにも是非どうぞ!http://takeichi.ipl-lab.org/~tops/upcoming_seminar.h…
Prior to Dr. Nakata’s talk there will be a “ToPS seminar” at the same
location. The talks will be of similar research interests.
http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html
Talk 1: Proving open induction using delimited control operators
Open Induction (OI) is a principle classically equivalent to Dependent
Choice, which is, unlike the later, closed under double-negation
translation and A-translation. In the context of Constructive Reverse
Mathematics, Wim Veldman has shown that, in presence of Markov's
Principle, OI on Cantor space is equivalent to Double-negation Shift
(DNS). With Danko Ilik, we have reworked Veldman's proof to give a
constructive proof of OI, where DNS is interpreted using delimited
control operators.
Joint work with Danko Ilik.
Talk 2: Walking through infinite trees with mixed induction and
coinduction: A Proof Pearl with the Fan Theorem and Bar Induction.
We study temporal properties over infinite binary red-blue trees in
the setting of constructive type theory. We consider several familiar
path-based properties, typical to linear-time and branching-time
temporal logics like LTL and CTL*, and the corresponding tree-based
properties, in the spirit of the modal mu-calculus. We conduct a
systematic study of the relationships of the path-based and tree-based
versions of ``eventually always blueness '' and mixed
inductive-coinductive ``almost always blueness'' and arrive at a
diagram relating these properties to each other in terms of
implications that hold either unconditionally or under specific
assumptions (Weak Continuity for Numbers, the Fan Theorem, Lesser
Principle of Omniscience, Bar Induction).
Joint work with Marc Bezem and Tarmo Uustalu.
みなさま
東京大学萩谷研の平井洋一より、Logic Zooワークショップのご案内です。
2013年1月31日(木)東京開催です(前日30日には平井洋一の博士論文公聴会)。
講演・前日夕食の申込は 2013年1月15日(火) 締切です。
詳細及び申込 http://logiczoo13.pira.jp
論理をみつける話から論理を調べる話、論理を使う話まで
ご講演、ご参加をお待ちしております。
平井洋一
Logic Zoo Workshop 2013 (Jan. 31, Tokyo)
========================================
A workshop on living, playing or working logics.
Topics include:
- substructural and more exotic logics
- type systems
- programming languages
- mathematics on non-classical logics
- software verification
- logics for social, economical, legal or linguistic analysis.
Organizer: Yoichi Hirai yh(a)lyon.is.s.u-tokyo.ac.jp
Schedule and Location
---------------------
- 2013 Jan. 31 (Thu), 10:00--17:00
- Room 236, through Science Bldg. 7, 理学部7号館2階より化東236室
Hongo campus, the Univ. of Tokyo 東京大学本郷キャンパス
- with four blackboards 黒板4枚あり
Registration
------------
Please register for your talk slot and/or dinner by Jan. 15, 2013.
A talk will be 30-minute long (tentative estimation).
Fill this form and send it to yh(a)lyon.is.s.u-tokyo.ac.jp
==================================
Logic Zoo (Jan. 31) Registration
name:
affiliation:
eve-dinner on 30th: yes / no / not decided
giving a talk: yes / not decided
title: TBD or a title
==================================
Some Other Events
-----------------
2013-01-30 (Wed): Defense and Dinner
12:00--14:00
Yoichi Hirai's defense (first half is public): Hyper-Lambda Calculi
Room 102, Science Bldg. 7, Hongo campus, the Univ. of Tokyo
19:00--21:00
Dinner: Logic Zoo Eve
nearby restaurant
2013-01-31 (Thu): Workshop
10:00--17:00
Logic Zoo Workshop
Room 236, through Science Bldg. 7, Hongo campus, the Univ. of Tokyo
みなさま,
こんにちは! 東京大学の蓮尾と申します.
先日お知らせした,タリン工科大学の中田景子さんによるご講演ですが,
** 時間と場所を変更 ** させてください.(日程は同じです)
急なお知らせで申し訳ありません.
また,会場の国立情報学研究所では,中田さんのご講演の前(13:30-15:30)に
ToPS セミナーが開催されます.そちらにも是非どうぞ!
http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
=============================================
Tue 18 December 2012, 16:00-17:30
Keiko Nakata (Tallinn University of Technology), 2 Talks
国立情報学研究所 12階 1208号室 Rm. 1208, 12F, National Institute of Informatics
Access: http://www.nii.ac.jp/en/about/access
*** 場所・時間が変わりました *** *** The time and venue have been changed ***
中田さんのご講演の前(13:30-15:30)に,同じ場所で ToPS
セミナーが開催されます.そちらにも是非どうぞ!http://takeichi.ipl-lab.org/~tops/upcoming_seminar.h…
Prior to Dr. Nakata’s talk there will be a “ToPS seminar” at the same
location. The talks will be of similar research interests.
http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html
Talk 1: Proving open induction using delimited control operators
Open Induction (OI) is a principle classically equivalent to Dependent
Choice, which is, unlike the later, closed under double-negation
translation and A-translation. In the context of Constructive Reverse
Mathematics, Wim Veldman has shown that, in presence of Markov's
Principle, OI on Cantor space is equivalent to Double-negation Shift
(DNS). With Danko Ilik, we have reworked Veldman's proof to give a
constructive proof of OI, where DNS is interpreted using delimited
control operators.
Joint work with Danko Ilik.
Talk 2: Walking through infinite trees with mixed induction and
coinduction: A Proof Pearl with the Fan Theorem and Bar Induction.
We study temporal properties over infinite binary red-blue trees in
the setting of constructive type theory. We consider several familiar
path-based properties, typical to linear-time and branching-time
temporal logics like LTL and CTL*, and the corresponding tree-based
properties, in the spirit of the modal mu-calculus. We conduct a
systematic study of the relationships of the path-based and tree-based
versions of ``eventually always blueness '' and mixed
inductive-coinductive ``almost always blueness'' and arrive at a
diagram relating these properties to each other in terms of
implications that hold either unconditionally or under specific
assumptions (Weak Continuity for Numbers, the Fan Theorem, Lesser
Principle of Omniscience, Bar Induction).
Joint work with Marc Bezem and Tarmo Uustalu.
1
0
講演のお知らせ
by minami@kurt.cla.kobe-u.ac.jp
12 Dec '12