( en | de | ru )

 

Disambiguation of "Simari, Guillermo Ricardo"

Author of the publication

copydeleteadd this publication to your clipboard
On the evolving relation between Belief Revision and Argumentation.

, , , and . Knowl. Eng. Rev., 26 (1): 35-43 (2011)

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.

Ricardo Guillermo Maliandi

Ricardo Guillermo Maliandi

Ricardo Guillermo Maliandi

Guillermo Medrano

Guillermo Balaguer

 

Other publications of authors with the same name

Sharing beliefs among agents with different degrees of credibility., , , and . Knowl. Inf. Syst., 50 (3): 999-1031 (2017)An Argument-Based Multi-agent System for Information Integration., and . ArgMAS, volume 6614 of Lecture Notes in Computer Science, page 171-189. Springer, (2010)Representing Defaults and Negative Information Without Negation-as-Failure., and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 437-451. Springer, (2006)Modelling Argument Accrual in Possibilistic Defeasible Logic Programming., , and . ECSQARU, volume 5590 of Lecture Notes in Computer Science, page 131-143. Springer, (2009)An Alternative Foundation for DeLP: Defeating Relations and Truth Values., , and . FoIKS, volume 4932 of Lecture Notes in Computer Science, page 42-57. Springer, (2008)Modelling argument accrual with possibilistic uncertainty in a logic programming setting., , and . Inf. Sci., (2013)Automating Defeasible Reasoning with Logic Programming., , , and . German-Argentinian Workshop on Information Technology, page 39-46. (1999)Modelling Shared Knowledge and Shared Knowledge Awareness in CSCL Scenarios Through Automated Argumentation Systems., , , and . CRIWG, volume 4715 of Lecture Notes in Computer Science, page 207-222. Springer, (2007)A structured argumentation system with backing and undercutting., , and . Eng. Appl. Artif. Intell., (2016)Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming., , and . LPNMR, volume 3662 of Lecture Notes in Computer Science, page 158-171. Springer, (2005)