März 2022 - finite-model-theory - lists.rwth-aachen.de

von Johann Makowsky

******************************************************************* LogTeach-22: Why and how to tech Logic for CS undergraduates? ******************************************************************* =============== Call for papers =============== https://easychair.org/cfp/LogTeach-22 LogTeach-22: LICS 2022 Workshop (July 31 and August 1, 2022, Haifa) Why and how to tech Logic for CS undergraduates? Scientific justification ------------------------- Logic is one of the pillars of the foundation of Computer Science, together with Algorithmic Mathematics, Information Theory, and Electronics. Consequently various versions of Logic courses used to be part of the undergraduate syllabus of Computer Science. However, as witnessed by the variety of conferences related to Logic present at the FLoC event, the emphasis has moved from the foundation to applications of Logic in Computer Science. Each of these conferences deal with topics suitable for advanced undergraduate and graduate courses, which require some Logic based prerequisite. On the other hand, Logic courses in the undergraduate syllabus have been forced to make place for courses deemed more suitable for the education of future specialists and practitioners working in IT. Many of the top Universities worldwide have dropped foundational Logic courses for undergraduates for more practical oriented courses, turning undergraduate CS programs into programs more suitable for what used to be vocational colleges and professional schools. Time has come to critically reflect upon and reevaluate the role of Logic in the undergraduate syllabus. It seems clear that the classical Logic in CS courses have no place there anymore. They seem to teach and emphasize the wrong narrative of logic as taught by tradition. However, it seems also clear that eliminating Logic courses all together is counter productive. The purpose of the workshop is the prepare a proposal for a logic course Logic-2020 which is useful and acceptable for University undergraduates in CS, and which can serve as a prerequisite for the many diverse branches of applied logic. "Logic may be not very useful, if you know it, but very harmful, if you ignore it" (Georg Kreisel) Invited speakers ---------------- * Moshe Vardi (Rice University, Houston TX, USA) * TBC Organisation ------------- The purpose of the workshop is to prepare a joint position paper to be published possibly in the Communications of ACM, or a similar prominent place, with recommendations for the future of teaching Logic for undergraduate CS-students. We plan to have presentations of position papers (30 minutes, including discussion) and invited lectures (60 minutes including discussion), followed by a two hour panel discussion. Workshop organizers and Program Committee ------------------------------------------ J.A. Makowsky (Technion, Haifa, Israel) E.V. Ravve (ORT Braude, Karmiel, Israel) S.N. Artemov (CUNY, New York, USA) S. Szeider (Technical University, Vienna, Austria) Dates and Location ------------------ FLOC is planned to be a conference with physical presence (possibly hybrid) in Haifa. The final decision on this will be made by May 1, 2022. * Deadline for abstract submission of papers: 10. May, 2022 * Deadline for submission of papers: 20. May, 2022 * Notification of acceptance: 15. June, 2022 * Submission link https://easychair.org/conferences/?conf=logteach22 For further information and questions contact: Prof. emeritus J.A. Makowsky Faculty of Computer Science Technion - Israel Institute of Technology Haifa 32000 http://www.cs.technion.ac.il/~janos

1 Jahr, 11 Monate

1
2
0 0

FLoC 2022 Mentoring Workshop: Call for Scholarship Applications — deadline on April 11th

von Sammartino, Matteo

