Logic-ml

logic-ml@fos.kuis.kyoto-u.ac.jp

7 participants
1772 discussions

第48回 MLG 数理論理学研究集会のご案内[再送：講演・宿泊締切11月20日]
by Katsuhiko Sano 14 Nov '13

14 Nov '13

第48回 MLG 数理論理学研究集会のご案内（再送） (重複してお受け取りの際はご容赦ください。) 北陸先端科学技術大学院大学の佐野勝彦です。講演の申し込み締切（11月20日）まで一週間を切りましたので、再度ご案内させていただきます。 2013年度MLG数理論理学研究集会（第48回）を下記の要領で開催いたします。多くの方のご講演・ご参加をお待ちしております。 ========================================= 第48回 MLG 数理論理学研究集会開催要領 ========================================= 期間: 2013 年 12 月 6 日(金) 〜 12 月 8 日(日) 場所: 山中温泉河鹿荘ロイヤルホテル（JR加賀温泉駅から車で約20分，加賀温泉駅から送迎あり）〒922-0126 石川県加賀市山中温泉河鹿町ホ100 URL : http://www.daiwaresort.jp/kajikasou/ 講演・宿泊申込締め切り: 2013 年 11 月 20 日（水）申し込みはこちらから --> https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LST… ホームページ：https://sites.google.com/site/mlg2013kaga/ 連絡先E-mail :mlg.logic.japan [at] gmail.com ============ 参加募集 ============ ・講演時間は原則40分を予定しています。・12月7日（土）の夜に懇親会を行います。・全日程参加の場合，参加費（宿泊代・食事代・会場代）は25000円前後になる予定です。・ご講演をなさらなくても参加いただけます。山中温泉河鹿荘ロイヤルホテルで宿泊および食事をなさらない場合にも参加費（会場代）2500円をいただきます。・講演申し込みは、https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LSTk/viewform の registration form からお願い致します。世話人佐野勝彦〒923-1292 石川県能美市旭台1-1 北陸先端科学技術大学院大学情報科学研究科 MLG2013に関するメールは，mlg.logic.japan [at] gmail.com まで。 -- Katsuhiko Sano School of Information Science Japan Advanced Institute for Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

1 0

Kowalski先生講演
by Satoshi Tojo 13 Nov '13

13 Nov '13

みなさま， 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

1 0

Talks by Ugo Dal Lago and Paul-Andre Mellies, This Friday (Nov 8)
by Ichiro Hasuo 06 Nov '13

06 Nov '13

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.

1 0

講演会のお知らせ
by KASHIMA Ryo 06 Nov '13

06 Nov '13

【一般向け講演会のお知らせ】日時：11月30日（土）15:00--16:30 会場：東京工業大学大岡山キャンパス西８号館Ｅ棟10階　　　情報理工学研究科大会議室講師：田中一之（東北大学）題目：数学パスルに挑む概要：知恵の輪、ソリティア、ルービック・キューブ、帽子パズルなど多種多様なパズルの世界に、天才チューリングが開発した計算可能理論を武器にして乗り込もう。ときには解けないと悟ることも正解である。ベネディクト・カンバーバッチがチューリングを演じる映画『The Imitation Game』の公開も待ち遠しい。案内ページ： http://www.is.titech.ac.jp/~kashima/Events/Lecture2013Tanaka.html どなたでもご参加いただけます。参加される方は下記宛にお申し込みください。 ------ 鹿島亮（東京工業大学情報理工学研究科） kashima(a)is.titech.ac.jp

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 01 Nov '13

01 Nov '13

皆様 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

1 0

数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Nov '13

01 Nov '13

数学基礎論若手の会2013のご案内（プログラムが準備できました）数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html プログラム： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/program.html 講演および宿泊のお申し込みの受け付けは終了いたしました． 11月16日（土）19:30より，懇親会を予定致しております．参加をご希望なさる方は，11月10日（日）までに，幹事までご連絡ください．

1 0

CREST 特任教員の募集（計算言語学、形式意味論、計算論理学）（〆切
by BEKKI Daisuke 31 Oct '13

31 Oct '13

