Logic-ml

10 participants
1782 discussions

再送：第53回MLG数理論理学研究集会
by Suzuki, Nobu-Yuki 19 Oct '18

19 Oct '18

皆様静岡大学の鈴木信行（53rd MLG 数理論理学研究集会　世話人代表）です。参加申込の〆切まで2週間となりましたので、再度、ご案内させていただきます。重複してお受け取りの方々には、ご寛恕を願っておきます。ぜひ、ご参加をご検討ください。 --------------------------------- 皆さま静岡大学の鈴木信行（53rd MLG 数理論理学研究集会　世話人代表）です。第53回MLG 数理論理学研究集会の情報です。第53回MLG 数理論理学研究集会期間・場所・期間: 2018年 11月 30日 (金)午後〜 12月 2日 (日)午前・場所: 静岡大学　静岡キャンパス　理学部C309 　〒422-8529　静岡県静岡市駿河区大谷836 　 (JR静岡駅よりバスで約30分) ウェブ上の情報： https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ 今回のMLGは、静岡大学理学部の教室を使用します。宿泊の手配のお世話はいたしませんので、各自でご手配ください。 (JR静岡駅周辺に宿泊されることをお勧めします。) 参加申し込みについて参加の申し込みは以下のURLから必要事項を記入の上、11月2日(金)までにお送りください。 https://docs.google.com/forms/d/e/1FAIpQLScBi6voKtT7J6q3xqm1rpaoztSe2GvRF8a… もしくは以下のフォームにご記入の上、メールでお送りください。送り先: mlg53rd.shizuoka(a)gmail.com 件名: MLG53申込 ---------------------------------------------- １．お名前２．所属・身分３．メールアドレス４．講演する・しない５．講演する場合タイトル（未定でも可）６．懇親会(11月30日予定)に参加する・しない (学生の方で懇親会に参加される場合は「参加する(学生)」とご記入ください。懇親会費の割引をする予定です。) ７．備考 (講演の希望日などがありましたらこちらにご記入ください) ---------------------------------------------- ※申し込み無しでもご参加いただけますが、懇親会への参加を希望される場合は必ずお申し込みください。 ※タイトルが未定の場合は、可能であれば開催一週間前までにお知らせください。 ※配布資料等で印刷が必要な場合は、11月22日までにお送り頂ければこちらで印刷いたします(白黒になります)。

1 0

CADE-27: Call for Papers, Workshops, Tutorials and System Competitions
by Nao Hirokawa 19 Oct '18

19 Oct '18

