From post

Argumentation-Based Semantics for Logic Programs with First-Order Formulae.

, , и . PRIMA, том 9862 из Lecture Notes in Computer Science, стр. 43-60. Springer, (2016)

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.

 

Другие публикации лиц с тем же именем

Dialectic proof procedures for assumption-based, admissible argumentation., , и . Artif. Intell., 170 (2): 114-159 (2006)An Argumentation-theoretic Foundation of Logic Programming. Journal of Logic Programming, 22 (2): 151--177 (1995)Partial Deduction of Logic Programs wrt Well-Founded Semantics., и . ALP, том 632 из Lecture Notes in Computer Science, стр. 384-402. Springer, (1992)On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games.. Artif. Intell., 77 (2): 321-358 (1995)An Axiomatic Analysis of Structured Argumentation for Prioritized Default Reasoning.. ECAI, том 263 из Frontiers in Artificial Intelligence and Applications, стр. 267-272. IOS Press, (2014)Some design guidelines for practical argumentation systems., , и . COMMA, том 216 из Frontiers in Artificial Intelligence and Applications, стр. 183-194. IOS Press, (2010)A Canonical Semantics for Structured Argumentation with Priorities.. COMMA, том 287 из Frontiers in Artificial Intelligence and Applications, стр. 263-274. IOS Press, (2016)On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming.. IJCAI, стр. 852-859. Morgan Kaufmann, (1993)A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation., и . IJCAI, стр. 746-751. (2009)On the strong completion of logic programs.. ALP, том 463 из Lecture Notes in Computer Science, стр. 158-172. Springer, (1990)