Logic-ml

9 participants
1781 discussions

RTA 2013: Last Call for Papers
by Nao Hirokawa 23 Jan '13

23 Jan '13

皆様 RTA 2013 の論文募集をご案内致します。今回の RTA はオランダ Eindhoven で行われ、TLCA 2013 との共催です。ぜひ投稿をご検討下さい。なお投稿締切は strict deadline となっております。廣川　直 (JAIST) ************************************************************************* RTA 2013: LAST CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands co-located with TLCA 2013 as part of RDP 2013 http://rta2013.few.vu.nl/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 (THIS IS A STRICT DEADLINE !) rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** INVITED SPEAKERS *** - Simon Peyton-Jones (Microsoft Research, UK) joint invited speaker for TLCA+RTA 2013 - Jarkko Kari (University of Turku, Finland) invited speaker for RTA 2013 - Mitsu Okada (Keio University, Japan) invited speaker for RTA 2013 *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: <http://www.dagstuhl.de/en/publications/lipics> Also, authors of selected papers will be invited to submit an extension of their RTA 2013 paper to a special issue of Logical Methods in Computer Science (LMCS) <http://www.lmcs-online.org/index.php>. *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: <http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>, - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: <https://www.easychair.org/conferences/?conf=rta2013>. The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli National University of Quilmes, Argentina Byron Cook Microsoft Research Cambridge, UK Stephanie Delaune ENS Cachan, France Gilles Dowek Inria Paris-Rocquencourt, France Maribel Fernandez King's College London, UK Nao Hirokawa JAIST Ishikawa, Japan Delia Kesner University Paris-Diderot, France Helene Kirchner Inria Paris-Rocquencourt, France Barbara Koenig University Duisburg Essen, Germany Temur Kutsia Johannes Kepler University Linz, Austria Aart Middeldorp University of Innsbruck, Austria Vincent van Oostrom Utrecht University, The Netherlands Femke van Raamsdonk VU University Amsterdam, The Netherlands Kristoffer Rose IBM Research New York, USA Manfred Schmidt-Schauss Goethe University Frankfurt, Germany Peter Selinger Dalhousie University, Canada Paula Severi University of Leicester, UK Aaron Stump The University of Iowa, USA Tarmo Uustalu Institute of Cybernetics Tallinn, Estonia Roel de Vrijer VU University Amsterdam, The Netherlands Johannes Waldmann HTWK Leipzig, Germany Hans Zantema Eindhoven University of Technology, The Netherlands *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon Brasilia University, Brasilia Frederic Blanqui INRIA Tsinghua University Beijing, China Salvador Lucas Technical University of Valencia, Spain Georg Moser (chair) University of Innsbruck, Austria Masahiko Sakai Nagoya University, Japan Sophie Tison University of Lille, France *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl.

1 0

セミナー案内
by KASHIMA Ryo 21 Jan '13

21 Jan '13

数理論理学セミナーのご案内日時：1月25日(金)15:00から場所：東京工業大学大岡山西８号館W棟11階 W1101セミナー室話者：宮部賢志（京大数解研）題目：一様Kurtzランダムネスに対する独立性定理概要：アルゴリズム的ランダムネスでは，ある2進無限列がランダムかどうかについて，様々な定式化を与える． Martin-L\"ofランダムネスはそのうちの一つで，次のような結果が知られている．「ある列がMLランダムであることと，その列の奇数番目の文字の列AがMLランダムかつ，偶数番目の文字の列が，Aから見てMLランダムであること，が同値となる」この定理はvan Lambalgen's Theoremと呼ばれているが，日本語では独立性定理と呼んでいる．ランダムネスの理論では様々なランダムの概念を考察する．他のランダムの概念に付いては，独立性定理が成り立たないことが知られていたが，筆者は一様相対化の場合は，Schnorrや計算可能ランダムについて，独立性定理が成り立つことを主張した．その後，Demuthランダムネスについても同様の結果が知られている．本発表では，Kurtzランダムネスの一様相対化の場合の独立性定理について報告する． ------ 問い合わせ先：鹿島亮（東京工業大学） kashima(a)is.titech.ac.jp

