SoCS-23 Call for Papers

[Wheeler Ruml]

=============================
= Call for Papers =
=============================

The 16th International Symposium on Combinatorial Search (SoCS-23)

Aquapalace Hotel Prague, Czech Republic
July 14 - July 16, 2023 (just after ICAPS)

http://socs23.search-conference.org


Important dates
===============
March 3, 2023 Abstract submission deadline
March 9, 2023 Paper submission deadline
April 27, 2023 Notification
May 17, 2023 Early registration deadline
July 14-16, 2023 SoCS 2023 conference


The Symposium on Combinatorial Search
=====================================

Heuristic search and other forms of combinatorial search and
optimization are a very active areas of research in artificial
intelligence, robotics, planning, discrete optimization and other
areas of computer science and operations research. The International
Symposium on Combinatorial Search (SoCS) is meant to bring researchers
in such areas together to exchange their ideas and cross-fertilize the
field.

SoCS serves researchers and submissions in all fields that use
combinatorial search, including artificial intelligence, planning,
robotics, constraint programming, meta-reasoning, operations research,
navigation and bioinformatics. We especially invite submissions
presenting real-world applications of heuristic search.

Papers exploring the boundaries between combinatorial search and
planning & scheduling research are also particularly welcome, given
the co-location with ICAPS 2023.

The proceedings of SoCS 2023 will be published by AAAI Press.


List of Topics
==============

Topics of interest include but are not limited to the following:

- Adversarial search
- Analysis of search algorithms
- Automated synthesis of lower bounds
- Bounding and pruning techniques
- Combinatorial optimization
- Combinatorial puzzles
- Continuous problem solving
- Constraint search
- External-memory and parallel search
- Incremental and active learning in search
- Deep learning in heuristics and search
- Machine learning for or in search algorithms
- Metareasoning and search
- Methodology and critiques of current practice
- Model-based search
- Portfolios of search algorithms
- Problem compilation
- Problem solving using search
- Random vs. systematic search strategy selection
- Real-life applications
- Real-time search
- Reinforcement learning and search
- Search in goal-directed problem solving
- Search space discretization for continuous state-space problems
- Search-based diagnosis
- Search in boolean satisfiability
- Search in machine learning and big data analytics
- Search methods in robotics
- Self-configuring and self-tuning algorithms
- Symmetry handling
- Time, memory, and solution quality trade-offs


Types of submissions
====================

Technical papers. Original long (up to 8 pages plus up to one page of
references) and short (up to 4 pages plus up to one page of
references) technical papers that report substantial original
research in search or in related areas that are not under review
in other archival conferences or journals.

Position papers. Original long (up to 8 pages plus up to one page of
references) and short (up to 4 pages plus up to one page of
references) position papers such as thoughtful critiques or bold
new perspectives of the field, historical perspectives and
analysis, technical discussions of various implementation
techniques, methodological contributions, and insightful reports
on new and demanding applications.

Extended abstracts. Up to 2 pages, including references, of original
work, work-in-progress, or work which has appeared in or is under
review at other venues such as AAAI/ICAPS/IJCAI. Most archival
conferences do not consider a 2-page extended abstract as
preventing submission of a full-length technical paper giving full
details on the same work. All accepted abstracts will be included
in the proceedings. Extended abstracts will likely be allocated
poster presentations.


Conference Chairs
=================

- Roman Barták, Charles University, Czech Republic (bar...@ktiml.mff.cuni.cz)
- Oren Salzman, Technion, Israel (osal...@cs.technion.ac.il)
- Wheeler Ruml, University of New Hampshire, USA (ru...@cs.unh.edu)

# EOF