메뉴 건너뛰기




Volumn 1, Issue 2, 2010, Pages 147-177

Answer-set programming encodings for argumentation frameworks

Author keywords

abstract argumentation frameworks; answer set programming; implementation

Indexed keywords

ABSTRACT ARGUMENTATION; ANSWER SET; ANSWER-SET PROGRAMMING; ARGUMENTATION FRAMEWORKS; ARGUMENTATION SYSTEMS; DATA INTEGRATION; DECLARATIVE PROGRAMMING; ENCODINGS; IMPLEMENTATION; LOGIC PROGRAMS; PRACTICAL IMPORTANCE;

EID: 79956319649     PISSN: 19462166     EISSN: 19462174     Source Type: Journal    
DOI: 10.1080/19462166.2010.486479     Document Type: Article
Times cited : (144)

References (47)
  • 1
    • 0036108826 scopus 로고    scopus 로고
    • A reasoning model based on the production of acceptable arguments
    • DOI 10.1023/A:1014490210693
    • Amgoud, L., and Cayrol, C. (2002), 'AReasoning Model Based on the Production of AcceptableArguments', Annals of Mathematics and Artificial Intelligence, 34, 197-215. (Pubitemid 37133007)
    • (2002) Annals of Mathematics and Artificial Intelligence , vol.34 , Issue.1-3 , pp. 197-215
    • Amgoud, L.1    Cayrol, C.2
  • 5
    • 78049299048 scopus 로고    scopus 로고
    • Resolution-based argumentation semantics
    • eds. P. Besnard, S. Doutre, and A. Hunter, of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press
    • Baroni, P., and Giacomin, M. (2008a), 'Resolution-based Argumentation Semantics', in Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008), eds. P. Besnard, S. Doutre, and A. Hunter,Vol. 172 of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press, pp. 25-36.
    • (2008) Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008) , vol.172 , pp. 25-36
    • Baroni, P.1    Giacomin, M.2
  • 6
    • 84875941438 scopus 로고    scopus 로고
    • A systematic classification of argumentation frameworks where semantics agree
    • eds. P. Besnard, S. Doutre, andA., Hunter of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press
    • Baroni, P., and Giacomin, M. (2008b), 'A Systematic Classification of Argumentation Frameworks Where Semantics Agree', in Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008), eds. P. Besnard, S. Doutre, andA. Hunter,Vol. 172 of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press, pp. 37-48.
    • (2008) Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008) , vol.172 , pp. 37-48
    • Baroni, P.1    Giacomin, M.2
  • 7
    • 25144470160 scopus 로고    scopus 로고
    • SCC-recursiveness: A general schema for argumentation semantics
    • DOI 10.1016/j.artint.2005.05.006, PII S0004370205000962
    • Baroni, P., Giacomin, M., and Guida, G. (2005), 'SCC-Recursiveness:A General Schema for Argumentation Semantics', Artificial Intelligence, 168, 162-210. (Pubitemid 41338774)
    • (2005) Artificial Intelligence , vol.168 , Issue.1-2 , pp. 162-210
    • Baroni, P.1    Giacomin, M.2    Guida, G.3
  • 9
    • 0041340842 scopus 로고    scopus 로고
    • Persuasion in practical argument using value-based argumentation frameworks
    • Bench-Capon, T.J.M. (2003), 'Persuasion in Practical Argument Using Value-based Argumentation Frameworks', Journal of Logic and Computation, 13, 429-448.
    • (2003) Journal of Logic and Computation , vol.13 , pp. 429-448
    • Bench-Capon, T.J.M.1
  • 10
    • 34548021635 scopus 로고    scopus 로고
    • Argumentation in artificial intelligence
    • DOI 10.1016/j.artint.2007.05.001, PII S0004370207000793
    • Bench-Capon, T.J.M., and Dunne, P.E. (2007), 'Argumentation in Artificial Intelligence', Artificial Intelligence, 171, 619-641. (Pubitemid 47285079)
    • (2007) Artificial Intelligence , vol.171 , Issue.10-15 , pp. 619-641
    • Bench-Capon, T.J.M.1    Dunne, P.E.2
  • 12
    • 0035338876 scopus 로고    scopus 로고
    • A logic-based theory of deductive arguments
    • DOI 10.1016/S0004-3702(01)00071-6, PII S0004370201000716
    • Besnard, P., and Hunter,A. (2001), 'A Logic-based Theory of Deductive Arguments', Artificial Intelligence, 128, 203-235. (Pubitemid 32421514)
    • (2001) Artificial Intelligence , vol.128 , Issue.1-2 , pp. 203-235
    • Besnard, P.1    Hunter, A.2
  • 13
    • 68049120170 scopus 로고    scopus 로고
    • Encoding deductive argumentation in quantified boolean formulae
    • Besnard, P., Hunter, A., andWoltran, S. (2009), 'Encoding Deductive Argumentation in Quantified Boolean Formulae', Artificial Intelligence, 173, 1406-1423.
    • (2009) Artificial Intelligence , vol.173 , pp. 1406-1423
    • Besnard, P.1    Hunter, A.2    Woltran, S.3
  • 14
    • 84940516232 scopus 로고    scopus 로고
    • Semi-stable semantics
    • eds. P.E. Dunne and T.J.M. Bench-Capon of Frontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press
    • Caminada, M. (2006), 'Semi-Stable Semantics', in Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006), eds. P.E. Dunne and T.J.M. Bench-Capon, Vol. 144 of Frontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press, pp. 121-130.
    • (2006) Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006) , vol.144 , pp. 121-130
    • Caminada, M.1
  • 15
    • 84875920141 scopus 로고    scopus 로고
    • Political engagement through tools for argumentation
    • eds. P. Besnard, S. Doutre, and A. Hunter, of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press
    • Cartwright, D., and Atkinson, K. (2008), 'Political Engagement Through Tools for Argumentation', in Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008), eds. P. Besnard, S. Doutre, and A. Hunter, Vol. 172 of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press, pp. 116-127.
    • (2008) Proceedings of the 2nd Conference on Computational Models of Argument (COMMA2008) , vol.172 , pp. 116-127
    • Cartwright, D.1    Atkinson, K.2
  • 18
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • Dantsin, E., Eiter, T., Gottlob, G., and Voronkov, A. (2001), 'Complexity and Expressive Power of Logic Programming', ACM Computing Surveys, 33, 374-425. (Pubitemid 33768487)
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4
  • 19
    • 0030408302 scopus 로고    scopus 로고
    • Graph theoretical structures in logic programs and default theories
    • DOI 10.1016/S0304-3975(96)00004-7, PII S0304397596000047
    • Dimopoulos, Y., and Torres, A. (1996), 'Graph Theoretical Structures in Logic Programs and Default Theories', Theoretical Computer Science, 170, 209-244. (Pubitemid 126411634)
    • (1996) Theoretical Computer Science , vol.170 , Issue.1-2 , pp. 209-244
    • Dimopoulos, Y.1    Torres, A.2
  • 20
    • 0029368659 scopus 로고
    • On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
    • Dung, P.M. (1995), 'On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games', Artificial Intelligence, 77, 321-358.
    • (1995) Artificial Intelligence , vol.77 , pp. 321-358
    • Dung, P.M.1
  • 21
    • 34548024853 scopus 로고    scopus 로고
    • Computing ideal sceptical argumentation
    • DOI 10.1016/j.artint.2007.05.003, PII S000437020700080X
    • Dung, P.M., Mancarella, P., and Toni, F. (2007), 'Computing Ideal Sceptical Argumentation', Artificial Intelligence, 171, 642-674. (Pubitemid 47285080)
    • (2007) Artificial Intelligence , vol.171 , Issue.10-15 , pp. 642-674
    • Dung, P.M.1    Mancarella, P.2    Toni, F.3
  • 24
    • 56649089518 scopus 로고    scopus 로고
    • Computational complexity of semi-stable semantics in abstract argumentation frameworks
    • eds. S. Hölldobler, C. Lutz, and H.Wansing. of LNCS, Dresden, Germany: Springer
    • Dunne, P.E., and Caminada, M. (2008), 'Computational Complexity of Semi-Stable Semantics in Abstract Argumentation Frameworks', in Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA 2008), eds. S. Hölldobler, C. Lutz, and H.Wansing, Vol. 5293 of LNCS, Dresden, Germany: Springer, pp. 153-165.
    • (2008) Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA 2008) , vol.5293 , pp. 153-165
    • Dunne, P.E.1    Caminada, M.2
  • 25
    • 79957611145 scopus 로고    scopus 로고
    • Technical note: Complexity of stage semantics in argumentation frameworks
    • Technische Universität Wien, Database and Artificial Intelligence Group
    • Dvorák, W., and Woltran, S. (2009), 'Technical Note: Complexity of Stage Semantics in Argumentation Frameworks', Technical Report DBAI-TR-2009-66, Technische Universität Wien, Database and Artificial Intelligence Group.
    • (2009) Technical Report DBAI-TR-2009-66
    • Dvorák, W.1    Woltran, S.2
  • 26
    • 49949116373 scopus 로고    scopus 로고
    • Algorithms for effective argumentation in classical propositional logic: A connection graph approach
    • eds. S. Hartmann and G. Kern-Isberner, February, of Lecture Notes in Computer Science, Pisa, Italy: Springer
    • Efstathiou, V., and Hunter, A. (2008), 'Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach', in Proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, (FoIKS 2008), eds. S. Hartmann and G. Kern-Isberner, February, Vol. 4932 of Lecture Notes in Computer Science, Pisa, Italy: Springer, pp. 272-290.
    • (2008) Proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, (FoIKS 2008) , vol.4932 , pp. 272-290
    • Efstathiou, V.1    Hunter, A.2
  • 27
    • 84940487242 scopus 로고    scopus 로고
    • Reasoning in argumentation frameworks using quantified boolean formulas
    • eds. P.E. Dunne and T.J.M. Bench-Capon of Frontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press
    • Egly, U., and Woltran, S. (2006), 'Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas', in Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006), eds. P.E. Dunne and T.J.M. Bench-Capon, Vol. 144 of Frontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press, pp. 133-144.
    • (2006) Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006) , vol.144 , pp. 133-144
    • Egly, U.1    Woltran, S.2
  • 28
    • 31644443816 scopus 로고    scopus 로고
    • Towards automated integration of guess and check programs in answer set programming: A meta-interpreter and applications
    • DOI 10.1017/S1471068405002577, PII S1471068405002577
    • Eiter, T., and Polleres, A. (2006), 'Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications', Theory and Practice of Logic Programming, 6, 23-60. (Pubitemid 43170521)
    • (2006) Theory and Practice of Logic Programming , vol.6 , Issue.1-2 , pp. 23-60
    • Eiter, T.1    Polleres, A.2
  • 33
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • Gelfond, M., and Lifschitz, V. (1991), 'Classical Negation in Logic Programs and Disjunctive Databases', New Generation Computing, 9, 365-386.
    • (1991) New Generation Computing , vol.9 , pp. 365-386
    • Gelfond, M.1    Lifschitz, V.2
  • 36
    • 64549136645 scopus 로고    scopus 로고
    • Reasoning about preferences in argumentation frameworks
    • Modgil, S. (2009), 'Reasoning about Preferences inArgumentation Frameworks', Artificial Intelligence, 173, 901-934.
    • (2009) Artificial Intelligence , vol.173 , pp. 901-934
    • Modgil, S.1
  • 37
    • 0033260715 scopus 로고    scopus 로고
    • Logic programming with stable model semantics as a constraint programming paradigm
    • Niemelä, I. (1999), 'Logic Programming with Stable Model Semantics as a Constraint Programming Paradigm', Annals of Mathematics and Artificial Intelligence, 25, 241-273.
    • (1999) Annals of Mathematics and Artificial Intelligence , vol.25 , pp. 241-273
    • Niemelä, I.1
  • 40
    • 33947208383 scopus 로고    scopus 로고
    • Inferring acceptable arguments with Answer Set Programming
    • DOI 10.1109/ENC.2005.26, 1592219, Proceedings - Sixth Mexican International Conference on Computer Science, ENC 2005
    • Osorio, M., Zepeda, C., Nieves, J.C., and Cortés, U. (2005), 'Inferring Acceptable Arguments with Answer Set Programming', in Proceedings of the 6th Mexican International Conference on Computer Science (ENC 2005), Puebla, Mexico: IEEE Computer Society, pp. 198-205. (Pubitemid 46415602)
    • (2005) Proceedings of the Mexican International Conference on Computer Science , vol.2005 , pp. 198-205
    • Osorio, M.1    Zepeda, C.2    Nieves, J.C.3    Cortes, U.4
  • 42
    • 84875943054 scopus 로고    scopus 로고
    • Dungine: A Java dung reasoner
    • eds. P. Besnard, S. Doutre, and A Hunter, of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press
    • South, M., Vreeswijk, G., and Fox, J. (2008), 'Dungine: A Java Dung Reasoner', in Proceedings of the 2nd Conference on Computational Models of Argument (COMMA 2008), eds. P. Besnard, S. Doutre, and A. Hunter, Vol. 172 of Frontiers in Artificial Intelligence and Applications, Toulouse, France: IOS Press, pp. 360-368.
    • (2008) Proceedings of the 2nd Conference on Computational Models of Argument (COMMA 2008) , vol.172 , pp. 360-368
    • South, M.1    Vreeswijk, G.2    Fox, J.3
  • 43
    • 0017013056 scopus 로고
    • The semantics of predicate logic as a programming language
    • van Emden, M., and Kowalski, R. (1976), 'The Semantics of Predicate Logic as a Programming Language', Journal of the ACM, 23, 733-742.
    • (1976) Journal of the ACM , vol.23 , pp. 733-742
    • Van Emden, M.1    Kowalski, R.2
  • 46
    • 84940469389 scopus 로고    scopus 로고
    • An algorithm to compute minimally grounded and admissible defence sets in argument systems
    • eds. P.E. Dunne andT.J.M. Bench-Capon, of Frontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press
    • Vreeswijk, G. (2006), 'An Algorithm to Compute Minimally Grounded and Admissible Defence Sets in Argument Systems', in Proceedings of the 1st Conference on Computational Models of Argument (COMMA2006), eds. P.E. Dunne andT.J.M. Bench-Capon,Vol. 144 ofFrontiers in Artificial Intelligence and Applications, Liverpool, UK: IOS Press, pp. 109-120.
    • (2006) Proceedings of the 1st Conference on Computational Models of Argument (COMMA2006) , vol.144 , pp. 109-120
    • Vreeswijk, G.1
  • 47
    • 67650695194 scopus 로고    scopus 로고
    • Computing argumentation semantics in answer set programming
    • eds. H. Hattori, T. Kawamura, T. Idé, M. Yokoo, and Y. Murakami , of LNCS, Asahikawa, Japan: Springer
    • Wakaki, T., and Nitta, K. (2008), 'Computing Argumentation Semantics in Answer Set Programming', in New Frontiers in Artificial Intelligence (JSAI 2008), Conference and Workshops, eds. H. Hattori, T. Kawamura, T. Idé, M. Yokoo, and Y. Murakami, Vol. 5447 of LNCS, Asahikawa, Japan: Springer, pp. 254-269.
    • (2008) New Frontiers in Artificial Intelligence (JSAI 2008) Conference and Workshops , vol.5447 , pp. 254-269
    • Wakaki, T.1    Nitta, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.