- finite-model-theory - lists.rwth-aachen.de

S.Barry Cooper Prize Call for Nominations

von acie＠acie.eu

S.BARRY COOPER PRIZE 2020 CALL FOR NOMINATIONS A Call for Nominations for the S.Barry Cooper Prize is now open. Nominations for the award should be submitted by email to the Award Committee Chair ANUJ DAWAR (UNIVERSITY OF CAMBRIDGE) ANUJ.DAWAR(a)CL.CAM.AC.UK Any emails and related messages should have the subject line starting with "S. Barry Cooper Prize 2020". To be considered, nominations for the 2020 Prize must be received by 17 JANUARY, 2020. A nomination package should include: 1. A statement of motivation for awarding the prize to the nominee, including: the nominee's outstanding results, their seminal and lasting theory building and/or exceptional service to the research communities, as the case may be. These should be supported by at least one of - A list of the most important publications, accompanied by a brief summary of the technical content of the papers and a brief explanation of their significance. Where possible, this should include pointers to online versions of the publications. - A statement explaining the role played and the exceptional services rendered by the nominee, in the research communities involved in computability and related areas. 2. A support letter or letters signed by at least two members of the scientific community. The nomination package must be in English, but it may include reference to publications in other languages. SELECTION PROCESS The Award Committee is solely responsible for the selection of the winner of the award. All matters relating to the selection process that are not specified here are left to the discretion of the Award Committee, whose decision will be final.

4 Jahre, 6 Monate

1
0
0 0

ACKERMANN AWARD 2020: CALL FOR NOMINATIONS

von EACSL Mail-Account

ACKERMANN AWARD 2020 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2020 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2018 and 31.12.2019 are eligible for nomination for the award. The deadline for submission is 1 April 2020. Submission details follow below. Nominations can be submitted from 1 January 2020 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de *** The Award The 2020 Ackermann award will be presented to the recipient(s) at CSL 2021, the annual conference of the EACSL. The award consists of * a certificate, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * Christel Baier (TU Dresden); * Michael Benedikt (Oxford University); * Mikolaj Bojanczyk (University of Warsaw); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Prakash Panangaden (McGill University); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund) , the president of EACSL; * Alexandra Silva, (University College London), ACM SigLog representative. *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick(a)tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick(a)tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 20 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text.

4 Jahre, 6 Monate

1
0
0 0

2nd Call for Affiliated Workshops at QONFEST 2020, in Vienna, TU Wien - Deadline: January 15, 2020

von Mihaela Rozman

