What are the necessity rules in defeasible reasoning?

Lam, Ho-Pun and Governatori, Guido (2011). What are the necessity rules in defeasible reasoning?. In: James P. Delgrande and Wolfgang Faber, Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-11). 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-11), Vancouver, BC, Canada, (187-192). 16-19 May 2011. doi:10.1007/978-3-642-20895-9_17

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Lam, Ho-Pun
Governatori, Guido
Title of paper What are the necessity rules in defeasible reasoning?
Conference name 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-11)
Conference location Vancouver, BC, Canada
Conference dates 16-19 May 2011
Proceedings title Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-11)   Check publisher's open access policy
Journal name Lecture Notes in Computer Science   Check publisher's open access policy
Series Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Place of Publication Heidelberg, Germany
Publisher Springer-Verlag Berlin Heidelberg
Publication Year 2011
Sub-type Fully published paper
DOI 10.1007/978-3-642-20895-9_17
Open Access Status Not yet assessed
ISBN 9783642208942
9783642208959
ISSN 0302-9743
1611-3349
Editor James P. Delgrande
Wolfgang Faber
Volume 6645
Start page 187
End page 192
Total pages 6
Language eng
Abstract/Summary 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.
Subjects 2614 Theoretical Computer Science
1700 Computer Science
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Conference Paper
Sub-type: Fully published paper
Collections: Official 2012 Collection
School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 11 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 17 May 2011, 22:53:51 EST by Mr Ho Pun Lam on behalf of School of Information Technol and Elec Engineering