The Centre for Logic and Philosophy of Science (CLPS) of the Vrije Universiteit Brussel (VUB) will host its Third Masterclass in the Philosophy of Mathematical Practice on June, 1-3 with Valeria Giardino (CNRS, Institut Jean Nicod, Paris).

We intend the Masterclass to be a fully interactive event, with the twofold objective to understand in depth the materials presented in the lectures, and to provide early career researchers (PhD students and Postdocs) with an opportunity to discuss their ongoing work in a helpful and constructive environment. The lectures by Valeria Giardino will take place in the mornings, and will be followed by afternoon sessions with presentations by early career researchers in the Philosophy of Mathematical Practice. The exact titles of the lectures will be communicated at a later stage.

MOVEP is a five-day summer school on modelling and verification of infinite state systems. It aims to bring together researchers and students working in the fields of control and verification of concurrent and reactive systems.

MOVEP 2022 will consist of ten invited tutorials. In addition, there will be special sessions that allow PhD students to present their on-going research (each talk will last around 20 minutes). Extended abstracts (1-2 pages) of these presentations will be published in informal proceedings.

The organisation committee is closely monitoring the COVID situation. Currently, we are planning for an in-person school in Aalborg with the possibility for remote participation for those that cannot attend in person. Should it become necessary, the school will be held virtually.

The problem of explaining why a consequence does or does not follow from a given set of axioms has been considered for full first-order theorem proving since at least 40 years, but there usually with mathematicians as users in mind. In knowledge representation and reasoning, efforts in this direction are more recent, and were usually restricted to sub-areas of KR such as AI planning and description logics. The purpose of this workshop is to bring together researchers from different sub-areas of KR and automated deduction that are working on explainability in their respective fields, with the goal of exchanging experiences and approaches. The workshop will be co-located with KR 2022 at FLoC 2022.

Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and computational languages, supporting tool development and reasoning. The LSFA series' objective is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side.

LSFA topics of interest include, but are not limited to: * Automated deduction * Applications of logical and semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory.

Organized by the inter-university Dutch Categories And Types Seminar, this workshop features talks by John Bourke (Masaryk University, Brno), Wijnand van Woerkom (Utrecht University), Nicola Gambino (University of Leeds), Benno van den Berg (University of Amsterdam) and Paige North (University of Pennsylvania).

UNIF 2022 is the 36th in a series of annual workshops on unification and related topics. Unification is concerned with the problem of identifying given (first- or higher-order) terms, either syntactically or modulo a theory. It is a fundamental technique that is employed in various areas of Computer Science and Mathematics. In particular, unification algorithms are key components in completion of term rewriting systems, resolution-based theorem proving, and logic programming. But unification is, for example, also investigated in the context of natural language processing, program analysis, types, modal logics, and in knowledge representation.

Just as its predecessors', the purpose of UNIF 2022 is to bring together researchers interested in unification theory and its applications, as well as closely related topics, such as matching (i.e., one-ided unification), anti-unification (i.e., the dual problem to unification), disunification (i.e., solving equations and inequations) and the admissibility problem (which generalizes unification in modal logics). It is a forum for presenting recent (even unfinished) work, and discuss new ideas and trends in this and related fields. UNIF 2022 is associated with IJCAR 2022 part of the Federated Logic Conference 2022.

The International conference MCU series traces its roots back to the mid 90's, and has always been concerned with gaining a deeper understanding of computation and universality through the study of models of general purpose computation.  The 9th edition of MCU will take place at the University of Debrecen in Hungary, it is co-located with DCFS 2022 and NCMA 2022. As long as travel conditions and the situation concerning the current humanitarian crisis in the neighboring Ukraine allow, the conference is planned to be on-site. If necessary, the possibility of both, in-person and online participation will be provided.

The scope of the conference topics includes, but is not limited to, computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models...) and analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing...) and the meaning and implantation of universality in these contexts. Particular emphasis is given towards search for frontiers between decidability and undecidability in the various models, search for the simplest universal models, computational complexity of predicting the evolution of computations in the various models. Parallel computing models and their connections to decidability, complexity and universality.

