[PlanetKR] SoCS-20: last call for papers
Mauro Vallati
M.Vallati at hud.ac.uk
Tue Feb 4 20:58:52 EST 2020
***********************
*** LAST CALL FOR PAPERS ***
=======================
SoCS 2020: The 13th Annual Symposium on Combinatorial Search
Vienna, Austria, May 26-28, 2020
Conference website: https://protect-au.mimecast.com/s/u4KDCD1v07HJMW8xcWXV0k?domain=socs20.search-conference.org
Submission link: https://protect-au.mimecast.com/s/wZ6aCE8wP7H0nzZqHwOof6?domain=easychair.org
Important dates
===============
Abstract registration deadline: February 12, 2020
Submission deadline: February 17, 2020
Notification: March 27, 2020
SoCS 2020 Conference: May 26-28, 2020
Symposium on Combinatorial Search
=================================
Heuristic Search and other forms of Combinatorial Search are very active
areas of inquiry in Artificial Intelligence. Such problem solving
techniques are studied in AI Planning, Robotics, Constraint Programming,
Operations Research, Bioinformatics and in many other areas of Computer
Science. The SoCS series of symposia aims to bring together researchers
from these different communities to exchange ideas and to cross-fertilise
the field.
In 2020, SoCS is co-located with the 17th International Conference
on the Integration of Constraint Programming, Artificial Intelligence,
and Operations Research (CPAIOR 2020). To celebrate this joint meeting we
especially encourage the submission of papers that explore the boundaries
between Heuristic/Combinatorial Search and discrete optimisation.
Submission Guidelines
=====================
We encourage researchers to submit three categories of papers
to the symposium:
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
---------------
In addition to the main technical track we encourage authors to submit
original long and short position papers discussing ideas and concepts
related to Heuristic and Combinatorial Search. Examples of position
papers could include 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
------------------
To foster the exchange of ideas at SoCS, we encourage authors
to submit extended abstracts (of up to 2 pages, including references)
of original work, work-in-progress, or work which has recently 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 2020 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 anonymise 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 2020 proceedings
generally allows publishing a full paper on the same line of research
at SoCS 2021 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 2020 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 questions, please contact the conference chairs.
List of Topics
==============
Topics of interest include but are not limited to the following:
Problem solving using search
Adversarial search
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
Constraint search
Random vs.systematic search strategy selection
Portfolios of search algorithms
Real-time search
Combinatorial optimisation
Search in goal-directed problem solving
Search space discretisation for continuous state-space problems
Self-configuring and self-tuning algorithms
Symmetry handling
Search in Boolean satisfiability
Time, memory, and solution quality trade-offs
Search in Big Data
Search in robotics
Search-based diagnosis
Real-life applications
Problem compilation
Organising Committee
====================
Daniel Harabor, Monash University, Australia
daniel.harabor at monash.edu
Mauro Vallati, University of Huddersfield, United Kingdom
m.vallati at hud.ac.uk
Venue
=====
The conference will be held in Vienna, Austria.
University of Huddersfield inspiring global professionals.
[https://protect-au.mimecast.com/s/ja_BCGv097UOqPz8UpgW8k?domain=marketing.hud.ac.uk]
This transmission is confidential and may be legally privileged. If you receive it in error, please notify us immediately by e-mail and remove it from your system. If the content of this e-mail does not relate to the business of the University of Huddersfield, then we do not endorse it and will accept no liability.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://discuss.it.uts.edu.au/pipermail/planetkr/attachments/20200204/5a2419f8/attachment.html
More information about the PlanetKR
mailing list