みなさま,
Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。
どうぞふるってご参加ください。
問い合わせ先:
東条 敏
北陸先端科学技術大学院大学 情報科学研究科
e-mail: tojo(a)jaist.ac.jp
------------------------------
-----------------
* JAIST Logic Seminar Series *
Date: Thursday 21 November, 2013, 15:10--16:40
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Robert A. Kowalski (Imperial College London)
Title: Towards a Logic-based Framework for Computing
(Joint work with Fariba Sadri)
Abstract:
In this talk, I present a logic-based, framework for Computing,
inspired by artificial intelligence, but scaled down for practical
database and programming applications. Computation in the framework is
viewed as the task of generating a sequence of state transitions, with
the purpose of making an agent’s goals all true. States are
represented by sets of atomic sentences (or facts), representing the
values of program variables, tuples in a coordination language, facts
in relational databases, or Herbrand models.
In the model-theoretic semantics of the framework, the
entire sequence of states and events is contained in a single
model-theoretic structure, by associating time stamps with facts and
events. But in the operational semantics, facts are updated
destructively, without time stamps. We show that the model generated
by destructive updates is identical to the model generated by
reasoning with facts containing time stamps. We also extend the model
with intentional predicates and composite event predicates defined by
logic programs containing conditions in first-order logic, which query
the current state.
Speaker's bio:
Professor Robert A. Kowalski (Emeritus Professor and Distinguished
Research Fellow) at Imperial College London.
Robert Kowalski studied at the University of Chicago, the University
of Bridgeport, Stanford University, the University of Warsaw, and the
University of Edinburgh, where he completed his PhD in 1970.
Kowalski has been an advisor to the UNDP Knowledge Based Systems
Project in India and to DFKI, the German Institute for Artificial
Intelligence. He co-ordinated the European Community Basic Research
Project, Compulog, and was the founder of the European Compulog
Network of Excellence. Since 2009, he has been an advisor to the
Department of Immunization, Vaccines and Biologicals, of the World
Health Organization in Geneva.
Kowalski is a Fellow of the Association for the Advancement of
Artificial Intelligence, the European Co-ordinating Committee for
Artificial Intelligence, and the Association for Computing Machinery.
He received the IJCAI (International Joint Conference of Artificial
Intelligence) award for Research Excellence in 2011.
--
Professor Hajime Ishihara
School of Information Science
Japan Advanced Institute of Science and Technology
1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan
Tel: +81-761-51-1206
Fax: +81-761-51-1149
ishihara(a)jaist.ac.jp
http://www.jaist.ac.jp/~ishihara
Dear all,
This coming Friday we have Ugo Dal Lago (Bologna) and
Paul-Andre Mellies (Paris VII) visiting us in U Tokyo and making
talks. Feel free to join us. See you there!
Best regards,
Ichiro Hasuo
http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar
------------------------------
Fri 8 November 2013, 10:00-12:00
Paul-Andre Mellies <http://www.pps.jussieu.fr/~mellies/> (U. Paris VII),
What a geometry of reasoning would look like?
理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html
Access: http://www-mmm.is.s.u-tokyo.ac.jp/
If one proceeds by analogy with mathematical physics, it is natural to
inquire
the geometric (rather than simply symbolic) nature of logical reasoning.
In this introductory talk, I will describe how this question may be
investigated
starting from a series of recent advances at the converging point of proof
theory
and of programming language semantics. In particular, I will explain how
a careful study of linear continuations, the most elementary mechanism
common to proofs and to programs, enables one to evacuate the historical
divide
between classical and constructive logic, and reveals the existence
of a logical pulsation which regulates reasoning and whose geometry
is related to well-known structures in mathematical physics.
Ugo Dal Lago <http://www.cs.unibo.it/~dallago/> (U. Bologna),
Applicative Bisimulation for Probabilistic Lambda-Calculus
理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html
Access: http://www-mmm.is.s.u-tokyo.ac.jp/
<http://www-mmm.is.s.u-tokyo.ac.jp/>
We study bisimulation and context equivalence in a probabilistic
lambda-calculus. Firstly, we show a technique for proving congruence of
probabilistic applicative bisimilarity. While the technique follows Howe's
method, some of the technicalities are quite different, relying on
non-trivial "disentangling" properties for sets of real numbers. We then
analyze the impact the employed notion of reduction has on
full-abstraction, giving somewhat surprising results in the call-by-value
case. We finally give another unexpected result about the discriminating
power of probabilistic contexts on pure lambda-terms.
皆様
Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。
どうぞふるってご参加ください。
問い合わせ先:
東条 敏
北陸先端科学技術大学院大学 情報科学研究科
e-mail: tojo(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
Date: Thursday 21 November, 2013, 15:10--16:40
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Robert A. Kowalski (Imperial College London)
Title: Towards a Logic-based Framework for Computing
(Joint work with Fariba Sadri)
Abstract:
In this talk, I present a logic-based, framework for Computing,
inspired by artificial intelligence, but scaled down for practical
database and programming applications. Computation in the framework is
viewed as the task of generating a sequence of state transitions, with
the purpose of making an agent’s goals all true. States are
represented by sets of atomic sentences (or facts), representing the
values of program variables, tuples in a coordination language, facts
in relational databases, or Herbrand models.
In the model-theoretic semantics of the framework, the
entire sequence of states and events is contained in a single
model-theoretic structure, by associating time stamps with facts and
events. But in the operational semantics, facts are updated
destructively, without time stamps. We show that the model generated
by destructive updates is identical to the model generated by
reasoning with facts containing time stamps. We also extend the model
with intentional predicates and composite event predicates defined by
logic programs containing conditions in first-order logic, which query
the current state.
Speaker's bio:
Professor Robert A. Kowalski (Emeritus Professor and Distinguished
Research Fellow) at Imperial College London.
Robert Kowalski studied at the University of Chicago, the University
of Bridgeport, Stanford University, the University of Warsaw, and the
University of Edinburgh, where he completed his PhD in 1970.
Kowalski has been an advisor to the UNDP Knowledge Based Systems
Project in India and to DFKI, the German Institute for Artificial
Intelligence. He co-ordinated the European Community Basic Research
Project, Compulog, and was the founder of the European Compulog
Network of Excellence. Since 2009, he has been an advisor to the
Department of Immunization, Vaccines and Biologicals, of the World
Health Organization in Geneva.
Kowalski is a Fellow of the Association for the Advancement of
Artificial Intelligence, the European Co-ordinating Committee for
Artificial Intelligence, and the Association for Computing Machinery.
He received the IJCAI (International Joint Conference of Artificial
Intelligence) award for Research Excellence in 2011.
--
Professor Hajime Ishihara
School of Information Science
Japan Advanced Institute of Science and Technology
1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan
Tel: +81-761-51-1206
Fax: +81-761-51-1149
ishihara(a)jaist.ac.jp
http://www.jaist.ac.jp/~ishihara
皆様,
# 重複して受け取られた場合はご容赦ください.
京都大学の末永と申します.
スウェーデンのハルムスタード大学の Walid Taha さんが
ポスドクを募集しています.Taha さんは最近 Acumen という
ハイブリッドシステムのモデリング言語を作っておられるのですが,
その言語のコンパイラについて研究するポストのようです.
興味をお持ちの方は Taha さんに直接コンタクトをお取りください.
末永幸平
--
Postdoc position on compiling hybrid differential equations
An NSF CPS project on Robot Design is building foundations and tools
for the simulation of hybrid (continuous/discrete) systems. The
project has an opening a postdoctoral research with Professor Taha at
Rice University. The successful candidate will design and evaluate
compilation strategies forenclosure-based solvers for hybrid
differential equations, and will be part of the team developing the
Acumen modeling language.
Applicants for this position should have strong skills and interest in
functional programming theory and practice; property-based testing;
performance analysis; and Scala. Excellent communication and
collaboration skills are required for both independent and
collaborative team work. Priority will be given to applicants who
already hold a doctoral degree in Computer Science, but applicants
with suitable skills and interests who hold a doctorate in
Mathematics, Physics, Electrical Engineering or Mechanical Engineering
are also encouraged to apply. Desirable experience includes
experience with writing numerical codes, interval and enclosure
methods, domain theory, operational semantics, formal verification,
differential equations, hybrid/impulsive differential equations, and
mechanical hardware design and control, especially in the context of
robotics. Desirable skills also include facility with Haskell, OCaml,
ML, Scheme, Mathematica, Maple, OpenGL, Matlab, Simulink, and other
modeling and simulation tools.
The position is for one year, renewable to two years, and is subject
to the availability of funding. The successful applicant will likely
spend part of their time in Halmstad, Sweden (50%) as part of the
collaboration. Successful applicants may start by the end of December
2013 or early March 2014.
The deadline for applications is November 29th, 2013. Application for
this position should be sent directly to Professor Taha by email. The
title of the email should be (without quotes) "Postdoc Position on
Compiling Hybrid Differential Equations". The application should
consist of one, self-contained PDF attachment. The application should
include 1) a brief cover letter including motivation for the
application, 2) a CV, and 3) a list of names of references. It is also
suggested that the application include online pointers to previous
publications or software produced by the applicant.
--
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/
皆様、
北陸先端科学技術大学院大学の佐野勝彦です。
CMCS'14 のCall for Papersをお送りいたします。
今回のCMCS'14では東京大学の蓮尾一郎さんの招待講演があります。
皆様、どうぞふるって論文をご投稿ください。締切は2014年1月です。
----------------------------------
Call for Papers
12th International Workshop on
Coalgebraic Methods in Computer Science (CMCS'14)
5 - 6 April 2014, Grenoble, France
http://www.coalg.org/cmcs14
Objectives and scope
-------------------
Established in 1998, the CMCS workshops aim to bring together researchers
with a common interest in the theory of coalgebras, their logics, and their
applications. As the workshop series strives to maintain breadth in its scope,
areas of interest include neighbouring fields as well. Topics of interest
include, but are not limited to, the following:
- The theory of coalgebras (including set theoretic and categorical
approaches)
- Coalgebras as computational and semantical models (for
programming languages, dynamical systems, term rewriting, etc.)
- Coalgebras in (functional, object-oriented, concurrent, and constraint)
programming
- Model checking, theorem proving and deductive verification
using coalgebraic techniques
- Coalgebraic data types, type systems and
behavioural typing
- Proof principles and (coinductive) definitions for
coalgebras (e.g. with bisimulations or invariants)
- Coalgebras and algebras
- Coalgebraic specification and verification
- Coalgebras and (modal) logic
- Coalgebra and control theory (notably of discrete event
and hybrid systems)
- Coalgebra in quantum computing
- Coalgebra and game theory
- Tools exploiting colgebraic techniques
Venue and event
---------------
CMCS??14 will be held in Grenoble, France, co-located with ETAPS 2014 on
5 - 6 April 2014.
Important dates
---------------
Abstract regular papers 6 January 2014
Submission regular papers 10 January 2014 (strict)
Notification regular papers 14 February 2014
Camera-ready copy 21 February 2014
Submission short contributions 23 February 2014 (strict)
Notification short contributions 9 March 2014
Invited speakers
----------------
Ichiro Hasuo, University of Tokyo, JP
Marina Lenisa, University of Udine, IT
Programme committee
-------------------
Andreas Abel, Ludwig-Maximilians-University Munich, DE
Davide Ancona, University of Genova, IT
Adriana Balan, University Politehnica of Bucharest, RO
Marta Bilkova, Charles University, CZ
Filippo Bonchi, LIP ENS-Lyon, FR
Marcello Bonsangue (chair), Leiden University, NL
Joerg Endrullis, Free University of Amsterdam, NL
Remy Haemmerle, University Politecnica de Madrid, SP
Bart Jacobs, Radboud University Nijmegen, NL???
Dexter Kozen, Cornell University, US
Bartek Klin, University of Warsaw, PL
Pierre Lescanne, ENS Lyon, FR
Stefan Milius, University of Erlangen-Nurenberg, DE
Rob Myers, Technical University of Braunschweig, DE
Dirk Pattinson, Australian National University, AU
Daniela Petrisan, University of Leicester, UK
Grigore Rosu, University of Illinois at Urbana-Champaign, US
Katsuhiko Sano, JAIST, Nomi, JP
Monika Seisenberger, Swansea University, UK
Ana Sokolova, University of Salzburg, AT
Publicity chair
---------------
Alexandra Silva, Radboud University Nijmegen, NL
PC chair
--------
Marcello Bonsangue, Leiden University, NL
Steering committee
------------------
Jiri Adamek, Technical University of Braunschweig, DE
Marcello Bonsangue, Leiden University, NL
Corina Cirstea, University of Southampton, UK
H. Peter Gumm (chair), University of Marburg, DE
Bart Jacobs, Radboud University Nijmegen, NL
Alexander Kurz, University of Leicester, UK
Marina Lenisa, University of Udine, IT
Ugo Montanari, University of Pisa, IT
Larry Moss, Indiana University, US
Dirk Pattinson, Australian National University, AU
John Power, University of Bath, UK
Horst Reichel, Technical University of Dresden, DE
Jan Rutten, CWI and Radboud University Nijmegen, NL
Lutz Schroeder, University of Erlangen-Nurenberg, DE
Submission guidelines
---------------------
We solicit two types of contributions: regular papers and short contributions.
Regular papers must be original, unpublished, and not submitted for
publication elsewhere. They should not exceed 20 pages in length in Springer
LNCS style. Short contributions may describe work in progress, or summarise
work submitted to a conference or workshop elsewhere. They should be no more
than two pages. Regular papers and short contributions should be submitted
electronically as a PDF file via the Easychair system at
http://www.easychair.org/conferences/?conf=cmcs2014.
The proceedings of CMCS 2014 will include all accepted regular papers and
will be published post-conference as a Springer volume in the IFIP-LNCS
series. Accepted short contributions will be bundled in a technical report.