$B!J=EJ#$7$F<u$1<h$i$l$?>l9g$O$4MF<O$/$@$5$$!K(J JST$B!&(JCREST$B8&5fNN0h!V%S%C%0%G!<%?4pHW!W(J http://www.jst.go.jp/kisoken/crest/research_area/ongoing/bunyah25-6.html $B$K$*$$$F!"$3$N$?$S:NBr$5$l$^$7$?8&5f2]Bj!'(J $B!VCN<1$K4p$E$/9=B$E*8@8l=hM}$N3NN)$HCN<1%$%s%U%i$N9=C[!W(J $B!J8&5fBeI=<T!'9u66DwIW!"8&5fJ,C4<T!'4%7rB@O:!"8M<!Bg2p!"5\HxM42p!K(J $B$r?d?J$9$k$?$a$K!"2<5-$N$H$*$j!"FCG$650w$N8xJg$r9T$$$^$9!#$J$*!"K\(J $B8xJg$K4X$7$F$O!"(JJREC-IN$B$N0J2<$N9`L\$b$4;2>H2<$5$$!#(J http://jrecin.jst.go.jp/seek/SeekJorDetail?fn=4&id=D113101576&ln_jor=0 $B5-(J 1. $B?&L>5Z$S?M0w(J $BFCG$=Z65<x$^$?$OFCG$=u65(J $B7W#2L>!JG$4|IU$-!K(J 2. $B=jB0(J $B$*Cc$N?e=w;RBg3X%7%_%e%l!<%7%g%s2J3X650i8&5f%;%s%?!<(J 3. $B6PL3>l=j(J $B$*Cc$N?e=w;RBg3X(J $BEl5~ETJ85~6hBgDM#2CzL\#1HV#19f(J $B:G4s$j1X!'El5~%a%H%m4]%NFb@~h,2YC+1XKt$OM-3ZD.@~(J $B8n9q;{1X$+$iELJb#7J,(J 4. $B@lLgJ,Ln(J $B7W;;8@8l3X!"7A<00UL#O@!"7W;;O@M}3X(J 5. $B?&L3FbMF(J $B!V0UL#$NI=8=!&7W;;%b%G%k$N9=C[!W$N8&5f!"(J $BFC$K0J2<$N%F!<%^(J(1)$B$^$?$O(J(2)$B$K4X$9$k8&5f$r9T$&!#(J (1) $BHOaFJ8K!Ey$N7A<0J8K!M}O@$K4p$E$/9b@:EY$J9=J82r@O(J $B!J9qN)>pJs3X8&5f=j(J $B5\Hx8&5f<<$H$N6&F18&5f!K(J (2) $B%b%@%j%F%#!&A0Ds$J$I$N8@8l8=>]$rBP>]$H$7$?!"9b3,7?M}O@$K4p$E$/(J $B0UL#7W;;$N<BAuEy$K4X$9$k8&5f(J $B!J$*Cc$N?e=w;RBg3X(J $B8M<!8&5f<<$H$N6&F18&5f!K(J 6. $B1~Jg;q3J(J (1) $BGn;N$N3X0L$^$?$O$3$l$HF1Ey$N8&5fG=NO$rM-$9$kJ}!#(J $BJ?@.(J25$BG/EYCf$KGn;N<hF@8+9~$_$NJ}$b4^$`!#(J (2) $B?&L3$N?k9T$KI,MW$H$5$l$kCN<1$d5;=Q$rM-$9$k$3$H!#(J 7. $B8[MQ4|4V(J $BJ?@.(J26$BG/(J4$B7n(J1$BF|0J9_$J$k$Y$/Aa$$;~4|!AJ?@.(J27$BG/(J3$B7n(J31$BF|(J $BG/EYKh$KO+;HAPJ}$N9g0U$K$h$j99?7$9$k$3$H$,$"$jF@$k!#(J $B$J$*!"99?7$O:GD9$GJ?@.(J31$BG/(J3$B7n(J31$BF|!J%W%m%0%i%`$N(J $B=*N;!K$^$G$H$9$k!#(J 8. $B="6H;~4V(J 8$B!'(J30$B!A(J17$B!'(J15$B!J7nMKF|!A6bMKF|!K$r4pK\$H$9$k:[NL(J $BO+F/@)$H$9$k!#(J $B!J>e5-;~4V$O5Y7F;~4V(J60$BJ,$r4^$`!K(J 9. $B5YF|!&5Y2K(J $B5YF|!'EZMKF|!&F|MKF|!"9qL1$N=KF|5Z$SG/KvG/;O(J $B!J(J12$B7n(J29$BF|!A(J1$B7n(J3$BF|!K(J $B5Y2K!'G/<!M-5k5Y2K!"IB5$5Y2K!"FCJL5Y2K(J 10. $B5kM?(J $BK\3X5kM?5,Dx$K4p$E$-;Y5k$9$k!#(J $B4pK\G/Jp!J4pK\G/Jp$r(J12$B7n$G3d$C$?3[$rKh7n;Y5k!K(J $BFCG$=Z65<x(J600$BK|1_!"FCG$=u65(J360$BK|1_(J $B@G6b5Z$SJ!Mx8|@8Hq!J8[MQJ]81NA!"6&:QAH9g3]6b!K$N(J $B<+8JIiC4J,$r95=|$9$k!#(J 11. $B<jEv(J $BK\3X5kM?5,Dx$K4p$E$-DL6P<jEv$r;Y5k$9$k!#(J $B$J$*!"4|Kv!&6PJY<jEv$N;Y5k$O$J$7!#(J $B!J$?$@$7!"DL6P5wN%$,#2-RL$K~$N>l9g$O!"DL6P<jEv$r(J $B;Y5k$7$J$$!#$^$?!":NMQF|$,7n$NCfES$N>l9g!"DL6P<j(J $BEv$OMb7n$+$i;Y5k$9$k!#!K(J 12. $BB`?&<jEv(J $B;Y5k$J$7!#(J 13. $B2CF~J]81(J $BO+:R!"8[MQJ]81!"J8It2J3X>J6&:QAH9g$K2CF~$9$k!#(J 14. $BDs=P=qN`(J (1) $BMzNr=q!J<L??E=IU!"Fh0u!"3XNr!&?&Nr!&<u>^Nr!&=jB0(J $B3X2q!&=;=j!&(JE-mail$B%"%I%l%9Ey$rL@5-$N$3$H!K(J (2) $B8&5f6H@S0lMw!JCx=q!"O@J8!J?3::$NM-L5JL!K!">7BT9V(J $B1i!"3X2qH/I=!"$=$NB>$KJ,N`$9$k$3$H!K(J (3) $B<gMW$JCx=q!"O@J8Ey$NJL:~$jKt$O<L$7!J(J3$BE@0JFb(J $B6H@S(J $B0lMwCf$K!{0u$rIU$9$3$H!K(J (4) $B=w;RBg3X$K650w$H$7$F="?&$9$k$3$H$X$NJzIi(J $B!J(J1,000$B;zDxEY!K(J (5) $BK\3X$G9T$*$&$H$9$k8&5f$K4X$9$kJzIi(J $B!J$3$l$^$G$N8&5f6H@S$rF'$^$($F5-:\$9$k$3$H!K(J $B!J(J2,000$B;zDxEY!K(J (6) $B=$N;!J8+9~$_!K>ZL@=q<c$7$/$O3X0L<xM?>ZL@=q(J (7) $B#2L>$NJ}$+$i$N?dA&>uKt$O1~Jg<T$K$D$$$F=j8+$r5a$a(J $BF@$kJ}#2L>$N;aL>5Z$SO"Mm@h(J (8) $B1~Jg=qN`JVAwMQIuE{!J!ZHw9M![;2>H!K(J $B$J$*!"(J(3)(8)$B0J30$O!"=q<0$r86B'#A#4H=$KE}0l$9$k$3$H!#(J 15. $BA*9MJ}K!(J (1) $BBh#1<!A*9M(J $B=qN`?3::(J $BA*9M7k2L$O!"K\?M08$KM9Aw$K(J $B$FDLCN$7$^$9!#(J (2) $BBh#2<!A*9M(J $BBh#1<!A*9M9g3J<T$KBP$7$F$N$_LL@\?3::(J $BLL@\?3::$G$O!"%W%l%<%s%F!<%7%g%s$r<B;\$N>e!"<A5?(J $B1~Ez$r9T$$$^$9!#(J $B%W%l%<%s%F!<%7%g%s2]Bj!&<B;\F|;~Ey>\:Y$O!"Bh#1<!(J $BA*9M9g3J<T$K!"Bh#1<!A*9M7k2L$HJ;$;$FDLCN$7$^$9!#(J $B$J$*!"LL@\Ey$K78$kN9Hq!"=IGqHqEy$O1~Jg<T$NIiC4$H(J $B$7$^$9!#:G=*E*$JA*9M7k2L$O!"K\?M08$KM9Aw$K$FDLCN(J $B$$$?$7$^$9!#(J 16. $BDs=P4|8B(J $BJ?@.(J25$BG/(J12$B7n(J10$BF|!J2P!K@58aI,Ce(J 17. $BDs=P@h(J $B")(J112-8610 $BEl5~ETJ85~6hBgDM#2CzL\#1HV#19f(J $B9qN)Bg3XK!?M$*Cc$N?e=w;RBg3XD9(J $B1)F~:4OB;R(J $B08(J 18. $BLd9g$;@h(J $B$*Cc$N?e=w;RBg3XBg3X1!(J $B?M4VJ82=AO@.2J3X8&5f2J<+A3!&1~MQ2J3X7O(J $B=Z65<x(J $B8M<!Bg2p(J E-mail$B!'(J bekki.daisuke(a)ocha.ac.jp $B$*Ld$$9g$o$;$O!"86B'EE;R%a!<%k$G$*4j$$$$$?$7$^$9!#(J $B!ZHw9M![(J $B1~Jg=qN`$O!"IuE{I=LL$K!VFCG$650w!J8M<!8&5f<<!K1~Jg=qN`:_Cf!W$H<k(J $B5-$7!"=qN1Kt$O4J0W=qN1$GM9Aw!JBpG[JX$b2D!K$N$3$H!#$J$*!"1~Jg=qN`$O(J $BJV5Q$9$k$N$G!"I,$:JVAwMQIuE{!J@Z<jEyE=IU!"JVAw08@hL@5-!K$rF1Iu$9$k(J $B$3$H!#(J $B$J$*!"K\8&5f%W%m%8%'%/%H$K4XO"$7$F!"5~ETBg3X!&ElKLBg3X$K$*$$$F$b(J $B!VCN<1$K4p$E$/9=B$E*8@8l=hM}!W!V%F%-%9%H2#CGE*$J>pJs!&CN<1$N4X78IU(J $B$1!W$K4X$7$F(J5$BL>$NFCDj650w!&8&5f0w$rJg=8$7$F$$$^$9!#(J http://jrecin.jst.go.jp/seek/SeekJorDetail?fn=3&id=D113100925&ln_jor=0

