A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present a general proof theoretical methodology for default systems. Given a default theory W, D , the default rules D are simply understood as restrictions on the tableaux construction of the logic. Different default approaches have their own way of understanding these restrictions and executing them. For each default approach (such as Reiter, Brewka or Lukaszewicz), the allowable default extensions can be obtained from the default tableau construction. The advantage of our approach,doi:10.1093/logcom/6.2.205 fatcat:dpbdxncjd5gjjkuazl6ybzw6bm