FLoC 2022 Mentoring Workshop (FLoC'22 MW) https://www.floc2022.org/flocmentoringworkshop 1 August 2022 and 5 August 2022 Haifa, Israel We warmly invite students to apply for travel scholarships to attend the Mentoring Workshop and FLoC. The deadline for applications is April 11th. Applications are received via the form at https://forms.gle/QxWmYcvQCPgXRxEq6 ABOUT THE MENTORING WORKSHOP The purpose of the FLoC 2022 Mentoring Workshop (FLoC'22 MW) is to provide mentoring and career advice to early-stage graduate students, to attract them to pursue research careers in various logic-related areas. The workshop will particularly encourage participation of women and under-represented minorities. There will be two workshop days, one for each FLoC Conference Block, so the students can choose which one of the two they prefer to attend. The workshop program will include a number of talks and interactive sessions. The talks will give an overview of the field along with brief introductions to the varied topics highlighted at FLoC. Other talks will provide mentoring and career advice, from academia and industry. CONFIRMED SPEAKERS Mentoring Workshop for FLoC Conference Block 1 (Friday, August 5th, 2022) TBA (check the website for updates!) Mentoring Workshop for FLoC Conference Block 2 (Friday, August 5th, 2022) * Rajeev Alur, University of Pennsylvania, USA * Kristin Rozier, Iowa State University, USA * Natarajan Shankar, SRI, USA * Alexandra Silva, Cornell University, USA CONTACT In case of questions, please contact the Mentoring Workshop co-chairs: Sandra Kiefer <kiefer(a)informatik.rwth-aachen.de> Marijana Lazić <lazic(a)in.tum.de> Caterina Urban <caterina.urban(a)inria.fr<mailto:caterina.urban@inria.fr>> ============================== Matteo Sammartino, Lecturer Royal Holloway University of London Department of Computer Science Tel.: (+44) (0) 1784 44 3690 Office: 2-07, Bedford Building https://matteosammartino.com/ This email, its contents and any attachments are intended solely for the addressee and may contain confidential information. In certain circumstances, it may also be subject to legal privilege. Any unauthorised use, disclosure, or copying is not permitted. If you have received this email in error, please notify us and immediately and permanently delete it. Any views or opinions expressed in personal emails are solely those of the author and do not necessarily represent those of Royal Holloway, University of London. It is your responsibility to ensure that this email and any attachments are virus free.

2 Jahre

1
1
0 0

Summer School on Data and Knowledge (Bordeaux, France)

von Diego Figueira

Please find below a school announcement, with an excellent programme of internationally-renowned speakers. The school is not only open to students but also to post-docs and established researchers. The application deadline is in one week. ************************************************************************************************** CALL FOR APPLICATIONS Joint EDBT-INTENDED School on Data and Knowledge July 4th-9th, 2022 Bordeaux, France https://edbtschool22.labri.fr/ *************************************************************************************************** APPLICATION DEADLINE: April 3rd, 2022 SOME STUDENT GRANTS AVAILABLE *************************************************************************************************** The EDBT association and INTENDED AI Chair are happy to announce a jointly sponsored Summer School on Data and Knowledge, which will be hosted in Bordeaux, France, from Monday July 4 to Saturday July 9, 2022. The school will cover a diverse range of topics around foundational database theory and the use of knowledge (constraints, ontologies) in data management, with a special focus on inconsistent, incomplete and more generally "imperfect" data. We invite students, postdocs, and other researchers interested in learning about the foundational aspects of databases and handling imperfect data to participate in the summer school. Application and registration details can be found on the school website: https://edbtschool22.labri.fr/ PROGRAM The summer school will feature 11 tutorials from internationally renowned researchers: * Reasoning with Constraints Andreas Pieris, University of Edinburgh, UK; University of Cyprus, Cyprus * Foundations of Graph Databases Pablo Barceló, Universidad Católica de Chile, Chile * Provenance Val Tannen, University of Pennsylvania, USA * Enumeration Nicole Schweikardt, Humboldt-University Berlin, Germany * Probabilistic Databases Antoine Amarilli, Télécom Paris, France * Consistent Query Answering Jef Wijsen, University of Mons, Belgium * Quantitative Reasoning about Constraint Violations Benny Kimelfeld, Technion, Israel * Ontology-Mediated Query Answering Carsten Lutz, University of Bremen, Germany * Ontology-Based Data Access Made Practical Diego Calvanese, Free University of Bozen-Bolzano, Italy; Ontopic s.r.l., Italy; Umeå University, Sweden * Computational Fact Checking Paolo Papotti, EURECOM, France * Data Quality Floris Geerts, University of Antwerp, Belgium The school will also feature several social events to encourage discussions between participants and lecturers. IMPORTANT DATES Deadline for application: April 3, 2022 Notification of acceptance: April 15, 2022 Deadline for registration: May 22, 2022 EDBT Summer School: July 4–9, 2022 ORGANIZATION Meghyn Bienvenu, CNRS & University of Bordeaux, France Diego Figueira, CNRS & University of Bordeaux, France If you have any questions, please contact us at: edbtschool2022(a)easychair.org

