| Revue: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000423345 |
| ISSN: | 1405-5546 |
| Autores: | Osorio, Mauricio1 Díaz, Juan1 Santoyo, Alejandro2 |
| Instituciones: | 1Universidad de las Américas, Cholula, Puebla. México 2Universidad Autónoma de Querétaro, Querétaro. México |
| Año: | 2017 |
| Periodo: | Jul-Sep |
| Volumen: | 21 |
| Número: | 3 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Analítico, descriptivo |
| Resumen en inglés | Dung’s abstract argumentation has been an object of intense study not only due to its relationship with logical reasoning but also because of its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We present a novel method, to the best of our knowledge, for computing semi-stable semantics using 0-1 integer programming. This approach captures the notions of conflict freeness, acceptability, maximality with regard to set inclusion, etc., by 0-1 integer constraints. Additionally, this work also presents an empirical experiment to compare our novel approach with an answer set programming approach. Our results indicate that the new method performed well, and it has a great opportunity space for improving |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Inteligencia artificial, Trama de argumentación, Programación binaria, Answer set programming, Semántica semiestable |
| Keyword: | Artificial intelligence, Argumentation frameworks, Binary programming, Answer set programming, Semi-stable semantics |
| Texte intégral: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
