Defeasible Reasoning via Datalog^neg

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.