What are the necessity rules in defeasible reasoning?

Authors:
Ho-Pun Lam;Guido Governatori
Affiliations:
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia;NICTA, Queensland Research Laboratory, Brisbane, Australia
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 10
Cited 4

Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Representation results for defeasible logic

ACM Transactions on Computational Logic (TOCL)
A Flexible Framework for Defeasible Logics

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Formalizing defeasible logic in CAKE

Fundamenta Informaticae
Propositional defeasible logic has linear complexity

Theory and Practice of Logic Programming
DR-Prolog: A System for Defeasible Reasoning with Rules and Ontologies on the Semantic Web

IEEE Transactions on Knowledge and Data Engineering
A review of current defeasible reasoning implementations

The Knowledge Engineering Review
The Making of SPINdle

RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

International Symposium on Symbolic and Algebraic Computation
On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic

RuleML'10 Proceedings of the 2010 international conference on Semantic web rules

Relative expressiveness of defeasible logics

Theory and Practice of Logic Programming
Legal contractions: a logical analysis

Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
Picking up the best goal: an analytical study in defeasible logic

RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Computing temporal defeasible logic

RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web

Quantified Score

Hi-index	0.00

Visualization

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.