Hardness of case-based decisions: A formal theory

Heng Zheng; Davide Grossi; Bart Verheij

doi:10.1145/3462757.3466071

Hardness of case-based decisions: A formal theory

Heng Zheng
, Davide Grossi
, Bart Verheij

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Stare decisis is a fundamental principle of case-based reasoning. Yet its application varies in complexity and depends, in particular, on whether relevant past decisions agree, or exist at all. The contribution of this paper is a formal treatment of types of the hardness of case-based decisions. The typology of hardness is defined in terms of the arguments for and against the issue to be decided, and their kind of validity (conclusive, presumptive, coherent, incoherent). We apply the typology of hardness to Berman and Hafner's research on the dynamics of case-based reasoning and show formally how the hardness of decisions varies with time.

Original language	English
Title of host publication	Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021
Pages	149-158
Number of pages	10
ISBN (Electronic)	9781450385268
DOIs	https://doi.org/10.1145/3462757.3466071
State	Published - Jul 27 2021
Event	18th International Conference on Artificial Intelligence and Law, ICAIL 2021 - Virtual, Online, Brazil Duration: Jun 21 2021 → Jun 25 2021

Publication series

Name	Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021

Conference

Conference	18th International Conference on Artificial Intelligence and Law, ICAIL 2021
Country/Territory	Brazil
City	Virtual, Online
Period	6/21/21 → 6/25/21

Bibliographical note

Publisher Copyright:
© 2021 Owner/Author.

Funding

The authors would like to thank the reviewers and Wijnand van Woerkom for their valuable feedback on earlier versions of this paper. This research was partially funded by the Hybrid Intelligence Center, a 10-year programme funded by the Dutch Ministry of Education, Culture and Science through the Netherlands Organization for Scientific Research, https://hybrid-intelligence-centre.nl.

Funders
Ministerie van Onderwijs, Cultuur en Wetenschap
Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Keywords

case-based reasoning
computational argumentation
hard cases

ASJC Scopus subject areas

Artificial Intelligence
Software
Law

Access to Document

10.1145/3462757.3466071

Cite this

@inproceedings{eb43247491424748af56054a7f644eec,

title = "Hardness of case-based decisions: A formal theory",

abstract = "Stare decisis is a fundamental principle of case-based reasoning. Yet its application varies in complexity and depends, in particular, on whether relevant past decisions agree, or exist at all. The contribution of this paper is a formal treatment of types of the hardness of case-based decisions. The typology of hardness is defined in terms of the arguments for and against the issue to be decided, and their kind of validity (conclusive, presumptive, coherent, incoherent). We apply the typology of hardness to Berman and Hafner's research on the dynamics of case-based reasoning and show formally how the hardness of decisions varies with time.",

keywords = "case-based reasoning, computational argumentation, hard cases",

author = "Heng Zheng and Davide Grossi and Bart Verheij",

note = "Publisher Copyright: {\textcopyright} 2021 Owner/Author.; 18th International Conference on Artificial Intelligence and Law, ICAIL 2021 ; Conference date: 21-06-2021 Through 25-06-2021",

year = "2021",

month = jul,

day = "27",

doi = "10.1145/3462757.3466071",

language = "English",

series = "Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021",

pages = "149--158",

booktitle = "Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021",

}

Zheng, H, Grossi, D & Verheij, B 2021, Hardness of case-based decisions: A formal theory. in Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021. Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021, pp. 149-158, 18th International Conference on Artificial Intelligence and Law, ICAIL 2021, Virtual, Online, Brazil, 6/21/21. https://doi.org/10.1145/3462757.3466071

Hardness of case-based decisions: A formal theory. / Zheng, Heng; Grossi, Davide; Verheij, Bart.
Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021. 2021. p. 149-158 (Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Hardness of case-based decisions

T2 - 18th International Conference on Artificial Intelligence and Law, ICAIL 2021

AU - Zheng, Heng

AU - Grossi, Davide

AU - Verheij, Bart

PY - 2021/7/27

Y1 - 2021/7/27

N2 - Stare decisis is a fundamental principle of case-based reasoning. Yet its application varies in complexity and depends, in particular, on whether relevant past decisions agree, or exist at all. The contribution of this paper is a formal treatment of types of the hardness of case-based decisions. The typology of hardness is defined in terms of the arguments for and against the issue to be decided, and their kind of validity (conclusive, presumptive, coherent, incoherent). We apply the typology of hardness to Berman and Hafner's research on the dynamics of case-based reasoning and show formally how the hardness of decisions varies with time.

AB - Stare decisis is a fundamental principle of case-based reasoning. Yet its application varies in complexity and depends, in particular, on whether relevant past decisions agree, or exist at all. The contribution of this paper is a formal treatment of types of the hardness of case-based decisions. The typology of hardness is defined in terms of the arguments for and against the issue to be decided, and their kind of validity (conclusive, presumptive, coherent, incoherent). We apply the typology of hardness to Berman and Hafner's research on the dynamics of case-based reasoning and show formally how the hardness of decisions varies with time.

KW - case-based reasoning

KW - computational argumentation

KW - hard cases

UR - https://www.scopus.com/pages/publications/85112375939

UR - https://www.scopus.com/pages/publications/85112375939#tab=citedBy

U2 - 10.1145/3462757.3466071

DO - 10.1145/3462757.3466071

M3 - Conference contribution

AN - SCOPUS:85112375939

T3 - Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021

SP - 149

EP - 158

BT - Proceedings of the 18th International Conference on Artificial Intelligence and Law, ICAIL 2021

Y2 - 21 June 2021 through 25 June 2021

ER -

Hardness of case-based decisions: A formal theory

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this