Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming
Lecture Notes in Computer Science - Germany
doi 10.1007/11546207_13
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2005
Authors
Publisher
Springer Berlin Heidelberg