Defeasible Reasoning via Datalog${}^{\neg }$

Abstract

We address the problem of compiling defeasible theories to Datalog${}^{\neg }$ programs. We prove the correctness of this compilation, for the defeasible logic $DL({\partial }_{||})$, but the techniques we use apply to many other defeasible logics. Structural properties of $DL({\partial }_{||})$ 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${}^{\neg }$ implementations.

Under consideration in Theory and Practice of Logic Programming (TPLP)

References in corpus (2)

• Predicate Logic as a Modelling Language: The IDP System
• A Model-Theoretic Semantics for Defeasible Logic