Relative Expressiveness of Defeasible Logics

10/05/2012
by   Michael Maher, et al.
0

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulations showing that logics in DL with and without the capability of team defeat are equally expressive. We also show that logics that handle ambiguity differently -- ambiguity blocking versus ambiguity propagating -- have distinct expressiveness, with neither able to simulate the other under a different formulation of expressiveness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2021

Relative Expressiveness of Defeasible Logics II

(Maher 2012) introduced an approach for relative expressiveness of defea...
research
01/09/2014

A logic for reasoning about ambiguity

Standard models of multi-agent modal logic do not capture the fact that ...
research
06/21/2021

Defeasible Reasoning via Datalog^

We address the problem of compiling defeasible theories to Datalog^ prog...
research
04/30/2010

Simple Type Theory as Framework for Combining Logics

Simple type theory is suited as framework for combining classical and no...
research
06/23/2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version)

We consider the family of guarded and unguarded ordered logics, that con...
research
08/11/2021

Approximating Defeasible Logics to Improve Scalability

Defeasible rules are used in providing computable representations of leg...
research
04/05/2022

Separability and harmony in ecumenical systems

The quest of smoothly combining logics so that connectives from classica...

Please sign up or login with your details

Forgot password? Click here to reset