A flexible framework for defeasible logics

Simple item page
dc.creatorAntoniou, G.
dc.creatorBilligton, D.
dc.creatorGovernatori, G.
dc.creatorMaher, M. J.
dc.date2000-03-07
dc.date.accessioned2026-07-25T16:26:34Z
dc.descriptionLogics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several logics and, when necessary, combine the representations. In general, such an approach results in a very difficult problem of combination. However, if we can choose the logics from a uniform framework then the problem of combining them is greatly simplified. In this paper, we develop such a framework for defeasible logics. It supports all defeasible logics that satisfy a strong negation principle. We use logic meta-programs as the basis for the framework.
dc.descriptionProceedings of 8th International Workshop on Non-Monotonic Reasoning, April 9-11, 2000, Breckenridge, Colorado
dc.identifierhttps://arxiv.org/abs/cs/0003013
dc.identifierhttp://arxiv.org/abs/cs/0003013
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/41377
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2.3; D.1.6
dc.titleA flexible framework for defeasible logics
dc.typetext

Files

Collections

arXiv