Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming

作者: Mauricio Osorio , Juan Díaz , Alejandro Santoyo

DOI: 10.1007/978-3-319-13647-9_38

关键词:

摘要: Dung’s abstract argumentation frameworks has been object of intense study not just for its relationship with logical reasoning but also uses within artificial intelligence. One research branch in focused on finding new methods computing different semantics. We present a novel method, to the best our knowledge, preferred semantics using 0-1 integer programming, and experimentally compare it two answer set programming approaches. Our results indicate that this method performed well.

参考文章(24)
Gerhard Brewka, Thomas Eiter, Mirosław Truszczyński, Answer set programming at a glance Communications of the ACM. ,vol. 54, pp. 92- 103 ,(2011) , 10.1145/2043174.2043195
T.J.M. Bench-Capon, Paul E. Dunne, Argumentation in artificial intelligence Artificial Intelligence. ,vol. 171, pp. 619- 641 ,(2007) , 10.1016/J.ARTINT.2007.05.001
Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio, Preferred extensions as stable models Theory and Practice of Logic Programming. ,vol. 8, pp. 527- 543 ,(2008) , 10.1017/S1471068408003359
Stefan Woltran, Johannes P. Wallner, Implementing Abstract Argumentation - A Survey ,(2013)
Mauricio Osorio, Alejandro Santoyo, Preferred Extensions as Minimal Models of Clark's Completion Semantics Research on computing science. ,vol. 68, pp. 57- 68 ,(2013) , 10.13053/RCS-68-1-5
L. A. Wolsey, G. L. Nemhauser, Integer programming ,(1972)
Rina Dechter, None, Constraint Processing ,(2003)
Juan Díaz, Mauricio Osorio, Alejandro Santoyo, Computing Semi-Stable Semantics of AF by 0-1 Integer Programming. LANMR. pp. 1- 10 ,(2014)