A flexible framework for defeasible logics

TL;DR

This paper introduces a unified, flexible framework for defeasible logics using logic meta-programs, enabling easier combination of different logics that adhere to a strong negation principle.

Contribution

It develops a uniform framework for defeasible logics based on logic meta-programs, simplifying their combination and broadening applicability.

Findings

Supports all defeasible logics satisfying strong negation

Simplifies the combination of multiple defeasible logics

Provides a meta-programming basis for defeasible logic frameworks

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.