皆様、
筑波大学の海野です。
来年4月下旬に開催される ETAPS 2020 併設のワークショップ TEASE-LP 2020 の
発表募集をお送りいたします。
論理プログラミングの確率・高階拡張や、検証、型推論、AIへの応用といった
近年のトレンドを扱うワークショップです。どうぞ参加・発表をご検討ください。
--
海野 広志
筑波大学システム情報系情報工学域
==========================================================================
Call for Contributions
Workshop on Trends, Extensions, Applications and
Semantics of Logic Programming (TEASE-LP 2020)
Dublin, Ireland, 25 April 2020
(co-located with ETAPS 2020)
www.coalg.org/tease-lp
Logic programming is a framework for expressing programs, propositions
and relations as Horn clause theories, with the purpose of performing
automatic inference in these theories. Horn clause theories are famous
for their well-understood declarative semantics, in which models of
logic programs are given inductively or coinductively. At the same time,
Horn clauses give rise to efficient inference procedures, usually involving
resolution. Logic programming found applications in type inference,
verification, and AI. While logic programming was originally conceived
for describing simple facts, it was extended to account for much more
complex theories. This includes higher-order theories, inductive and
coinductive data, and stochastic/probabilistic theories.
The aim of this workshop is to bring together researchers that work on
extensions of logic programming and inference methods, and to foster an
exchange of methods and applications that have emerged in different
communities.
Venue and Event
---------------------------
TEASE-LP 2020 will be held in Dublin, Ireland, co-located with
ETAPS 2020 on 25 April 2020.
Invited Speakers
---------------------------
* Keynote: Luke Ong, University of Oxford, GBR
* Tutorial: Uli Sattler, University of Manchester, GBR
Important Dates
---------------------------
Abstract submission: Wednesday, 26 February 2020 AoE
Notification: Wednesday, 25 March 2020 AoE
Camera-ready copy: Wednesday, 1 April 2020 AoE
Workshop: Saturday, 25 April 2020
Topics
---------------------------
The central idea of this workshop is to discuss the theory of logic
programming and associated topics that have as well the goal to
automatically infer knowledge and proofs. Our intention is to bring
together researchers that work on the numerous topics that contribute to
automatic proof inference and foster an exchange that may lead to advances
in the theory of logic programming.
Topics of interest include, but are not limited to, the following:
* Proof theory (e.g. focalised and uniform proofs),
* Logic programming beyond the classical Horn clause theories
(e.g. coinduction, higher-order Horn clauses, probabilities,
categorical logic, inductive LP),
* Extensions of logic programming (e.g. DataLog, description logic,
relational programming),
* Advanced implementations (e.g. λProlog, ELPI, miniKanren),
* Type theory (e.g. polarised λ-calculus, proofs-as-programs,
types for logic programming),
* Semantics (e.g. classical, categorical, algebraic, coalgebraic) , and
* Applications.
Programme Committee
---------------------------
Henning Basold (chair), Leiden University, NLD
Nikolaj Bjørner, Microsoft Research, USA
William Byrd, University of Alabama at Birmingham, USA
Gopal Gupta, The University of Texas at Dallas, USA
Ekaterina Komendantskaya (chair), Heriot-Watt University, GBR
Dale Miller, INRIA and LIX/Ecole Polytechnique, FRA
Gopalan Nadathur, University of Minnesota, USA
Frank Pfenning, Carnegie Mellon University, USA
Hiroshi Unno, University of Tsukuba, JPN
Noam Zeilberger, University of Birmingham, GBR
Submission Instructions
---------------------------
Since the aim of the workshop is to foster exchange and discussions
on trends, extensions, applications and semantics of logic programming,
we invite presentations of possibly already published as well as ongoing
work. Submissions should be abstracts of at most two pages in
EPTCS style (http://style.eptcs.org/) and will be only be published in
the informal pre-proceedings and on the website of the workshop.
Post-proceedings volume may be solicited by the PC, based on the quality
of contributions. Contributions should be submitted via the Easychair system:
https://easychair.org/my/conference?conf=teaselp2020
All contributions will be refereed by the programme committee and it is
expected that at least one of the authors will be present during the
workshop.
皆様,
(重複してお受け取りの方はご容赦ください.)
京都大学の末永です.
来年4月下旬に開催される CPS-IoT Week 2020 併設のワークショップ MT-CPS 2020 の
2nd call for presentation をお送りします.
https://sites.google.com/view/mt-cps2020/
サイバーフィジカルシステムのモニタリングとテストを中心として
関連するトピックに関する発表を募集しております.
CPS-IoT Week の会議 (HSCC, ICCPS, IPSN, RTAS, IC2E, ICFC, IoTDI) で
論文が accept された皆様は特にご発表をご検討いただけると幸いです.
宜しくお願いいたします.
末永
==========================================================================
5th Workshop on Monitoring and Testing of Cyber-Physical Systems
(MT-CPS 2020)
https://sites.google.com/view/mt-cps2020/home
Part of CPS-IoT Week 2020
https://www.cse.unsw.edu.au/~cpsiot/cpsweek2020/
April 21, 2020 - Sydney, Australia
==========================================================================
* Description
Cyber-physical systems (CPS) model the integration of computational
modules, like decision logic, with physical phenomena in the
environment, such as the phenomenon being controlled by the
logic. Several CPS applications, such as self-driving cars and other
autonomous ground/aerial/underwater vehicles, medical devices,
surgical robots, as well as many Internet of Things (IoT)
applications, particularly for Industrial IoT or Industry 4.0, are
safety-critical, where human lives can be at stake. CPS exhibit
complex and unpredictable behaviors, thus making their correctness and
robustness analysis a challenging task. Given the gap between the
complexity of such systems and the scalability of current formal
methods, exhaustive formal verification remains an elusive
goal. However, simulation-based lightweight verification techniques,
such as monitoring and testing, achieve both rigor and efficiency by
enabling the evaluation of systems according to the properties of
their exemplar behaviors. The Workshop on Monitoring and Testing of
Cyber-Physical Systems (MT-CPS) aims to bring together researchers and
practitioners interested in the problems of detecting, testing,
measuring, and extracting qualitative and quantitative properties from
individual behaviors of CPS.
* Topics of interest include (but are not limited to):
- Specification languages for monitoring and testing
- Runtime verification and monitoring of CPS
- Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing
- Testing the integration of heterogeneous components
- Monitoring and testing of streaming and/or historical IoT data
- Interpretation of multi-dimensional counter-examples
- Black-box and white-box testing
- Measuring and statistical information gathering for data-driven analyses
- Simulation-based verification and parameter synthesis
- Fault diagnostics, localization, and recovery
- Combination of static and dynamic analysis
- Applications and case studies from safety-critical domains
* Workshop format
MT-CPS is intended to be a forum for exchanging the latest scientific
activity and emerging trends between researchers and practitioners. We
encourage submission of abstracts that address any of the
aforementioned topics of interest and cover recently published or work
in progress. In addition to the contributed material, the workshop
will include a combination of invited talks from leading researchers
and/or practitioners from industry, academia, and government research
labs around the world.
The workshop is intended to be an informal gathering about latest
results and, as such, it will not have formal proceedings. However, we
will make accepted abstracts and presentation material publicly
available.
Abstracts are submitted via Easychair:
https://easychair.org/conferences/?conf=mtcps2020
* Submission instructions
Abstracts should be in PDF form, up to 2 pages in length with 1-inch
margins and at least 10-point font size, and may contain up to two
figures. Abstracts should list the full names, affiliations, and
contact information of all authors. If you are interested in
demonstrating a technology you are working on at the workshop, please
indicate so in your abstract submission.
Abstracts will be reviewed by the Program Committee. Those that are
selected for oral presentations will be posted on the workshop
website, and will be part of the papers distributed to CPS-IoT Week
participants.
* Important Dates
Abstract submission deadline: February 16, 2020
Notification: March 8, 2020
Final version: March 29, 2020
Workshop: April 21, 2020
* Committee
- Program Chairs
Paolo Arcaini, National Institute of Informatics
Kohei Suenaga, Kyoto University
- Program Committee
Houssam Abbas, Oregon State University
Shaukat Ali, Simula Research Laboratory
Ezio Bartocci, Vienna University of Technology
Thao Dang, Verimag
Jyotirmoy Deshmukh, University of Southern California
Alexandre Donzé, Decyphir
Georgios Fainekos, Arizona State University
Ichiro Hasuo, National Institute of Informatics
Bardh Hoxha, Souther Illinois University
Baekgyu Kim, Toyota InfoTechnology Center
Konstantinos Mamouras, Rice University
Mohammad Mousavi, University of Leicester
Jens Oehlerking, Robert Bosch GmbH
Akshay Rajhans, MathWorks
Kristin Yvonne Rozier, Iowa State University
Oleg Sokolsky, University of Pennsylvania
- Steering Committee
Houssam Abbas, Oregon State University
Ezio Bartocci, Vienna University of Technology
Jyotirmoy Deshmukh, University of Southern California
Georgios Fainekos, Arizona State University
Sajed Miremadi, Volvo Cars
Dejan Nickovic, AIT Austrian Institute of Technology
Jens Oehlerking, Bosch
--
Kohei Suenaga (末永幸平), Ph.D
Associate professor (准教授)
Graduate School of Informatics, Kyoto University
(京都大学情報学研究科)
ksuenaga(a)gmail.com
http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/
皆様,
東北大学の松田です.
来年の7月9-10にオスロで開催される国際会議 RC 2020 の〆切が1週間延長されましたので,
改めてご案内をお送りいたします.
何卒投稿をご検討いただけますと幸いです.
--------------------------------------------------
We apologize if you receive multiple copies of this Call for Papers.
Please distribute to anyone who may be interested.
=======================================================================
12th Conference on Reversible Computation
(RC 2020)
Deadline extension
July 9th-10th, 2020, Oslo, Norway
Abstract Submission: February 7th, 2020 (extended)
Submission Deadline: February 14th, 2020 (extended)
https://reversible-computation-2020.github.io/
=======================================================================
Reversible computation has a growing number of promising application
areas such as low power design, coding/decoding, debugging, testing
and verification, database recovery, discrete event simulation,
reversible algorithms, reversible specification formalisms, reversible
programming languages, process algebras, and the modeling of
biochemical systems. Furthermore, reversible logic provides a basis
for quantum computation with its applications, for example, in
cryptography and in the development of highly efficient algorithms.
First reversible circuits and quantum circuits have been implemented
and are seen as promising alternatives to conventional CMOS
technology.
The conference will bring together researchers from computer science,
mathematics, and physics to discuss new developments and directions
for future research in Reversible Computation. This includes
applications of reversibility in quantum computation. Research papers,
tutorials, tool demonstrations, and work-in-progress reports are
within the scope of the conference. Invited talks by leading
international experts will complete the program. Contributions on all
areas of Reversible Computation are welcome, including---but not
limited to---the following topics:
* Applications
* Architectures
* Algorithms
* Bidirectional transformations
* Circuit Design
* Debugging
* Fault Tolerance and Error Correction
* Hardware
* Information Theory
* Physical Realizations
* Programming Languages
* Quantum Computation
* Software
* Synthesis
* Theoretical Results
* Testing
* Verification
===== Important Dates =====
Abstract submission: February 7, 2020 (extended)
Submission deadline: February 14, 2020 (extended)
Notification to authors: March 20, 2020
Final version: April 10, 2020
Conference: July 9 - July 10, 2020
===== Invited speakers =====
Marek Perkowski (Portland State University, US)
Perdita Stevens (University of Edinburgh, Scotland)
===== Special issue =====
After the conference, authors of best papers will be invited to submit
an extended version of their work to a special issue to be published
in Science of Computer Programming (Elsevier).
===== Paper submission =====
Interested researchers are invited to submit full research papers (16
pages maximum), tutorials (16 pages maximum), as well as
work-in-progress or tool demonstration papers (6 pages maximum) in
Springer LNCS format. Additional material intended for reviewers but
not for publication in the final version - for example, details of
proofs - may be placed in a clearly marked appendix that is not
included in the page limit. Reviewers are at liberty to ignore
appendices and papers must be understandable without them.
Contributions must be written in English and report on original,
unpublished work, not submitted for publication elsewhere. Submissions
not adhering to the specified constraints may be rejected without
review. Each paper will undergo a peer review of at least 3 anonymous
reviewers. All accepted papers will be included in the conference
proceedings and published by Springer as a Lecture Notes in Computer
Science (LNCS) volume. Papers can be submitted electronically in pdf
via the RC 2020 interface of the EasyChair system:
https://easychair.org/conferences/?conf=rc2020
===== General Chair =====
Rudolf Schlatte
University of Oslo
Norway
===== Program Chairs =====
Ivan Lanese
University of Bologna/INRIA
Italy
Mariusz Rawski
Warsaw University of Technology
Poland
===== Program Committee =====
* Gerhard Dueck (University of New Brunswick, Canada)
* Robert Glück (University of Copenhagen, Denmark)
* Jarkko Kari (University of Turku, Finland)
* Jean Krivine (CNRS, France)
* Martin Lukac (Nazarbayev University, Kazakhstan)
* Kazutaka Matsuda (Tohoku University, Japan)
* Claudio Antares Mezzina (Università di Urbino, Italy)
* Lukasz Mikulski (Nicolaus Copernicus University, Poland)
* Torben Ægidius Mogensen (University of Copenhagen, Denmark)
* Claudio Moraga (TU Dortmund University, Germany)
* Iain Phillips (Imperial College London, UK)
* Krzysztof Podlaski (University Of Lodz, Poland)
* Markus Schordan (Lawrence Livermore National Laboratory, US)
* Peter Selinger (Dalhousie University, Canada)
* Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland)
* Milena Stankovic (University of Nis, Serbia)
* Himanshu Thapliyal (University of Kentucky, US)
* Irek Ulidowski (University of Leicester, UK)
* German Vidal (Universitat Politecnica de Valencia, Spain)
* Robert Wille (Johannes Kepler University Linz, Austria)
* Tetsuo Yokoyama (Nanzan University, Japan)
皆様、
Walter Carnielli先生の依頼で、代理投稿させていただきます。
どうぞよろしくお願い致します。
大森仁
*************************************
Call for Applications: 100 grants - “Sao Paulo School of Advanced
Science on Contemporary Logic, Rationality and Information” at
CLE/Unicamp, Brazil
*https://splogic.org*
Important deadlines & procedures:
-Applications from January 15th to February 22th, 2020
-Notification of acceptance till March 23th, 2020
-Fast application track: https://splogic.org/call-for-entries/
- For further info: cle.fapesp.logic(a)gmail.com
************************************
We are delighted to inform that the “Sao Paulo School of Advanced
Science on Contemporary Logic, Rationality and Information – SPLogiC”,
promoted by the Centre for Logic, Epistemology and the History of
Science (CLE) of the University of Campinas (Unicamp),Brazil, will be
held at Unicamp from July 13th to 24th, 2020.
The School, funded by Sao Paulo Research Foundation (FAPESP),
celebrates the 90th anniversary of Newton da Costa and aims at:
- Providing an overview of the state-of-art methodology and research
on contemporary logic (featuring non-classical logics), rationality
and information.
- Attracting qualified candidates to work on research institutions in
the State of São Paulo.
The program comprises 9 courses and 9 plenary talks delivered in
English by experts in each topic, as well as oral presentations (LED
Talks) and poster sessions by the students.
Topics to be covered include:
• History and Philosophy of Paraconsistent Logics
• The Australian, Belgian Brazilian,and Israeli schools on paraconsistency
• Logic and Reasoning
• Logic and Information
• Logic and Argumentation
• Methodological aspects on interpreting, translating and combining logics
• Logic, Probabiity and Artificial Intelligence.
The event will select 100 fully-funded participants (50 grantees from
all states of Brazil and 50 international grantees). Funding includes
airfare, medical insurance, accommodation and meals throughout the two
weeks.
Undergraduate, graduate students and postdoctoral fellows (up to 5
years after completion of the Ph.D) from all countries are encouraged
to apply.
For additional information visit the WebSite: https://splogic.org
We look forward to receiving you!
Itala M. Loffredo D’Ottaviano, Coordinator
Walter Carnielli, Advisory Committee Chair
-----------------------------------------------
Centre for Logic, Epistemology and the History of Science
State University of Campinas –UNICAMP
13083-859 Campinas -SP, Brazil
-----------------------------------------------
Walter Carnielli
https://waltercarnielli.com/
皆様,
東北大学の松田です.
来年の7月9-10にオスロで開催される国際会議 RC 2020 の第二回論文募集の案内をお送りいたします.
前回(第一回)からの主な情報の差分は招待講演者の情報です.具体的には,RC 2020の招待講演が以下の方々に決定いたしました.
Marek Perkowski (Portland State University, US)
Perdita Stevens (University of Edinburgh, Scotland)
何卒投稿をご検討いただければ幸いです.
-------------
We apologize if you receive multiple copies of this Call for Papers.
Please distribute to anyone who may be interested.
=======================================================================
12th Conference on Reversible Computation
(RC 2020)
July 9th-10th, 2020, Oslo, Norway
Abstract Submission: January 31th, 2020
Submission Deadline: February 7th, 2020
https://reversible-computation-2020.github.io/
=======================================================================
Reversible computation has a growing number of promising application
areas such as low power design, coding/decoding, debugging, testing
and verification, database recovery, discrete event simulation,
reversible algorithms, reversible specification formalisms, reversible
programming languages, process algebras, and the modeling of
biochemical systems. Furthermore, reversible logic provides a basis
for quantum computation with its applications, for example, in
cryptography and in the development of highly efficient algorithms.
First reversible circuits and quantum circuits have been implemented
and are seen as promising alternatives to conventional CMOS
technology.
The conference will bring together researchers from computer science,
mathematics, and physics to discuss new developments and directions
for future research in Reversible Computation. This includes
applications of reversibility in quantum computation. Research papers,
tutorials, tool demonstrations, and work-in-progress reports are
within the scope of the conference. Invited talks by leading
international experts will complete the program. Contributions on all
areas of Reversible Computation are welcome, including---but not
limited to---the following topics:
* Applications
* Architectures
* Algorithms
* Bidirectional transformations
* Circuit Design
* Debugging
* Fault Tolerance and Error Correction
* Hardware
* Information Theory
* Physical Realizations
* Programming Languages
* Quantum Computation
* Software
* Synthesis
* Theoretical Results
* Testing
* Verification
===== Important Dates =====
Abstract submission: January 31, 2020
Submission deadline: February 7, 2020
Notification to authors: March 20, 2020
Final version: April 10, 2020
Conference: July 9 - July 10, 2020
===== Invited speakers =====
Marek Perkowski (Portland State University, US)
Perdita Stevens (University of Edinburgh, Scotland)
===== Special issue =====
After the conference, authors of best papers will be invited to submit
an extended version of their work for a special issue in a relevant
journal of the field. The name of the selected journal will be
published on the RC website in the next days.
===== Paper submission =====
Interested researchers are invited to submit full research papers (16
pages maximum), tutorials (16 pages maximum), as well as
work-in-progress or tool demonstration papers (6 pages maximum) in
Springer LNCS format. Additional material intended for reviewers but
not for publication in the final version - for example, details of
proofs - may be placed in a clearly marked appendix that is not
included in the page limit. Reviewers are at liberty to ignore
appendices and papers must be understandable without them.
Contributions must be written in English and report on original,
unpublished work, not submitted for publication elsewhere. Submissions
not adhering to the specified constraints may be rejected without
review. Each paper will undergo a peer review of at least 3 anonymous
reviewers. All accepted papers will be included in the conference
proceedings and published by Springer as a Lecture Notes in Computer
Science (LNCS) volume. Papers can be submitted electronically in pdf
via the RC 2020 interface of the EasyChair system:
https://easychair.org/conferences/?conf=rc2020
===== General Chair =====
Rudolf Schlatte
University of Oslo
Norway
===== Program Chairs =====
Ivan Lanese
University of Bologna/INRIA
Italy
Mariusz Rawski
Warsaw University of Technology
Poland
===== Program Committee =====
* Gerhard Dueck (University of New Brunswick, Canada)
* Robert Glück (University of Copenhagen, Denmark)
* Jarkko Kari (University of Turku, Finland)
* Jean Krivine (CNRS, France)
* Martin Lukac (Nazarbayev University, Kazakhstan)
* Kazutaka Matsuda (Tohoku University, Japan)
* Claudio Antares Mezzina (Università di Urbino, Italy)
* Lukasz Mikulski (Nicolaus Copernicus University, Poland)
* Torben Ægidius Mogensen (University of Copenhagen, Denmark)
* Claudio Moraga (TU Dortmund University, Germany)
* Iain Phillips (Imperial College London, UK)
* Krzysztof Podlaski (University Of Lodz, Poland)
* Markus Schordan (Lawrence Livermore National Laboratory, US)
* Peter Selinger (Dalhousie University, Canada)
* Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland)
* Milena Stankovic (University of Nis, Serbia)
* Himanshu Thapliyal (University of Kentucky, US)
* Irek Ulidowski (University of Leicester, UK)
* German Vidal (Universitat Politecnica de Valencia, Spain)
* Robert Wille (Johannes Kepler University Linz, Austria)
* Tetsuo Yokoyama (Nanzan University, Japan)
===== Contacts =====
rc2020(a)easychair.org
https://reversible-computation-2020.github.io/
皆様
来年2月20日〜22日に石川県加賀市で行われます「第52回TRSミーティング」
の参加者募集案内をお送り致します。
本ミーティングは口頭発表からなるインフォーマルな国内集会でして、
項書換え分野の発表だけでなくその隣接分野、応用分野の発表も大歓迎
です。参加をご検討頂けると幸いです。
廣川 直 (JAIST)
======================================================================
CALL FOR PARTICIPATION
52nd TRS Meeting
February 20 - 22, 2020, Kaga, Ishikawa
https://www.jaist.ac.jp/~hirokawa/trs-meeting/original/52.html
======================================================================
The Term Rewriting Meeting (TRS Meeting) is a biannual informal
workshop that aims at promoting the research on rewriting and related
areas. Participants are requested to give a talk of approximately 15
to 60 minutes in English on their research activities. The subject
of the talk is not required to be one's original result; for example,
explaining an interesting paper is perfectly OK.
See also: http://www.jaist.ac.jp/~hirokawa/trs-meeting/
* Information
Date:
February 20 (Thu) - 22 (Sat), 2020
Venue:
Hotel Arrowle (http://www.arrowle.co.jp/)
5-1 Shibayama-cho, Kaga, Ishikawa, Japan
Registration fee:
tba (but most likely around 26,000 JPY)
Accommodation fees:
- 7,850 JPY per night for a single room
- 6,200 JPY per night for a twin room shared with two persons
* Registration
Please send the following registration form to Nao Hirokawa
<hirokawa(a)jaist.ac.jp> by January 7 (Tue), 2020.
----------------------------------------------------------------------
Registration Form of the 52nd TRS Meeting
Name:
Affiliation:
Title of talk (*):
Duration of talk (*):
Preference on your room: [single / shared]
[Male / Female] (leave one)
Requests/comments (on foods, partial participation, etc.):
----------------------------------------------------------------------
The items marked with * can be sent later.
皆様,
国際会議IJCARの投稿募集です(概要締切1/16, 論文締切1/23).
今回は,CADE, FroCoS, TABLEAUX だけでなくて,ITP (International
Conference on Interactive Theorem Proving)の合同会議になっています.
また,FSCDとの同時開催(6/29-7/5,@パリ)になります.
ぜひ,ご投稿を検討頂けますよう,よろしくお願い申し上げます.
---
青戸等人(新潟大学)
===============================================================================
CALL FOR PAPERS
IJCAR 2020
The 10th International Joint Conference on Automated Reasoning
Paris, France, June 29-July 5, 2020
https://ijcar2020.org
===============================================================================
IJCAR is the premier international joint conference on all topics in automated
reasoning. The IJCAR 2020 technical program will consist of presentations of
high-quality original research papers, short papers describing interesting work
in progress, system descriptions, and invited talks. IJCAR 2020 (+ workshops,
tutorials, etc.) will take place in Paris (France) from June 29 to July 5 2020.
It will be co-located with the conference FSCD.
IJCAR 2020 is the merger of leading events in automated reasoning:
* CADE (Conference on Automated Deduction)
* FroCoS (Symposium on Frontiers of Combining Systems)
* ITP (International Conference on Interactive Theorem Proving)
* TABLEAUX (Conference on Analytic Tableaux and Related Methods)
TOPICS
======
IJCAR 2020 invites submissions related to all aspects of automated or
interactive reasoning, including foundations, implementations, and
applications. Original research papers and descriptions of working automated
deduction systems or proof assistants are solicited.
IJCAR topics include the following ones:
* Logics of interest include: propositional, first-order, classical,
equational, higher-order, non-classical, constructive, modal, temporal,
many-valued, substructural, description, type theory.
* Methods of interest include: tableaux, sequent calculi, resolution, model-
elimination, inverse method, paramodulation, term rewriting, induction,
unification, constraint solving, decision procedures, model generation,
model checking, semantic guidance, interactive theorem proving, logical
frameworks, AI-related methods for deductive systems, proof presentation,
automated theorem proving, combination of decision or proof procedures, SAT
and SMT solving, integration of proof assistants with automated provers and
other symbolic tools, etc.
* Applications of interest include: verification, formal methods, program
analysis and synthesis, computer mathematics, declarative programming,
deductive databases, knowledge representation, education, formalization of
mathematics etc.
The proceedings of IJCAR 2020 will be published by Springer in the LNAI/LNCS
series (www.springer.com/lncs).
IMPORTANT DATES
===============
* Abstract submission: January 16, 2020
* Paper submission: January 23, 2020
* Rebuttal: March 6-10, 2020
* Notification: March 20, 2020
* Final version of papers due: April 10, 2020
* IJCAR Conference + Workshops: June 29 - July 5, 2020
INVITED SPEAKERS
================
* Clark Barrett (Stanford University, USA)
* John Harrison (Amazon Web Services, USA) Joint IJCAR-FSCD speaker
* Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil)
* Ruzica Piskac (Yale University, USA)
* Rene Thiemann (University of Innsbruck, Austria) Joint FSCD-IJCAR speaker
SUBMISSION GUIDELINES
=====================
Submission is electronic, through
https://easychair.org/conferences/?conf=ijcar2020
Authors are strongly encouraged to use LaTeX and the Springer "llncs" format,
which can be obtained from
http://www.springer.de/comp/lncs/authors.html
We solicit three categories of submissions:
REGULAR PAPERS.
Submissions, not exceeding fifteen (15) pages excluding bibliography, should
contain original research, and 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 software available with
their submission for reproducibility. In particular submissions describing
formal proofs are expected to be accompanied by the source files of the
formalization. The PC will take availability of software and data into account
when evaluating submissions. Submissions reporting on case studies in an
industrial context are strongly invited, and should describe details,
weaknesses and strength in sufficient depth. Simultaneous submission to other
conferences with proceedings or submission of material that has already been
published elsewhere is not allowed.
SYSTEM DESCRIPTIONS.
Submissions, not exceeding seven (7) pages excluding bibliography, should
describe the implemented tool and its novel features. Submissions in this
category should bear the phrase "(system description)" beneath the title. One
author is expected to be able to perform a demonstration on demand to accompany
a tool presentation. Papers describing tools that have already been presented
in other conferences before will be accepted only if significant and clear
enhancements to the tool are reported and implemented.
SHORT PAPERS.
Submissions, not exceeding five (5) pages excluding bibliography, and
describing interesting work in progress. Such a preliminary report may consist
of an extended abstract. Each of these papers should bear the phrase "(short
paper)" beneath the title. Accepted submissions in this category will be
presented as short talks and published in the main proceedings. There will be
no downgrading from regular papers or system descriptions to short papers.
All submissions should meet high academic standards; proofs of theoretical
results that do not fit in the page limit, executables of systems, and input
data of experiments should be made available, via a reference to a website or
in an appendix of the paper.
BEST PAPER AWARD
================
IJCAR 2020 will recognize the most outstanding submission with a best paper
award at the conference.
STUDENT TRAVEL AWARDS
====================
Woody Bledsoe Travel Awards will be available to support selected students
attending the conference.
SPECIAL ISSUE
=============
The authors of a selection of the best IJCAR 2020 papers will be invited to
submit an extended version of their paper after the conference, to be published
in a special issue of Logical Methods in Computer Science.
ORGANIZATION
============
Conference Chair:
* Kaustuv Chaudhuri (INRIA, Ecole Polytechnique)
Programme Chairs:
* Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France),
* Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany)
Workshop, Tutorial and Competition Chairs:
* Giulio Manzonetto (Université Paris-Nord, France)
* Andrew Reynolds (University of Iowa, USA)
Programme Committee:
* Takahito Aoto (Niigata University, Japan)
* Carlos Areces (FaMAF Universidad Nacional de Cordoba, Argentina)
* Jeremy Avigad (Carnegie Mellon University, USA)
* Franz Baader (TU Dresden, Germany)
* Peter Baumgartner (Data 61 and CSIRO, Australia)
* Christoph Benzmüller (Freie Universität Berlin, Germany)
* Yves Bertot (INRIA, Sophia Antipolis, France)
* Armin Biere (Johannes Kepler University Linz, Austria)
* Nikolaj Bjorner (Microsoft Research, USA)
* Jasmin Blanchette (Vrije Universiteit Amsterdam, Netherlands)
* Maria Paola Bonacina (Universita degli Studi di Verona, Italy)
* James Brotherston (University College London, UK)
* Serenella Cerrito (IBISC, Univ. Evry, Paris Saclay University, France)
* Agata Ciabattoni (Vienna University of Technology, Austria)
* Koen Claessen (Chalmers University of Technology, Gothenburg, Sweden)
* Leonardo de Moura (Microsoft Research, USA)
* Stéphane Demri (CNRS, LSV, ENS Paris-Saclay, France)
* Gilles Dowek (Inria and ENS Paris-Saclay, France)
* Marcelo Finger (University of São Paulo, Brazil)
* Pascal Fontaine (Universite de Lorraine, CNRS, Inria, LORIA, France)
* Didier Galmiche (Universite de Lorraine - LORIA, France)
* Silvio Ghilardi (Universita degli Studi di Milano, Italy)
* Martin Giese (Universitetet i Oslo, Norway)
* Juergen Giesl (RWTH Aachen University, Germany)
* Valentin Goranko (Stockholm University, Sweden)
* Rajeev Gore (The Australian National University, Australia)
* Stefan Hetzl (Vienna University of Technology, Austria)
* Marijn J. H. Heule (The University of Texas at Austin, USA)
* Cezary Kaliszyk (University of Innsbruck, Austria)
* Deepak Kapur (University of New Mexico, USA)
* Laura Kovacs (Vienna University of Technology, Austria)
* Andreas Lochbihler (Digital Asset (Switzerland) GmbH)
* Christopher Lynch (Clarkson University, USA)
* Assia Mahboubi (Inria, France)
* Panagiotis Manolios (Northeastern University, USA)
* Dale Miller (Inria and LIX/Ecole Polytechnique, France)
* Claudia Nalon (University of Brasilia, Brazil)
* Tobias Nipkow (Technical University of Munich, Germany)
* Albert Oliveras (Universitat Politècnica de Catalunya, Spain)
* Jens Otten (University of Oslo, Norway)
* Lawrence Paulson (University of Cambridge, UK)
* Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France)
* Frank Pfenning (Carnegie Mellon University, USA)
* Andrei Popescu (Middlesex University London, UK)
* Andrew Reynolds (University of Iowa, USA)
* Christophe Ringeissen (LORIA-INRIA, France)
* Christine Rizkallah (University of New South Wales, Australia)
* Katsuhiko Sano (Hokkaido University, Japan)
* Renate Schmidt (The University of Manchester, UK)
* Stephan Schulz (DHBW Stuttgart, Germany)
* Roberto Sebastiani (DISI, University of Trento, Italy)
* Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany)
* Matthieu Sozeau (INRIA Paris, France)
* Martin Suda (Czech Technical University, Czech Republic)
* Geoff Sutcliffe (University of Miami, USA)
* Sofiene Tahar (Concordia University, Canada)
* Cesare Tinelli (The University of Iowa, USA)
* Christian Urban (King's College London, UK)
* Josef Urban (Czech Technical University in Prague, Czech Republic)
* Uwe Waldmann (Max Planck Institute for Informatics, Germany)
* Christoph Weidenbach (Max Planck Institute for Informatics, Germany)
皆様,
(重複してお受け取りの方はご容赦ください.)
京都大学の末永です.
来年4月下旬に開催される CPS-IoT Week 2020 併設のワークショップ MT-CPS 2020 の
発表募集をお送りします.
https://sites.google.com/view/mt-cps2020/
サイバーフィジカルシステムのモニタリングとテストを中心として
関連するトピックに関する発表を募集しております.
CPs-IoT Week にお越しの方は特に,それ以外の方もどうぞ発表をご検討ください.
末永
==========================================================================
5th Workshop on Monitoring and Testing of Cyber-Physical Systems
(MT-CPS 2020)
https://sites.google.com/view/mt-cps2020/home
Part of CPS-IoT Week 2020
https://www.cse.unsw.edu.au/~cpsiot/cpsweek2020/
April 21, 2020 - Sydney, Australia
==========================================================================
* Description
Cyber-physical systems (CPS) model the integration of computational
modules, like decision logic, with physical phenomena in the
environment, such as the phenomenon being controlled by the
logic. Several CPS applications, such as self-driving cars and other
autonomous ground/aerial/underwater vehicles, medical devices,
surgical robots, as well as many Internet of Things (IoT)
applications, particularly for Industrial IoT or Industry 4.0, are
safety-critical, where human lives can be at stake. CPS exhibit
complex and unpredictable behaviors, thus making their correctness and
robustness analysis a challenging task. Given the gap between the
complexity of such systems and the scalability of current formal
methods, exhaustive formal verification remains an elusive
goal. However, simulation-based lightweight verification techniques,
such as monitoring and testing, achieve both rigor and efficiency by
enabling the evaluation of systems according to the properties of
their exemplar behaviors. The Workshop on Monitoring and Testing of
Cyber-Physical Systems (MT-CPS) aims to bring together researchers and
practitioners interested in the problems of detecting, testing,
measuring, and extracting qualitative and quantitative properties from
individual behaviors of CPS.
* Topics of interest include (but are not limited to):
- Specification languages for monitoring and testing
- Runtime verification and monitoring of CPS
- Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing
- Testing the integration of heterogeneous components
- Monitoring and testing of streaming and/or historical IoT data
- Interpretation of multi-dimensional counter-examples
- Black-box and white-box testing
- Measuring and statistical information gathering for data-driven analyses
- Simulation-based verification and parameter synthesis
- Fault diagnostics, localization, and recovery
- Combination of static and dynamic analysis
- Applications and case studies from safety-critical domains
* Workshop format
MT-CPS is intended to be a forum for exchanging the latest scientific
activity and emerging trends between researchers and practitioners. We
encourage submission of abstracts that address any of the
aforementioned topics of interest and cover recently published or work
in progress. In addition to the contributed material, the workshop
will include a combination of invited talks from leading researchers
and/or practitioners from industry, academia, and government research
labs around the world.
The workshop is intended to be an informal gathering about latest
results and, as such, it will not have formal proceedings. However, we
will make accepted abstracts and presentation material publicly
available.
Abstracts are submitted via Easychair:
https://easychair.org/conferences/?conf=mtcps2020
* Submission instructions
Abstracts should be in PDF form, up to 2 pages in length with 1-inch
margins and at least 10-point font size, and may contain up to two
figures. Abstracts should list the full names, affiliations, and
contact information of all authors. If you are interested in
demonstrating a technology you are working on at the workshop, please
indicate so in your abstract submission.
Abstracts will be reviewed by the Program Committee. Those that are
selected for oral presentations will be posted on the workshop
website, and will be part of the papers distributed to CPS-IoT Week
participants.
* Important Dates
Abstract submission deadline: February 16, 2020
Notification: March 8, 2020
Final version: March 29, 2020
Workshop: April 21, 2020
* Committee
- Program Chairs
Paolo Arcaini, National Institute of Informatics
Kohei Suenaga, Kyoto University
- Program Committee
Houssam Abbas, Oregon State University
Shaukat Ali, Simula Research Laboratory
Ezio Bartocci, Vienna University of Technology
Thao Dang, Verimag
Jyotirmoy Deshmukh, University of Southern California
Alexandre Donzé, Decyphir
Georgios Fainekos, Arizona State University
Ichiro Hasuo, National Institute of Informatics
Bardh Hoxha, Souther Illinois University
Baekgyu Kim, Toyota InfoTechnology Center
Konstantinos Mamouras, Rice University
Mohammad Mousavi, University of Leicester
Jens Oehlerking, Robert Bosch GmbH
Akshay Rajhans, MathWorks
Kristin Yvonne Rozier, Iowa State University
Oleg Sokolsky, University of Pennsylvania
- Steering Committee
Houssam Abbas, Oregon State University
Ezio Bartocci, Vienna University of Technology
Jyotirmoy Deshmukh, University of Southern California
Georgios Fainekos, Arizona State University
Sajed Miremadi, Volvo Cars
Dejan Nickovic, AIT Austrian Institute of Technology
Jens Oehlerking, Bosch
皆様
6月末にパリで行われます FSCD 2020 の二回目の論文募集案内
をお送り致します。招待講演者の情報が加筆されております。
ぜひ論文の投稿をご検討下さい。
廣川 (JAIST)
=========================================================================
Updated information on: Invited speakers
=========================================================================
CALL FOR PAPERS
Fifth International Conference on
Formal Structures for Computation and Deduction (FSCD 2020)
June 29 – July 5, 2020, Paris, France
http://fscd2020.org/
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions
will not be considered.
Abstract: February 6, 2020
Submission: February 9, 2020
Rebuttal: March 27-29, 2020
Notification: April 13, 2020
Final version: April 27, 2020
INVITED SPEAKERS
----------------
- René Thiemann: FSCD-IJCAR joint speaker
(http://cl-informatik.uibk.ac.at/users/thiemann/)
- John Harrison: FSCD-IJCAR joint speaker
(https://www.cl.cam.ac.uk/~jrh13/)
- Brigitte Pienta
(https://www.cs.mcgill.ca/~bpientka/)
- Andrew Pitts
(https://www.cl.cam.ac.uk/~amp12/)
- Simona Ronchi della Rocca
(http://www.di.unito.it/~ronchi/)
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, models of computation,
semantics and verification in new challenging areas.
The suggested, but not exclusive, list of topics for submission is:
1. Calculi: Rewriting systems (string, term, higher-order, graph,
conditional, modulo, infinitary, etc.);
Lambda calculus; Logics (first-order, higher-order, equational,
modal, linear, classical, constructive, etc.);
Proof theory (natural deduction, sequent calculus, proof nets,
etc.); Type theory and logical frameworks;
Homotopy type theory; Quantum calculi.
2. Methods in Computation and Deduction: Type systems (poly- morphism,
dependent, recursive, intersection, session, etc.);
Induction, coinduction; Matching, unification, completion, order-
ings; Strategies (normalization, completeness, etc.);
Tree automata; Model building and model checking; Proof search and
theorem proving;
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, 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;
Verification tools;
Proof assistants and interactive theorem provers; Applications in
industry;
Applications of formal sys- tems in other sciences.
6. Semantics and Verification in new challenging areas: Certification;
Security; Blockchain protocols;
Data Bases; Deep learning and machine learning algorithms; Planning.
PUBLICATION
—————
The proceedings will be published as an electronic volume in the Leibniz
International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.
All LIPIcs proceedings are open access.
SPECIAL ISSUE
-------------
Authors of selected papers will be invited to submit an extended version to
a special issue of Logical Methods in Computer Science.
SUBMISSION GUIDELINES
---------------------
Submissions can be made in two categories. Regular research papers are
limited to 15 pages (including references, with the possibility to add
an annex for technical details, e.g. proofs) and must present original
research which is unpublished and not submitted elsewhere. System
descriptions are limited to 15 pages (including references) and must
present new software tools in which FSCD topics play an important role,
or significantly new versions of such tools. Complete instructions on
submitting a paper can be found on the conference web site.
BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The program committee will select a paper in which at least one author
is a junior researcher, i.e. either a student or whose PhD award date
is less than three years from the first day of the meeting.
Other authors should declare to the PC Chair that at least 50% of
contribution is made by the junior researcher(s).
PROGRAM COMMITTEE CHAIR
-----------------------
Zena M. Ariola, University of Oregon
fscd2020(a)easychair.org
PROGRAM COMMITTEE
-----------------
M. Alpuente, Technical Univ. of Valencia
S. Alves, University of Porto
A. Bauer, University of Ljubljana
M. P. Bonacina, Università degli studi di Verona
P-L. Curien, CNRS - Univ. of Paris Diderot
P. Dybjer, Chalmers Univ. of Technology
U. De’Liguoro, University of Torino
M. Fernández, King’s College London
M. Gaboardi, Boston University
D. Ghica, University of Birmingham
S. Ghilezan, University of Novi Sad
J. Giesl, RWTH Aachen University
S. Guerrini, University of Paris 13
R. Harper, Carnegie Mellon University
M. Hasegawa, Kyoto University
N. Hirokawa, JAIST
P. Johann, Appalachian State University
O. Kammar, University of Edinburgh
D. Kesner, University of Paris Diderot
C. Kop, Radboud University
O. Laurent, ENS Lyon
D. Licata, Wesleyan University
A. Middeldorp, University of Innsbruck
J. Mitchell, Stanford University
K. Nakata, SAP Postdam
M. Pagani, University of Paris Diderot
E. Pimentel, Fed. Univ. Rio Grande do Norte
F. van Raamsdonk, Vrije University Amsterdam
G. Rosu, University of Illinois
A. Sabry, Indiana University
A. Stump, University of Iowa
P. Urzyczyn, University of Warsaw
T. Uustalu, Reykjavik University
S. Zdancewic, University of Pennsylvania
CONFERENCE CHAIR
----------------
Stefano Guerrini, University of Paris 13
WORKSHOP CHAIR
--------------
Giulio Manzonetto, University of Paris 13
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
J. Vicary, Oxford University
PUBLICITY CHAIR
---------------
S. Alves, University of Porto
FSCD STEERING COMMITTEE
-----------------------
S. Alves (University of Porto),
M. Ayala-Rincón (University of Brasilia)
C. Fuhs (Birkbeck, London University)
H. Geuvers (Radboud University)
D. Kesner (Chair, University of Paris Diderot )
H. Kirchner (Inria)
C. Kop (Radboud University)
D. Mazza (University of Paris 13)
D. Miller (Inria)
L. Ong (Oxford University)
J. Rehof (TU Dortmund)
S. Staton (Oxford University)
皆様、産総研の山形と申します。Swansea大学のArnold Beckmann教授の講演会を下記の通り開催いたします。Beckmann教授は限定算術、証明複雑度およびそれらと計算複雑度との関係などを研究されています。
入構に事前登録が必要なため、参加ご希望の方は12月12日正午までに山形まで、お名前と所属をお知らせください。参加ご希望の方は必ず事前に連絡していただくようお願いします。
講演日時:12月13日14:00-15:00
場所:産総研関西センター C-6棟2階第16会議室
https://goo.gl/maps/ZJzcgE1agWLxypsk7
*************************
Arnold Beckmann: Consistency of equational theories and the separation
problem for bounded arithmetic
Abstract: The separation problem for bounded arithmetic is one of the
most important problems in the area due to its tight connections to the
question whether computational complexity classes can be separated, the
Millennium problem whether P equals NP or not being the most well-known
one. Well studied candidates for separating theories of bounded
arithmetic are consistency statements of formal theories, building on
Kurt Goedel's famous incompleteness theorems. The most promising
consistency statements are given by those of certain equational
theories. In our talk, we will review the results on consistency of
equational theories in the context of the separation problem for bounded
arithmetic. We explain the progress that has been made over recent
years to advance this problem, and state the research programme that has
resulted from it.
*************************
よろしくご参集ください。
—
山形賴之
国立研究開発法人 産業技術総合研究所 主任研究員
http://staff.aist.go.jp/yoriyuki.yamagata/
皆様,
東北大学の松田です.
来年の7月9-10にオスロで開催される国際会議 RC 2020 の論文募集の案内をお送りいたします.
何卒投稿をご検討いただければ幸いです.
=======================================================================
12th Conference on Reversible Computation
(RC 2020)
July 9th-10th, 2020, Oslo, Norway
Abstract Submission: January 31th, 2020
Submission Deadline: February 7th, 2020
https://reversible-computation-2020.github.io/
=======================================================================
Reversible computation has a growing number of promising application
areas such as low power design, coding/decoding, debugging, testing
and verification, database recovery, discrete event simulation,
reversible algorithms, reversible specification formalisms, reversible
programming languages, process algebras, and the modeling of
biochemical systems. Furthermore, reversible logic provides a basis
for quantum computation with its applications, for example, in
cryptography and in the development of highly efficient algorithms.
First reversible circuits and quantum circuits have been implemented
and are seen as promising alternatives to conventional CMOS
technology.
The conference will bring together researchers from computer science,
mathematics, and physics to discuss new developments and directions
for future research in Reversible Computation. This includes
applications of reversibility in quantum computation. Research papers,
tutorials, tool demonstrations, and work-in-progress reports are
within the scope of the conference. Invited talks by leading
international experts will complete the program. Contributions on all
areas of Reversible Computation are welcome, including---but not
limited to---the following topics:
* Applications
* Architectures
* Algorithms
* Bidirectional transformations
* Circuit Design
* Debugging
* Fault Tolerance and Error Correction
* Hardware
* Information Theory
* Physical Realizations
* Programming Languages
* Quantum Computation
* Software
* Synthesis
* Theoretical Results
* Testing
* Verification
===== Important Dates =====
Abstract submission: January 31, 2020
Submission deadline: February 7, 2020
Notification to authors: March 20, 2020
Final version: April 10, 2020
Conference: July 9 - July 10, 2020
===== Invited speakers =====
TO BE ANNOUNCED
===== Paper submission =====
Interested researchers are invited to submit full research papers (16
pages maximum), tutorials (16 pages maximum), as well as
work-in-progress or tool demonstration papers (6 pages maximum) in
Springer LNCS format. Additional material intended for reviewers but
not for publication in the final version - for example, details of
proofs - may be placed in a clearly marked appendix that is not
included in the page limit. Reviewers are at liberty to ignore
appendices and papers must be understandable without them.
Contributions must be written in English and report on original,
unpublished work, not submitted for publication elsewhere. Submissions
not adhering to the specified constraints may be rejected without
review. Each paper will undergo a peer review of at least 3 anonymous
reviewers. All accepted papers will be included in the conference
proceedings and published by Springer as a Lecture Notes in Computer
Science (LNCS) volume. Papers can be submitted electronically in pdf
via the RC 2020 interface of the EasyChair system:
https://easychair.org/conferences/?conf=rc2020
===== General Chair =====
Rudolf Schlatte
University of Oslo
Norway
===== Program Chairs =====
Ivan Lanese
University of Bologna/INRIA
Italy
Mariusz Rawski
Warsaw University of Technology
Poland
===== Program Committee =====
* Gerhard Dueck (University of New Brunswick, Canada)
* Robert Glück (University of Copenhagen, Denmark)
* Jarkko Kari (University of Turku, Finland)
* Jean Krivine (CNRS, France)
* Martin Lukac (Nazarbayev University, Kazakhstan)
* Kazutaka Matsuda (Tohoku University, Japan)
* Claudio Antares Mezzina (Università di Urbino, Italy)
* Lukasz Mikulski (Nicolaus Copernicus University, Poland)
* Torben Ægidius Mogensen (University of Copenhagen, Denmark)
* Claudio Moraga (TU Dortmund University, Germany)
* Iain Phillips (Imperial College London, UK)
* Krzysztof Podlaski (University Of Lodz, Poland)
* Markus Schordan (Lawrence Livermore National Laboratory, US)
* Peter Selinger (Dalhousie University, Canada)
* Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland)
* Milena Stankovic (University of Nis, Serbia)
* Himanshu Thapliyal (University of Kentucky, US)
* Irek Ulidowski (University of Leicester, UK)
* German Vidal (Universitat Politecnica de Valencia, Spain)
* Robert Wille (Johannes Kepler University Linz, Austria)
* Tetsuo Yokoyama (Nanzan University, Japan)
===== Contacts =====
rc2020(a)easychair.org
https://reversible-computation-2020.github.io/
みなさま
第3回の基礎論セミナーのお知らせです。
どなたでも聴講できますので
ご興味のおありの方はどうぞいらして下さい。
web page:
https://www.ms.u-tokyo.ac.jp/seminar/logic/
新井敏康
第3回基礎論セミナー
日時:2019年12月20日(金)13:00-14:30
場所:東京大学大学院数理科学研究科 156号室
講演者:池上 大祐
title:
On supercompactness of \omega_1
abstract::
In ZFC, all the large cardinals are much bigger than \omega_1, the
least uncountable cardinal, while without assuming the Axiom of
Choice, \omega_1 could have some large cardinal properties. Jech and
Takeuti independently proved that if the axiom system ZFC + There is a
measurable cardinal is consistent, then so is ZF + \omega_1 is a
measurable cardinal. Takeuti also proved that one can replace
"measurable cardinal" above with "supercompact cardinal" as well as
some other large cardinals. Woodin proved that one can reduce the
assumption, i.e., the consistency of ZFC + a supercompact cardinal, to
that of ZFC + There are proper class many Woodin cardinals which are
limits of Woodin cardinals, to obtain the consistency of ZF + \omega_1
is a supercompact cardinal. Furthermore, the model he constructed also
satisfies the Axiom of Determinacy (AD).
In this talk, after giving some background on the connections between
large cardinals and determinacy, we discuss some consequences of the
axiom system ZF + \omega_1 is a supercompact cardinal. This is joint
work with Nam Trang.
投稿の締め切りが 12月28日になりました。
=====================================================
AWPL 2020: 5th Asian Workshop on Philosophical Logic
7-9 April 2020
Hangzhou, China
https://www.xixilogic.org/events/awpl2020/ <https://www.xixilogic.org/events/awpl2020/>
=====================================================
CALL FOR PAPERS
The 5th Asian Workshop on Philosophical Logic, 7-9 April 2020, Hangzhou, China
Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second, third and fourth workshops took place successfully in Guangzhou (2014), Taipei (2016) and Beijing (2018), respectively. The previous post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer.
The Fifth Asian Workshop on Philosophical Logic (AWPL 2020) will be held in Hangzhou, China, on 7-9 April 2020, organized by the Institute of Logic and Cognition at Zhejiang University.
The AWPL 2020 workshop is an event in the Zhejiang Logic for AI Summit (ZjuLogAI 2020, https://www.xixilogic.org/zjulogai/ <https://www.xixilogic.org/zjulogai/>) which takes place on 6-10 April 2020. All AWPL participants are invited to attend other events as well.
------------------------
INVITED SPEAKERS (confirmed)
Christoph Benzmüller <http://page.mi.fu-berlin.de/cbenzmueller/> (Freie Universität Berlin)
------------------------
SUBMISSION
All submissions should present original works not previously published. Submissions should be typeset in English, using the LNCS template (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>), be prepared as a PDF file with at most 12 pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2020 <https://easychair.org/conferences/?conf=awpl2020>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series.
------------------------
IMPORTANT DATES
Submission deadline: 28 December 2019.
Notification: 1 January 2020
Workshop: 7-9 April 2020
------------------------
PROGRAM COMMITTEE (to be confirmed)
Thomas Ågotnes, University of Bergen
Nick Bezhanishvili, University of Amsterdam
Sujata Ghosh, Indian Statistical Institute
Meiyun Guo, South-West University, China
Fengkui Ju, Beijing Normal University
Kok-Yong Lee, National Chung Cheng University
Beishui Liao, Zhejiang University (chair)
Hanti Lin, University of California Davis
Fenrong Liu, Tsinghua University
Hu Liu, Sun Yat-Sen University
Xinwen Liu, Chinese Academy of Social Sciences
Minghui Ma, Sun Yat-Sen University
Hiroakira Ono, JAIST, Japan
Eric Pacuit, University of Maryland
R Ramanujam, Institute of Mathematical Sciences, India
Olivier Roy, University of Bayreuth
Katsuhiko Sano, Hokkaido University
Yì N. Wáng, Zhejiang University (co-chair)
Chin-Mu Yang, Taiwan National University
Jiji Zhang, Lingnan University
_______________________________________________
Logic-ml mailing list
Logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:Logic-ml@fos.kuis.kyoto-u.ac.jp>
http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml>
みなさま
直前になりましたが、第2回の基礎論セミナー
のお知らせです。
どなたでも聴講できますので
ご興味のおありの方はどうぞいらして下さい。
web page:
https://www.ms.u-tokyo.ac.jp/seminar/logic/
新井敏康
第2回基礎論セミナー
日時:2019年11月21日(木)13:30-15:00
場所:東京大学大学院数理科学研究科 003号室
講演者:佐藤憲太郎
title:
Self-referential Theorems for Finitist Arithmetic
abstract::
The finitist logic excludes,on the syntax level, unbounded quantifiers
and accommodates only bounded quantifiers.
The following two self-referential theorems for arithmetic theories
over the finitist logic will be considered:
Tarski's impossibility of naive truth predicate and
Goedel's incompleteness theorem.
Particularly, it will be briefly explained that
(i) the naive truth theory over the finitist arithmetic with summation
and multiplication
is consistent and proves its own consistency, and that
(ii) by the use of finitist arithmetic, the hierarchy of consistency strengths,
based on Goedel's second incompleteness theorem,
can be extended downward (to the area not reachable by first order
predicate arithmetic).
This is a joint work with Jan Walker, and overlaps significantly with
his doctoral dissertation.
問合せ先:新井敏康
tosarai(a)ms.u-tokyo.ac.jp
Workshop Announcement
Categorical Algebra and Computation
A Workshop in Honour of John Power on the occasion of his 60th Birthday
23rd December 2019
Research Institute for Mathematical Sciences, Kyoto University
http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/
We are delighted to host a workshop in honour of John Power on the occasion of
his 60th birthday at RIMS, Kyoto University. John, recently retired and now
a honorary professor at Macquarie University, Sydney, is staying in Kyoto as
a visiting professor of RIMS for the winter of 2019/2020. During his stay in
Kyoto, John turns 60.
John has made substantial contributions in category theory and its applications
to computer science throughout his career. At the same time, he has been
a wonderful teacher, mentor and friend to many of us, with his exceptional
insights, kindness, and humour.
Since the 1990's John has regularly visited Japan and worked with Japanese
researchers, including several PhD students and young postdocs.
John's presence has made great impact on Japanese research community of
semantics of computation and related fields; John has co-authored a number of
papers with young Japanese researchers and served as their mentor.
This workshop will feature talks by John's friends and collaborators as well as
young Japanese researchers who are under the influence of John's work
in a broad sense.
The speakers will include
- Soichiro Fujii (Kyoto University)
- Shin-ya Katsumata (NII, Tokyo)
- Yoshiki Kinoshita (Kanagawa University)
- Yuichi Komorida (NII, Tokyo)
- Steve Lack (Macquarie University)
- Ken Sakayori (University of Tokyo)
and John Power.
Registration
Attendance is free. Please register at the workshop webpage
http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/
so that we can estimate the number of participants. (We plan to supply tea,
coffee and sweets during the break.)
Venue
The workshop will take place in the conference room 420 of the RIMS main
building located in the North Campus of the university. For access
information and maps see
http://www.kurims.kyoto-u.ac.jp/en/access-01.html
Organizers
- Masahito Hasegawa (local organizer) (Kyoto University)
- Ichiro Hasuo (NII, Tokyo)
- Makoto Takeyama (Kanagawa University)