2 Jahre

1
0
0 0

LAMAS & SR 2022 - 1st Call for Contributions

von Fabio Mogavero

[Apologies for multiple cross-posting] -------------------------------------------------------------------------------- 1st Call for Contributions 2nd International Workshop on Logical Aspects in Multi-Agent Systems and Strategic Reasoning (LAMAS&SR) 2022 25-26 August 2022, Rennes, France URL: https://lamassr.github.io/ -------------------------------------------------------------------------------- Objectives ---------- Logics and strategic reasoning play a central role in multi-agent systems. Logics can be used, for instance, to express the agents’ abilities, knowledge, and objectives. Strategic reasoning refers to algorithmic methods that allow for developing good behaviour for the agents of the system. At the intersection, we find logics that can express existence of strategies or equilibria, and can be used to reason about them. The LAMAS&SR workshop merges two international workshops: LAMAS (Logical Aspects of Multi-Agent Systems), which focuses on all kinds of logical aspects of multi-agent systems from the perspectives of artificial intelligence, computer science, and game theory, and SR (Strategic Reasoning), devoted to all aspects of strategic reasoning in formal methods and artificial intelligence. List of Topics -------------- The topics covered by the workshop include, but are not limited to: * Logical systems for specification, analysis, and reasoning about multi-agent systems * Logic-based modelling of multi-agent systems * Dynamical multi-agent systems * Deductive systems and decision procedures for logics for multi-agent systems * Development and implementation of methods for verification in multi-agent systems * Logic-based tools for multi-agent systems * Logics for reasoning about strategic abilities * Logics for multi-agent mechanism design, verification, and synthesis * Logical foundations of decision theory for multi-agent systems * Strategic reasoning in formal verification * Automata theory for strategy synthesis * Applications and tools for cooperative and adversarial reasoning * Robust planning and optimisation in multi-agent systems * Risk and uncertainty in multi-agent systems * Quantitative aspects in strategic reasoning Invited Speakers ---------------- * Rineke Verbrugge, University of Groningen Co-Located Event ---------------- LAMAS&SR 2022 will be an event co-located with the 14th International Conference on Advances In Modal Logic (AiML 2022, 22-25 August). About COVID-19 -------------- Local organizers are following closely the evolution of the pandemic situation. Our preference is for a full in-person event, but we will employ an online or hybrid format according to the situation. Important Dates --------------- * Paper submission: May 23 (AoE) * Author notification: June 30 (AoE) * Camera ready: July 15 (AoE) * Workshop: August 25-26, 2022 Contribution Submission ----------------------- Authors are invited to submit extended abstracts of 2 pages, plus 1 page for references only, in the AAMAS 2022 format. Both published and unpublished works are welcome. Submissions are subject to a single-blind review process, thus, submissions should not be anonymous, must be in PDF format, and will be handled via EasyChair at https://easychair.org/conferences/?conf=lamassr22 Although there will be no formal proceedings, accepted extended abstracts will be made available on the workshop website. Extensions of selected original contributions will be then invited to a special issue of Games, an MDPI open-access journal, with a special arrangement. Program Co-Chairs ----------------- * Fabio Mogavero, Università di Napoli Federico II * Sophie Pinchinat, Université de Rennes 1 Program Committee ----------------- * Thomas Agotnes, University of Bergen * Natasha Alechina, Utrecht University * Guy Avni, University of Haifa * Massimo Benerecetti, University of Naples Federico II * Hans van Ditmarsch, Open University of Netherlands * Valentin Goranko, Stockholm University * Wojtek Jamroga, University of Luxembourg and Polish Academy of Sciences * Dario Della Monica, University of Udine * Emiliano Lorini, Université Paul Sabatier * Nicolas Markey, Université de Rennes 1 * Bastien Maubert, University of Naples Federico II * John-Jules C. Meyer, Utrecht University * Aniello Murano, University of Naples Federico II * Rohit J. Parikh, City University of New York * Sasha Rubin, The University of Sydney, Australia * Marija Slavkovik, University of Bergen * Yanjing Wang, Peking University Organising Committee -------------------- * Sophie Pinchinat, Université de Rennes 1 * Dylan Bellier, Université de Rennes 1 * Pierre Le Scornet, Université de Rennes 1 * Sophie Maupile, Université de Rennes 1 * Alexandre Terefenko, Université de Rennes 1 * Fabio Mogavero, Università di Napoli Federico II