Computer Theorem Proving is becoming a paradigm as well as a technological base for a new generation of educational software in science, technology, engineering and mathematics. The workshop brings together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems.

ThEdu'22 will be a satellite workshop of FLoC 2022. Invited Speakers: Thierry Dana-Picard, Yoni Zohar.

Applied category theory is important to a growing community of researchers who study computer science, logic, type theory, engineering, physics, biology, chemistry, social science, linguistics and other subjects using category-theoretic tools. The background and experience of our members is as varied as the systems being studied. The goal of the Applied Category Theory conference series is to bring researchers together, strengthen the applied category theory community, disseminate the latest results, and facilitate further development of the field.

The conference will be fully hybrid, that is, it will be possible for both the audience and presenters to participate remotely over Zoom, if preferred.

The conference will be held in hybrid form at IHPST, UMR 8590, Université Paris 1 Panthéon-Sorbonne, 2nd floor of 13, rue du Four 75006 Paris, France. The participation is open to anyone who is interested and a registration is required both for those who plan to attend in person and for those who plan to attend by Zoom.

The conference is organized in the context of the project 'Insights from Bolzano'. The three main aims of the project are: to elaborate a general account of grounding in the conceptual sciences, based on Bolzano's insights; to unify the debate on grounding and mathematical explanation; to unify the debate on grounding and causation.

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems.

CiE 2022 is the 18th 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.

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. CiE 2022 is planned as an on-site conference with online elements.

WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers.

It is planned to have a special session with the exhibition of a one-hour documentary film "Taking the Long View: The Life of Shiing-shen Chern" (George Scisery, 2011) about a remarkable mathematician who is considered a father of modern differential geometry.

This workshop aims to bring together researchers working in all aspects of machine ethics and explainability, including theoretical work, system implementations, and applications. The co-location of this workshop with ICLP is intended also to encourage more collaboration with researchers from different fields of logic programming.This workshop provides a forum to facilitate discussions regarding these topics and a productive exchange of ideas.

Topics of interest include (but not limited to):
 - New approaches to programming machine ethics;
 - New approaches to explainability of blackbox models;
 - Evaluation and comparison of existing approaches;
 - Approaches to verification of ethical behavior;
 - Logic programming applications in machine ethics;
 - Integrating logic programing with methods for machine ethics;
 - Integrating logic programing with methods for explainability.

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.

ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers: Philippa Gardner (Imperial College London) and Ralf Jung (MIT CSAIL).

Starting from Craig's interpolation theorem for first-order logic, the existence and computation of interpolants became an active research area, with applications in different fields, notably in verification, databases, and knowledge representation. There are challenging theoretical and practical questions, for model-theoretic as well as proof-theoretic approaches. The workshop aims at bringing together researchers working on interpolation and its various applications, based on different approaches, increasing the awareness of the automated reasoning community for challenging open problems related to interpolation.

iPRA 2022 is a workshop at the Federated Logic Conference (FLoC) 2022. The workshop will include invited talks, invited tutorials (speakers to be announced), and contributed talks.

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P? Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT/QBF solving.

The workshop will be part of FLoC and will be affiliated with the conference SAT'22.

The conference will be held in hybrid form at IHPST, UMR 8590, Université Paris 1 Panthéon-Sorbonne, 2nd floor of 13, rue du Four 75006 Paris, France. The participation is open to anyone who is interested and a registration is required both for those who plan to attend in person and for those who plan to attend by Zoom.

The conference is organized in the context of the project 'Insights from Bolzano'. The three main aims of the project are: to elaborate a general account of grounding in the conceptual sciences, based on Bolzano's insights; to unify the debate on grounding and mathematical explanation; to unify the debate on grounding and causation.

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems.

