@dblp

Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming.

, , and . LPNMR, volume 3662 of Lecture Notes in Computer Science, page 158-171. Springer, (2005)

Links and resources

Tags