皆様来年８月にブラジル・ナタールで開催されます、自動演繹に関する国際会議 CADE の論文・ワークショップ・チュートリアルおよびシステムコンペティション募集の案内をお送り致します。是非、投稿をご検討下さい。廣川 (JAIST) ============================================================================ CADE-27: Call for Papers, Workshops, Tutorials and System Competitions ---- The 27th International Conference on Automated Deduction (CADE-27) Natal, Brazil 25-30 August 2019 http://www.cade-27.info CALL FOR PAPERS CADE is the major international forum for presenting research on all aspects of automated deduction. High-quality submissions on the general topic of automated deduction, including foundations, applications, implementations, theoretical results, practical experiences and user studies are solicited. Key dates: Abstract deadline: 15 February 2019 Submission deadline: 22 February 2019 * Logics of interest include propositional, first-order, equational, higher-order, classical, description, modal, temporal, many-valued, constructive, other non-classical, meta-logics, logical frameworks, type theory, set theory, as well as any combination thereof. * Paradigms of interest include theorem proving, model building, constraint solving, computer algebra, model checking, proof checking, and their integration. * Methods of interest include resolution, superposition, completion, saturation, term rewriting, decision procedures, model elimination, connection methods, tableaux, sequent calculi, natural deduction, as well as their supporting algorithms and data structures, including matching, unification, orderings, induction, indexing techniques, proof presentation and explanation, proof planning. * Applications of interest include program analysis, verification and synthesis of software and hardware, formal methods, computational logic, computer mathematics, natural language processing, computational linguistics, knowledge representation, ontology reasoning, deductive databases, declarative programming, robotics, planning, and other areas of artificial intelligence. Submissions can be made in two categories: regular papers and system descriptions. The page limit in Springer LNCS style is 15 pages excluding references for regular papers and 10 pages excluding references for system descriptions. Submissions must be unpublished and not submitted for publication elsewhere. They will be judged on relevance, originality, significance, correctness, and readability. System descriptions must contain a link to a working system and will also be judged on usefulness and design. Proofs of theoretical results that do not fit in the page limit, executables of systems, and input data of experiments should be made available, via a reference to a website or in an appendix of the paper. For papers containing experimental evaluations, all data needed to rerun the experiments must be available. Reviewers will be encouraged to consider this additional material, but submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chair may solicit further reviews after the rebuttal period. The proceedings of the conference will be published in the Springer LNCS/LNAI series. Formatting instructions and the LNCS style files can be obtained at http://www.springer.de/comp/lncs/authors.html At every CADE conference the Program Committee selects one of the accepted papers to receive the CADE Best Paper Award. The award recognizes a paper that the Program Committee collegially evaluates as the best in terms of originality and significance, having substantial confidence in its correctness. Overall technical quality, completeness, scholarly accuracy, and readability are also considered. Characteristics associated with a best paper include, for instance, introduction of a strong new technique or approach, solution of a long-standing open problem, introduction and solution of an interesting and important new problem, highly innovative application of known ideas or existing techniques, and presentation of a new system of outstanding power. Under exceptional circumstances, the Program Committee may give two awards (ex aequo) or give no award. IMPORTANT DATES Abstract deadline: 15 February 2019 Submission deadline: 22 February 2019 Rebuttal phase: 2 April 2019 Notification: 15 April 2019 Final version: 27 May 2019 SUBMISSION INSTRUCTIONS Papers should be submitted via https://easychair.org/conferences/?conf=cade27 CADE-27 ORGANIZERS Conference Chair: Elaine Pimentel Federal University of Rio Grande do Norte, Brazil Organizers: Carlos Olarte Federal University of Rio Grande do Norte, Brazil Joao Marcos Federal University of Rio Grande do Norte, Brazil Claudia Nalon University of Brasilia, Brazil Giselle Reis CMU, Qatar Program Committee Chair: Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France Workshop, Tutorial, and Competition Chair: Giles Reger University of Manchester, UK Publicity Chair: Geoff Sutcliffe University of Miami, USA Program Committee: Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Franz Baader, TU Dresden, Germany Clark Barrett, Stanford University, USA Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands Maria Paola Bonacina, Universita degli Studi di Verona, Italy Leonardo Mendonca de Moura, Microsoft Research, USA Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan Clare Dixon, University of Liverpool, UK Mnacho Echenim, Universite de Grenoble, France Marcelo Finger, University of Sao Paulo, Brazil Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France Silvio Ghilardi, Universita degli Studi di Milano, Italy Juergen Giesl, RWTH Aachen University, Germany Rajeev Gore, The Australian National University, Australia Stefan Hetzl, Technische Universitaet Wien, Austria Marijn J. H. Heule, The University of Texas at Austin, USA Nao Hirokawa, JAIST, Japan Moa Johansson, Chalmers University of Technology, Sweden Cezary Kaliszyk, University of Innsbruck, Austria Deepak Kapur, University of New Mexico, USA Benjamin Kiesl, Technische Universitaet Wien, Austria Konstantin Korovin, The University of Manchester, UK Laura Kovacs, Technische Universitaet Wien, Austria Ramana Kumar, DeepMind, UK Claudia Nalon, University of Brasilia, Brazil Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany Carlos Olarte, Federal University of Rio Grande do Norte, Brazil Jens Otten, University of Oslo, Norway Andre Platzer, Carnegie Mellon University, USA Andrew Reynolds, The University of Iowa, USA Philipp Ruemmer, Uppsala University, Sweden Renate A. Schmidt, The University of Manchester, UK Stephan Schulz, DHBW Stuttgart, Germany Roberto Sebastiani, University of Trento, Italy Natarajan Shankar, SRI International, USA Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany Martin Suda, Czech Technical University, Czech Republic Geoff Sutcliffe, University of Miami, USA Rene Thiemann, University of Innsbruck, Austria Uwe Waldmann, Max Planck Institute for Informatics, Germany Christoph Weidenbach, Max Planck Institute for Informatics, Germany Sarah Winkler, University of Innsbruck, Austria CALL FOR WORKSHOPS, TUTORIALS, SYSTEM COMPETITIONS The 27th International Conference on Automated Deduction (CADE-27) Natal, Brazil 25-30 August 2019 http://www.cade-27.info CALL FOR WORKSHOPS Workshop proposals for CADE-27 are solicited. The workshops will take place on August 25-26 2019, before the main conference. Both well-established workshops and newer ones are encouraged. Similarly, proposals for workshops with a tight focus on a core automated reasoning specialization, as well as those with a broader, more applied focus, are very welcome. Please provide the following information in your application document: + Workshop title. + Names and affiliations of organizers. + Proposed workshop duration (from half a day to two days) and preferred day(s). + Brief description of the goals and the scope of the workshop. Why is the workshop relevant for CADE? + Is the workshop new or has it met previously? In the latter case information on previous meetings should be given (e.g., links to the program, number of submissions, number of participants). + What are the plans for publication? CALL FOR TUTORIALS Tutorial proposals for CADE-27 are solicited. Tutorials are expected to be either half-day or full-day events, with a theoretical or applied focus, on a topic of interest for CADE-27. Proposals should provide the following information: + Tutorial title. + Names and affiliations of organizers. + Proposed tutorial duration (from half a day to one days) and the preferred day. + Brief description of the tutorial's goals and topics to be covered. + Whether or not a version of the tutorial has been given previously. CADE will take care of printing and distributing notes for tutorials that would like this service. CALL FOR SYSTEM COMPETITIONS The CADE ATP System Competition (CASC), which evaluates automated theorem proving systems for classical logics, has become an integral part of the CADE conferences. Further system competition proposals are solicited. The goal is to foster the development of automated reasoning systems in all areas relevant for automated deduction in a broader sense. Proposals should include the following information: + Competition title. + Names and affiliations of organizers. + Duration and schedule of the competition. + Room/space requirements. + Description of the competition task and the evaluation procedure. + Is the competition new or has it been organized before? In the latter case information on previous competitions should be given. + What computing resources are required and how will they be provided? IMPORTANT DATES Workshop/Tutorials/System Competitions: Submission deadline: 15 November 2018 Notification: 15 December 2018 SUBMISSION INSTRUCTIONS Proposals for workshops, tutorials, and system competitions should be uploaded via https://easychair.org/conferences/?conf=cade27wtc

