Special Track on Nonmonotonic Reasoning
Special Track Contents
Nonmonotonic reasoning concerns situations when information is incomplete or uncertain. Thus, conclusions drawn lack iron-clad certainty that comes with classical logic reasoning. New information, even if the original one is retained, may change conclusions. Formal ways to capture mechanisms involved in nonmonotonic reasoning, and to exploit them for computation as in the answer set programming paradigm are at the heart of this research area.
The six papers accepted for the special track contain significant contributions to the foundations of logic programming under the answer set semantics, to nonmonotonic extensions of description logics, to belief change in restricted settings, and to argumentation. They illustrate that the field remains vibrant and relevant to the long-term goals of artificial intelligence.
- Brewka, G., Marek, V., and Truszczynski, M. (2011) "Preface to the Special Track on Nonmonotonic Reasoning"
- Alviano, M., Calimeri, F., Faber, W., Leone, N., and Peri, S. (2011) "Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates"
- Bonatti, P., Faella, and M., Sauro, L. (2011) "Defeasible Inclusions in Low-Complexity Description Logics"
- Booth, R., Meyer, T., Varzinczak, I., Wassermann, R. (2011) "Basic Horn Contraction"
- Dvorak, W., and Woltran, S. (2011) "On the Intertranslatability of Argumentation Semantics"
- Gabbay, D., Pearce, D., and Valverde, A. (2011) "Interpolable Formulas in Equilibrium Logic and Answer Set Programming"
- Lee, J., and Meng, Y. (2011) "General Theory of Stable Models and First-Order Loop Formulas"