Defeasible Reasoning via Datalog^

06/21/2021
by   Michael J. Maher, et al.
0

We address the problem of compiling defeasible theories to Datalog^ programs. We prove the correctness of this compilation, for the defeasible logic DL(∂_||), but the techniques we use apply to many other defeasible logics. Structural properties of DL(∂_||) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog^ implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2020

An Under-Approximate Relational Logic: Heralding Logics of Insecurity, Incorrect Implementation More

Recently, authors have proposed under-approximate logics for reasoning a...
research
08/11/2021

Approximating Defeasible Logics to Improve Scalability

Defeasible rules are used in providing computable representations of leg...
research
04/08/2019

Verification Logics for Quantum Programs

We survey the landscape of Hoare logics for quantum programs. We review ...
research
10/05/2012

Relative Expressiveness of Defeasible Logics

We address the relative expressiveness of defeasible logics in the frame...
research
03/19/2023

Logic of Differentiable Logics: Towards a Uniform Semantics of DL

Differentiable logics (DL) have recently been proposed as a method of tr...
research
01/02/2020

Rethinking Defeasible Reasoning: A Scalable Approach

Recent technological advances have led to unprecedented amounts of gener...
research
08/20/2018

A continuum of incomplete intermediate logics

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

Please sign up or login with your details

Forgot password? Click here to reset