Handling Exceptions in Logic Programming without Negation as Failure
Default rules, i.e. statements of the form normally a’s are b’s, are usually handled in Answer Set Programming by means of negation as failure which provides a way to capture exceptions to normal situations. In this paper we propose another approach which offers an operational counterpart to negation as failure, and which may be thought as a corresponding dual attitude. The approach amounts to an explicit rewriting of exceptions in default rules, together with the addition of completion rules that are consistent with current knowledge. It is shown that the approach can be applied to restore the consistency of inconsistent programs that implicitly involve specificity ordering between the rules. The approach is compared to previous works aiming at providing support to the rewriting of default rules. It is also shown how the proposed approach agrees with the results obtained in the classical way.
Unable to display preview. Download preview PDF.
- 4.Confalonieri, R., Prade, H.: Answer Set Programming for Computing Decisions Under Uncertainty. Accepted in the 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (2011)Google Scholar
- 8.Garcia, B.B., Lopes, J.G.P., Varejão, F.: Compiling default theory into extended logic programming. In: Proc. of the 7th Ibero-American Conference on Artificial Intelligence, pp. 207–216. Springer, Heidelberg (2000)Google Scholar
- 14.Pearl, J.: System z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Proc. of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 121–135. Morgan Kaufmann, San Francisco (1990)Google Scholar
- 16.Touretzky, D.S., Horty, J.F., Thomason, R.H.: A clash of intuitions: the current state of nonmonotonic multiple inheritance systems. In: Proc. of Int. Joint Conf. on Artificial Intelligence, pp. 476–482. Morgan Kaufmann, San Francisco (1987)Google Scholar