Abstract
We extend logic programming to deal with default reasoning by allowing the explicit representation of exceptions in addition to general rules. To formalise this extension, we modify the answer set semantics of Gelfond and Lifschitz, which allows both classical negation and negation as failure.
We also propose a transformation which eliminates exceptions by using negation by failure. The transformed program can be implemented by standard logic programming methods, such as SLDNF. The explicit representation of rules and exceptions has the virtue of greater naturalness of expression. The transformed program, however, is easier to implement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Asirelli, P., De Santis, M. and Martelli, M., “Integrity Constraints in Logic Databases,”J. Logic Programming, 2, 3, pp. 221–232, 1985.
Clark, K. L., “Negation as Failure,” inLogic and Databases (Gallaire, H. and Minker, J., eds.), Plenum Press, pp. 293–322, 1978.
Eshghi, K. and Kowalski, R. A., “Abduction Compared with Negation by Failure,”Proc. of the Sixth International Logic Programming Conference, MIT Press, 1989.
Gelfond, M. and Lifschitz, V., “The Stable Model Semantics for Logic Programs,”Proc. of the Fifth International Conference and Symposium on Logic Programming (Kowalski, R. A. and Bowen, K. A., eds.), 2, pp. 1070–1080, 1988.
Gelfond, M. and Lifschitz, V., “Logic Programs with Classical Negation,”Proc. of the Seventh International Logic Programming Conference, MIT Press, 1990.
Ioannides, A. J., “Transformation Algorithms for Representing Knowledge without Integrity Constraints,”M. Sc. thesis, Department of Computing, Imperial College, London, 1989.
Kowalski, R. A. and Sadri, F., “Knowledge Representation without Integrity Constraints,” Department of Computing, Imperial College, London, 1988.
Kowalski, R. A., “The Treatment of Negation in Logic Programs for Representing Legislation,”Proc. of the Second International Conference on Artificial Intelligence and Law, pp. 11–15, 1989.
Lloyd J. W.,Foundatins of Logic Programming, 2nd extended edition, Springer-Verlag, 1987.
Pereira, L. M. and Aparicio, J. N., “Default Reasoning as Abduction,”Technical Report, AI Centre/Uninova, 2825 Monte da Caparica, Portugal, 1990.
Poole, D., “A Logical Framework for Default Reasoning,”Artificial Intelligence, 36, pp. 27–47, 1988.
Reiter, R., “A Logic for Default Reasoning,”Artificial Intelligence, 13, pp. 81–132, 1980.
Sergot, M. J., Sadri, F., Kowalski, R. A., Kriwaczek, F., Hammond, P. and Cory, H. T., “The British Nationality Act as a Logic Program,”CACM, 29, 5, pp. 370–386, 1986.
Author information
Authors and Affiliations
About this article
Cite this article
Kowalski, R.A., Sadri, F. Logic programs with exceptions. New Gener Comput 9, 387–400 (1991). https://doi.org/10.1007/BF03037170
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037170