Propositional defeasible logic has linear complexity, (2001)

by M J Maher
Venue:Theory and Practice of Logic Programming