2 Jahre

1
0
0 0

Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop, last

von Tobias Kappé

Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://learnaut22.github.io Deadline: Extended to April 7th Submission portal: https://easychair.org/conferences/?conf=learnaut2022 Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually). Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop). Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata or any other models from language theory and deep learning models for sequential data. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Jeffrey Heinz (Stony Brook University) Sheila McIlraith (University of Toronto) Ariadna Quattoni (Universitat Politècnica de Catalunya) ** Submission instructions ** Submissions in the form of anonymized extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://ctan.org/tex-archive/macros/latex/contrib/jmlr We do accept submissions of work recently published or currently under review. - Submission url: https://easychair.org/conferences/?conf=learnaut2022 - Submission deadline: April 7th - Notification of acceptance: May 5th - Early registration: TBD ** Program Committee ** - Dana Angluin (Yale University) - Leonor Becerra-Bonache (Jean Monnet University, Saint-Étienne) - Jorge Castro (Universitat Politècnica de Catalunya) - Dana Fisman (Ben-Gurion University) - Matthias Gallé (Naver Labs Europe) - Gerco van Heerdt (University College London) - Colin de la Higuera (University of Nantes) - Falk Howar (TU Dortmund) - Nils Jansen (Radboud University) - Joshua Moerman (Open University of the Netherlands) - Ariadna Quattoni (Universitat Politècnica de Catalunya) - Bernhard Steffen (TU Dortmund) - Henning Urbat (Friedrich-Alexander University Erlangen-Nürnberg) - Frits Vaandrager (Radboud University) - Ryo Yoshinaka (Tohoku University) ** Organizers ** Rémi Eyraud (Jean Monnet University, Saint-Étienne) Tobias Kappé (ILLC, University of Amsterdam) Guillaume Rabusseau (Mila & DIRO, Université de Montréal) Matteo Sammartino (Royal Holloway, University of London & University College London)

2 Jahre

1
0
0 0

April 5-6, 2022: Guarded Fragments: Current Trends and Applications (GF@25)

von Balder ten Cate

Guarded Fragments: Current Trends and Applications (GF@25) April 5-6, 2022, Fully Online Webpage: https://events.illc.uva.nl/GF25/ The Guarded Fragment (GF) was introduced in 1996 by Hajnal Andreka, Johan van Benthem and Istvan Nemeti, as a decidable fragment of first-order logic that aims to explain the attractive algorithmic and model theoretic behavior of modal logic. It subsequently gave rise to a larger family of decidable guarded fragments of first-order logic and second-order logic. These guarded fragments are, up to today, still actively studied and used in various application domains across different areas of computer science and artificial intelligence (e.g., data management, knowledge representation). This workshop is a celebration of the 25th anniversary of GF. It will showcase recent results, bringing together different strands of research, and offering an opportunity for reflection. The workshop is fully online, with a program consisting of 7 invited lectures, spread out across two days.

2 Jahre

1
0
0 0

Call for papers: QBF '22

von HUBERT MING CHEN