1 0

A Workshop on Philosophical Logic and Philosophy of Logicのご案内
by Hitoshi Omori 20 Sep '18

20 Sep '18

A Workshop on Philosophical Logic and Philosophy of Logicのご案内 (重複してお受け取りの際はご容赦ください。) JAISTの大森仁と申します。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。 ------------------------------------- A Workshop on Philosophical Logic and Philosophy of Logic 【日時】2018年9月25日【場所】I-56 (Collaboration Room 7), JAIST 【ウェブサイト】 https://sites.google.com/site/hitoshiomori/home/workshops/jaist201809 【プログラム】 10:00--11:00 Takuro Onishi "Situated Assertions" 11:00--12:00 Kai Tanter "Making Bilateralism Relevant" 12:00--13:30 Lunch 13:30--14:30 Shoshin Nomura "A formalization of A. Danto's narrative sentences" 14:30--15:30 Hidenori Kurokawa "On Takeuti’s view of the concept of set" 15:30--15:45 Coffee break 15:45--16:45 Satoru Niki "On some subsystems of minimal logic" 16:45--17:45 Colin Caret "Paraconsistency in the Wild?" ------------------------------------- どうぞ奮ってご参加下さい。よろしくお願いいたします。大森仁

1 0

CFP: 14th Theorem Proving and Provers meeting (TPP 2018), Nov. 21-22 in Sendai
by Keisuke Nakano 19 Sep '18

19 Sep '18

