This workshop aims to provide a forum where researchers, currently working on constraint reasoning, optimization, and learning, can exchange their ideas, discuss new developments, and explore possible future directions. Therefore, we welcome and encourage three types of submission:
- 1. Work in progress and Original Contributions.
We welcome submissions presenting unpublished and original ideas, including work in progress with preliminary results. Authors may submit either an extended abstract or a full paper (up to 15 pages) in the LIPIcs format. All submissions will be evaluated through a double-blind review process. Accepted contributions, subject to the authors’ agreement, will have their final versions published on the workshop website. - 2. Already published work.
Authors interested in presenting their work to the workshop audience may submit papers that have already been published. Such submissions should be non-anonymous and must clearly indicate the venue where the work was originally published. Only papers published within the last calendar year will be considered (e.g., CPAIOR 2025, CP 2025, ECAI 2025, IJCAI 2025, AAAI 2025, or any journal published or conference held after May 2025). - 3. Papers Not Selected for the Main CP or SAT Conference.
Authors may submit papers that were not selected for presentation at the main CP or SAT conference. Acceptance decisions for the workshop will take into account the reviews received during the CP/SAT review process. By selecting this category, you agree that only the organizers of the workshop will have access to your CP/SAT reviews.
Contributions should be submitted in the form of a PDF file, following LIPIcs guidelines. The type of submission as defined above should be clearly stated during the submission.
All submissions will be reviewed by the PC members. A presentation time slot will be given to each accepted submission.
Submission link: https://submissions.floc26.org/soft/
Registration: Please register via FLoC’26 registration page (selecting the Soft workshop)