CALL FOR PAPERS QBF 2022 -------- International Workshop on Quantified Boolean Formulas and Beyond August 1, 2022 To be held in hybrid format (virtually + in-person). https://www.ac.tuwien.ac.at/qbf2022/ Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2022), August 2-5, 2022. ------------------------------------------------------------- Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. The decision problem of QBF is PSPACE-complete, compared to the NP-completeness of the decision problem of propositional logic (SAT). Many problems from application domains such as model checking, formal verification or synthesis are PSPACE-complete, and hence could be encoded in QBF in a natural way. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not yet widely applied to practical problems in academic or industrial settings. For example, the extraction and validation of models of (un)satisfiability of QBFs has turned out to be challenging, given that state-of-the-art solvers implement different solving paradigms. The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges. The workshop also welcomes work on reasoning with quantifiers in related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP), and satisfiability modulo theories (SMT) with quantifiers. =============== IMPORTANT DATES =============== May 1: Submission June 5: Notification of acceptance June 19: Final versions of accepted papers due August 1: Workshop Please see the workshop webpage for any updates: https://www.ac.tuwien.ac.at/qbf2022/ ====================== CALL FOR CONTRIBUTIONS ====================== The workshop is concerned with all aspects of current research on all formalisms enriched by quantifiers, and in particular QBF. The topics of interest include (but are not limited to): Applications, encodings and benchmarks with quantifiers QBF Proof theory and complexity results Experimental evaluations of solvers or related tools Case studies illustrating the power of quantifiers Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc. Formats of proofs and certificates Implementations of proof checkers and verifiers Decision procedures Calculi and their relationships Data structures, implementation details and heuristics Pre- and inprocessing techniques Structural reasoning ========== SUBMISSION ========== Submissions of extended abstracts are invited and will be managed via Easychair: https://easychair.org/conferences/?conf=qbf2022 In particular, we invite the submission of extended abstracts on work that has been published already, novel unpublished work, or work in progress. The following forms of submissions are solicited: - Proposals for short tutorial presentations on topics related to the workshop. Tutorial proposals will be reviewed by the PC. The number of accepted tutorials depends on the overall number of accepted papers and talks, with the aim to set up a balanced workshop program. - Talk abstracts reporting on already published work. Such an abstract should include an outline of the planned talk, and pointers to relevant bibliography. - Talk proposals presenting work that is unpublished or in progress. - Submissions which describe novel applications of QBF or related formalisms in various domains are particularly welcome. Additionally, this call comprises known applications which have been shown to be hard for QBF solvers in the past as well as new applications for which present QBF solvers might lack certain features still to be identified. Each submission should have an overall length of 1-4 pages in LNCS format. Authors may decide to include an appendix with additional material. Appendices will be considered at the reviewers' discretion. The accepted extended abstracts will be published on the workshop webpage. The workshop does not have formal proceedings. Authors of accepted contributions are expected to give a talk at the workshop. ======= CONTACT ======= qbf2022(a)easychair.org ================= PROGRAM COMMITTEE ================= Hubie Chen, Birkbeck, University of London Florian Lonsing, Stanford University Martina Seidl, JKU Linz Friedrich Slivovsky, TU Wien

2 Jahre, 1 Monat

1
0
0 0

Permanent positions at University of Birmingham

von Anupam das

Dear colleagues, The University of Birmingham is seeking to make several tenured appointments at the moment: * Assistant or Associate Professor (deadline 3 April). https://bham.taleo.net/careersection/external/jobdetail.ftl?job=220000E3&tz… * Professor (deadline 25 March). https://bham.taleo.net/careersection/external/jobdetail.ftl?job=220000G4&tz… These posts are not associated to any particular research area, but the School has an outstanding tradition in Theoretical Computer Science: https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-c… If you are interested in applying please feel free to contact one of us for informal discussions: https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-c… Best, Anupam

2 Jahre, 1 Monat

1
0
0 0

Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022)

von RADU IOSIF

Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://asl-workshop.github.io/asl22/ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields in computing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 10, 2022 (AoE) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Charguéraud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel Méry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Meta, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany)

2 Jahre, 1 Monat

1
0
0 0

FSCD 2024: Call for Location

von carsten＠dcs.bbk.ac.uk

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2024 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 9th FSCD International Conference to be held during the summer of 2024. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020; FSCD 2021 in Buenos Aires (Argentina); FSCD 2022 in Haifa (Israel) as part of FLOC2022; FSCD 2023 in Rome (Italy). The deadline for proposals is *** 27th June 2022 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information below). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2022 taking place at Haifa in August 2022. The final decision about hosting and organising of FSCD 2024 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: * FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. * National, regional, and local government and industry support, both organizational and financial. * Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. * Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. * Estimated costs on registration for the conference and workshops, both for regular and student participants. * Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: = number, capacity and audiovisual equipment of meeting rooms; = a large plenary session room that can hold all the registrants; = enough rooms for parallel session workshops/tutorials in the two days before and the two days after the main conference; = internet connectivity and workstations for demos/competitions; = catering services; = presence of professional staff. * Support for hybrid attendance to the conference. * Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. * Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Herman Geuvers herman(a)cs.ru.nl FSCD SC Chair

2 Jahre, 1 Monat

1
0
0 0