Logic-ml March 2011

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

11 participants
17 discussions

東北大，田中・山崎グループの状況について
by YOKOYAMA Keita 14 Mar '11

14 Mar '11

皆様，東北大の横山です，皆様には多大なご心配をお掛けしていることと存じます．研究とは直接関係のないメールで恐縮です．本日14日午前までに，直接・間接様々な方法で，田中先生・山崎先生をはじめ，研究グループの修士以上全員の無事が確認できましたので，ここにご報告いたします．ご心配をいただきました皆様に，心より感謝申し上げます．なお，近隣を含め，ライフラインの復旧は未だ限定的で，大学のメールシステムの復旧までにはかなりの時間を要するかと思われます．田中・山崎グループのメンバーへの緊急の連絡がありましたら横山 azutab(a)gmail.com までご連絡ください．横山啓太 -- Keita Yokoyama Mathematical Institute, Tohoku University Aoba, Sendai, JAPAN, 980-8578 azutab(a)gmail.com

1 0

Talk by Yde Venema, Thursday this week (17 March)
by Ichiro Hasuo 13 Mar '11

13 Mar '11

Dear colleagues, This coming Thursday our guest Yde Venema from ILLC, University of Amsterdam is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ PS. Our deepest sympathy for those suffering from the tragic earthquake. ======= Speaker: Yde Venema Institute for Logic, Language and Computation Universiteit van Amsterdam http://staff.science.uva.nl/~yde/ Title: Coalgebra automata (towards a universal theory of automata) Date: 11.00 - 12.00, Thu 17 Mar 2011 Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Automata operating on infinite objects provide an invaluable tool for the spcification and verification of programs. Many of the infinite objects studied in this area, such as words/streams, trees, graphs or transition systems, represent ongoing behaviour in some way, and provide key specimens of coalgebras. Hence it make sense to develop a universal theory of coalgebra automata: automata operating on coalgebras. The motivation underlying the introduction of coalgebra automata is to gain a deeper understanding of this branch of automata theory by studying properties of automata in a uniform manner, parametric in the type of the recognized structures. Coalgebraic automata theory thus contributes to Universal Coalgebra as a mathematical theory of state-based evolving systems. In the talk we give a quick introduction to coalgebra, and we introduce the notion of a coalgebra automaton. We will see that in fact a large part of the theory of parity automata can be lifted to a coalgebraic level of generality, and thus indeed belongs to the theory of Universal Coalgebra. More specifically, coalgebra automata satisfy various closure properties: under some conditions on the coalgebraic type, the collection of recognizable languages are closed under taking union, intersection, complementation, and existential projections. We will discuss two kinds of coalgebra automata, corresponding to approaches in coalgebraic logic that are based on, respectively, relation lifting and predicate liftings. Our results have many applications in the theory of (coalgebraic fixpoint logics), but these will only be discussed tangentially. =======

1 0

MOL 12 Tokyo - Submission Open
by Makoto Kanazawa 06 Mar '11

06 Mar '11

*** ONLINE PAPER SUBMISSION OPEN *** Last Call for Papers (submission deadline: March 22, 2011) 12th Meeting on Mathematics of Language Tokyo, September 5–7, 2011 http://sites.google.com/site/mol12tokyo/ Invited Speakers • Kit Fine, New York University • Andreas Maletti, Universität Stuttgart Background MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003). Aims and Scope MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to: • complexity and generative capacity of grammar formalisms • formal analysis of linguistic theories and frameworks • model-theoretic and proof-theoretic methods in linguistics • mathematical foundations of statistical and stochastic approaches to language analysis • formal models of language use and language change Submission Guideline We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues. Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available atftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip. Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12. Submissions will be reviewed anonymously by at least three reviewers. Proceedings The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science. Important Dates • Deadline for submission: March 22, 2011 • Notification to authors: May 16, 2011 • Deadline for camera-ready copies for the proceedings: June 1, 2011 • Conference: September 5-7, 2011 Program Committee • Patrick Blackburn • Alexander Clark • Philippe de Groote • Aravind Joshi • Greg Kobele • Andras Kornai • Marcus Kracht (Chair) • Natasha Kurtonina • Michael Moortgat • Larry Moss • Gerald Penn • Sylvain Pogodalla • James Rogers • Sylvain Salvati • Hiroyuki Seki • Ed Stabler • Hans-Jörg Tiede Organizing Committee • Makoto Kanazawa (Chair) • Ryo Yoshinaka

