SciELO - Scientific Electronic Library Online

 
vol.21 issue3Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple GraphsNumerical Investigation of the Droplet Behavior in Cascades Using a Finite Volume Method author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

On-line version ISSN 2007-9737Print version ISSN 1405-5546

Abstract

OSORIO, Mauricio; DIAZ, Juan  and  SANTOYO, Alejandro. 0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks. Comp. y Sist. [online]. 2017, vol.21, n.3, pp.457-471. ISSN 2007-9737.  https://doi.org/10.13053/cys-21-3-2230.

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.

Keywords : Argumentation frameworks; binary program-ming; answer set programming; semi-stable semantics.

        · text in English     · English ( pdf )