Representing Argumentation Schemes with Constraint Handling Rules (CHR)

We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentation schemes in informal logic and philosophy, and serve as executable specifications for automatically constructing arguments, when applied to a set of assumptions. Since argumentation schemes are defeasible inference rules, both premises and conclusions of schemes can be second-order schema variables, i.e. without a fixed predicate symbol. Thus, while particular schemes can be and have been implemented in computer programs, in general argumentation schemes cannot be represented as executable specifications using logic programming languages based on first-order logic, such as Prolog. Moreover, even if the conclusion (head) of Prolog rules could be second-order variables, a depth-first, backwardchaining search strategy, as typically used in logic programming, would usually cause such programs to not terminate, since every goal would match the head of such a scheme, including all goals created by instantiating the body of the same scheme. The language for representing argumentation schemes presented here, for the purpose of automatically constructing arguments, uses Constraint Handling Rules (CHR), a declarative, Turing complete, forwards-chaining, rule-based programming language introduced by Thom Fruhwirth in 1991. We also report on a legal pilot application, called DUCK, which uses the system in a web application to help cloud service providers comply with the new European General Data Protection Regulation (GDPR).

[1]  Douglas Walton,et al.  Similarity, precedent and argument from analogy , 2010, Artificial Intelligence and Law.

[2]  Slim Abdennadher,et al.  Introduction to the Special Issue on Constraint Handling Rules , 2005, Theory Pract. Log. Program..

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

[4]  Trevor J. M. Bench-Capon,et al.  Towards a rule-based representation of open texture in law , 1985 .

[5]  Douglas Walton,et al.  Formalizing Balancing Arguments , 2016, COMMA.

[6]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

[7]  Edward H. Shortliffe,et al.  Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project (The Addison-Wesley series in artificial intelligence) , 1984 .

[8]  Trevor J. M. Bench-Capon,et al.  Using Argumentation to Structure E-Participation in Policy Making , 2015, Trans. Large Scale Data Knowl. Centered Syst..

[9]  John L. Pollock,et al.  Defeasible Reasoning in OSCAR , 2000, ArXiv.

[10]  Thom W. Frühwirth,et al.  Constraint Handling Rules , 2009, Constraint Programming.

[11]  Trevor J. M. Bench-Capon,et al.  Practical reasoning as presumptive argumentation using action based alternating transition systems , 2007, Artif. Intell..

[12]  Henry Prakken,et al.  The Carneades model of argument and burden of proof , 2007, Artif. Intell..

[13]  Chris Reed,et al.  Argumentation Schemes , 2008 .

[14]  Thomas F. Gordon,et al.  Constructing arguments with a computational model of an argumentation scheme for legal rules: interpreting legal rules as reasoning policies , 2007, ICAIL.

[15]  Martin Sulzmann,et al.  A concurrent constraint handling rules implementation in Haskell with software transactional memory , 2007, DAMP '07.

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

[17]  Bart Demoen,et al.  The computational power and complexity of constraint handling rules , 2009, TOPL.

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

[19]  Douglas Walton,et al.  Argument Mining by Applying Argumentation Schemes , 2012 .

[20]  Thom W. Frühwirth,et al.  Terminological Reasoning with Constraint Handling Rules , 1993, PPCP.

[21]  Douglas Walton,et al.  Legal reasoning with argumentation schemes , 2009, ICAIL.

[22]  Chris Reed,et al.  Araucaria: Software for Puzzles in Argument Diagramming and XML , 2001 .

[23]  Marek J. Sergot,et al.  A logic-based calculus of events , 1989, New Generation Computing.