@inproceedings{9c80512a9d604b99aed61edefa2178e0,
title = "What are the necessity rules in defeasible reasoning?",
abstract = "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.",
author = "Lam, {Ho Pun} and Guido Governatori",
year = "2011",
doi = "10.1007/978-3-642-20895-9_17",
language = "English",
isbn = "9783642208942",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "187--192",
booktitle = "Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Proceedings",
note = "11th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2011 ; Conference date: 16-05-2011 Through 19-05-2011",
}