The conference will be held in hybrid form at IHPST, UMR 8590, Université Paris 1 Panthéon-Sorbonne, 2nd floor of 13, rue du Four 75006 Paris, France. The participation is open to anyone who is interested and a registration is required both for those who plan to attend in person and for those who plan to attend by Zoom.

The conference is organized in the context of the project 'Insights from Bolzano'. The three main aims of the project are: to elaborate a general account of grounding in the conceptual sciences, based on Bolzano's insights; to unify the debate on grounding and mathematical explanation; to unify the debate on grounding and causation.

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems.

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems.

Inductive reasoning is one of the most important reasoning techniques for humans and formalises the intuitive notion of 'reasoning from experience;. It has thus influenced both theoretical work on the formalisation of rational models of thought in Philosophy as well as practical applications in the areas of Artificial Intelligence and, in particular, Machine Learning. The First International Conference on Foundations, Applications, and Theory of Inductive Logic (FATIL2022) aims at bringing together experts from all fields concerned with inductive reasoning.

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems.

PhDs in Logic is an annual graduate conference organized by graduate students. This interdisciplinary conference welcomes contributions to various topics in mathematical logic, philosophical logic, logic in computer science and in linguistics. It usually involves tutorials by established researchers as well as short presentations by PhD students, master students and first-year postdocs on their research.

Registration deadline: 20/07/2022 (If you need a child-care, please let us know by email/contact-form within June 20th 2022).

SMT 2022 is the 20th International Workshop on Satisfiability Modulo Theories. It is affiliated with IJCAR 2022, part of FLoC2022, and will be held on August 11th-12th, 2022, in Haifa, Israel.

The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to: * Decision procedures and theories of interest * Combinations of decision procedures * Novel implementation techniques * Benchmarks and evaluation methodologies * Applications and case studies * Theoretical results.

The VardiFest titled "On the Not So Unusual Effectiveness of Logic" is a FLoC-22  workshop in honor of Moshe Vardi and is intended to celebrate Moshe Vardi's pioneering contributions that has enhanced logic's centrality in Computer science.

The workshop will be organized ala Highlights conference style: i.e., composed of short talks and invited talks.

The Australasian Association for Logic will hold its annual conference online via Zoom from Wednesday, June 22 to Friday, June 24, 2022. There will be three one-hour tutorials on different logic-related topics. The speakers will be Julian Gutierrez (Monash University), and two more experts (TBA). Session times will be 40 minutes. The scheduling is done according to Brisbane/Sydney/Canberra local time (AEST, UTC+10).

This workshop focuses on end-to-end implementations of vector-based compositional architectures. This means not only the elementary word embeddings are obtained from data, but also the categories/types and their internal composition so that neural methods can then be applied to learn how the structure of syntactic derivations can be systematically mapped to operations on the data-driven word representations. For this last step, the workshop invites approaches that do not require the semantic operations to be linear maps since restricting the meaning algebra to finite dimensional vector spaces and linear maps means that vital information encoded in syntactic derivations may be lost in translation.

On the evaluation side, we welcome work on modern NLP tasks for evaluating sentence embeddings such as Natural Language Inference, sentence-level classification, and sentence disambiguation tasks. Special interest goes out to work that uses compositionality to investigate the syntactic sensitivity of large-scale language models.

The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress.

The 32nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2022) will be held as a hybrid (blended) meeting, both in-person (at the Ivane Javakhishvili Tbilisi State University -TSU- in Tbilisi, Georgia) and virtual. LOPSTR 2022 will be co-located with PPDP 2022 as part of the Computational Logic Autumn Summit 2022.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

On May 17th and 18th, we will have the pleasure of hosting the final workshop of the ERC Cognitive Semantics project. We will have a great lineup of speakers presenting recent advances in semantics and cognition. The day before the workshop, on May 16th, Sonia Ramotowska will defend her thesis "Quantifying quantifier representations: Experimental studies, computational modeling, and individual differences". And the day after the workshop, on May 19th, we will host a half-day satellite meeting on Reasoning & Neural Networks.

