Semantic-based construction of arguments: An answer set programming approach

In this paper, we introduce an argumentation approach which takes an extended logic program as input and gives a set of arguments with the respective disagreements among them as output. We establis ...

[1]  Jürgen Dix,et al.  A general theory of confluent rewriting systems for logic programming and its applications , 2001, Ann. Pure Appl. Log..

[2]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[3]  Alexander A. Razborov,et al.  Why are there so many loop formulas? , 2006, TOCL.

[4]  Philippe Besnard,et al.  Bridging the Gap between Abstract Argumentation Systems and Logic , 2009, SUM.

[5]  Yining Wu,et al.  Between Argument and Conclusion - Argument-based Approaches to Discussion, Inference and Uncertainty , 2012 .

[6]  Didier Dubois,et al.  Reasoning in inconsistent stratified knowledge bases , 1996, Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96).

[7]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[8]  Michael J. Maher,et al.  Argumentation Semantics for Defeasible Logic , 2004, J. Log. Comput..

[9]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[10]  Henry Prakken,et al.  The ASPIC+ framework for structured argumentation: a tutorial , 2014, Argument Comput..

[11]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[12]  Jürgen Dix,et al.  Partial Evaluation and Relevance for Approximations of Stable Semantics , 1994, ISMIS.

[13]  Pietro Baroni,et al.  An introduction to argumentation semantics , 2011, The Knowledge Engineering Review.

[14]  Chris Reed,et al.  TOAST: Online ASPIC+ implementation , 2012, COMMA.

[15]  Ulises Cortés,et al.  An Overview of Argumentation Semantics , 2008, Computación y Sistemas.

[16]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[17]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..

[18]  Martin Caminada,et al.  On the evaluation of argumentation formalisms , 2007, Artif. Intell..

[19]  Phan Minh Dung,et al.  Assumption-Based Argumentation , 2009, Argumentation in Artificial Intelligence.

[20]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[21]  John McCarthy,et al.  Programs with common sense , 1960 .

[22]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[23]  Vladimir Lifschitz,et al.  Answer Set Programming , 2019 .

[24]  Phan Minh Dung,et al.  Closure and Consistency In Logic-Associated Argumentation , 2014, J. Artif. Intell. Res..

[25]  Guillermo Ricardo Simari,et al.  Defeasible logic programming: an argumentative approach , 2003, Theory and Practice of Logic Programming.

[26]  David Scott Warren,et al.  XSB: Extending Prolog with Tabled Logic Programming , 2010, Theory and Practice of Logic Programming.

[27]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[28]  Henry Prakken,et al.  Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[29]  Francesca Toni,et al.  An Assumption-Based Framework for Non-Monotonic Reasoning , 1993, LPNMR.

[30]  Martin Caminada,et al.  On the equivalence between logic programming semantics and argumentation semantics , 2015, Int. J. Approx. Reason..

[31]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[32]  Paul E. Dunne,et al.  Semi-stable semantics , 2006, J. Log. Comput..

[33]  Mauricio Osorio,et al.  Logics with Common Weak Completions , 2006, J. Log. Comput..

[34]  A.R.C.S. A. H. Loveless.  What is an abstract ? , 1990 .

[35]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[36]  Chitta Baral.  Knowledge Representation, Reasoning and Declarative Problem Solving: Query answering and answer set computing systems , 2003 .

[37]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[38]  Anthony Hunter,et al.  Algorithms for generating arguments and counterarguments in propositional logic , 2011, Int. J. Approx. Reason..

[39]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[40]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[41]  Dorian Gaertner,et al.  CaSAPI : a system for credulous and sceptical argumentation , 2007 .

[42]  Chitta Baral,et al.  Representing Concurrent Actions in Extended Logic Programming , 1993, IJCAI.

[43]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[44]  Claudette Cayrol,et al.  A Reasoning Model Based on the Production of Acceptable Arguments , 2002, Annals of Mathematics and Artificial Intelligence.

[45]  Donald Nute,et al.  Defeasible Logic , 1994, INAP.

[46]  Melvin Fitting,et al.  Fixpoint Semantics for Logic Programming a Survey , 2001, Theor. Comput. Sci..

[47]  Neophytos Demetriou.  Argumentation with Abduction , 2005 .

[48]  Anthony Hunter,et al.  Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach , 2008, FoIKS.

[49]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[50]  G. Aldo Antonelli,et al.  Non-monotonic Logic , 2001 .

[51]  Francesca Toni,et al.  Justifying answer sets using argumentation , 2016, Theory Pract. Log. Program..

[52]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[53]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

[54]  Gerhard Brewka.  Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..

[55]  Drew McDermott,et al.  Nonmonotonic Logic II: Nonmonotonic Modal Theories , 1982, JACM.

[56]  Phan Minh Dung,et al.  Dialectic proof procedures for assumption-based, admissible argumentation , 2006, Artif. Intell..

[57]  Dov M. Gabbay,et al.  Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming , 2009, Stud Logica.

[58]  Sanjay Modgil,et al.  Proof Theories and Algorithms for Abstract Argumentation Frameworks , 2009, Argumentation in Artificial Intelligence.

[59]  Henry Prakken,et al.  An abstract framework for argumentation with structured arguments , 2010, Argument Comput..

[60]  Didier Dubois,et al.  Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case , 1997, Stud Logica.

[61]  Henry Prakken,et al.  A general account of argumentation with preferences , 2013, Artif. Intell..

[62]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[63]  Teodor C. Przymusinski.  On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.

[64]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[65]  Guillermo Ricardo Simari,et al.  Towards an argument interchange format , 2006, The Knowledge Engineering Review.

[66]  Miguel Calejo.  InterProlog: Towards a Declarative Embedding of Logic Programming in Java , 2004, JELIA.

[67]  Francesca Toni,et al.  Argumentation and answer set programming , 2011 .

[68]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[69]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties , 1995, Fundam. Informaticae.