|
Computational Aspects of Non-monotonic ReasoningCALL 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:
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 PROGRAM COMMITTEE SUBMISSION
DETAILS PROCEEDINGS NMR2004 AND OTHER NMR2004 SUBWORKSHOPS IMPORTANT DEADLINES Submission of papers February 27, 2004 Omar Elkhatib, Enrico Pontelli and Tran Cao Son
A SAT-based polynomial space algorithm for answer set programming
Enhancing answer set programming with templates
BackJumping techniques for rules instantiation in the DLV system
On acyclic and head-cycle free nested logic programs
Finding stable models via quantum computation
``All's well that ends well'' - a proposal of global abduction
|
© 2003
Pacific Institute for
the Mathematical Sciences Last Modified: April 15, 2004 |