Dynamic logic (DL), a generalisation of the logic of Floyd-Hoare introduced in the 70s by Pratt, is a well-known and particularly powerful way of combining propositions, for capturing static properties of program states, and structured actions, responsible for transitions from a state to another (and typically combined through a Kleene algebra to express sequential, non-deterministic, iterative behaviour of systems), into a formal framework to reason about, and verify, classic imperative programs. Over time Dynamic logic grew to encompass a family of logics increasingly popular in the verification of computational systems, and able to evolve and adapt to new, and complex validation challenges.

Dynamic logic is not only theoretically relevant, but it also shows enormous practical potential and it is indeed a topic of interest in several scientific venues, from wide-scope software engineering conferences to modal logic specific events. That being said, DaLí is the only event exclusively dedicated to this topic. It is our aim to once again bring together in a single place the heterogeneous community of colleagues which share an interest in Dynamic logic - from Academia to Industry, from Mathematics to Computer Science, - to promote their works, to foster great discussions and new collaborations.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

On May 17th and 18th, we will have the pleasure of hosting the final workshop of the ERC Cognitive Semantics project. We will have a great lineup of speakers presenting recent advances in semantics and cognition. The day before the workshop, on May 16th, Sonia Ramotowska will defend her thesis "Quantifying quantifier representations: Experimental studies, computational modeling, and individual differences". And the day after the workshop, on May 19th, we will host a half-day satellite meeting on Reasoning & Neural Networks.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

Answer set programming is a successful extension of logic programming for solving combinatorial problems as well as knowledge representation and reasoning problems. Most current implementations of ASP work by grounding a program and using a SAT solver-like technology to find the answer sets. While this approach is extremely efficient, relying on grounding of the program leads to significant blow-up of the program size, and computing the whole model makes finding justification of an atom in the model hard. This limits the applicability of ASP to problems dealing with large knowledge bases. Goal-directed or query-driven execution strategies have been proposed that do not require grounding. The goal of this workshop is to foster discussion around challenges and opportunities that such approaches present.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

The Department of Mathematics and Statistics, Indian Institute of Technology Kanpur (IITK) is pleased to organize the 9th Indian School on Logic and its Applications (Part-I) in virtual mode.

The school will focus on Stone-type dualities and categorical syntax-semantics dualities. The school is open to participants interested in mathematics, computer science, philosophy, linguistics and other areas from around the world.

The categoricity of an axiom system means that its non-logical symbols have, up to isomorphism, only one possible interpretation. The first axiomatizations of mathematical theories such as number theory and analysis by Dedekind, Hilbert, Huntington, Peano and Veblen were indeed categorical. These were all second order axiomatisations, suffering from what many consider a weakness, namely dependence on a strong metatheory, casting a shadow over these celebrated categoricity results. In finer analysis a new form of categoricity has emerged. It is called internal categoricity because it is perfectly meaningful without any reference to a metatheory, and it is now known that the classical theories, surprisingly even in their first order formulation, can be shown to be internally categorical.

In this workshop various aspects of and approaches to internal categoricity are presented and the following questions, among others, are discussed: What is the philosophical import/advantage of internal categoricity over ordinary categoricity? Is internal categoricity the right concept of categoricity? Does internal categoricity play a role also in first order theories?

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

Sophisticated causal reasoning has long been prevalent in human society and continues to have an undeniable impact on the advancement of science, technology, medicine, and other significant fields. From the development of ancient tools to modern roots of causal analysis in business and industry, reasoning about causality and having the ability to explain causal mechanisms enables us to identify how an outcome of interest came to be and gives insight into how to bring about, or even prevent, similar outcomes in future scenarios.

