DeepAI AI Chat
Log In Sign Up

A flexible framework for defeasible logics

by   G. Antoniou, et al.

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.


page 1

page 2

page 3

page 4


Goldblatt-Thomason Theorems for Modal Intuitionistic Logics

We prove Goldblatt-Thomason theorems for frames and models of a wide var...

A continuum of incomplete intermediate logics

This paper generalizes the 1977 paper of V.B. Shehtman, which constructe...

A Game Theoretical Semantics for Logics of Nonsense

Logics of non-sense allow a third truth value to express propositions th...

Choice Logics and Their Computational Properties

Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are fo...

Rapid Prototyping Formal Systems in MMT: 5 Case Studies

Logical frameworks are meta-formalisms in which the syntax and semantics...

Intelligence Graph

In fact, there exist three genres of intelligence architectures: logics ...

Connectives in Quantum and other Cumulative Logics

Cumulative logics are studied in an abstract setting, i.e., without conn...