Dear all (English translation follows below), 皆様，東北大学の中野です．第14回 TPP (Theorem Proving and Provers) ミーティングを 11月21日(水)から 11月22日(木)までの予定で，東北大学片平キャンパスにて開催します．このミーティングは，2005年から年に1回開催され，定理証明系を作っている人から使う側の人まで幅広い人たちが集まり，様々な側面からの話をしあうことでアイディアの交換をしてきたものです．ミーティング期間中の討論を大切にしたいと考えていますので，出来上がった仕事の講演だけでなく，進行中の仕事，未完成の仕事についての講演も歓迎します．参加者には可能な限りご講演いただくことを期待しています．詳細は以下のWebページをご確認ください： https://ksk.github.io/tpp2018/ 参加をご希望の方は11/9(金)までに上のWebページから参加申し込みをお願いします．また，懇親会を1日め (11/21) の夜に予定しており，そちらの参加希望も同じ登録フォームから受け付けております．奮ってご参加ください．後からでも変更可能ですので，お早めにご登録いただけると大変ありがたいです．また，上記のWebページにおきまして毎年恒例のTPPmarkの問題も掲載しております．当日参加できない方の解答も受け付けておりますので，ぜひ挑戦してみてください．多数のご参加をお待ちしております．どうぞよろしくお願いします． We are happy to announce the 14th TPP meetings (Theorem Proving and Provers meeting) will be held in the Katahira Campus of Tohoku University: from Wednesday, November 21 to Thursday, November 22 TPP is a series of annual meetings for developers as well as users of theorem provers. Discussions from various aspects and exchanges of ideas have taken place in the past meetings since 2005. We regard the discussions during the meeting to be most important. As such, not only the talks about completed work, but those about ongoing work and half-baked work are also welcome. We hope all participants would consider giving a talk. More information is available at: https://ksk.github.io/tpp2018/ If you are interested in participating the meeting, please register at the Web page above by November 9. In the registration form, you may express intent to join the dinner party which is planned at the evening of the first day. Please make your early registration if possible because you may modify it later. The page also shows the TPPmark problem. Those who will not attend the meeting also can submit the solution. Please check it out and submit your solution. We are looking forward to your attendance and your solutions. -- 中野圭介東北大学電気通信研究所 ksk(a)tohoku.ac.jp

1 0

第53回MLG数理論理学研究集会（追加情報）
by Suzuki, Nobu-Yuki 18 Sep '18

18 Sep '18

皆さま静岡大学の鈴木信行（53rd MLG 数理論理学研究集会　世話人代表）です。第53回MLG 数理論理学研究集会の情報です。第53回MLG 数理論理学研究集会期間・場所・期間: 2018年 11月 30日 (金)午後〜 12月 2日 (日)午前・場所: 静岡大学　静岡キャンパス　理学部C309 　〒422-8529　静岡県静岡市駿河区大谷836 　 (JR静岡駅よりバスで約30分) ウェブ上の情報： https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ 今回のMLGは、静岡大学理学部の教室を使用します。宿泊の手配のお世話はいたしませんので、各自でご手配ください。 (JR静岡駅周辺に宿泊されることをお勧めします。) 参加申し込みについて参加の申し込みは以下のURLから必要事項を記入の上、11月2日(金)までにお送りください。 https://docs.google.com/forms/d/e/1FAIpQLScBi6voKtT7J6q3xqm1rpaoztSe2GvRF8a… もしくは以下のフォームにご記入の上、メールでお送りください。送り先: mlg53rd.shizuoka(a)gmail.com 件名: MLG53申込 ---------------------------------------------- １．お名前２．所属・身分３．メールアドレス４．講演する・しない５．講演する場合タイトル（未定でも可）６．懇親会(11月30日予定)に参加する・しない (学生の方で懇親会に参加される場合は「参加する(学生)」とご記入ください。懇親会費の割引をする予定です。) ７．備考 (講演の希望日などがありましたらこちらにご記入ください) ---------------------------------------------- ※申し込み無しでもご参加いただけますが、懇親会への参加を希望される場合は必ずお申し込みください。 ※タイトルが未定の場合は、可能であれば開催一週間前までにお知らせください。 ※配布資料等で印刷が必要な場合は、11月22日までにお送り頂ければこちらで印刷いたします(白黒になります)。

1 0

第53回MLG数理論理学研究集会のご案内
by Suzuki, Nobu-Yuki 18 Sep '18

18 Sep '18

皆さま静岡大学の鈴木信行と申します。今年度の　MLG 数理論理学研究集会　の世話人（代表）をいたします。今年度、第53回MLG 数理論理学研究集会は、以下の要領で開催する予定です。第53回MLG 数理論理学研究集会期間・場所 (予定) ・期間: 2018年 11月 30日 (金)午後〜 12月 2日 (日)午前・場所: 静岡大学　静岡キャンパス　理学部C309 　〒422-8529　静岡県静岡市駿河区大谷836 　 (JR静岡駅よりバスで約30分) ウェブ上の情報： https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ （現時点では、まだあまり情報はありません）ご予定にお加えいただけますよう、お願いいたします。

1 0

ジラール教授（Jean-Yves GIRARD）連続講義 “LOGIC 2.0 : A derealistic refoundation of logic” Sept. 25th & Oct. 2nd, keio Univ.
by Mitsu Okada 13 Sep '18

13 Sep '18

