( en | de | ru )

 

Disambiguation of "Dung, Phan Minh"

Author of the publication

copydeleteadd this publication to your clipboard
An Axiomatic Analysis of Structured Argumentation for Prioritized Default Reasoning.

. ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, page 267-272. IOS Press, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dung Phan Minh

Phan-Tien Dung

Phan Xuan Minh

Thi My-Dung Phan

Thi Minh Diep Phan

 

Other publications of authors with the same name

A dialectic procedure for sceptical, assumption-based argumentation, , and . Proc. of the 1st International Conference on Computational Models of Arguments (COMMA 2006), page 145--156. Liverpool, UK, IOS Press, (2006)A Canonical Semantics for Structured Argumentation with Priorities.. COMMA, volume 287 of Frontiers in Artificial Intelligence and Applications, page 263-274. IOS Press, (2016)A Fixpoint Approach to Declarative Semantics of Logic Programs., and . NACLP, page 604-625. MIT Press, (1989)The Acceptability Semantics for Logic Programs., , and . ICLP, page 504-519. MIT Press, (1994)Argumentation for Practical Reasoning: An Axiomatic Approach.. PRIMA, volume 9862 of Lecture Notes in Computer Science, page 20-39. Springer, (2016)On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming.. IJCAI, page 852-859. Morgan Kaufmann, (1993)A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation., and . IJCAI, page 746-751. (2009)Declarative Semantics of Hypothetical Logic Programming with Negation as Failure.. ELP, volume 660 of Lecture Notes in Computer Science, page 45-58. Springer, (1992)Knowledge base dynamics, Abduction and Databases updates., and . J. Appl. Non Class. Logics, 5 (1): 51-76 (1995)On the strong completion of logic programs.. ALP, volume 463 of Lecture Notes in Computer Science, page 158-172. Springer, (1990)