Classifying Semi-Normal Default Logic on the Basis of its Expressive Power

  • Authors:
  • Tomi Janhunen

  • Affiliations:
  • -

  • Venue:
  • LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports on systematic research which aims to classify non-monotonic logics by their expressive power. The classification is based on translation functions that satisfy three important criteria: polynomiality, faithfulness and modularity (PFM for short). The basic method for classification is to prove that PFM translation functions exist (or do not exist) between certain logics. As a result, non-monotonic logics can be arranged to form a hierarchy. This paper gives an overview of the current expressive power hierarchy (EPH) and investigates seminormal default logic as well as prerequisite-free and semi-normal default logic in order to locate their exact positions in the hierarchy.