What Are the Necessity Rules in Defeasible Reasoning?

This paper investigates a new approach for computing the inference of defeasible logic. The algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representation properties in different variants of DL. Experiments also show that our algorithm outperform traditional approach by several order of amplitudes.

• Type: Journal
• Year: 2011
• Where: LPNMR
• Authors: Ho-Pun Lam, Guido Governatori
• Keywords: Automated Reasoning, Inference, LPNMR 2011, Traditional Approach, Variants