This workshop aims to bring together researchers and practitioners of logic programming with a dedicated focus on methods and trends emerging from the study of causality and explanation. The workshop will present the latest research and application developments in these areas and provide opportunities to discuss current and future research directions and relationships to other fields (e.g. Machine Learning, Diagnosis, Natural Language Processing and Understanding, Philosophy of Science). An important expected outcome of this workshop is to collect first-hand feedback from the ICLP  community about the role and placement of causal reasoning and explanation in the landscape of modern computer theory as well as in the software industry.

The categoricity of an axiom system means that its non-logical symbols have, up to isomorphism, only one possible interpretation. The first axiomatizations of mathematical theories such as number theory and analysis by Dedekind, Hilbert, Huntington, Peano and Veblen were indeed categorical. These were all second order axiomatisations, suffering from what many consider a weakness, namely dependence on a strong metatheory, casting a shadow over these celebrated categoricity results. In finer analysis a new form of categoricity has emerged. It is called internal categoricity because it is perfectly meaningful without any reference to a metatheory, and it is now known that the classical theories, surprisingly even in their first order formulation, can be shown to be internally categorical.

In this workshop various aspects of and approaches to internal categoricity are presented and the following questions, among others, are discussed: What is the philosophical import/advantage of internal categoricity over ordinary categoricity? Is internal categoricity the right concept of categoricity? Does internal categoricity play a role also in first order theories?

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The purpose of this special issue of AMAI is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with recent artificial intelligence techniques. Symbolic Computation is the science of computing with symbolic objects (terms, formulae, programs, representations of algebraic objects etc.). Powerful algorithms have been developed during the past decades for the major subareas of symbolic computation: computer algebra and computational logic. These algorithms and methods are successfully applied in various fields, including software science, which covers a broad range of topics about software construction and analysis. Meanwhile, artificial intelligence methods and machine learning algorithms are widely used nowadays in various domains and, in particular, combined with symbolic computation. Several approaches mix artificial intelligence and symbolic methods and tools deployed over large corpora to create what is known as cognitive systems. Cognitive computing focuses on building systems which interact with humans naturally by reasoning, aiming at learning at scale.

Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration.

Invited Speakers: Erika Ábrahám (RWTH Aachen University), Deyan Ginev (FAU Erlangen-Nürnberg and NIST) and Sébastien Gouëzel (IRMAR, Université de Rennes 1).

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The conference is concerned with the theory of computability and complexity over real-valued data. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

The International Joint Conference on Rules and Reasoning (RuleML+RR) is the leading international joint conference in the field of rule-based reasoning. Stemming from the synergy between the well-known RuleML and RR events, one of the main goals of this conference is to build bridges between academia and industry.

RuleML+RR 2022 aims to bring together rigorous researchers and inventive practitioners, interested in the foundations and applications of rules and reasoning in academia, industry, engineering, business, finance, healthcare and other application areas. It provides a forum for stimulating cooperation and cross-fertilization between the many different communities focused on the research, development and applications of rule-based systems.

The RuleML+RR 2022 conference is part of the event 'Declarative AI: Rules, Reasoning, Decisions, and Explanations' and is co-located with DecisionCAMP 2022 and the Reasoning Web Summer School. It features the RuleChallenge and a Doctoral Consortium as associated events.

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The conference is concerned with the theory of computability and complexity over real-valued data. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle.

The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person.

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The conference is concerned with the theory of computability and complexity over real-valued data. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle.

The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person.

Several successful logic programming languages, evidenced by the availability of a multitude of solvers, industrial applications, and an active research community, have been proposed in the literature. Researchers have long recognized the need for epistemic operators in these languages. This led to a flurry of research on this topic, and renewed interest in recent years. A central question is that of the definition of a rigorous and intuitive semantics for such epistemic operators, which is still subject of ongoing research. Notions of equivalence, structural properties, and the inter-relationships between logic programming languages and established logics are all subjects being actively investigated. Another important topic is that of practical solvers to compute answers to logic programs that contain epistemic operators. Several solvers are actively developed, building on established solvers, or using rewriting-based approaches. For practical applications, additional language features are actively explored in order to be able to apply epistemic extensions of logic programming langauges to practical problems. The goal of this workshop is to facilitate discussions regarding these topics and a productive exchange of ideas.