1 0

Postdoc position on compiling hybrid differential equations
by Kohei SUENAGA 30 Oct '13

30 Oct '13

皆様， # 重複して受け取られた場合はご容赦ください．京都大学の末永と申します．スウェーデンのハルムスタード大学の 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/

1 0

Fwd: [jacap:205] Matthias Schrin氏の講演会のお知らせ(CAPE)
by Shunsuke Yatabe 29 Oct '13

29 Oct '13

皆様、京都大学で開催される数学の哲学の研究会について、ご案内をご転送させて頂きます。矢田部俊介 ---------- Forwarded message ---------- From: 応用哲学会事務局 <jacap-secretary(a)ethics.bun.kyoto-u.ac.jp> Date: 2013/10/29 Subject: [jacap:205] Matthias Schrin氏の講演会のお知らせ(CAPE) To: "jacap(a)googlegroups.com" <jacap(a)googlegroups.com> 皆様来る10月31日（木）に、CAPEレクチャーとして、Matthias Schrin氏の講演会が以下の要領で開催されます。直前のご連絡になってしまい、申し訳ありません。皆様のご参加をお待ちしております。京都大学大学院文学研究科附属応用哲学・倫理学教育研究センター http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/ 事務補佐　　天野恵美理〒606-0085 京都市左京区吉田本町　京都大学文学部内 CAPE(a)bun.kyoto-u.ac.jp 講師：Prof. Dr. Matthias Schrin （ミュンヘン大学）演題：Hilbert and Wittenstein on the Consistency of Mathematical Theory 日時：2013年10月31日（木）18時〜場所：京都大学吉田キャンパス総合研究棟２号館第10演習室 http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm （34番の建物です）要旨：添付書類をご参照ください。 -- --- このメールは Google グループのグループ「応用哲学会」の登録者に送られています。このグループから退会し、メールの受信を停止するには、jacap+unsubscribe(a)googlegroups.com にメールを送信します。その他のオプションについては、https://groups.google.com/groups/opt_out にアクセスしてください。

1 0

CMCS'14: Coalgebraic Methods in Computer Science, Grenoble (France), 5-6 Apr 2014
by Katsuhiko Sano 26 Oct '13

26 Oct '13

皆様、北陸先端科学技術大学院大学の佐野勝彦です。 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.

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml