SMLC 2013

Call for Papers

The SMLC 2013 workshop adopts an “Open Questions” format. – This means that the SMLC 2013 call for papers contains a list of questions on the synthetic modeling of life and cognition formulated by members of the Program Committee and other selected specialists on the basis of their expertise and in accordance with the topics of the workshop.

The SMLC 2013 workshop questions are cutting-edge open questions defining the agenda of the nascent  interdisciplinary community dedicated to support the reflected and cooperative development of the synthetic modeling of life and cognition. 

We welcome abstracts presenting and critically supporting original approaches directed to tackle the issues defined by the questions, and able to stimulate discussions and the emergence of new research lines in the interdisciplinary community created by the workshop.

The list of the SMLC 2013 workshop open questions can be found here. The questions are divided in three groups on the basis of their contents, and each question has an ID number.

We invite specialists from all the different research fields involved in this highly interdisciplinary forum to submit abstracts. In particular we welcome researchers from biology, synthetic biology, computational biology, AL, cognitive sciences, sciences of complex systems, computer sciences, AI, cognitive robotics, developmental robotics, social robotics, philosophy of science, philosophy of mind, philosophy of biology, philosophy of cognitive science, epistemology.

The Program Committee will select the papers to be presented at the workshop as talks through a double-blind peer review process.

Deadline: 30.06.2013

Extended deadline: 07.07.2013

Submission at: https://www.easychair.org/conferences/?conf=smlc2013

Information on how to prepare your abstract(s) and latest Information at http://www.pt-ai.org/smlc/2013/paper-submission

For any further information, please do not hesitate to contact the organizers.

Thank you for contributing to this emergent research area!