Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming.

Carlos Ivn Chesevar, Guillermo Ricardo Simari, Llus Godo

Browse the full LPNMR paper archive.