1 0

Talk by Yoshihiro Maruyama, Tuesday next week (8 Mar 2011)
by Ichiro Hasuo 03 Mar '11

03 Mar '11

Dear colleagues, Next week on Tuesday Yoshihiro Maruyama, a finishing master student at Department of Humanistic Informatics, Kyoto University is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Yoshihiro Maruyama (Department of Humanistic Informatics, Kyoto University) http://researchmap.jp/ymaruyama/ Title: Duality in Logic, Algebraic Geometry, and Computer Science Date: 11.00 - 12.00, Tue 8 Mar 2011 Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: Categorical duality often arises between ontological and epistemological aspects of concepts.　Indeed, we can find a number of such dualities in diverse fields: duality between models and theories in logic; duality between computer systems and their properties in computer science; duality between states and observables in quantum physics; duality between varieties and rings in algebraic geometry. In this talk, we briefly attempt to clarify the relationships between these dualities (especially, dualities in logic and algebraic geometry in relation to logical completeness and Hilbert Nullstellensatz), and develop a moderately general theory of dualities between modal logics and coalgebras (representations of the above-mentioned duality in computer science), extending the theory of natural dualities (a general theory of Stone-type dualities based on universal algebra) via a new concept of modal power. For the latter part, a preprint "Natural Duality, Modality and Coalgebra" is available in: http://researchmap.jp/ymaruyama/

1 0

Fwd: NSA2011
by Tchizawa 02 Mar '11

02 Mar '11

関係各位様 2010年度超準解析シンポジウムの第4報です。今回は Guy Wallet, Imme van den Berg　教授が海外から参加されます。講演は日本語でOKですが、レジュメはできれば英語で作成されることを希望します。尚、3 月 29日（火）に懇親会を予定しています、こちらの参加の予定もお知らせください。２０１０年度超準解析シンポジウム日時：３月２8日（月）,２9日（火）,30日（水）, 2011　場所：東京都市大学　世田谷キャンパス 2号館1階　21C 　　（東急大井町線　尾山台駅　徒歩　約１５分） NSA 2011 Program ********************** 28th March Reception, 12:30-14:00 Session, 14:00-15:00 : H.Yamashita, "Brownian phase-space path integral" 15:30-17:30 : I.V.D.Berg, "External numbers and external points" ----------------------------------- 29th March 10:00-11:00 : K.Yokoyama "TBA" 11:30-12:30 : S.Sanders, "Nonstandard Analysis, the star of Reverse Mathematics" Lunch Time Session, 14:00-15:00 : S.Nagamachi, "Bosonization" 15:30-17:30 : G.Wallet, "Arithmetization and Harthong-Reeb line based on Omega-numbers" Banquet : Santo Spirito (Meguro) 19:00-21:30 -------------------------------------------- 30th March 10:00-11:00 : H.Miki, "4-dim duck solutions in a trading economic model" 11:30-12:30 : K.Tchizawa, "On a local model in a 4-dim slow-fast system" ------------------------------------- Kiyoyuki Tchizawa Directorate Ph.D Tokyo Nonlinear Analysis Research Center Institute of Administration Engineering, Ltd.

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 ================================================== Call for papers INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM‚11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 ================================================== Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this „service revolution‰ will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general „rigorous software development‰ might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks∑), service dependability, service evaluation/monitoring/testing, etc∑, a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, ∑) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We already agreed with the editor of an international journal to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra(a)imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas(a)oracle.com * Fabio Massacci, University of Trento, Italy - massacci(a)disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara(a)newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montréal, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep Küngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hernán Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA

1 0

CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 02 Mar '11

02 Mar '11

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml March 2011