********************************************************************************** *ジラール教授（Jean-Yves GIRARD）連続講義（９月２５日、１０月２日,　Sept 25th,Oct.2nd, Keio Univ.）* *Lecture**“LOGIC 2.0 : A derealistic refoundation of logic” * *********************************************************************************. 参加自由、事前登録なしです。お気軽にお立ち寄りください。 ********************************************************************************* Abstract attached below アブストラクトは下をご覧ください。１回目：9月25日(火)　Sept.25th, 18:00-19:30, Lecture 1 and discussion. ２回目：10月2日(火) Oct.2nd, 17:00-19:00, Lecture 2 and extended discussion,. 慶應義塾大学三田キャンパス大学院校舎1階313番教室, Room 313 Graduate School Building, Mita Campus, Keio University ******************************************************************************** （大学院校舎は下記キャンパスマップの8です） Mita Campus, Keio University, Classroom 313, 1F of Graduate School Building (Number 8 of the Campus Map below) 構内図Campus Map: https://www.keio.ac.jp/en/maps/mita.html 招聘講師/ Invited Lecturer: ジャン＝イヴ　ジラール教授（フランス国立科学センターCNRS名誉主任研究員、マルセイユ数学研究所） Prof. Jean-Yves GIRARD (Directeur de Recherches émérite, CNRS-IMM) 題目/ Title: LOGIC 2.0 : A derealistic refoundation of logic （最新情報はこちらのトップに載せる予定です: https://abelard.flet.keio.ac.jp/）アブストラクト/ABSTRACT LOGIC 2.0 : A derealistic refoundation of logic. Logic is based upon a doubt as to « reality », not to speak of authority. This is why axiomatic realism, a.k.a. Tarskism, at work in familiar (1.0) logic is a miscarriage of logical rationality. We propose to replace the trinity Syntax/Semantics/Meta, with an architecture based upon the synthetic a posteriori : « l’usine » (the factory) and its proofnets. We thus replace the nets of logic with the logic of nets. Among the technical novelties, the self-dual propositional constants フand ヲwhose multiplicative combinations define natural numbers. Since equality becomes logical equivalence, natural numbers provide pairwise contradictory propositions, which is classically inconsistent : a conjunction can thus be true while one of its components is false.Truth, which no longer proceeds from the Sky, is governed by the Euler-Poincaré invariant of graphs, with a derealistic switch : the invariant depends upon the divide between objective and subjective vertices. Derealism thus accomplishes a spectacular jailbreak from Tarskism! ---------------------------------------------------------- お問い合わせ先: 慶應義塾大学文学部哲学専攻岡田光弘研究室東京都港区三田２−１５−４５事務局　Email: logic(a)abelard.flet.keio.ac.jp ----------------------------------------------------------

1 0

Call for Papers: ICLA 2019: Eighth Indian Conference on Logic and its Applications 2019, IIT Delhi, India (March 3-5, 2019)
by Katsuhiko Sano 12 Sep '18

12 Sep '18

