An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance

  • Authors:
  • Ekawit Nantajeewarawat;Vilas Wuwongse

  • Affiliations:
  • -;-

  • Venue:
  • ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inheritance is a characteristic reasoning mechanism in systems with taxonomic information. In rule-based deductive systems with inclusion polymorphism, inheritance can be captured in a natural way by means of typed substitution. However, with method overriding and multiple inheritance, it is well-known that inheritance is nonmonotonic and the semantics of inheritance becomes problematical. We present a general framework, based on Dung's abstract theory of argumentation, for developing a natural semantics for declarative programs with dynamic defeasible inheritance. We investigate the relationship between the presented semantics and Dobbie and Topor's perfect model (with overriding) semantics, and show that for inheritance-stratified programs, the two semantics coincide. The proposed semantics, nevertheless, still provides the correct skeptical meanings for non-inheritance-stratified programs, while the perfect model semantics fails to yield sensible meanings for them.