* *QONFEST 2020* * August 31-September 5, 2020, Vienna, Austria (http://qonfest2020.conf.tuwien.ac.at/) QONFEST is the umbrella conference comprising the joint international 2020 meetings CONCUR (31st International Conference on Concurrency Theory), QEST (17th International Conference on Quantitative Evaluation of SysTems), FORMATS (18th International Conference on Formal Modeling and Analysis of Timed Systems) and FMICS (25th International Conference on Formal Methods for Industrial Critical Systems). QONFEST 2020 will be hosted at TU Wien, Vienna, Austria, with the conferences taking place in the main building at Karlsplatz 13, 1040 Wien, and the workshops in the computer science building at Favoritenstr. 911, 1040 Wien. CALL FOR AFFILIATED WORKSHOPS Researchers and practitioners are invited to submit proposals for workshops to be affiliated to QONFEST 2020. Example topics include: concurrency theory and its applications, timed systems, semantics, logics, verification techniques, cross-fertilization between industry and academia and opportunities for young and prospective researchers. Past QONFEST conferences have been accompanied by successful workshops on a variety of topics. You can have an idea of the past workshops by browsing the pages of the previous editions of CONCUR, QEST, FORMATS and FMICS. The purpose of the workshops is to provide participants with a friendly, interactive atmosphere for presenting novel ideas and discussing their application. The workshops take place on Monday August 31, 2020 and Saturday September 5, 2020. Proposals should include: * The name and the preferred date of the proposed workshop (August 31 or September 5, 2020) * A short description of the workshop (500 words max) * If applicable, a description of past versions of the workshop, including dates, organizers, submission and acceptance counts, and attendance * The expected number of participants * The name and a link to the website(s) of the organizer(s) * The publication plan (only invited speakers, no published proceedings, pre-/post-proceedings published with EPTCS/ENTCS/...). The QONFEST organization offers: * a link from the QONFEST web site; * setup of meeting space, and related equipment, * coffee-breaks and lunch for the participants on the day of the workshop, * on-line and on-site registration to the workshop, * free workshop registration for an organizer and in case of more than 15 participants a second free workshop registration The main responsibility for organizing the workshop goes to the workshop organizer(s), including: * workshop publicity (possibly including call for papers, submission and review process) * scheduling of workshop activities in collaboration with the QONFEST workshop chair. IMPORTANT DATES Submission of workshop proposals: January 15, 2020 (but we greatly appreciate if you announce your proposal to us as soon as possible). Notification: January 31, 2020 SUBMISSION TO: Florian Zuleger (zuleger at forsyte dot at) For more information, please contact me via email. The QONFEST 2020 workshop chair, Florian Zuleger https://forsyte.at/people/zuleger/ Technische Universität Wien Vienna, Austria

4 Jahre, 6 Monate

1
0
0 0

Gödel Prize - 2nd call for nominations

von Anuj Dawar

The Gödel Prize 2020 - Call for Nominations Deadline: February 15, 2020 The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery, Special Interest Group on Algorithms and Computation Theory (ACM SIGACT). The award is presented annually, with the presentation taking place alternately at the International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The 28th Gödel Prize will be awarded at the 47th International Colloquium on Automata, Languages, and Programming to be held during 8-12 July, 2020 in Beijing. The Prize is named in honour of Kurt Gödel in recognition of his major contributions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous “P versus NP” question. The Prize includes an award of USD 5,000. Award Committee: The 2020 Award Committee consists of Samson Abramsky (University of Oxford), Anuj Dawar (Chair, University of Cambridge), Joan Feigenbaum (Yale University), Robert Krauthgamer (Weizmann Institute), Daniel Spielman (Yale University) and David Zuckerman (University of Texas, Austin). Nominations: Nominations for the award should be submitted by email to the Award Committee Chair: anuj.dawar(a)cl.cam.ac.uk. Please make sure that the Subject line of all nominations and related messages begin with “Goedel Prize 2020.” To be considered, nominations for the 2020 Prize must be received by February 15, 2020. Those intending to submit a nomination should contact the Award Committee chair by email well in advance to discuss it. For full details on eligibility and requirements, please see http://eatcs.org/index.php/goedel-prize http://www.sigact.org/prizes/gödel.html or contact the Award Committee chair, Anuj Dawar <anuj.dawar(a)cl.cam.ac.uk> -- Anuj.Dawar(a)cl.cam.ac.uk Professor of Logic and Algorithms Department of Computer Science and Technology University of Cambridge Phone: +44 1223 334408 15 J.J. Thomson Avenue Fax: +44 1223 334678 Cambridge CB3 0FD, UK. http://www.cl.cam.ac.uk/users/ad260

4 Jahre, 6 Monate

1
0
0 0

PhD position in Theoretical Computer Science at HU Berlin

von Christoph Berkholz

PhD position in Theoretical Computer Science at HU Berlin The logic and complexity group at HU Berlin lead by Prof. Dr. Christoph Berkholz is looking for a PhD candidate in theoretical computer science. * Details: https://hu.berlin/luk-vacancies * Apply by: January 23, 2020 * Starting date (expected): April 2020 The ideal candidate holds or will soon receive an excellent master's degree in computer science or mathematics and has a strong background in theoretical computer science with a specialisation in at least one research field covered by the group, for example, knowledge compilation, constraint satisfaction, finite model theory, database theory, or proof complexity. The successful applicant is expected to carry out research in the Emmy-Noether project "Representation Complexity of Enumeration and Counting Algorithms" led by Christoph Berkholz. The position is fully funded for initially 2,5 years with the possibility of extension and has no formal teaching obligations. The expected starting date is April 2020. For informal inquiries do not hesitate to contact Christoph Berkholz (berkholz(a)informatik.hu-berlin.de). Applications (in German or English) should include: - 1-2 page letter of motivation describing the interest in the position and the background in theoretical computer science - CV - bachelor's and master's degree certificate (if available at the time of application) as well as a list of taken courses with grades - a copy of the master thesis and publications (if applicable) - name and mail address of one or two references that are able and willing to provide a letter of recommendation (ideally including the master thesis advisor) To obtain full consideration, send your application material referring to Kennziffer DR/240/19 by January 23, 2020 in a single PDF file (plus additional files for thesis/publications) to Prof. Dr. Christoph Berkholz (berkholz(a)informatik.hu-berlin.de). HU is seeking to increase the proportion of women in research and teaching, and specifically encourages qualified female scholars to apply. Severely disabled applicants with equivalent qualifications will be given preferential consideration. People with an immigration background are specifically encouraged to apply. -- Prof. Dr. Christoph Berkholz Tel: +49 30 2093 3079 Fax: +49 30 2093 3081 Email: berkholz(a)informatik.hu-berlin.de Url: http://www.informatik.hu-berlin.de/~berkhoch Postanschrift / Postal address: Institut für Informatik Humboldt-Universität zu Berlin Unter den Linden 6 10099 Berlin Germany

4 Jahre, 6 Monate

1
0
0 0

CfP: NLA'20 Special Session at DCAI'20

von Roussanka Loukanova

Special Session on Natural Language and Argumentation 2020 (NLA'20) at DCAI'20 https://www.dcai-conference.net/special-sessions/nla20 at: 17th International Conference on Distributed Computing and Artificial Intelligence L'Aquila, Italy, 17-19 June 2020 https://www.dcai-conference.net Scope We are in the reality of natural and computational systems of argumentation provided by reasoning, with natural and artificial languages. Intelligent systems of argumentation target advanced methods for exchanging, saving, reasoning, accessing, and updating information in memory. The special session on Natural Language and Argumentation (NLA) covers theories and applications. Formal models of argumentation like the Dung framework assume that natural language arguments have properly been mapped to logical formulas or partial proofs. Argument mining, when mainly working with existing machine learning methods, encounters difficulties to properly analyse arguments and relations between arguments, over general data, and especially when natural language expressions involve logical constructions. On the other side, traditional methods map sentences to logical formulas, which can be available after having been handled by a theorem prover. E.g., categorial analyses yield discourse representation structures, by using a parser (like Boxer, or Grail), and theorem provers (e.g., Coq) handle corresponding logical representations. The first two approaches (the Dung framework, and typical argument mining) suffer from the lack of development of the relations between natural language texts and dialogues, and do not handle the logical structure of meanings, while the third one (the predominant, traditional logical approach) is limited by the lack of sophisticated semantic lexicon for encompassing the logical structure carried by some words, and interconnections with other methods. Topics We welcome submissions on the following topics, without limiting to them, across approaches, methods, theories, implementations, and applications, in support of argumentation: - Formal models of argumentations (e.g., Dung's framework) - Logic of preferences - Argument mining - Theorem provers and assistants - Model checkers - Theory of computation - Theory of information - Natural language inference - Beliefs, attitudes, persuasions - theories and applications - Formal languages in support of reasoning and argumentation - Algorithms related to natural language and argumentation - theories, implementations, applications - Mapping NL expressions into logical representations - Syntactic and semantic analyses of natural language - Computational methods to natural language - approaches, theories - Computational syntax, semantics, and/or interfaces between them - NLP argument mining - Ambiguity and underspecification in syntax and semantics - Discourse and context dependency - Reasoning with ambiguity and underspecification - Interactive computation, reasoning, argumentation - Computation with heterogeneous information - Reasoning with heterogeneous and/or inconsistent information - Dialog, interactions - Interdisciplinary approaches to language, computation, reasoning, memory, relevant for argumentation - Argumentation in AI applications: e.g., to business, economy, justice, health, medical sciences - ... Important Dates Paper submission deadline: 31 January, 2020 Notification of acceptance: 09 March, 2020 Camera-Ready papers due: 30 March, 2020 Conference: 17-19 June, 2020 Paper Submission https://www.dcai-conference.net/special-sessions All papers must be formatted according to the AISC, Springer, template, with a maximum length of 8 pages, including figures and references. All proposed papers must be submitted in electronic form (PDF format) using the DCAI 2020 conference management system: https://www.dcai-conference.net/submission Publication At least one of the authors will be required to register and attend the symposium to present the paper in order to include the paper in the conference proceedings. All accepted and presented papers will be published by the Advances in Intelligent Systems and Computing, AISC, Springer Verlag. Organizing Committee Stergios Chatzikyriakidis, University of Gothenburg, Sweden Emiliano Lorini, CNRS, IRIT, France Roussanka Loukanova, Stockholm University, Sweden; and, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria Richard Moot, LIRMM-CNRS, Montpellier, France Christian Retoré, Université de Montpellier and LIRMM-CNRS, Montpellier, France Contact Roussanka Loukanova (rloukanova the special symbol gmaildotcom) -------------------------------------------------------------

4 Jahre, 6 Monate

1
0
0 0

Computability in Europe 2020 THIRD CALL FOR PAPERS

von acie＠acie.eu

COMPUTABILITY IN EUROPE 2020 THIRD CALL FOR PAPERS: CiE 2020: Salerno, Italy June 29 - July 3, 2020 https://www.acie.eu/cie-conference-series/cie2020 https://www.acie.eu IMPORTANT DATES: Deadline for abstract registration: 17 January 2020 AOE (extended) Deadline for article submission: 24 January 2020 AOE (extended) Notification of acceptance: 14 March 2020 Final versions due: 7 April 2020 Deadline for informal presentations submission: 10 April 2020 (The notifications of acceptance for informal presentations will be sent a few days after submission.) Early registration before: 1 May 2020 CiE 2020 is the 16th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), and Durham (2019). TUTORIAL SPEAKERS: - Virginia Vassilevska Williams (MIT) - Martin Ziegler (Korea Advanced Institute of Science and Technology) INVITED SPEAKERS: Paolo Boldi (University of Milan) Véronique Bruyère (University of Mons) Ekatarina Fokina (Vienna University of Technology) Amaury Pouly (CNRS Paris) Antonio Restivo (University of Palermo) Damien Woods (Maynooth University) HOSTED BY: Department of Computer Science, University of Salerno SPECIAL SESSIONS: Algorithmic Learning Theory Combinatorial String Matching Computable Topology History and Philosophy of Computing Large scale Bioinformatics and Computational Sciences Modern aspects of Formal Languages CONTRIBUTED PAPERS: Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: Marcella Anselmo University of Salerno (co-chair) Veronica Becher Universidad de Buenos Aires Paola Bonizzoni University of Milano-Bicocca Laura Crosilla University of Oslo Liesbeth De Mol Université de Lille 3 Gianluca Della Vedova University of Milano-Bicocca Jérôme Durand-Lose Université d'Orléans Pawel Gawrychowski University of Wroclaw Mathieu Hoyrup LORIA Juliette Kennedy University of Helsinki Karoliina Lehtinen University of Liverpool Benedikt Loewe Universiteit van Amsterdam Florin Manea Universität Göttingen Timothy McNicholl Iowa State University Klaus Meer BTU Cottbus-Senftenberg Turlough Neary University of Zurich Daniel Paulusma Durham University Arno Pauly Swansea University (co-chair) Karin Quaas University of Leipzig Viola Schiaffonati Politecnico di Milano Markus L. Schmid Humboldt University Berlin Alexander Schoenhuth Bielefeld University Thomas Schwentick Universität Dortmund Marinella Sciortino University of Palermo Victor Selivanov Institute on Informatics Systems Mariya Soskova University of Wisconsin-Madison Peter Van Emde Boas Universiteit van Amsterdam Linda Brown Westrick Pennsylvania State University The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. THE PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) to submit original research articles in all areas related to the above for presentation at the conference and inclusion in the proceedings of CiE 2020 at https://easychair.org/conferences/?conf=cie2020. Papers must be submitted in PDF format, using the LNCS style (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…) and must have a maximum of 12 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Papers building bridges between different parts of the research community are particularly welcome. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. WOMEN IN COMPUTABILITY TRAVEL GRANTS We are very happy to announce that within the framework of the Women in Computability programme sponsored by ACM-W we are able to offer four grants of up to 250 EUR for junior female researchers who want to participate in CiE 2020. Applications for this grant should be sent to johanna.franklin(a)gmail.com, before APRIL 30, 2020 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior female researchers who are presenting a paper (including informal presentations) at CiE 2020.

4 Jahre, 6 Monate

1
0
0 0

Gandy centenary

von Anuj Dawar

ROBIN GANDY CENTENARY COLLOQUIUM Saturday 22 February 2020 There will be a one-day Colloquium at Wolfson College Oxford. This event celebrates the centenary of Robin Gandy, a leading figure in Mathematical Logic, student and close friend of Alan Turing, Oxford University Reader in Mathematical Logic and a Fellow of Wolfson College. It will be a full day meeting with an outstanding set of speakers, including four of Gandy's former students, and ranging across topics in mathematical logic, philosophy of mathematics, and computer science, as well as personal reflections and historical perspectives. Speakers Marianna Antonutti Marfori (Munich) Andrew Hodges (Oxford) Martin Hyland (Cambridge) Jeff Paris (Manchester) Göran Sundholm (Leiden) Christine Tasson (Paris) Philip Welch (Bristol) For details of the event, see the web page at https://www.wolfson.ox.ac.uk/event/gandy-colloquium-0 Registration is required. This can be done at https://www.oxforduniversitystores.co.uk/short-courses/computer-science/eve… The registration includes refreshment breaks and a buffet lunch. The event is free to Wolfson members. For others the early registration fee is £10. However, places are limited and the fee can only be kept at this level for the first 50 people who register. After this it will be increased to £30. There is also the option to register for the conference dinner. This is £35 without wine, £45 including wine. Organizing Committee: Samson Abramsky (Chair), Daniel Isaacson, Jonathan Pila, and Alex Wilkie. For enquiries, contact Karen Barnes, karen.barnes(a)cs.oc.ac.uk.

4 Jahre, 6 Monate

1
0
0 0

IJCAR 2020 - Call for Papers

von Prof. Dr. Viorica Sofronie-Stokkermans

=============================================================================== CALL FOR PAPERS IJCAR 2020 The 10th International Joint Conference on Automated Reasoning Paris, France, June 29-July 5, 2020 https://ijcar2020.org =============================================================================== IJCAR is the premier international joint conference on all topics in automated reasoning. The IJCAR 2020 technical program will consist of presentations of high-quality original research papers, short papers describing interesting work in progress, system descriptions, and invited talks. IJCAR 2020 (+ workshops, tutorials, etc.) will take place in Paris (France) from June 29 to July 5 2020. It will be co-located with the conference FSCD. IJCAR 2020 is the merger of leading events in automated reasoning: * CADE (Conference on Automated Deduction) * FroCoS (Symposium on Frontiers of Combining Systems) * ITP (International Conference on Interactive Theorem Proving) * TABLEAUX (Conference on Analytic Tableaux and Related Methods) TOPICS ====== IJCAR 2020 invites submissions related to all aspects of automated or interactive reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems or proof assistants are solicited. IJCAR topics include the following ones: * Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, type theory. * Methods of interest include: tableaux, sequent calculi, resolution, model- elimination, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, automated theorem proving, combination of decision or proof procedures, SAT and SMT solving, integration of proof assistants with automated provers and other symbolic tools, etc. * Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, education, formalization of mathematics etc. The proceedings of IJCAR 2020 will be published by Springer in the LNAI/LNCS series (www.springer.com/lncs). IMPORTANT DATES =============== * Abstract submission: January 16, 2020 * Paper submission: January 23, 2020 * Rebuttal: March 6-10, 2020 * Notification: March 20, 2020 * Final version of papers due: April 10, 2020 * IJCAR Conference + Workshops: June 29 - July 5, 2020 INVITED SPEAKERS ================ * Clark Barrett (Stanford University, USA) * John Harrison (Amazon Web Services, USA) Joint IJCAR-FSCD speaker * Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) * Ruzica Piskac (Yale University, USA) * Rene Thiemann (University of Innsbruck, Austria) Joint FSCD-IJCAR speaker SUBMISSION GUIDELINES ===================== Submission is electronic, through https://easychair.org/conferences/?conf=ijcar2020 Authors are strongly encouraged to use LaTeX and the Springer "llncs" format, which can be obtained from http://www.springer.de/comp/lncs/authors.html We solicit three categories of submissions: REGULAR PAPERS. Submissions, not exceeding fifteen (15) pages excluding bibliography, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and software available with their submission for reproducibility. In particular submissions describing formal proofs are expected to be accompanied by the source files of the formalization. The PC will take availability of software and data into account when evaluating submissions. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses and strength in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. SYSTEM DESCRIPTIONS. Submissions, not exceeding seven (7) pages excluding bibliography, should describe the implemented tool and its novel features. Submissions in this category should bear the phrase "(system description)" beneath the title. One author is expected to be able to perform a demonstration on demand to accompany a tool presentation. Papers describing tools that have already been presented in other conferences before will be accepted only if significant and clear enhancements to the tool are reported and implemented. SHORT PAPERS. Submissions, not exceeding five (5) pages excluding bibliography, and describing interesting work in progress. Such a preliminary report may consist of an extended abstract. Each of these papers should bear the phrase "(short paper)" beneath the title. Accepted submissions in this category will be presented as short talks and published in the main proceedings. There will be no downgrading from regular papers or system descriptions to short papers. All submissions should meet high academic standards; 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. BEST PAPER AWARD ================ IJCAR 2020 will recognize the most outstanding submission with a best paper award at the conference. STUDENT TRAVEL AWARDS ==================== Woody Bledsoe Travel Awards will be available to support selected students attending the conference. SPECIAL ISSUE ============= The authors of a selection of the best IJCAR 2020 papers will be invited to submit an extended version of their paper after the conference, to be published in a special issue of Logical Methods in Computer Science. ORGANIZATION ============ Conference Chair: * Kaustuv Chaudhuri (INRIA, Ecole Polytechnique) Programme Chairs: * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France), * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) Workshop, Tutorial and Competition Chairs: * Giulio Manzonetto (Université Paris-Nord, France) * Andrew Reynolds (University of Iowa, USA) Programme Committee: * Takahito Aoto (Niigata University, Japan) * Carlos Areces (FaMAF Universidad Nacional de Cordoba, Argentina) * Jeremy Avigad (Carnegie Mellon University, USA) * Franz Baader (TU Dresden, Germany) * Peter Baumgartner (Data 61 and CSIRO, Australia) * Christoph Benzmüller (Freie Universität Berlin, Germany) * Yves Bertot (INRIA, Sophia Antipolis, France) * Armin Biere (Johannes Kepler University Linz, Austria) * Nikolaj Bjorner (Microsoft Research, USA) * Jasmin Blanchette (Vrije Universiteit Amsterdam, Netherlands) * Maria Paola Bonacina (Universita degli Studi di Verona, Italy) * James Brotherston (University College London, UK) * Serenella Cerrito (IBISC, Univ. Evry, Paris Saclay University, France) * Agata Ciabattoni (Vienna University of Technology, Austria) * Koen Claessen (Chalmers University of Technology, Gothenburg, Sweden) * Leonardo de Moura (Microsoft Research, USA) * Stéphane Demri (CNRS, LSV, ENS Paris-Saclay, France) * Gilles Dowek (Inria and ENS Paris-Saclay, France) * Marcelo Finger (University of São Paulo, Brazil) * Pascal Fontaine (Universite de Lorraine, CNRS, Inria, LORIA, France) * Didier Galmiche (Universite de Lorraine - LORIA, France) * Silvio Ghilardi (Universita degli Studi di Milano, Italy) * Martin Giese (Universitetet i Oslo, Norway) * Juergen Giesl (RWTH Aachen University, Germany) * Valentin Goranko (Stockholm University, Sweden) * Rajeev Gore (The Australian National University, Australia) * Stefan Hetzl (Vienna University of Technology, Austria) * Marijn J. H. Heule (The University of Texas at Austin, USA) * Cezary Kaliszyk (University of Innsbruck, Austria) * Deepak Kapur (University of New Mexico, USA) * Laura Kovacs (Vienna University of Technology, Austria) * Andreas Lochbihler (Digital Asset (Switzerland) GmbH) * Christopher Lynch (Clarkson University, USA) * Assia Mahboubi (Inria, France) * Panagiotis Manolios (Northeastern University, USA) * Dale Miller (Inria and LIX/Ecole Polytechnique, France) * Claudia Nalon (University of Brasilia, Brazil) * Tobias Nipkow (Technical University of Munich, Germany) * Albert Oliveras (Universitat Politècnica de Catalunya, Spain) * Jens Otten (University of Oslo, Norway) * Lawrence Paulson (University of Cambridge, UK) * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France) * Frank Pfenning (Carnegie Mellon University, USA) * Andrei Popescu (Middlesex University London, UK) * Andrew Reynolds (University of Iowa, USA) * Christophe Ringeissen (LORIA-INRIA, France) * Christine Rizkallah (University of New South Wales, Australia) * Katsuhiko Sano (Hokkaido University, Japan) * Renate Schmidt (The University of Manchester, UK) * Stephan Schulz (DHBW Stuttgart, Germany) * Roberto Sebastiani (DISI, University of Trento, Italy) * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) * Matthieu Sozeau (INRIA Paris, France) * Martin Suda (Czech Technical University, Czech Republic) * Geoff Sutcliffe (University of Miami, USA) * Sofiene Tahar (Concordia University, Canada) * Cesare Tinelli (The University of Iowa, USA) * Christian Urban (King's College London, UK) * Josef Urban (Czech Technical University in Prague, Czech Republic) * Uwe Waldmann (Max Planck Institute for Informatics, Germany) * Christoph Weidenbach (Max Planck Institute for Informatics, Germany)

4 Jahre, 7 Monate

1
0
0 0

TTCS 2020 - 2nd Call for Papers

von Renato Neves

The Third IFIP International Conference on Topics in Theoretical Computer Science (TTCS 2020) http://cs.ipm.ac.ir/ttcs/2020 Institute for Research in Fundamental Sciences (IPM) Tehran, Iran, July 1-3, 2020 *** Submission Deadline: January 12, 2020 *** *** NEW - Invited Speakers *** MohammadTaghi Hajiaghayi, University of Maryland, USA (Track A) Filippo Bonchi, University of Pisa, Italy (Track B) ================================================== ------------------------------ Scope ------------------------------ TTCS is a bi-annual conference series, intending to serve as a forum for novel and high-quality research in all areas of Theoretical Computer Science. The conference is held in cooperation with the European Association for Theoretical Computer Science (EATCS). The proceedings will be published in the Springer LNCS series. TTCS is organized in 2 tracks. Topics of interest include but are not limited to: Track A: Algorithms and Complexity - algorithms and data structures, - algorithmic coding theory, - algorithmic graph theory and combinatorics, - approximation algorithms, - computational complexity, - computational geometry, - computational learning theory, - economics and algorithmic game theory, - fixed-parameter algorithms, - machine learning, - optimization, - parallel and distributed algorithms, - quantum computing, - randomness in computing, - theoretical cryptography. Track B: Logic, Semantics, and Programming Theory - algebra and coalgebra in computer science, - concurrency theory, - coordination languages, - formal verification and model-based testing, - logic in computer science, - methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems, - stochastic and probabilistic specification and reasoning, - theoretical aspects of other CS-related research areas, e.g. computational science, databases, information retrieval, and networking, - theory of programming languages, - type theory. ------------------------------ Important Dates ------------------------------ - Full Paper Submission: January 12, 2020 - Author notification: March 12, 2020 - Camera-ready paper: April 1, 2020 - Conference: July 1-3, 2020 ------------------------------ Submissions ------------------------------ Research papers are solicited in all areas of theoretical computer science. All papers will undergo a rigorous review process and will be judged based on their originality, soundness, significance of the results, and relevance to the theme of the conference. Papers should be written in English. Research papers should not exceed 15 pages in the LNCS style format. All technical details necessary for a proper evaluation of a submission must be included in the submission or in a clearly-labeled appendix, to be consulted at the discretion of program committee members. Multiple and/or concurrent submission to other scientific venues is not allowed and will result in rejection as well as notification to the other venue. Any case of plagiarism (including self-plagiarism from earlier publications) will result in rejection as well as notification to the authors' institutions. TTCS 2020 proceedings will be published by Springer, in the Lecture Notes in Computer Science series, in accordance to the contract between Springer Nature Switzerland AG and the International Federation for Information Processing (IFIP). Papers should be submitted to the appropriate track through EasyChair at https://easychair.org/conferences/?conf=ttcs2020 ------------------------------ Programme Committee ------------------------------ Track A: Algorithms and Complexity Mohammad Ali Abam, Sharif University of Technology, Iran (PC co-chair) Sepehr Assadi, Rutgers University, USA Mohammad Hossein Bateni, GoogleRresearch, USA Salman Beigy, IPM, Iran Hossein Esfandiari, Harvard University, USA Omid Etesami, IPM, Iran Marc van Kreveld, Utrecht University, Netherlands Mohammad Mahdian, Google Research, USA Mohammad Mahmoody, University of Virginia, USA Vahab Mirrokni, Google Research, USA Gunter Rote, FU Berlin, Germany Mohammadreza Salavatipour, University of Alberta, Canada Masoud Seddighin, IPM, Iran Saeed Seddighin, Harvard University, USA Michiel Smid, Carleton Univesity, Canada Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran Track B: Logic, Semantics, and Programming Theory Farhad Arbab, CWI, The Netherlands Kyungmin Bae, Pohang University of Science and Technology, South Korea Christel Baier, Technische Universitat Dresden, Germany Luis S. Barbosa, University of Minho, Portugal (PC co-chair) Mario Benevides, Universidade Federal do Rio de Janeiro, Brazil Simon Bliduze, INRIA Lille, France Filippo Bonchi, University of Pisa, Italy Marcello Bonsangue, University of Leiden, The Netherlands Flavio Corradini University of Camerino, Italy Fredrik Dahlqvist, UCL, UK Sergey Goncharov, FAU Erlangen-Nurnberg, Germany Hossein Hojjat, Rochester Institute of Technology, USA Mohammad Izadi, Sharif University of Technology, Iran Sung-Shik Jongmans, Open University, The Netherlands Alexander Knapp, University of Augsburg, Germany Jan Kretinsky, Munich University of Technology, Germany Alexandre Madeira, University of Aveiro, Portugal Stefan Mitsch, Carnegie Mellon University, USA Mohammad Reza Mousavi, University of Leicester, UK Renato Neves, INESC TEC, Portugal Peter Olveczky, University of Oslo, Norway Prakash Panangaden, McGill University, Canada Elaine Pimentel, UFRN, Brazil Subodh Sharma, IIT Delhi, India Pawel Sobocinski, Taltech, Estonia Ana Sokolova, University of Salzburg, Austria Carolyn Talcott, Stanford University, USA Benoit Valiron, LRI, France Naijun Zhan, Chinese Academy of Science, China Link to the online cfp: https://easychair.org/cfp/TTCS2020

4 Jahre, 7 Monate

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory