Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning

作者: Phan Minh Dung , Paolo Mancarella , Francesca Toni

DOI: 10.1007/3-540-45632-5_12

关键词:

摘要: We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of reasoning proposed in [1]. Appropriate instances provide concrete formalisms example logic programming negation as failure default logic.We propose (credulous sceptical) under different semantics, namely conventional stable model semantics more liberal partial or preferred extension semantics. study relationships between argue that, many meaningful cases, (simpler) can be used sound complete In cases still, (much simpler) compare existing literature.

参考文章(30)
Ken Satoh, A Top Down Proof Procedure for Default Logic by Using Abduction. european conference on artificial intelligence. pp. 65- 69 ,(1994)
Ken Satoh, Noboru Iwayama, A Query Evaluation Method for Abductive Logic Programming. JICSLP. pp. 671- 685 ,(1992)
Ilkka Niemelä, Patrik Simons, Efficient Implementation of the Well-founded and Stable Model Semantics JICSLP. pp. 289- 303 ,(1996)
A. C. Kakas, Phan Minh Dung, P. Mancarella, The acceptability semantics for logic programs international conference on logic programming. pp. 504- 519 ,(1994)
Antonis C. Kakas, Yannis Dimopoulos, Logic Programming without Negation as Failure. ILPS. pp. 369- 383 ,(1995)
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Finding admissible and preferred arguments can be very hard principles of knowledge representation and reasoning. pp. 53- 61 ,(2000)
A.C. Kakas, P. Mancarella, Preferred extensions are partial stable models Journal of Logic Programming. ,vol. 14, pp. 341- 348 ,(1992) , 10.1016/0743-1066(92)90015-U
Phan Minh Dung, Robert A. Kowalski, Francesca Toni, Synthesis of Proof Procedures for Default Reasoning logic-based program synthesis and transformation. pp. 313- 324 ,(1996) , 10.1007/3-540-62718-9_18
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Preferred Arguments are Harder to Compute than Stable Extension international joint conference on artificial intelligence. pp. 36- 43 ,(1999)