This website is dedicated to the editorial and author-support activities of the journal 'Artificial Intelligence', usually referred to as the AIJ. It does not document the publisher's activities (but see the link to Elsevier's website at the top right of this page, "AIJ@Elsevier").

The editorial process is organized by the Artificial Intelligence Journal Division (AIJD) of IJCAI.

All submissions should be made via the Elsevier's Editorial System (EES). Submission via email is not possible. 

- AIJ has approved a new policy regarding under what circumstances a submission to AIJ may include work previously published in a conference paper by the same author


Next Call for Funding will open on January 15, 2019.

The results of the summer 2018 Funding will be available on October 15.

The following 26 proposals were granted Funding in the January 2018 Call.

Call for papers: Special Issue of the Artificial Intelligence Journal (AIJ) on Epistemic Planning
Deadline 1st October, 2018. See the Special Issue page for further information.


AI Journal - Classic and Prominent Paper Awards 2018
Read the full Call for nomination and details here.
The nomination deadline was 20 April 2018.
More info on the AIJ Award page.



Classical Paper Award:

 Phan Minh Dung:

On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games.

Artif. Intell. 77(2): 321-358 (1995)

This is the seminal paper on argumentation theory that laid the foundations for almost all subsequent work in the area. This rich and elegant argumentation framework is developed from a few simple abstract primitives and is used to establish a crisp and meaningful relation between argumentation and theories of non-monotonic reasoning, logic programming, social choice, and cooperative games.

Prominent: Award:

Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Conflict-driven answer set solving: From theory to practice.
Artif. Intell. 187: 52-89 (2012)

Answer set programming (ASP) provides a powerful compact language for expressing a number
of combinatorial problems. The paper  introduces a novel  approach for  computing answer sets of
logic programs which is  based on concepts successfully applied in Satisfiability (SAT) checking.
The  approach is implemented in the ASP solver clasp  that has won several contests while
extending  the range of problems that can be modeled and solved effectively as answer set programs.