Computing the Acceptability Semantics
作者： Francesca Toni , Antonios C. Kakas
关键词:
摘要: We present a proof theory and procedure for nonmonotonic reasoning based on the acceptability semantics logic programming, formulated in an argumentation framework. These are defined as generalisations of corresponding theories procedures stable preferred extension semantics. In turn, these can be seen Eshghi-Kowalski abductive programming.
springer.com
core.ac.uk
sci-hub.st 参考文章(9)
Antonis C. Kakas, Paolo Mancarella, Stable Theories for Logic Programs. ISLP. pp. 85- 100 ,(1991)
A. C. Kakas, Phan Minh Dung, P. Mancarella, The acceptability semantics for logic programs international conference on logic programming. pp. 504- 519 ,(1994)
Bernhard Nebel, Gerhard Lakemeyer, Foundations of Knowledge Representation and Reasoning ,(1994)
Phan Minh Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming international joint conference on artificial intelligence. pp. 852- 857 ,(1993)
A. C. Kakas, Default Reasoning via Negation as Failure european conference on artificial intelligence. pp. 160- 178 ,(1994) , 10.1007/3-540-58107-3_10
A. C. KAKAS, R. A. KOWALSKI, F. TONI, Abductive Logic Programming Journal of Logic and Computation. ,vol. 2, pp. 719- 770 ,(1992) , 10.1093/LOGCOM/2.6.719
David Poole, A logical framework for default reasoning Artificial Intelligence. ,vol. 36, pp. 27- 47 ,(1988) , 10.1016/0004-3702(88)90077-X
José Júlio Alferes, Luís Moniz Pereira, An Argumentation Theoretic Semantics Based on Non-Refutable Falsity international conference on lightning protection. pp. 3- 22 ,(1994) , 10.1007/BFB0030657
Phan Minh Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games Artificial Intelligence. ,vol. 77, pp. 321- 357 ,(1995) , 10.1016/0004-3702(94)00041-X