@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
https://teal.cs.brown.edu/floc2026/
TEAL 2026: Tools for Educational Activities in Logic
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Theorem Proving Components for Educational Software (ThEdu)
https://theduworkshop.github.io/ThEduWebSite/#thedu26-presentation
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
24th International Workshop on Satisfiability Modulo Theories (SMT)
https://smt-workshop.cs.uiowa.edu/2026/
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
====================================================
Call for Papers
UNIF 2026
The 40th International Workshop on Unification
July 24, 2026, Lisbon, Portugal
https://www.risc.jku.at/conferences/unif2026/
====================================================
UNIF 2026 is the 40th event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of making two terms equal, finding solutions for equations or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc.
The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the state of the art in unification theory.
Topics of interest to this forum include, but are not limited to:
- Syntactic and equational unification algorithms
- Matching and Constraint Solving
- Higher-Order Unification
- Unification in modal, fuzzy, temporal and description logics
- Anti-unification/generalization
- Semi-unification
- Disunification
- Narrowing
- Admissibility of Inference Rules
- Combination problems
- Formalization of unification and related techniques
- Complexity Issues
- Implementation techniques
- Applications
The 40th International Workshop on Unification is part of FLoC'26, affiliated with FSCD 2026 and IJCAR 2026.
** Important Dates
May 7, 2026: paper submission deadline.
May 29, 2026: author notification.
June 13, 2026: camera-ready paper submission deadline.
July 24, 2026: UNIF 2026 in Lisbon.
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Call for papers: Isabelle Workshop 2026 (FLoC Lisbon)
=====================================================
Website: https://sketis.net/isabelle/isabelle-workshop-2026
Where: Lisbon (Portugal), associated with ITP and IJCAR, as part of FLoC
When: 24..25-Jul-2025 (UTC+1)
What:
This informal workshop will bring together users and developers of the
interactive theorem prover Isabelle. The year 2026 is special due to 40th
anniversary of Isabelle, so we allocate 2 full days for the event.
Important Dates:
- Paper submission deadline: 09-May-2026 (AoE)
- Notification of acceptance: 01-Jun-2026 (UTC+0)
Organisers and Program Chairs:
- Jasmin Blanchette
- Dmitry Traytel
- Makarius Wenzel
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
VAMPIRE 2026
The Vampire 2026 workshop will discuss recent developments in
implementation,
application, evaluation and comparison of first-order theorem provers,
including but not limited to Vampire, and their interaction with other
systems.
We seek submissions reporting on but not limited to:
- prerequisites for substantial progress in theorem proving tools
- implementation principles and practice
- heuristics and strategies for different application areas
- case studies, successful and unsuccessful
- missing features in modern theorem provers
Submissions can be in any form, ranging from work in progress to completed
work. For example, the users can submit:
- extended abstracts or full papers;
- theoretical papers;
- experimental papers and case studies;
- or in general any papers that can benefit tool developers and users.
Papers can be of any length, ranging from 1-page abstracts to full papers up
to 20 pages in length. The papers should use the EasyChair templates, which
can be found at https://easychair.org/publications/for_authors
Submissions should be made using the FLoC system, via the link
https://submissions.floc26.org/vampire/
The workshop post-proceedings will be published within the EasyChair EPiC
Series in Computing.
Important dates:
Paper submission: May 29, 2026 (AoE)
Notification of acceptance: June 5, 2026
Workshop: July 24, 2026
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
PAAR-2026: 10TH WORKSHOP ON PRACTICAL ASPECTS OF AUTOMATED REASONING
-- co-located with IJCAR 2026 --
-- as part of FLoC 2026 --
July 25, 2026, Lisbon, Portugal
Web site: https://paar2026.github.io/
Submission link: https://submissions.floc26.org/paar
Abstract registration deadline: April 14, 2026
Submission deadline: April 21, 2026
* Jan Jakubuv, Czech Technical University in Prague, CZ
* Cezary Kaliszyk, University of Melbourne, AU
* Daniela Kaufmann, TU Wien, AT
* Boris Konev, University of Liverpool, UK
* Daniel Le Berre, CNRS - Universit� d?Artois, FR
* Ondrej Lengal, Brno University of Technology, CZ
* Tomer Libal, University of Luxembourg, LU
* Michael Rawson, University of Southampton, UK
* Philipp Ruemmer, Uppsala University, SE
* Renate A. Schmidt, The University of Manchester, UK
* Stephan Schulz, DHBW Stuttgart, DE
* Frieder Stolzenburg, Harz University of Applied Sciences, DE
* Geoff Sutcliffe, University of Miami, US
* Sophie Tourret, Inria and MPI for Informatics, DE
* Zsolt Zombori, Alfr�d R�nyi Institute of Mathematics, Hungarian Academy of Sciences, HU
Publication
-----------
PAAR proceedings will be published electronically in a workshop
proceedings venue (such as CEUR workshop proceedings or
EasyChair Kalpa proceedings).
Venue
-----
IJCAR 2026 in Lisbon, Portugal
Important dates
---------------
* Abstract submission: April 14, 2026
* Paper submission: April 21, 2026
* Author notification: May 12, 2026
* Camera-ready paper versions due: July 1, 2026
* Workshop: July 25, 2026
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
WST 2026 - First Call for Papers
21st International Workshop on Termination
https://termination-portal.org/wiki/21st_International_Workshop_on_Termination
July 25, 2026, Lisbon, Portugal
Affiliated with IJCAR, July 26-29, 2026
The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of
termination, whether this interest be practical or theoretical,
primary or derived. The workshop also provides a ground for
cross-fertilization of ideas from the different communities interested
in termination (e.g., working on computational mechanisms, programming
languages, software engineering, constraint solving, etc.). The
friendly atmosphere enables fruitful exchanges leading to joint
research and subsequent publications.
The workshop is held as part of the 2026 Federated Logic Conference
(FLoC 2026 https://www.floc26.org) and is affiliated with the
13th International Joint Conference on Automated Reasoning
(IJCAR 2026 https://www.floc26.org/ijcar).
IMPORTANT DATES
- title and abstract submission: April 28, 2026
- submission: May 5, 2026
- notification: May 26, 2026
- early registration: June 1, 2026
- final version: June 26, 2026
- workshop: July 25, 2026
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Termination and Complexity Competition 2026
http://www.termination-portal.org/wiki/Termination_Competition_2026
Call for Participation
Since the beginning of the millennium, many research groups developed tools for fully automated termination and complexity analysis.
After a tool demonstration at the 2003 Termination Workshop in Valencia, the community decided to start an annual termination competition to spur the development of tools and termination techniques.
The termination and complexity competition focuses on automated termination and complexity analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. In all categories, we also welcome the participation of tools providing certifiable proofs. The goal of the termination and complexity competition is to demonstrate the power of the leading tools in each of these areas.
The competition will be affiliated with the International Workshop on Termination (WST 2026, https://termination-portal.org/wiki/21st_International_Workshop_on_Termination), which takes place at the Federated Logic Conference (FLoC 2026, https://www.floc26.org). It will be run on the RWTH University HPC cluster. The final run will be in parallel to the FLoC workshops on July 24th and 25th. The results will be presented at WST, and presumably also at IJCAR.
We strongly encourage all developers of termination and complexity analysis tools to participate in the competition. We also welcome the submission of termination and complexity problems, especially problems that come from applications.
A category is only run in the competition if there are at least 2 participants, at least 40 examples for this category in the underlying termination problem data base, and clearly defined rules. If there is no category that is convenient for your tool, you can contact the organizers, since other categories can be considered as well if enough participants are guaranteed.
For further information, we refer to the website of the termination and complexity competition: https://termination-portal.org/wiki/Termination_Competition_2026
Important dates
Tool and Benchmark Submission: June 26
Full Run: July 13-17
Live Run: July 24/25
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Subscribe to:
Comments (Atom)