1 0

European Master's Program in Computational Logic
by Bertram Fronhöfer 17 Jan '13

17 Jan '13

Dear all, I'd like to draw your attention to the fact that fresh Erasmus Mundus scholarships are available for Non-European AND European students who enroll in our European Master's Program in Computational Logic in the fall of 2013. The deadline for application is 31 January, 2013. More details are given below. In particular, I'd like to draw your attention to the fact that we are able to provide grants to EU-students for doing their project at the National ICT of Australia (NICTA). Please spread this information as wide as possible among friends and colleagues, at your old universities and the places, where you currently live and work. Many thanks -- Steffen ******************************************************************************************************* The European Master's Program in Computational Logic We are glad to announce to you the possibility to join our European Master's Program of Computational Logic. This program is offered jointly at the Free-University of Bozen-Bolzano in Italy, the Technische Universität Dresden in Germany, the Universidade Nova de Lisboa in Portugal and the Technische Universität Wien in Austria. Within this program you have the choice to study at two /three of the four European universities. In addition, you can do your project work at the National ICT of Australia (NICTA). You will graduate with a MSc in Computer Science and obtain a joint degree. Information on the universities and the program including the application procedure is provided here: http://www.emcl-study.eu/home.html Language of instruction is English. Tuition fees are 3.000 EUR (for non-European students) and 1.000 (for European students) per year. We would like to draw your attention to the ERASMUS-MUNDUS scholarship program. The ERASMUS-MUNDUS consortium offers 2-year scholarships up to 48.000 EUR for non-EU students and up to 23.000 EUR for EU students of our European Master's Program in Computational Logic. More information on the scholarship program is available from: http://www.emcl-study.eu/fileadmin/emcl_booklet_tree/ma_em_grant.html Do not hesitate to contact us if you have any further questions. Kind regards -- Steffen Hölldobler Prof. Dr. Steffen Hoelldobler International Center for Computational Logic Technische Universität Dresden 01062 Dresden, Germany phone: [+49](351)46 33 83 40 fax: [+49](351)46 33 83 42 email: sh(a)iccl.tu-dresden.de

1 0

CfPart: CTFM 2013, Tokyo, 18-20, Feb 2013
by Naohi Eguchi 15 Jan '13

15 Jan '13

研究会のご案内以下の要領で計算可能性，逆数学等に関する研究会を開催いたします． Computability Theory and Foundations of Mathematics (CTFM 2013) (2013年2月18日(月)〜2月20日(水)，東京工業大学大岡山キャンパス) 参加ご希望の方は参加登録ページよりお申込ください． http://sendailogic.math.tohoku.ac.jp/CTFM/registration.html 参加申込締切：2013年2月4日(月) 多くの方々の参加申込をお待ちいたします．江口直日，Sam Sanders, 田中一之 CTFM(a)math.tohoku.ac.jp ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013) http://sendailogic.math.tohoku.ac.jp/CTFM/ ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. This is a successor workshop to Workshop on Proof Theory and Computability Theory 2012 - Philosophical Frontiers in Reverse Mathematics (February 20 - 23, 2012, Tokyo, Japan). -------------------------------------------- Deadline of Registration: February 4th, 2013 -------------------------------------------- Invited Speakers: Chi Tat Chong (National University of Singapore) Erik Palmgren (Stockholm University) Michael Rathjen (University of Leeds) Helmut Schwichtenberg (LMU Munich) Stephen G. Simpson (Pennsylvania State University) Yang Yue (National University of Singapore) Wu Guohua (Nanyang Technological University) -------------------------------------------- Programme Committee: Toshiyasu Arai (Chiba) Naohi Eguchi (Tohoku) Hajime Ishihara (JAIST) Ryo Kashima (Tokyo Institute of Technology) Sam Sanders (Ghent) Kazuyuki Tanaka (Tohoku, Co-chair) Andreas Weiermann (Ghent, Co-chair) Takeshi Yamazaki (Tohoku) Keita Yokoyama (Tokyo Institute of Technology) --------------------------------------------

