NMR 2004
Call for Papers
Important Dates
Programme Committee
Registration
Location
Accommodation
Programme
Invited
Author Instructions

SUBWORKSHOPS
Foundations of Nonmonotonic Reasoning
Computational Aspects of Nonmonotonic Reasoning
Action and Causality
Belief Change
Uncertainty Frameworks
Argument, Dialogue and Decision

SPONSORS
NMR logo

International Workshop on
Non-Monotonic Reasoning

June 6-8, 2004
Westin Whistler Resort and Spa,
Whistler BC, Canada


Computational Aspects of Non-monotonic Reasoning

CALL FOR PAPERS | ACCEPTED PAPERS

Specialized workshop in conjunction with NMR2004 (www.pims.math.ca/science/2004/NMR/papers.html)

The first results on the computational complexity of non-monotonic reasoning (NMR) were published in the beginning of 90s. In few years, the main decision problems of non-monotonic logics were classified in the polynomial time hierarchy. These results indicate that non-monotonic reasoning typically involves another source of computational complexity compared to classical reasoning. The general understanding gained from complexity results led to a progressive development of algorithms for non-monotonic reasoning. As a result, a number of systems implementing non-monotonic reasoning have emerged. Yet favored by the increasing performance of computer hardware, the performance of the existing systems is already sufficient to enable industrial applications of non-monotonic reasoning.

The subworkshop on computational aspects is a one-day event aiming to attract researchers interested in the computational side of non-monotonic reasoning: algorithms, complexity, and implementation techniques. The technical program forms a part of the Tenth Non-monotonic Reasoning Workshop (NMR2004), to be held in Whistler, BC, Canada, immediately after the KR-04 conference. The goal of this subworkshop is to promote the further development of systems implementing non-monotonic reasoning in practice.

TOPICS

Authors are invited to submit original papers on computational aspects of non-monotonic reasoning. See www.pims.math.ca/science/2004/NMR/papers.html for details. Short descriptions of new systems implementing NMR are also welcome.

The list of topics of interest includes but is not limited to:

  • Algorithms and data structures for NMR
  • Computational complexity analysis
  • Optimization techniques needed in NMR systems
  • Extensions to existing implementations
  • Performance analysis, benchmarking
  • Programming methodology
  • Standardization of system interfaces
  • Future challenges for NMR systems

We also welcome implementations to participate in a system competition that was initiated at a workshop on Nonmonotonic Reasoning, Answer Set Programming, and Constraints. The competition is currently hosted by the University of Potsdam and the results will be reviewed in conjunction with the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7). Our idea is that new systems can join the competition for another round to be summarized at NMR2004. Also, new benchmarks can be taken into consideration in order to increase the scope of comparison. To introduce new systems and benchmarks, an informal request should be send by email to Torsten Schaub.

ORGANIZERS
Tomi Janhunen (Tomi.Janhunen@hut.fi)
Torsten Schaub (torsten@cs.uni-potsdam.de)

PROGRAM COMMITTEE
Yannis Dimopoulos, University of Cyprus, Cyprus
Esra Erdem, Vienna University of Technology, Austria
Wolfgang Faber, Vienna University of Technology, Austria
Giovambattista Ianni, Universita della Calabria, Italy
Tomi Janhunen, Helsinki University of Technology, Finland
Chiaki Sakama, Wakayama University, Japan
Torsten Schaub, University of Potsdam, Germany
Terrance Swift, State University of New York at Stony Brook, U.S.A.
Jia-Huai You, University of Alberta, Canada,
Richard Watson, Texas Tech University, U.S.A.

SUBMISSION DETAILS
All NMR2004 subworkshops have the same submission requirements. Submissions are limited to 12 pages (excluding title page and references) of standard LaTeX 12pt article format. For system descriptions, the limit is 6 pages. Submissions are sent to each of the organizers by e-mail, in pdf format.

PROCEEDINGS
Final papers, limited to 9 KR-style pages, will be distributed at the meeting along with papers from the other NMR workshops. For system descriptions, the limit is 4 IJCAI-style pages. Accepted papers will also be arranged into on-line proceedings.

NMR2004 AND OTHER NMR2004 SUBWORKSHOPS
The other specialized workshops that will be held at NMR2004 are:

IMPORTANT DEADLINES

Submission of papers February 27, 2004
Notification of acceptance March 31, 2004
Final version (pdf file) April 30, 2004
Conference Dates: June 6-8, 2004

ACCEPTED PAPERS

ASP-PROLOG: a system for reasoning about answer set programs in prolog
Omar Elkhatib, Enrico Pontelli and Tran Cao Son

A SAT-based polynomial space algorithm for answer set programming
Enrico Giunchiglia, Yuliya Lierler and Marco Maratea

Enhancing answer set programming with templates
Giovambattista Ianni, Giuseppe Ielpa, Adriana Pietramala, Maria Carmela Santoro and Francesco Calimeri

BackJumping techniques for rules instantiation in the DLV system
Nicola Leone, Simona Perri and Francesco Scarcello

On acyclic and head-cycle free nested logic programs
Thomas Linke, Hans Tompits and Stefan Woltran

Finding stable models via quantum computation
David A. Meyer, James Pommersheim and Jeffrey. B. Remmel

``All's well that ends well'' - a proposal of global abduction
Ken Satoh


© 2003 Pacific Institute for the Mathematical Sciences
Last Modified: April 15, 2004