Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming (2005)
by
Carlos I. Chesnevar
,
Guillermo R. Simari
,
Lluis Godo
| Venue: | LNAI/LNCS Series (Proc. 8th Intl. LPNMR Conf |
| Citations: | 19 - 10 self |
BibTeX
@INPROCEEDINGS{Chesnevar05computingdialectical,
author = {Carlos I. Chesnevar and Guillermo R. Simari and Lluis Godo},
title = {Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming},
booktitle = {LNAI/LNCS Series (Proc. 8th Intl. LPNMR Conf},
year = {2005},
pages = {158--171},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Solving a P-DeLP query...