1 0

NIIレクチャーシリーズのお知らせ(Randy Goebel)
by Ken Satoh 11 Jan '13

11 Jan '13

NIIレクチャーシリーズのお知らせ国立情報学研究所(NII)では、海外の情報学に関係する著名研究者を招聘し、レクチャーシリーズを行っております。今回は、ＡＩの黎明期からＡＩの研究をされてきたカナダ・アルバータ大学のRandy Goebel先生の連続レクチャーのお知らせです。今回はＡＩ原理をビッグデータに応用する最先端の研究の講演を行っていただきます。講師:Prof. Randy Goebel (department of Computing Science at the University of Alberta, in Edmkonton, Alberta, Canada) 講義名：Do the emerging tools for managing big data fit with the founding principles of Artificial Intelligence? http://www.nii.ac.jp/en/event/list/0212 場所：国立情報学研究所 20階 2010室講義日：2013/2/12, 20, 26, 3/1 時間: 13:30-15:00 出席は無料で、どなたでも参加できます。参加のご検討よろしくお願いします。佐藤　健国立情報学研究所および総研大 ======= NII Lecture Series Title: Do the emerging tools for managing big data fit with the founding principles of Artificial Intelligence? ideas on the integration of the advice taker, structured inference, reasoning with incomplete information, and building multi-scale models from data. Speaker: Prof. Randy Goebel (department of Computing Science at the University of Alberta, in Edmkonton, Alberta, Canada) He is also vice president of the innovates Centre of Research Excellence (iCORE) at Alberta Innovates Technology Futures (AITF), chair of the Alberta Innovates Academy, and principle investigator in the Alberta Innovates Centre for Machine Learning. He received the B.Sc. (Computer Science), M.Sc. (Computing Science), and Ph.D. (Computer Science) from the Universities of Regina, Alberta, and British Columbia, respectively. At AITF, Randy is in charge of reshaping research investments (graduate student scholarships, research chairs, research centres). His research interests include applications of machine learning to systems biology, visualization, and web mining, as well as work on natural language processing, web semantics, and belief revision. Randy has experience working on industrial research projects in crew scheduling, pipeline scheduling, and steel mill scheduling, as well as scheduling and optimization projects for the energy industry in Alberta. Randy has held appointments at the University of Waterloo, University of Tokyo, Multimedia University (Malaysia), Hokkaido University (Sapporo), and has had research collaborations with DFKI (German Research Centre for Artificial Intelligence), NICTA (National ICT Australia), RWC (Real World Computing project, Japan), ICOT (Institute for New Generation Computing, Japan), NII (National Institute for Informatics, Tokyo), and is actively involved in academic and industrial collaborative research projects in Canada, Australia, Europe, and China. Abstract: The modern discipline of computer science has many facets, but what has clearly emerged in the last decade are three themes based on 1) rapidly accumulating volumes of data, 2) inter- and cross-disciplinary application of computer science to all scientific disciplines, and 3) a renewed interest in the semantics of complex information models, spanning a spectrum from semantic web, natural language, to multi-scale systems biology. This series of four lectures will attempt to knit together these three themes, by presenting the ideas that have emerged in their support: the rapid development and extension of machine learning theory and methods to help make sense of accumulating volumes of data, the application of computer science to nearly all scientific disciplines, especially those whose progress now necessarily relies on the management and interpretation of large data, and finally, the revival of a focus on semantics of information models based on data. Outline: Lecture 1: Connecting Advice Taking and Big Data Lecture 2: Structured inference and incomplete information Lecture 3: Natural Language Processing: Compressing Data to Models Lecture 4: Hypothesis Management with Symbols and Pictures Place: Lecture room 2010, 20th floor, National Institute of Informatics Date: 13:30pm-15:00pm, February 12, 20, 26, March 1, 2013 Lecture 1 Connecting Advice Taking and Big Data Tuesday, February 12, 2013, 13:30 - 15:00 A fundamental premise of Artificial Intelligence (AI) is the ability for a computer program to improve its behaviour by taking advice. Incremental accumulation of advice or knowledge has never been easier than today, when the rate of data capture is higher than ever before, and the management of big data and deployment of machine learning are coupled to help manage the transition from data to knowledge. This lecture uses simple technical concepts from nearly sixty years of AI, to identify some of the research challenges of managing big data, and exploiting knowledge emergent from big data. The goal is to find some important research priorities based on the motivation of the Advice Taker, and the current state of big data management and machine learning. Lecture 2 Structured inference and incomplete information Wednesday. February. 20, 13:30 - 15:00 If the foundation of Artificial Intelligence (AI) is the accumulation and use of knowledge, then a necessary stop is the structuring knowledge to be able to make inferences. The organization structures required to facilitate inference now span a broad spectrum of mathematical methods, including everything from simple propositional logic to sophisticated statistical and probabilistic inference. The two foundational components of computational inference are semantics of formal reasoning, and the development of reasoning methods to deal with incomplete information. This lecture reviews the foundational components of semantics and reasoning systems, including the development of goal-oriented reasoning based on abductive reasoning, the connection between logical and probabilistic systems, and especially how the architecture of reasoning systems can provide the basis for managing hypotheses in the face of incomplete information. Lecture 3 Natural Language Processing: Compressing Data to Models Tuesday. February. 26, 13:30 - 15:00 The problem of machine processing of natural language (NLP) has long been a research focus of artificial intelligence. This is partly because the use of natural language is easily conceived as a cognitive task requiring human-like intelligence. It is also because the rational structures for computer interpretation of language require the full suite of computational tools developed over the last hundred years (grammar, dictionaries, logic, parsing, inference, and context management). Most of the recent practical advances in NLP have arisen in the context of simple machine learning applied to large language corpora, to induce fragments of language models that provide the basis for interpretive and generative manipulation of language. These largely statistical models are arisen in what has been called the "pendulum swing" of NLP, in which statistical models have recently dominated those based on structural linguistics. In this lecture, we look at the concept of noisy corpora and their role in language models, including some interesting alternative sources of data for building language models. The applications range from complex language summary to the information extraction from medical, legal, and historical documents. Lecture 4 Hypothesis Management with Symbols and Pictures Friday. March. 1, 13:30 - 15:00 The current suite of Artificial Intelligence (AI) tools has provided a basis for sophisticated human-computer interfaces based on more than typing in language. In fact, one can develop multi-level representations that provide the basis for direct manipulation of visualizations. By constraining the repertoire of direct manipulations, one can enrich human computer interaction so that both humans and machines can understand and exploit visual interaction. This lecture shows how such direction manipulation requires a large repertoire of formal reasoning methods, and provides the sketch of formal framework and the problems arising in its development.

