AI Journal - Classic and Prominent Paper Awards 2018

The AI Journal is pleased to Announce Two Awards for papers published
in the journal:

- The AIJ Prominent Paper Award recognizes outstanding papers

published not more than seven years ago in the AI Journal that are
exceptional in their significance and impact.

Nominations are now solicited for papers published in AIJ between 2011
and 2017 for the 2018 Prominent Paper Award.

Here is the complete list of this year's Eligible Prominent Papers.

The AIJ Classic Paper Award recognizes outstanding papers published
at least 15 calendar years ago in the AI Journal that are
exceptional in their significance and impact.

So for this year, eligible papers for the Classic Paper award are
those published in AIJ between 1970 and 2002. Here is the complete list of this year's Eligible Classic Papers.

The next round of nominations will be in April 2019.

Information about the format
of nominations and the evaluation criteria for these two awards can be
found here:

AIJ Classic Paper Award.
AIJ Prominent Paper Award.

And you can nominate your candidates here: https://easychair.org/conferences/?conf=aijawards18

The 2018 Classic and Prominent Paper Awards were given to the following papers:

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 Paper 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.

Here is the list of All Previous Award Winners.