Cited by 30Artificial Intelligence in LawLogic, Reasoning, and KnowledgeMulti-Agent Systems and Negotiation

Isomorphism and argumentation

Bench-Capon, Trevor, Gordon, Thomas F.·2009·Proceedings of the 12th International Conference on Artificial Intelligence and Law

Abstract

As knowledge representation tools become more sophisticated, and computer systems increase in power and ubiquity, the prospects of building practical applications based on the representation of large amounts of legislation draw closer. In this paper we reflect on our experience with developing a knowledge representation language for legal rules and an inference engine for this language in the Estrella project, in order to reconsider the principles which should guide the representation of legislation. One common demand, based largely on software engineering considerations relating to maintenance, verification and validation, is that representations should be isomorphic to their sources. We explore this notion by representing a fragment of German Family Law using our tools. We show that there are several different ways of representing even this small and simple fragment of law in an isomorphic fashion. Moreover these differences matter, in terms of where the burden of proof is allocated, in terms of the explanations produced, and in terms of the operational procedures that are reflected.

Integrity signals

Registry

Crossref · 10.1145/1568234.1568237

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A rule-based ADM system would undergo systematic changes by which amendments in law or court practice will be inserted as new rules in the software, provided that there is proper maintenance of the rule-based system.

    “In contrast, a rule-based ADM system would undergo systematic changes by which amendments in law or court practice will be inserted as new rules in the software, provided that there is proper maintenance of the rule-based system (Bench-Capon and Gordon 2009, 12).”
  • A traditional knowledge-based system can be amended more or less quickly depending on how far-reaching the changes are, although it might still take weeks at best from the perspective of maintenance.

    “A traditional knowledge-based system can therefore be amended more or less quickly depending on how far-reaching the changes are (although it might still take weeks at best from the perspective of maintenance).”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Bench-Capon, T., & Gordon, T. F.
Affiliations
  • University of Liverpool (GB)
  • Fraunhofer Institute for Open Communication Systems (DE)
Venue
Proceedings of the 12th International Conference on Artificial Intelligence and Law
Publisher
ACM
Published
2009-06-08
Pages
11-20
OpenAlex
W2042280927
Cited by
29
References
20
Citations by year
2024: 1 · 2022: 2 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 2 · 2017: 2 · 2016: 2 · 2015: 2 · 2014: 1 · 2012: 2
FWCI
38.94
Type
conference paper
Language
en
Open access
closed
Locations
  • International Conference on Artificial Intelligence and Law (publishedVersion)
  • Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
Funders
Sixth Framework Programme (IST-2004-027655)
Topics
  • Social Sciences › Political Science and International Relations › Artificial Intelligence in Law
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
Keywords
isomorphism, legal argumentation, legal knowledge representation, legal norms, inference engine, German family law, burden of proof, explanation generation, legal reasoning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review