An algorithm for computing semi-stable semantics

Article English OPEN
Caminada, Martin (2007)

The semi-stable semantics for formal argumentation has been introduced as a way of approximating stable semantics in situations where no stable extensions exist. Semi-stable semantics can be located between stable semantics and preferred semantics in the sense that every stable extension is a semi-stable extension and every semi-stable extension is a preferred extension. Moreover, in situations where at least one stable extension exists, the semi-stable extensions are equal to the stable extensions. In this paper we provide an outline of an algorithm for computing the semi-stable extensions, given an argumentation framework. We show that with a few modifications, the algorithm can also be used for computing stable and preferred semantics.
  • References (7)

    1. Vreeswijk, G.: An algorithm to compute minimally grounded and admissible defence sets in argument systems. In Dunne, P., BenchCapon, T., eds.: Computational Models of Argument; Proceedings of COMMA 2006, IOS (2006) 109-120

    2. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (1995) 321-357

    3. Caminada, M.: Semi-stable semantics. In Dunne, P., BenchCapon, T., eds.: Computational Models of Argument; Proceedings of COMMA 2006, IOS Press (2006) 121-130

    4. Caminada, M.: An algorithm for computing semi-stable semantics. Technical Report Technical Report UU-CS-2007-010, Utrecht University (2007) http://www.cs.uu.nl/˜martinc/algorithm techreport.pdf.

    5. Caminada, M.: On the issue of reinstatement in argumentation. In Fischer, M., van der Hoek, W., Konev, B., Lisitsa, A., eds.: Logics in Artificial Intelligence; 10th European Conference, JELIA 2006, Springer (2006) 111-123 LNAI 4160.

    6. Pollock, J.L.: Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge, MA (1995)

    7. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4) (1991) 365-385

  • Metrics
    0
    views in OpenAIRE
    0
    views in local repository
    8
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    Online Research @ Cardiff - IRUS-UK 0 8
Share - Bookmark