1 0

Cristian S. Calude氏、Elena Calude氏講演会のお知らせ（中央大学研究開発機構）
by Kohtaro Tadaki 11 Jan '13

11 Jan '13

＜重複してお受け取りの方はご容赦ください＞皆様：中央大学の只木と申します。中央大学研究開発機構では、来週19日土曜日、ニュージーランド研究者Cristian S. Calude氏（オークランド大学）およびElena Calude氏（マッセイ大学）をお招きし、下記要領で講演会を開催します。皆様、奮ってご参加下さい。 ---------------------------------- 只木孝太郎 (Kohtaro Tadaki) 中央大学研究開発機構〒112-8551 東京都文京区春日1-13-27 E-mail: tadaki(a)kc.chuo-u.ac.jp WWW: http://www2.odn.ne.jp/tadaki/ ---------------------------------------------------------- Cristian S. Calude氏、Elena Calude氏講演会 ◆日時： 2013年1月19日（土）15時00分〜 17時30分 ◆場所：中央大学後楽園キャンパス 5号館1階 5138号室（下記参照） ◆参加申込：不要 ---------------------------------------------------------- [ 講演内容 ] ◆15時00分〜16時00分講演題目：The complexity of mathematical problems 講演者：Cristian S. Calude (University of Auckland, NZ) and Elena Calude (Massey University, NZ) 講演要旨： Evaluating (or even guessing) the degree of complexity of an open problem, conjecture or mathematically proven statement is not an easy task not only for beginners, but also for the most experienced mathematicians. Is there a (uniform) method to evaluate, in some objective way, the difficulty of a mathematical statement or problem? The question is not trivial because mathematical problems can be so diverse. But, is there any indication that all, or most, or even a large part of mathematical problems have a kind of "commonality" allowing a uniform evaluation of their complexity? How could one compare a problem in number theory with a problem in complex analysis, a problem in algebraic topology or a theorem in dynamical systems? Surprisingly enough, such "commonalities" do exist for many mathematical problems. One of them is based on the possibility of expressing the problem in terms of (very) simple programs reducible to a (natural) question in theoretical computer science, the so-called "halting problem". A more general "commonality" can be discovered using the inductive type of computation, a computation more general the Turing computability. As a consequence, uniform approaches for evaluating the complexity of a large class of mathematical problems/conjectures/statements can be, and have been, developed. This talks reviews current progress and some open problems. ◆16時30分〜17時30分講演題目： The Kochen-Specker theorem and quantum randomness 講演者： Cristian S. Calude (University of Auckland, NZ) 講演要旨： The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is noncontextual and consistent with quantum mechanics. If we require noncontextuality, the consequence is that many observables must not have pre-existing definite values. However, the Kochen-Specker theorem does not allow one to determine which observables must be value indefinite. In this talk we present an improvement on the Kochen-Specker theorem which allows one to actually locate observables which are provably value indefinite. Various technical and subtle aspects relating to this formal proof and its connection to quantum mechanics are discussed. This result is then utilized for the proposal and certification of a dichotomic quantum random number generator operating in a three-dimensional Hilbert space. ------------------------------------------------------------ 会場への道順： [中央大学後楽園キャンパスへのアクセスガイド] http://www.chuo-u.ac.jp/chuo-u/access/index_j.html http://www.chuo-u.ac.jp/chuo-u/access/access_korakuen_j.html [中央大学後楽園キャンパスマップ] http://www.chuo-u.ac.jp/chuo-u/campusmap/korakuen_j.html ------------------------------------------------------------

