Logic-ml April 2011

12 participants
14 discussions

[開催案内] 情報処理学会第83回プログラミング研究発表会(4/25-26)
by Keisuke Nakano 07 Apr '11

07 Apr '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊この場を借りまして，情報処理学会第83回プログラミング研究発表会開催のご案内をさせて頂きます．この研究発表会は3月16-17日に行われる予定でしたが，東日本大震災の影響により中止となったため，学会の通達に基づき日程と開催地を変更して開催させていただくことなりました．日程は4月25日-26日で，場所は京都大学楽友会館です．皆様のご参加をお待ちしております．最新情報は下記ページに掲示されますのでご確認ください． http://millsmess.cs.uec.ac.jp/pro/2010-5/ ---------------- 第83回プログラミング研究会 (PRO-2010-5) 日程：2011年 4月 25日(月)・26日(火) 場所：京都大学楽友会館 http://www.kyoto-u.ac.jp/ja/profile/intro/facilities/kyoshokuin/rakuyu/ 　　　〒606-8501　京都市左京区吉田二本松町市バス「近衛通（このえどおり）」下車徒歩すぐ ---------------- プログラムは発表予定者の都合に基づいて現在調整中です．元のプログラムは http://millsmess.cs.uec.ac.jp/pro/2010-5/old-program.html からご覧になれますが，都合により発表がキャンセルされる可能性があることを予めご了承ください．多くの方のご参加をお待ちしております．担当：中野圭介(電通大)，河内谷清久仁(日本IBM)

1 0

2nd CFP: 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)
by Koji Hasebe 07 Apr '11

07 Apr '11

（重複して受け取られた場合はご容赦下さい。） 6月にコペンハーゲンにて開催される"1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011)"のCFPをお送り致します。多数の投稿をお待ちしております。長谷部浩二筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻 [Please accept our apologies if you receive multiple copies of this email] ================================================== 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 have already agreed with the editor of the international Journal of Internet Services and Information Security 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: Non-classical Modal and Predicate Logics
by Yuping Shen 05 Apr '11

05 Apr '11

Call for papers *** Non-classical Modal and Predicate Logics *** Guangzhou (Canton), China, 5-9 December 2011 http://logic.sysu.edu.cn/ncmpl2011 Modalities and predicates have since ancient time been central notions of logic. In the 20th century, various systems of non-classical logics have emerged, with applications in many disciplines like Computer Science, Linguistics, Mathematics, and Philosophy. This gave rise to the questions of non-classical treatment of quantification and modalities and their accommodation in these non-classical logics. In response, various modal and predicate variants of non-classical logics have been introduced and studied in the past decades. Although there are many good conferences on (mainly propositional) non-classical logics, this conference is one solely dedictated to modal and predicate non-classical logics. The aim of the conference is to bring together researchers from various branches of non-classical logics, not only to present recent advances in their particular fields, but also to identify common problems and methods and foster the exchange of ideas between researchers from separate fields. Topics of interest: * The study of first- or higher-order variants of non-classical logics, including, but not limited to: - Predicate intuitionistic and superintuitionistic logics - Predicate modal logics - Predicate substructural logics - Predicate many-valued and partial logics - Predicate paraconsistent logics - Predicate non-monotonic logics, etc. * Non-classical theories of quantification over classical logics, such as: - Free logics - Branching quantifiers and IF-logic - Generalized quantifiers * Extensions by modalities of (propositional or predicate) non-classical logics, including: - Modal extensions of (super)intuitionistic, substructural, many-valued, paraconsistent, non-monotonic, etc., logics - Co-algebraic treatment of modalities We accept both purely theoretical works on the above logics coming from all branches of mathematical logic (proof-theory, model theory, game theory, computational complexity, etc.), as well as their application in the foundation of mathematics (non-classical mathematics), computer science, linguistics, philosophy, etc. Strong papers on propositional logics can also be accepted, provided they relate to the themes in the main scope of the conference (e.g., the study of completions in algebraic semantics, propositional quantification, etc.). Full versions of selected papers will be published in a special issue of an international peer-reviewed journal (to be specified). == Invited speakers == Gabriel Sandu Hiroakira Ono Mingsheng Ying Rob Goldblatt Valentin Shehtman Xuefeng Wen == Conference chairs == Shier Ju Petr Cintula == Program committee == Steve Awodey Libor Behounek Itala M.L. D'Ottaviano Rosalie Iemhoff Hu Liu Michael Rathjen Greg Restall Yde Venema == Organizing committee == Yuping Shen (chair) == Coference web page == http://logic.sysu.edu.cn/ncmpl2011 == Conference fee == Foreign participants: 150 EUR Chinese participants: 1000 RMB Chinese students: 200 RMB The conference fee covers accommodation and all meals during the conference, coffee breaks, social program, and conference materials. == Abstracts == Extended abstracts of 3-5 pages should be submitted via the EasyChair web interface, see http://logic.sysu.edu.cn/ncmpl2011 == Important dates == Deadline for abstracts: 1 September 2011 Notification of acceptance: 20 September 2011 Conference: 5-9 December 2011 Shier Ju and Petr Cintula Conference chairs

1 0

[TACL 2011] Third and last call for papers -- submission deadline approaching: 18/04/2011
by tacl2011＠lif.univ-mrs.fr 04 Apr '11

04 Apr '11

[Apologies for multiple copies] *Submission deadline approaching: 18/04/2011* =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Third and final call for papers =============================================================================== July 26-30, 2011 Universités Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Università degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. The program committee specially encourages submissions related to the work of Leo Esakia, and may select some of these submission for presentation at the special session. Submissions ----------- Contributed presentations will be of two types: * standard presentations of 20 minutes in parallel sessions, * featured, 30 minutes long, plenary presentations. The submission of an extended abstract in pdf format will be required to be selected for a contributed presentation of either kind. Concerning the standard presentations, while preference will be given to new work, results that have already been published or presented elsewhere will also be considered. Concerning the featured presentations: the program committee will choose a small number of submissions of which the authors will be invited to give a plenary presentation. The criteria for this selection will be: originality, significance and interest to the wider TACL community. There will be just one submission procedure, for contributed presentations of either kind: authors are requested to submit a short text of four pages, in English and in pdf format, through the easychair submission site: https://www.easychair.org/conferences/?conf=tacl2011 Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Università degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Université Aix-Marseille II Tadeusz Litak, University of Leicester Paul-André Melliès, CNRS Paris Diderot George Metcalfe, Universität Bern Nicola Olivetti, Université Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Université Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Université de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011(a)lif.univ-mrs.fr ===============================================================================

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml April 2011