A Flexible Framework for Defeasible Logics
Abstract
Logics 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.
Cite
Text
Antoniou et al. "A Flexible Framework for Defeasible Logics." AAAI Conference on Artificial Intelligence, 2000. doi:10.48550/arxiv.cs/0003013Markdown
[Antoniou et al. "A Flexible Framework for Defeasible Logics." AAAI Conference on Artificial Intelligence, 2000.](https://mlanthology.org/aaai/2000/antoniou2000aaai-flexible/) doi:10.48550/arxiv.cs/0003013BibTeX
@inproceedings{antoniou2000aaai-flexible,
title = {{A Flexible Framework for Defeasible Logics}},
author = {Antoniou, Grigoris and Billington, David and Governatori, Guido and Maher, Michael J.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2000},
pages = {405-410},
doi = {10.48550/arxiv.cs/0003013},
url = {https://mlanthology.org/aaai/2000/antoniou2000aaai-flexible/}
}