1 0

HAS 2013: Deadline Extended
by Ichiro Hasuo 06 Jan '13

06 Jan '13

みなさま，東京大学の蓮尾です．あけましておめでとうございます．以前お知らせした ETAPS 併設ワークショップの HAS，締切が 1/21 に延長になりました．Post-proceeding ですので，論文の preliminary version でも大歓迎，とのことです．ご投稿を検討いただければ幸いです．どうかよろしくお願いいたします．それでは！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ =========================== [Apologies for multiple copies] [Please note: submission deadline extended to January, 12] ************************************************************************************************************ ********* CALL FOR PAPERS Third Workshop on Hybrid Autonomous Systems (HAS 2013) A satellite event of European Joint Conferences on Theory and Practice of Software, ETAPS 2013 March 17, 2013, Rome, Italy http://www2.warwick.ac.uk/fac/sci/maths/people/staff/bujorianu/has2013/ ************************************************************************************************************ ********* SCOPE: The interest on autonomous systems is increasing both in industry and academia. Such systems must operate with limited human intervention in a changing environment and must be able to compensate for significant system failures without external intervention. The hybrid discrete-continuous models constitute appropriate models of autonomous systems . Hybrid systems have behaviours characterised by the interaction between continuous and discrete dynamics and research in the area is driven by several school of thoughts. One approach is mainly focussed on applications to automation systems and the models and methods are centred on the concept of hybrid automaton (deterministic or probabilistic). A distinct school of thought interprets hybrid systems as control systems with regime change. Such systems are highly adaptive and suitable for modelling autonomic behaviours. The most prominent models of this approach are the stochastic hybrid systems and the mixed logical and dynamical systems. There is a clear research opportunity to combine these approaches for developing models, methods, techniques, methodologies, tools and environments for autonomous systems engineering. This workshop brings together researchers interested in all aspects of autonomy and resilience of hybrid systems. TOPICS: Topics include (but are not limited to): Ø new modelling paradigms for autonomous systems; Ø verification and safety certification techniques; Ø modelling, analysis and control of hybrid systems; Ø uncertainty and stochastic modelling; Ø multi-agent systems; Ø algebraic and categorical methods; Ø interaction between hybrid modelling and complexity science; Ø reports on case studies and practical experiments; Ø autonomous systems in natural science (e.g. from biology, ecology, climate). INVITED SPEAKERS: * Maria Domenica di Benedetto, L'Aquila University, IT * Radu Grosu, Vienna University of Technology, AU * Rafael Wisniewski, Aalborg University, DEN SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits the submission of regular papers, which must contain original work, and must not have been previously published, nor be under consideration for publication elsewhere. The accepted submissions should clearly indicate the membership to one of the following categories: - technical contributions; - tutorials on a topic of importance; - surveys on large extent cross-disciplinary research (e.g., project outcomes);wor - reports on early stage or ongoing work. For each category of submission the novelty of the submission has to be clearly stated and the page limit should vary between 6 and 15 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: https://www.easychair.org/conferences/login_as_yes.cgi?a=3413468 The workshop PC will review all regular paper submissions to select appropriate ones, ones for acceptance in each category, based on their relevance, merit, originality, and technical content. The authors of accepted submissions are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue in a journal is under consideration. IMPORTANT DATES: Submission (regular paper): *extended* January 12, 2013 Notification: January 24, 2013 Final version (ETAPS proceedings): February 14, 2013 Workshop: March 17, 2013 Final version (EPTCS post proceedings): TBA ORGANIZATION: PC Chairs: * Luca Bortolussi, University of Trieste, IT * Manuela Bujorianu, University of Warwick, UK * Giordano Pola, University of L’Aquila, IT Program Committee: * Ezio Bartocci, TU Wien, AU * Maria Domenica di Benedetto, L'Aquila University, IT * Luca Bortolussi, University of Trieste, IT (co-Chair) * Manuela Bujorianu, University of Warwick, UK (co-Chair) * Alberto Casagrande, Univeristy of Trieste, IT * Thao Dang, Verimag, FR * Louise Dennis, University of Liverpool, UK * Clare Dixon, University of Liverpool, UK * Alexandre Donzé, UC Berkeley, US * Martin Fränzle, Carl von Ossietzky Universität, DE * Ichiro Hasuo, University of Tokio, JP * Agung Julius, Rensselaer Polytechnic Institute, US * Toshimitsu Ushio, Osaka University, JP * Giordano Pola, L'Aquila University, IT (co-Chair) * Rom Langerak, University of Twente, NL * David Parker, University of Birmingham, UK * Guido Sanguinetti, University of Edinburgh, UK * Olaf Stursberg, University of Kassel, DE