Logic-ml の皆様、北海道大学の佐野勝彦です。インドのデリーで開催される論理の国際会議についてご案内いたします。奮ってご投稿ください。佐野勝彦 ----------------------------------------------------------------------------------------------------- CALL FOR PAPERS ICLA 2019: Eighth Indian Conference on Logic and its Applications 2019 Indian Institute of Technology Delhi New Delhi, India, March 3-5, 2019 Conference websitehttp://icla2019.cse.iitd.ac.in Submission linkhttps://easychair.org/conferences/?conf=icla2019 Posterdownload The Association for Logic in India (ALI) announces the eighth edition of its biennial International Conference on Logic and its Applications (ICLA), to be held at the Indian Institute of Technology Delhi from March 3 to 5, 2019. ICLA is a forum for bringing together researchers from a wide variety of fields in which formal logic plays a significant role, along with mathematicians, computer scientists, philosophers and logicians studying foundations of formal logic in itself. A special feature of this conference is the inclusion of studies in systems of logic in the Indian tradition and historical research on logic. As in the earlier events in this series, we shall have eminent scholars as invited speakers. Details of the last ICLA 2017 may be found at https://icla.cse.iitk.ac.in. See http://ali.cmi.ac.in for information on past events as well as updates on this conference. Scope: Authors are invited to submit papers presenting original and unpublished research in any area of logic and applications. Articles on mathematical and philosophical logic, logic in computer science, foundations and philosophy of mathematics and the sciences, use of formal logic in areas of theoretical computer science and artificial intelligence, logic and linguistics, history of logic, Indian systems of logic, or on the relationship between logic and other branches of knowledge, are welcome. Committees: Program Committee Abhisekh Sankaran, IMSc Chennai Amaldev Manuel, IIT Goa (Co-chair) Amit Kuber, IIT Kanpur Anuj Dawar, University of Cambridge Arnaud Sangnier, Univercite Paris Diderot Arun Kumar, IIT Delhi Astrid Kiehn, IIT Mandi Benedikt Löwe, University of Amsterdam Benedikt Bollig, LSV, ENS Cachan, CNRS Benjamin Monmege, Aix-Marseille Université, LIF, CNRS Davide Grossi, University of Groningen Denis Kuperberg, ENS Lyon Gabriele Puppis, LaBRI, Bordeaux Hans van Ditmarsch, LORIA - CNRS / University of Lorraine Ivo Düntsch, Brock University Katsuhiko Sano, Hokkaido University M. Praveen, Chennai Mathematical Institute Md. Aquil Khan, IIT Indore (Co-chair) Mihir Kumar Chakraborty, Jadavpur University Minghui Ma, Sun Yat-Sen University Ramchandra Phawade, IIT Dharwad Richard Zach, University of Calgary S. Akshay, IIT Bombay Sankha Basu, IIIT Delhi Smita Sirker, Jawaharlal Nehru University Soma Dutta, University of Warsaw Sreejith A. V., IIT Goa Stefan Göller, University of Kassel Sujata Ghosh, ISI Chennai Sunil Easaw Simon, IIT Kanpur Torben Braüner, Roskilde University Organizing committee S. Arun-Kumar, IIT Delhi Sanjiva Prasad, IIT Delhi Subodh V Sharma, IIT Delhi Publication: Submitted papers will be peer-reviewed and accepted papers will be published in the conference proceedings. The ICLA 2019 conference proceedings will be published either in the Springer Lecture Notes in Computer Science series or in Leibniz International Proceedings in Informatics (LIPIcs), a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl – Leibniz Center for Informatics. Submission Guidelines: Authors may submit drafts of full papers or extended abstracts. The submission must not exceed 12 pages in Springer-Verlag Lecture Notes LaTeX style. If appropriate, proof details omitted in the paper may be added in an appendix meant for the reviewers. Concurrent submissions to other conferences/journals are not admissible. For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates: Deadline for Submissions: 5 November 2018 Notification to authors: 21 December 2018 Pre-conference Workshops: 1-2 March 2019 Conference: 3-5 March 2019 Contact Please contact the PC chairs (aquilk(a)iiti.ac.in, amal(a)iitgoa.ac.in) for any further queries.

1 0

フォーマルアプローチ特集論文募集のご案内
by mano.ken＠lab.ntt.co.jp 12 Sep '18

12 Sep '18

