AISB Convention 2015

Call for Symposium Proposals: The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2015 Con...


Read More...

Yasemin Erden on BBC

AISB Committee member, and Philosophy Programme Director and Lecturer, Dr Yasemin J. Erden interviewed for the BBC on 29 October 2013. Speaking on the Today programme for BBC Radio 4, as well as the Business Report for BBC world N...


Read More...

Mark Bishop on BBC ...

Mark Bishop, Chair of the Study of Artificial Intelligence and the Simulation of Behaviour, appeared on Newsnight to discuss the ethics of ‘killer robots’. He was approached to give his view on a report raising questions on the et...


Read More...

AISB YouTube Channel

The AISB has launched a YouTube channel: http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...


Read More...

Lighthill Debates

The Lighthill debates from 1973 are now available on YouTube. You need to a flashplayer enabled browser to view this YouTube video  


Read More...
01234

Notice

AISB opportunities Bulletin Item

CALL FOR PAPERS: Special issue of the Journal of Symbolic Computation


JOURNAL OF SYMBOLIC COMPUTATION SPECIAL ISSUE FOR ISSAC 2011

Guest Editors: Ioannis Z. Emiris, Eric Schost

The International Symposium on Symbolic and Algebraic Computation
(ISSAC) is the premier annual conference to present and discuss new developments and original 
research results in all areas of symbolic mathematical computation. This special issue is related 
to topics discussed in the context of the ISSAC 2011 Conference, held in San Jose, California.


IMPORTANT DATES:
- submission: 20th of October, 2011
- notification of acceptance / rejection: early April 2012
- camera ready version: May 2012
- issue ready: July 2012


All areas of computer algebra and symbolic computation are of interest. These include, but are not
limited to:

  Algorithmic aspects: Exact and symbolic linear, polynomial and
  differential algebra. Symbolic-numeric, homotopy, and series methods.
  Computational geometry, group theory, number theory, quantifier
  elimination and logic. Summation, recurrence equations, integration,
  ODE & PDE. Theoretical and practical aspects, including algebraic
  complexity, and techniques for important special cases.

  Software aspects: Design of packages and systems, data representation.
  Parallel and distributed algebraic computing, considerations for
  modern hardware. User-interface issues, and use with systems for,
  e.g., digital libraries, courseware, simulation and optimization,
  automated theorem-proving, computer-aided design, and automatic
  differentiation.

  Application aspects: Applications that stretch the current limits of
  computer algebra, use it in new ways, or apply it in situations with
  broad impact, in particular to the natural sciences, life sciences,
  engineering, economics and finance, and education.


The submission is open to contributions not necessarly related to papers included in the 
proceedings of ISSAC 2011. Papers must not duplicate work already published or submitted for 
publication elsewhere. Improved or extended versions of papers included in the proceedings of 
ISSAC 2011 are welcome; in that case, a cover letter should explain what are the new ideas 
compared to the related ISSAC 2011 proceedings paper.


All the papers will be refereed according to the JSC standards.
Papers submissions should follow the guidelines for JSC submssions 
(see www4.ncsu.edu/~hong/jsc.htm) and should be submitted to easychair at 
http://www.easychair.org/conferences/?conf=jscissac11

The introduction of the paper must explicitly address the following questions in succinct and 
informal manner:
  - What is the problem?
  - Why is the problem important?
  - What has been done so far on the problem?
  - What is the main contribution of the paper on the problem?
  - Why is the contribution original?
  - Why is the contribution non-trivial?

When feasible, all the main definitions, theorems and algorithms should be illustrated by simple 
but meaningful examples.