ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Isomorphism and argumentation
Full text PdfPdf (436 KB)
Source International Conference on Artificial Intelligence and Law archive
Proceedings of the 12th International Conference on Artificial Intelligence and Law table of contents
Barcelona, Spain
SESSION: Research papers table of contents
Pages: 11-20  
Year of Publication: 2009
ISBN:978-1-60558-597-0
Authors
Trevor Bench-Capon  University of Liverpool, Liverpool, UK
Thomas F. Gordon  Fraunhofer FOKUS, Berlin, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1568234.1568237
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Bench-Capon and P. Leng. Developing heuristics for the argument based explanation of negation in logic programs. In Proceedings of the AAAI-Workshop on Computational Dialectics, 1994, pages 1--8, 1994.
 
2
T. J. M. Bench-Capon and F. P. Coenen. Isomorphism and legal knowledge based systems. Artificial Intelligence and Law, 1(1): 65--86, 1992.
 
3
T. J. M. Bench-Capon, D. Lowes, and A. M. McEnery. Argument-based explanation of logic programs. Knowl.-Based Syst., 4(3): 177--183, 1991.
4
5
6
 
7
T. F. Gordon. Visualizing carneades argument graphs. Law, Probability and Risk, 6 (1--4): 109--17, 2007.
 
8
 
9
 
10
11
12
 
13
J. Karpf. Quality Assurance of Legal Expert Systems. Jurimatics No2, Copenhagen Business School, Denmark, 1989.
 
14
H. Prakken and G. Sartor. Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics, 7(1), 1997.
 
15
H. Prakken and J. Schrickx. Isomorphic models for rules and exceptions in legislation. In Proceedings of Jurix 1991, pages 17--27, 1991.
 
16
G. Sartor. Defeasibility in legal reasoning. In Informatics and the Foundations of Legal Reasoning, pages 119--157. Kluwer Academic Publishers, Dordrecht, 1995.
17
18
19
 
20
21
 
22

Collaborative Colleagues:
Trevor Bench-Capon: colleagues
Thomas F. Gordon: colleagues