SoCS 2019: The 12th Annual Symposium on Combinatorial Search Napa, California, USA Napa, CA, United States, July 16-17, 2019 |
Conference website | http://socs19.search-conference.org |
Submission link | https://easychair.org/conferences/?conf=socs2019 |
Poster | download |
Abstract registration deadline | March 25, 2019 |
Submission deadline | April 1, 2019 |
Heuristic search and other forms of combinatorial search are very active areas of research in artificial intelligence, planning, robotics, constraint programming, operations research, bioinformatics, and other areas of computer science. SoCS is meant to bring researchers from these areas together to exchange ideas and cross-fertilize the field.
In 2019, SoCS is collocated with the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019).
Submission Guidelines
We encourage researchers to submit three categories of papers to the symposium. Application oriented papers are especially welcome:
- 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) papers are the standard category. We welcome technical papers that report substantial original research in search or in the related area that are not under review in other archival conference or journal.
- Position papers. We also encourage authors to submit original long and short (the same page limits as in technical papers applies) position papers discussing ideas and concepts related to search. Examples of position papers could include thoughtful critiques 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. To foster the exchange of ideas at SoCS, we encourage authors to submit extended abstracts of original work, work-in-progress, or work which has appeared in or is under review at other venues such as AAAI/IJCAI.
Original Long and Short Papers (both Technical and Position)
Original papers will be rigorously peer-reviewed. SoCS 2019 will follow a double-blind review process for original papers, and hence authors of original papers are required to omit author information from their submissions and anonymize obvious self-references. Non-anonymous submissions may be rejected without review.
Long papers may be up to 8 pages in length, plus an additional page for references only. Short papers may be up to 4 pages, plus an additional page for references only. Long and short original papers should be new work which has not been published (nor currently simultaneously under review) in any other archival publication venue. Papers that do not follow these requirements will be rejected without review.
Extended Abstracts
The publication of a research abstract in the SoCS 2019 proceedings generally allows publishing a full paper on the same line of research at SoCS 2020 or other venues.
The extended abstract submissions will be lightly reviewed in order to ensure that they are of interest to the SoCS community. The submitted version of the extended abstract can be up to 8 pages, plus an additional page for references only. However, if the extended abstract submission is accepted, only 2 pages (including references) will be allocated in the SoCS 2019 proceedings. The submitted version itself will not be reprinted in the proceedings.
Abstracts of papers which are under double-blind review in another conference must be anonymous (names and affiliations must not appear in the submitted PDF).
For any inquiries, please feel free to contact the conference chairs.
List of Topics
Topics of interest include but are not limited to the following:
- Analysis of search algorithms
- Automated synthesis of lower bounds
- Bounding and pruning techniques
- Combinatorial puzzles
- Continuous problem solving
- External-memory and parallel search
- Incremental and active learning in search
- Meta-reasoning and search
- Methodology and critiques of current practice
- Model-based search
- Random vs. systematic search strategy selection
- Portfolios of search algorithms
- Real-time search
- Search in goal-directed problem solving
- Search space discretization for continuous state-space problems
- Self-configuring and self-tuning algorithms
- Symmetry handling
- Time, memory, and solution quality trade-offs
- Search in Big Data
- Constraint search
- Search in robotics
- Search-based diagnosis
- Real-life applications
- Problem compilation
Organizing Committee
William Yeoh, Washington University in St. Louis, USA
wyeoh@wustl.edu
Pavel Surynek, Czech Technical University in Prague, Czech Republic
pavel.surynek@fit.cvut.cz
Venue
The conference will be held in Napa, California, USA.