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
Lecture Notes in Computer Science
0000−0002−4267−4447] , Thomas Meyer 2[0000−0003−2204−6969] , and Ivan Varzinczak 3[0000−0002−0025−9632] Abstract. We present a systematic approach for extending the KLM framework for defeasible entailment. We first present a class of basic defeasible entailment relations, characterise it in three distinct ways and provide a high-level algorithm for computing it. This framework is then refined, with the refined version being characterised in a similar manner. We show that the two well-knowndoi:10.1007/978-3-030-19570-0_12 fatcat:oddvnetg5zgqfnbnguvypr7gq4