1 0

CALCO 2013: Second Call for Papers
by Ichiro Hasuo 04 Jan '13

04 Jan '13

みなさま，こんにちは！東京大学の蓮尾です．国際会議 CALCO 2013 の案内を（再度）お送りします．トピックは代数・余代数・形式検証の理論一般，開催地はポーランド・ワルシャワ，締切は2月末です．どうか投稿をご検討ください．それでは！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ [Apologies for multiple copies] ========================================================================= SECOND CALL FOR PAPERS: CALCO 2013 5th International Conference on Algebra and Coalgebra in Computer Science September 3 - 6, 2013 Warsaw, Poland http://coalg.org/calco13/ ========================================================================= Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 ========================================================================= -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK, 2011). The fifth edition will be held in Warsaw, the capital of Poland. -- INVITED SPEAKERS -- Andrej Bauer - University of Lubljana, Sl Miko??aj Boja??czyk - Warsaw University, PL Neil Ghani - University of Strathclyde, UK Damien Pous - CNRS, ENS-Lyon, F -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra -- NEW TOPICS -- This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged. * Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is also being planned. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calco2013 -- BEST PAPER AND BEST PRESENTATION AWARDS -- For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants. -- IMPORTANT DATES -- Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- PROGRAMME COMMITTEE -- Luca Aceto - Reykjavik University, Iceland Ji???? Ad??mek - TU Braunschweig, D Lars Birkedal - IT University of Copenhagen, DK Filippo Bonchi - CNRS, ENS-Lyon, F Corina Cirstea - University of Southhampton, UK Bob Coecke - University of Oxford, UK Andrea Corradini - University of Pisa, I Mai Gehrke - Universit?? Paris Diderot - Paris 7, F H. Peter Gumm - Philipps University Marburg, D Gopal Gupta - University of Texas at Dallas, USA Ichiro Hasuo - Tokyo University, Japan Reiko Heckel - University of Leicester, UK (cochair) Bart Jacobs - Radboud University Nijmegen, NL Ekaterina Komendantskaya - University of Dundee, Scotland, UK Barbara K??nig - University of Duisburg-Essen, D Jos?? Meseguer - University of Illinois, Urbana-Champaign, USA Marino Miculan - University of Udine, I Stefan Milius - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D (cochair) Larry Moss - Indiana University, Bloomington, USA Till Mossakowski - DFKI Lab Bremen and University of Bremen, D Prakash Panangaden - McGill University, Montreal, Canada Dirk Pattinson - Imperial College London, UK Dusko Pavlovic - Royal Holloway, University of London, UK Daniela Petrisan - University of Leicester, UK John Power - University of Bath, UK Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL Lutz Schr??der - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D Monika Seisenberger - Swansea University, UK Sam Staton - University of Cambridge, UK Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL Pawel Sobocinski - University of Southampton, UK Yde Venema - University of Amsterdam, NL Uwe Wolter - University of Bergen, NO -- ORGANISING COMMITTEE -- Bartek Klin (University of Warsaw, Poland) Andrzej Tarlecki (University of Warsaw, Poland) -- LOCATION -- Warsaw, the capital of Poland, is a lively city with many historic monuments and sights, but also with a thriving business district. It is easily accessible via two airports: the main Chopin Airport, used by most international carriers, and the recently open Warsaw Modlin Airport (30 minutes away by rail), used by budget airlines. -- SATELLITE WORKSHOPS -- CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired by Monika Seisenberger (Swansea University). The workshop is dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO Early Ideas workshop (and vice versa). A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO Tools, will be held alongside the main conference, chaired by Lutz Schr??der (Friedrich Alexander Universit??t Erlangen-N??rnberg). Papers of this workshop will be included in the CALCO proceedings. -- CALCO Early Ideas Overview -- The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. The list of topics of particular interest is shown on the main CALCO 2013 page. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calcoearlyideas2013 The use of LNCS style is strongly encouraged. After the workshop, authors will have the opportunity to submit a full 10-15 page paper on the same topic. The reviewing will be carried out by the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of selected papers will be available online. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. http://coalg.org/calco13/workshops.html#ei -- CALCO Early Ideas Dates -- 2-page short contribution submission: May 27, 2013 Notification for short contribution: June 24, 2013 Final short contribution due: July 15, 2013 CALCO Early Idead Workshop: September 2, 2013 10-15 page paper submission: October 15, 2013 Notification for paper: December 15, 2013 Final paper version due: January 15, 2014 -- CALCO Early Ideas Program Committee -- Bartek Klin, University of Warsaw, Poland John Power, University of Bath, UK Monika Seisenberger, Swansea University, UK (chair) -- CALCO-Tools Overview -- CALCO-Tools will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. Topics of interest include systems, prototypes, and tools developed specifically for the design, checking, execution, and verification of (co)algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. Tool submissions should not exceed 5 pages in LNCS format. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission. Each submission will be evaluated by at least three reviewers; one or more of the reviewers will be asked to download and use the tool. At least one of the authors of each tool paper must attend the conference to demo the tool. http://coalg.org/calco13/workshops.html#tools -- CALCO-Tools Dates -- Paper submission: April 8, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- CALCO-Tools Programme Committee -- Einar Broch Johnsen, University of Oslo, Norway Mark Hills, CWI Amsterdam, The Netherlands Barbara K??nig, University of Duisburg-Essen, Germany Dorel Lucanu, Alexandru Ioan Cuza University, Romania Dominik Luecke, CWI Amsterdam, The Netherlands Till Mossakowski, DFKI, Germany Lutz Schr??der, Friedrich-Alexander Universit??t Erlangen-N??rnberg, Germany (chair) Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands -- FURTHER INFORMATION -- Queries related to submission, reviewing, and programme should be sent to the relevant conference or workshop chairs. Queries related to the organisation should be emailed to calco2013(a)mimuw.edu.pl . [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ESSS 2013 -- submission deadline extended
by 山形賴之 26 Dec '12

