CFProposal AISB2018

  The Society for the Study of Artificial Intelligence and Simulation for Behaviour (AISB) is soliciting proposals for symposia to be held at the AISB 2018 convention.The longest running convention on Artificial Intelligence, A...


Read More...

Insurance AI Analy...

Insurance AI Analytics Summit, October 9-10, London Join us for Europe’s only AI event dedicated to insurance where 300 attendees will unite from analytics, pricing, marketing, claims and underwriting. You’ll find out how advan...


Read More...

AISB 2018 Convention

  The longest running convention on Artificial Intelligence, AISB 2018 will be held at the University of Liverpool, chaired by Floriana Grasso and Louise Dennis. As in the past years, AISB 2018 will provide a unique forum for p...


Read More...

AI Summit London

     The AI Summit London: The World’s Number One AI Event for Business  Date: 9-10 May 2017 Venue: Business Design Centre, London. The AI Summit is the world’s first and largest/number one conference exhibition dedicated to t...


Read More...

AISB Wired Health

    AISB and WIRED events have partnered to bring together inspirational high-profile speakers. Join hundreds of healthcare, pharmaceutical and technology influencers and leaders at the 4th Annual WIRED Health event, taking pl...


Read More...

Hugh Gene Loebner

  The AISB were sad to learn last week of the passing of philanthropist and inventor Hugh Gene Loebner PhD, who died peacefully in his home in New York at the age of 74.  Hugh was founder and sponsor of The Loebner Prize, an an...


Read More...

AI Europe 2016

  Partnership between AISB and AI Europe 2016: Next December 5th and 6th in London, AI Europe will bring together the European AI eco-system by gathering new tools and future technologies appearing in professional fields for th...


Read More...

AISB convention 2017

  In the run up to AISB2017 convention (http://aisb2017.cs.bath.ac.uk/index.html), I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid...


Read More...

Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Read More...

Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Read More...
0123456789

Notice

AISB opportunities Bulletin Item

CALL FOR PAPERS: Special issue on "Loops in Argumentation"


Special issue of Journal of Logic and Computation (JLC)

Arguments can be linked together by various kinds of relationships (e.g 
attack, defense, derivation, support, ...) lending themselves to direct 
representation as graph- or network-based formalisms. Dung's argumentation 
framework, encompassing a binary attack relation between arguments, is 
probably the most known one, but other kinds of argumentation networks 
have also been proposed in the literature. Whatever relationship between 
arguments is considered, a circularity in it poses questions which are 
both conceptual and practical. On the conceptual side, one has to make 
sense, if possible, of the loop situation, i.e. either to give it an 
interpretation or reject it (e.g. What does a circular support relation 
mean? Does it represent a valid support in some sense? or, for the attack 
relation, have odd- and even-length attack loops the same or a different 
nature?). On the practical side, one needs to take into account the 
presence of loops in defining models and algorithms operating on 
argumentation networks, primarily when it comes to assess the 
justification status of arguments.

This kind of loop-related questions are receiving increasing attention in 
the literature (again, especially for attack loops in the context of 
Dung's framework) but a wealth of further developments is sought: the aim 
of this special issue is to collect together high-level works assessing 
and/or advancing the state of the art in dealing with (various kinds of) 
loops in (various kinds of) argumentation networks and 
argumentation-related areas. We solicit original submissions on topics 
including, but not limited to: - causes, nature and conceptual status of 
circular relationships in formal and informal argumentation - handling of 
loops in argumentation networks at semantic and/or algorithmic level - 
loops in argumentation networks vs. loops in logic programming, dialogue 
protocols and other argumentation-related formalisms - loops in actual 
argumentation-based reasoning and dialogues (legal reasoning, 
evidence-based reasoning, decision support, negotiation, deliberation, 
...)

We encourage submissions of high quality, original papers which are not 
simultaneously submitted for publication elsewhere. Reviewing will take 
place according to the standards common at JLC. Authors will be able to 
keep part of the copyright, so that their work can also be published by 
other means (for instance as book chapters), after the special issue has 
appeared.

Important Dates:
- Submissions due for review:   March 31, 2013
- Notification of 1st decision: June 30, 2013
- Revisions due: September 30, 2013
- Notification of acceptance:   October 20, 2013
- Final version due:    November 3, 2013
- Issue publication:    mid 2014

Instructions for submission (see also http://jlcloops13.ing.unibs.it/): 
Paper submission is managed through EasyChair and is open between February 
1 and March 31, 2013. Papers should be submitted in PDF format through the 
submission page available at this link 
(https://www.easychair.org/conferences/?conf=jlcloops13). There are no 
restrictions on the length of the papers. Authors will be allowed to keep 
the pre-print version of the paper on their personal website.

Special issue editors
- Pietro Baroni (University of Brescia)
- Dov Gabbay (King's College, London)
- Massimiliano Giacomin (University of Brescia)