logic-ml の皆様，電子情報通信学会論文誌英文ED分冊“フォーマルアプローチ特集”の，論文募集のご案内をさせていただきます．真野（NTT コミュニケーション科学基礎研究所） ---- フォーマルアプローチ特集論文募集電子情報通信学会論文誌英文ED分冊フォーマルアプローチ特集編集委員会フォーマルアプローチ（形式手法・形式技法・形式理論）は，情報システムや組込みシステムの設計開発における信頼性向上の鍵となる重要な基盤です．これまで，設計対象のモデル化，要求分析と仕様記述，コード自動生成，テストと検証，保守と再利用などに関する技術と理論的知見を生み出してきました．近年の情報技術の進展に伴う対象領域の拡大に伴い，フォーマルアプローチは従来にも増して多様な分野で用いられるようになり，ますます発展しています．本小特集は，情報システムや組込みシステムの設計・運用におけるフォーマルアプローチについて，基礎理論から応用まで，幅広い研究を対象にしています．個別の対象領域に特化したケーススタディから，分野横断的な手法や理論まで，様々な方面から，フォーマルアプローチ研究に携わる若手研究者を奨励するとともに，この分野の研究が更に発展することを目指しております．奮って御投稿下さいますよう御案内申し上げます． 1. 対象分野主な対象は以下のとおりですが，これに限らず，「情報システムや組込みシステム及びそれをとりまく環境を定式化した上で，そのシステムの振舞いの解析や性質の導出を厳密に行い，設計・運用に関わる種々の問題の解決を図る」ことを目指した論文を広く募集します． - 基礎理論：システムの構造や振舞いの形式記述・検証に関する基礎理論 - 形式技法：ソフトウェア，ハードウェア，ネットワークなどのシステムに対する体系だった記述・検証技法 - 形式ツール：モデル検査器や定理証明器など，形式手法に基づくツール - 応用：情報システムや組込システム，回路系，情報セキュリティ，車載システム，人工知能・機械学習システムなどへの形式手法の適用事例 - 教育：教育事例 2. 論文の執筆と取扱い論文 (一般論文)，レター，及びサーベイ論文を募集します．投稿規程等は電子情報通信学会の英文誌の規程と同じです．以下の規程を御参照下さい． "The Information for Authors" (IEICE Transactions on Information and Systems) http://www.ieice.org/eng/shiori/mokuji_iss.html 3. 主なスケジュール　論文投稿締切　　　　平成 30年 9月25日 (火) 23:59 JST (厳守) 　第一回判定通知予定　平成 30年11月23日 (金) 　初回修正締切　　　　平成 31年 1月18日 (金) 　最終判定通知予定　　平成 31年 3月 8日 (金) 　発行予定　　　　　　平成 31年 8月号 4. 投稿方法本特集では，電子投稿のみを受付けます．論文を下記のweb pageから投稿して下さい．初期投稿時に，編集可能な論文本体 (TeX/Word)，図，著者の写真, biographyも投稿する必要があります．　 https://review.ieice.org/regist/regist_baseinfo_e.aspx 投稿の際には以下の項目を選択してください． "Journal/Section" -> "[Special FO] Formal Approaches" 同時にWEB上で著作権譲渡手続きができます．投稿手続きについて御不明な点がございましたら，問合先まで御連絡下さい． 5. 掲載料招待論文を含むすべての著者は，論文が採録となった場合，2019年4月頃に掲載料をお支払い頂くことになります．2019年5月15日までに支払いが完了しない場合には，採録取り消しとなります． 6. オープンアクセス化情報システムソサイエティ英文論文誌は，2017 年 1 月よりオープンアクセス化されています．J-STAGE（https://www.jstage.jst.go.jp/browse/transinf/）に掲載されている論文はすべて閲覧可能になっています． 7. 特集編集委員会委員長：青木利晃（北陸先端大）　幹事：真野健（ＮＴＴ），中川博之（阪大）　委員：石川冬樹'情報研)，來間啓伸(日立)，小林孝一(北大)，　　　　立石孝彰(日本IBM)，土屋達弘(阪大)，山口真悟(山口大)，　　　　横川智教(岡山県立大) 8. 問合せ先本特集のホームページ: (和文) http://www.jaist.ac.jp/~toshiaki/fa2018/jp/ (英文) http://www.jaist.ac.jp/~toshiaki/fa2018/ 　青木利晃　北陸先端科学技術大学院大学情報科学系　923-1292 石川県能美市旭台1-1 　toshiaki(a)jaist.ac.jp =============================================================== CALL FOR PAPERS Special Section on Formal Approaches The IEICE Transactions on Information and Systems announces a forthcoming special section on Formal Approaches to be published in August 2019. Formal methods and techniques play a key role in designing and developing highly reliable information systems and embedded systems. The last decades have seen various new techniques and profound theoretical results using formal methods in surprisingly many fields such as modeling, requirements analysis, specification, automatic generation of codes, testing, verification, and maintenance. They are rapidly extending their application domains as a result of the recent growth of information and communication technologies. The Special Section on Formal Approaches aims at stimulating research on formal approaches to information systems and embedded systems, ranging from fundamental theory to practical applications. Our emphasis is put on the cross-fertilization of related research fields and encouragement of young researchers. Topics: The major topics are listed below, but we solicit submissions in all areas of formal approaches, i.e., first to formalize information systems, embedded systems, and their environment, next to analyze their behavior and to derive their properties rigorously, and then to solve various problems in designing and managing the systems. - Theoretical foundations: all aspects of theory related to formal description and verification for structure and behavior of systems. - Formal techniques: techniques for mainly describing and analyzing systems, such as software, hardware and networks. - Formal tools: tools based on formal methods such as model checkers, theorem provers, and static and dynamic analyzers. - Applications: practical experiences of applying formal methods to information systems, embedded systems, circuits, security, AI systems, machine learning systems, automotive systems, etc. - Education: education on formal methods. Submission Instructions: The deadline for submission is Sep 25, 2018, 23:59 JST(GMT+9). Manuscripts should be carefully prepared according to the guideline in the "Information for Authors" (available at http://www.ieice.org/eng/shiori/mokuji_iss.html). The preferred length of the manuscript is 8 pages. Only electronic submission through the web page is accepted. Submit a complete paper and transfer copyright of the paper using the IEICE Web site https://review.ieice.org/regist/regist_baseinfo_e.aspx Authors should choose the [Special FO] Formal Approaches" as a "Journal/Section" on the online screen. Editorial Committee: Guest Editor-in-Chief: Toshiaki Aoki (JAIST) Guest Editors: Ken Mano (NTT Communication Science Laboratories) Hiroyuki Nakagawa (Osaka University) Members: Fuyuki Ishikawa (National Institute of Infomatics) Hironobu Kuruma (Hitachi, Ltd.) Koichi Kobayashi (Hokkaido University) Takaaki Tateishi (IBM Japan) Tatsuhiro Tsuchiya (Osaka University) Shingo Yamaguchi (Yamaguchi University) Tomoyuki Yokogawa (Okayama Prefectural University) Further information may be obtained from the web page at: http://www.jaist.ac.jp/~toshiaki/fa2018/ All inquiries should be sent to the guest editor in chief: Toshiaki Aoki(JAIST) 1-1 Asahidai, Nomi-shi, Ishikawa, 923-1292, Japan E-mail: toshiaki(a)jaist.ac.jp Important Dates: Submission Deadline: Sep 25, 2018 23:59 JST (GMT+9) [firm deadline] First Notification: Nov 23, 2018 Revised Version Deadline: Jan 18, 2019 Final Notification: Mar 8, 2019 Important Notice. (1) At least one of the authors must be an IEICE member when the manuscript is submitted for review. For the application of IEICE membership, visit http://www.ieice.org/eng/member/OM-appli.html (2) When a paper has been accepted for publication, the authors are required to pay the page charges covering part of the cost of publication. Please carefuly read the submission guideline at http://www.ieice.org/eng/shiori/mokuji_iss.html (3) Upon accepted for publication, all authors, including authors of invited papers, should pay the page charges covering partial cost of publication around April, 2019. If payment is not completed by May 15, 2019, your manuscript will be handled as rejection. (4) The IEICE Transactions on Information and Systems is an open access journal from January, 2017. Open access to "IEICE Transactions on Information and Systems” is available via the J-STAGE (https://www.jstage.jst.go.jp/browse/transinf/).