26 Dec '12

ESSS 2013の論文投稿締め切りが延長されました。皆様の投稿をお待ちしております。 ================================================== 2nd International Workshop on Engineering Safety and Security Systems March 18, 2013, Luxembourg Co-located with ICST 2013 in Luxembourg, March 18-22, 2013 More information: http://www.comp.nus.edu.sg/~pat/esss2013/ =================================================== Important dates ----------------- * January 6th 2013: Submission deadline (extended) * February 11th 2013: Notification of acceptance/rejection (extended) * March 18th 2013: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2013. Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html ). Papers should not exceed 6 pages for full papers and 2 pages for short papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All workshop papers will be published in the IEEE Digital Library in the form of a post-proceedings. A pre-workshop version of the papers will be available on the workshop website prior. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Cyrille Artho, AIST, Japan Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan -- 山形頼之独立行政法人産業技術総合研究所研究員 E-mail: yoriyuki.yamagata(a)aist.go.jp http://staff.aist.go.jp/yoriyuki.yamagata/

1 0

QIT28のご案内
by NISHIMURA Harumichi 26 Dec '12

26 Dec '12

logic-mlの皆様，来年５月に開催される第２８回量子情報技術研究会（QIT28）のご案内をQIT28世話人に代わって投稿させていただきます．よろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 http://www.math.cm.is.nagoya-u.ac.jp/~hnishimura/ --- 第28回量子情報技術研究会研究会の内容情報科学と量子力学を融合させた新しい分野、量子情報科学に関する研究会です。情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して、情報科学、物理学、光エレクトロニクスを含む理学、工学、数理科学に携わる研究者間に自由な討論の場を提供し、この研究分野の発展を図ることを目的としています。期日 2013年5月27日（月）, 28日（火）会場北海道大学創成科学研究棟大会議室（〒001-0021 札幌市北区北21条西10丁目）発表募集内容発表募集分野（申込状況によっては査読可能性あり）：量子情報、量子計算、量子暗号など広く量子情報技術に関わる理論的研究、実験的研究、計算機科学的研究、数学的研究、およびその他関連分野定員 150名参加費事前振込み一般6,000円, 学生1,000円． (当日会場払いは一般7,000円, 学生2,000円) (懇親会は別途）研究会参加申込要領参加申込は下記Webにて受付けます． http://staff.aist.go.jp/s-kawabata/qit/ 講演（口頭，ポスター）申込，予稿集原稿PDF提出は電子情報通信学会のWebシステムを使用する予定．【講演申込締切】 2013年4月12日（金）；口頭講演 2013年4月26日（金）；ポスター講演【予稿集原稿提出】 2013年4月26日（金）【参加申込締切】 2013年5月2日（木）【問合先】富田章久（北海道大学大学院情報科学研究科）竹内繁樹（北海道大学電子科学研究所/大阪大学産業科学研究所）長谷川俊夫（三菱電機株式会社情報技術総合研究所） E-mail: qit28(a)ml.hokudai.ac.jp 主催量子情報技術時限研究専門委員会 (委員長枝松圭一(東北大)) 共催応用物理学会量子エレクトロニクス研究会物質・デバイス領域共同研究拠点北海道大学電子科学研究所

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml