Checking the Validity of Rule-Based Arguments Grounded in Cases: A Computational ApproachHeng Zheng, Minghui Xiong, Bart VerheijOne puzzle studied in AI & Law is how arguments, rules and cases are formally connected. Recently a formal theory was proposed formalizing how the validity of arguments based on rules can be grounded in cases. Three kinds of argument validity were distinguished: coherence, presumptive validity and conclusiveness. In this paper the theory is implemented in a Prolog program, used to evaluate a previously developed model of Dutch tort law. We also test the theory and its implementation with a new case study modeling Chinese copyright infringement law. In this way we illustrate that by the use of the implementation the process of modeling becomes more efficient and less error-prone.Manuscript (in PDF-format) Reference: Zheng, H., Xiong, M., & Verheij, B. (2018). Checking the Validity of Rule-Based Arguments Grounded in Cases: A Computational Approach. Legal Knowledge and Information Systems. JURIX 2018: The Thirty-first Annual Conference (ed. Palmirani, M.), 220-224. Amsterdam: IOS Press. http://dx.doi.org/10.3233/978-1-61499-935-5-220 Bart Verheij's home page - research - publications |