1 1

WIAS Seminar: “The epsilon calculus with equality predicate and Herbrand complexity” (September 10, Waseda University)
by Makoto Fujiwara 07 Sep '18

07 Sep '18

皆様， (重複して受け取られた場合はご容赦ください) 早稲田大学の藤原誠です． 9月10日(月)に早稲田大学早稲田キャンパスにてインスブルック大学の宮本賢治さんをお迎えしてセミナーを開催いたします．ヨーロッパで研究をされている宮本さんの日本での貴重なご講演です．参加自由ですのでどうぞふるってご参加下さい．なお，今回の講演は英語で行われます．予めご了承下さい．詳細については以下のページをご参照下さい． https://www.waseda.jp/inst/wias/news/2018/08/23/5646/ 日時：2018年９月10日(月)16:00-17:30 Date & Time: Monday, 10 September 2018, 16:00 – 17:30 場所：早稲田大学早稲田キャンパス9号館5階第1会議室 Venue: Meeting room #1 on the 5th floor, Building #9, Waseda University Speaker: Kenji Miyamoto (University of Innsbruck, Kenji.Miyamoto(a)uibk.ac.at) Title: The epsilon calculus with equality predicate and Herbrand complexity Abstract: Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\varepsilon$ [1]. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. Moser and Zach study the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential theorems obtained by this elimination procedure [2]. We extend their results to epsilon-calculus with equality predicate. This is joint work with Georg Moser. [1] D. Hilbert and P. Bernays, Grundlagen der Mathematik, vol. 2, Springer Berlin, 1939. [2] G. Moser and R. Zach, The epsilon calculus and Herbrand complexity, Studia Logica, vol. 82 (2006), no. 1, pp. 133--155. ============================================ 藤原誠 (Makoto Fujiwara) 早稲田大学高等研究所 (Waseda Institute for Advanced Study, Waseda University) E-mail: makoto_fujiwara(a)aoni.waseda.jp ============================================

1 1

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml