Representation results for defeasible logic

ABSTRACT

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.

REFERENCES

• 1: ANTONIOU, G. 1997. Nonmonotonic Reasoning. MIT Press.
• 2: G. Antoniou , D. Billington , M. J. Maher, Normal forms for defeasible logic, Proceedings of the 1998 joint international conference and symposium on Logic programming, p.160-174, August 1998, Manchester, United Kingdom
• 3: G. Antoniou , D. Billington , M. J. Maher, On the Analysis of Regulations using Defeasible Rules, Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 6, p.6033, January 05-08, 1999
• 4: ANTONIOU, G., MAHER,M.J.,AND BILLINGTON, D. 2000. Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming 41, 1, 45-57.
• 5: ANTONIOU, G., MARUYAMA, F., MASUOKA, R., AND KITAJIMA, H. 1999b. Issues in intelligent information integration. In Proc. 3rd IASTED International Conference on Internet and Multimedia Systems and Applications. IASTED, 345-349.
• 6: BILLINGTON, D. 1993. Defeasible logic is stable. Journal of Logic and Computation 3, 370-400.
• 7: CODD, E. F. 1972. Further normalization of the data base relational model. In Data Base Systems, Courant Computer Science Symposia Series 6. Prentice Hall.
• 8: DIMOPOULOS,Y.AND KAKAS, A. 1995. Logic programming without negation as failure. In Proc. 5th International Symposium on Logic Programming. MIT Press, 369-384.
• 9: P. Geerts , D. Vermeir , D. Nute, Ordered logic: defeasible reasoning for multiple agents, Decision Support Systems, v.11 n.2, p.157-190, Feb. 1994 [doi>10.1016/0167-9236(94)90030-2]
• 10: Benjamin N. Grosof, Prioritized conflict handing for logic programs, Proceedings of the 1997 international symposium on Logic programming, p.197-211, November 1997, Port Washington, New York, United States
• 11: Benjamin N. Grosof , Yannis Labrou , Hoi Y. Chan, A declarative approach to business rules in contracts: courteous logic programs in XML, Proceedings of the 1st ACM conference on Electronic commerce, p.68-77, November 03-05, 1999, Denver, Colorado, United States [doi>10.1145/336992.337010]
• 12: KOWALSKI,R.A.AND TONI, F. 1996. Abstract argumentation. Artificial Intelligence and Law 4, 275-296.
• 13: Michael J. Maher , Grigoris Antoniou , David Billington, A Study of Provability in Defeasible Logic, Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence, p.215-226, July 13-17, 1998
• 14: A. Rock, Efficient defeasible reasoning systems, Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence, p.384, November 13-15, 2000
• 15: MAREK,V.AND TRUSZCZYNSKI, M. 1993. Nonmonotonic Reasoning. Springer, Berlin.
• 16: NUTE, D. 1987. Defeasible reasoning. In Proc. 20th Hawaii International Conference on Systems Science. IEEE Press, 470-477.
• 17: Donald Nute, Defeasible logic, Handbook of logic in artificial intelligence and logic programming (vol. 3): nonmonotonic reasoning and uncertain reasoning, Oxford University Press, Inc., New York, NY, 1994
• 18: PETTOROSSI,A.AND PROIETTI, M. 1994. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming 19/20, 261-320.
• 19: REEVES, D. M., GROSOF, B. N., WELLMAN,M.P.,AND CHAN, H. Y. 1999. Towards a declarative language for negotiating executable contracts. In Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99). AAAI Press/MIT Press.
• 20: J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
• 21: ROCK, A. 2000. Deimos: Query answering defeasible logic system. http://www.cit.gu.edu.au/ ~arock/defeasible/Defeasible.cgi.
• 22: VERMEIER, D., NUTE,D.,AND GEERTS, P. 1990. Modeling defeasible reasoning with multiple agents. In Proc. Hawaii International Conference on Systems Sciences. Vol. III. IEEE Press, 534-543.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Proof theory

General Terms:
Theory

Keywords:
defeasible logic, normal forms, transformations