Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Representing argumentation schemes with constraint handling rules (CHR)

 
: Gordon, Thomas F.; Friedrich, Horst

:
Volltext urn:nbn:de:0011-n-4941320 (181 KByte PDF)
MD5 Fingerprint: b177152a12481322878a0baa1bdb9b34
Erstellt am: 17.5.2018


Bex, Floris (Ed.):
17th Workshop on Computational Models of Natural Argument, CMNA 2017. Proceedings. Online resource : Co-located with ICAIL 2017, London, UK, July 16, 2017
London, 2018 (CEUR Workshop Proceedings 2048)
S.30-37
Workshop on Computational Models of Natural Argument (CMNA) <17, 2017, London>
International Conference on Artificial Intelligence and Law (ICAIL) <16, 2017, London>
Englisch
Konferenzbeitrag, Elektronische Publikation
Fraunhofer FOKUS ()

Abstract
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, backward-chaining 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).

: http://publica.fraunhofer.de/dokumente/N-494132.html