This workshop is part of the Federated Logic Conference (FLoC) 2022, to take place in Haifa, Israel.

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The conference is concerned with the theory of computability and complexity over real-valued data. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle.

The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person.

The aim of GandALF 2022 is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization.

Co-sponsored by the National Science Foundation, Lisa Simonyi, the Institute for Advanced Study (IAS), and Princeton University Department of Mathematics, Women and Mathematics (WAM) is an annual program that aims to recruit and retain more women in mathematics. WAM aims to counter the initial imbalance in the numbers of men and women entering mathematics training as well as the higher attrition rate of female mathematicians compared to their male counterparts at every critical transition stage in mathematical careers. WAM encourages female mathematicians to form collaborative research relationships and to become active in a vertical mentoring network spanning a continuum from undergraduates to emerita professors, which provides support and reduces the sense of isolation experienced by many women in mathematics. While there are a number of women's programs targeted solely at undergraduates, or graduate students, or postdocs, very few programs provide the depth and breadth that come from simultaneously including features tailored for undergraduate students, graduate students, and researchers from a broad spectrum of US institutions, all in one united community of scholars, as WAM does.

Terng Lecture Series: Cynthia Rudin (Duke University), Introduction to Interpretable Machine Learning.
Uhlenbeck Lecture Series: Maria Florina Balcan (Carnegie Mellon University), Foundations for Learning in the Age of Big Data

The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle.

The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person.

Ontological questions have always been central to the philosophy of mathematics. Besides the standard accounts of mathematical ontology, in recent times new paradigms have emerged, in connection with new important mathematical breakthroughs, but also with the advent of new automated tools for mathematical enquiries. This workshop aims to bring together scholars who have devoted time and effort to clarify which kinds of mathematical objects there are and what their nature consists in, and to present new trends in the philosophical investigations of mathematical ontology.

Ontological questions have always been central to the philosophy of mathematics. Besides the standard accounts of mathematical ontology, in recent times new paradigms have emerged, in connection with new important mathematical breakthroughs, but also with the advent of new automated tools for mathematical enquiries. This workshop aims to bring together scholars who have devoted time and effort to clarify which kinds of mathematical objects there are and what their nature consists in, and to present new trends in the philosophical investigations of mathematical ontology.

The Czech Technical University in Prague will host the 18th edition of the "Mons Theoretical Computer Science Days" on September 5-9, 2022 (postponed from September 7-11, 2020). The conference will offer invited talks and lectures on selected abstracts.

The theme of the conference is combinatorics on words and formal languages from their different perspectives (combinatorial, algorithmic, dynamical, logic, ...). The conference also welcomes other related branches of computer science and mathematics (number theory, computability, model checking, semigroups, game theory, discrete geometry, decentralized algorithms, bioinformatics, ...).

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.

The aim of the annual International Conference on Intuitionistic Fuzzy Sets (ICIFS) is to gather specialists interested in intuitionistic fuzziness, decision making under uncertainty, and other related topics, and to give them floor for discussions on both the theoretical and practical aspects of intuitionistic fuzzy sets. Since 2013, ICIFS has been an EUSFLAT endorsed event.

We are pleased to announce that Leeds Computability Days 2022 will take place from 30 May to 1 June 2022 at the University of Leeds.

Leeds Computability Days 2022 is a hybrid meeting. Registration is required (but free!) for both in person and online participants.

The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area.

WPTE 2022 is affiliated to FSCD 2022, part of FLoC 2022, Haifa, Israel. Invited speaker: Akihisa Yamada, National Institute of Advanced Industrial Science and Technology (AIST), Japan.

We are pleased to announce that Leeds Computability Days 2022 will take place from 30 May to 1 June 2022 at the University of Leeds.

Leeds Computability Days 2022 is a hybrid meeting. Registration is required (but free!) for both in person and online participants.