Abstract
The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrained inferences can be specified in a knowledge representation language where a theory consists of a collection of logic programming-like rules and a priority constraint among them: that the application of one rule blocks that of the lower ranked rules. We thus present a formal system for representing common sense knowledge, and call it priority logic. As applications, we recast default reasoning by priority reasoning, and show that Horty's defeasible inheritance networks can be represented by priority logic. This latter result is a partial answer to Horty's challenge that it is impossible to relate path-based reasoning to general nonmonotonic formalisms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jr. Allen L. Brown, Surya Mantha, and Toshiro Wakayama. Constraint optimization using preference logics: A new role for modal logic. In Isabel F. Cruz, editor, Using a Visual Constraint Language for Data Display Specification, pages 22–23, 1993.
Jr. Allen L. Brown, Surya Mantha, and Toshiro Wakayama. Preference logics: Towards a unified approach to non-monotonicity in deductive reasoning. Annals of Mathematics and Artificial Intelligence, pages 10: 233–280, 1994.
F. Baader and B. Hollunder. Priorities on default with prerequisite and their application in treating specificity in terminological default logic. Journal of Automata Reasoning, 15:41–68, 1995.
G. Brewka. Nonmonotonic reasoning: Logical Foundations of Commonsense. Cambridge University Press, 1991.
G. Brewka. Well-founded semantics for extended logic programming with dynamic preference. Journal of Artificial Intelligence Research, 4:19–36, 1996.
F. Buccafurri, N. Leone, and P. Rullo. Stable models and their computation for logic programming with inheritance and true negation. J. Logic Programming, pages 27: 5–44, 1995.
K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.
J. Delgrande, T. Schaub, and W. Jackson. Alternative approach to default logic. Artificial Intelligence, 70:167–237, 1994.
V. Dimopoulos and A. Kakas. Logic programming without negation as failure. In Proc. ILPS '95, MIT Press, 1995.
P. Dung. An argumentation theoretic foundation for logic programming. J. Logic Programming, 22:151–177, 1995.
P. Dung and T. Son. Nonmonotonic inheritance, argumentation and logic programming. In Proc. 3rd International conference on LPNMR, pages 316–329. MIT Press, 1995.
K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234–254. MIT Press, 1989.
D. Etherington and R. Reiter. On inheritance hierarchies with exceptions. In AAAI-83, pages 104–108. Morgan Kaufmann, 1983.
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference logic programming. In Proc. 12th ICLP, pages 731–746. MIT Press, 1995.
J.F. Horty. Some direct theories of nonmonotonic inheritance. In M. Cabbay and C. Hogger, editors, Handbook of Logic and Artificial Intelligence, pages 111–187. Oxford University, 1991.
T. Imielinski. Results on translating defaults to circumscription. Artificial Intelligence, 32:131–146, 1987.
H. Jagadish, A. Mendelzon, and I. Mumick. Managing conflicts between rules. In Proc. ACM PODS. Montreal Quebec, Canada, 1996.
A. Kakas, P. Mancarella, and P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP, pages 504–519, 1994.
S. Mantha. first-Order Preference Theories and their Applications. PhD thesis, University of Utah, 1991.
V. Marek and V.S. Subrahmanian. The relationship between logic program semantics and non-monotonic reasoning. In Proc. 6th International Conference on Logic Programming, 1989.
V. Marek and M. Truszcynski. Relating autoepistemic and default logic. In Proc. Principles of Knowledge Representation and Reasoning, pages 276–288. Morgan Kaufmann, 1989.
V. Marek and M. Truszczybski. Nonmonotonic Logic, Context-Dependent Reasoning. Springer-Verlag, 1993.
J. McCarthy. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
R. Moore. Semantical consideration on nonmonotonic logic. Artificial Intelligence, 25(1):234–252, 1985.
R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55–76. Plenum Press, 1978.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
R. Reiter and G. Cirscuolo. On interacting defaults. In Proc. 7th IJCAI, pages 270–276, 1981.
C. Sakama and K. Inous. Representing priorities in logic programs. In Proc. Int'l Conference and Symposium on Logic Programming, 1996.
Y. Shoham. A semantics approach to non-monotonic logics. In Proc. IJCAI, pages 388–392, 1987.
R.H. Thomason and J.F. Horty. Logics for inheritance theory. In 2nd International Workshop for Non-Monotonic Reasoning, pages 220–237, 1988.
F. Toni and A.C. Kakas. Computing the acceptability semantics. In Proc. 3rd International Conference on Logic Programming and Non-monotonic Reasoning, pages 401–415, 1995.
X. Wang, J. You, and L. Yuan. Circumscription by inference rules with priority. In Proc. 12th European Conf. on Artificial Intelligence, pages 110–115, 1996.
X. Wang, J. You, and L. Yuan. Logic programming without default negation revised. TR96-25, Department of Computing Science, University of Alberta, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, X., You, JH., Yuan, L.Y. (1997). Nonmonotonic reasoning by monotonic inferences with priority constraints. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1996. Lecture Notes in Computer Science, vol 1216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023803
Download citation
DOI: https://doi.org/10.1007/BFb0023803
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62843-9
Online ISBN: 978-3-540-68702-3
eBook Packages: Springer Book Archive