Skip to main content
Log in

Cross-categorization of legal concepts across boundaries of legal systems: in consideration of inferential links

  • Published:
Artificial Intelligence and Law Aims and scope Submit manuscript

Abstract

This work contrasts Giovanni Sartor’s view of inferential semantics of legal concepts (Sartor in Artif Intell Law 17:217–251, 2009) with a probabilistic model of theory formation (Kemp et al. in Cognition 114:165–196, 2010). The work further explores possibilities of implementing Kemp’s probabilistic model of theory formation in the context of mapping legal concepts between two individual legal systems. For implementing the legal concept mapping, we propose a cross-categorization approach that combines three mathematical models: the Bayesian Model of Generalization (BMG; Tenenbaum and Griffiths in Behav Brain Sci 4:629–640, 2001), the probabilistic model of theory formation, i.e., the Infinite Relational Model (IRM) first introduced by Kemp et al. (The twenty-first national conference on artificial intelligence, 2006, Cognition 114:165–196, 2010) and its extended model, i.e., the normal-IRM (n-IRM) proposed by Herlau et al. (IEEE International Workshop on Machine Learning for Signal Processing, 2012). We apply our cross-categorization approach to datasets where legal concepts related to educational systems are respectively defined by the Japanese- and the Danish authorities according to the International Standard Classification of Education. The main contribution of this work is the proposal of a conceptual framework of the cross-categorization approach that, inspired by Sartor (Artif Intell Law 17:217–251, 2009), attempts to explain reasoner’s inferential mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. Inspired by our original work presented this paper, we have applied our approach to two identical datasets for constructing a hierarchical graph representing a single knowledge system. The extended work is found in Glückstad et al. (2013).

  2. http://www.uis.unesco.org/education/ISCEDmappings/Pages/default.aspx.

  3. \(\varvec{\eta}\) values equal to or over 0.5

  4. In this work, we consider that the ontology construction is out of the main focus. In other words, the ontology has been developed solely for the purpose of visualization. The theoretical background of the TO method is therefore explained in “Appendix 2”.

  5. The theory of FCA is reviewed in “Appendix 2”.

  6. http://conexp.sourceforge.net/.

References

  • Aldous D (1985) Exchangeability and related topics. In: École dÉté de Probabilités de Saint-Flour XIII-1983 (Lecture notes in mathematics). Springer, Berlin, pp 1–198

  • Berlin J, Motro A (2002) Database schema matching using machine learning with feature selection. In: Proceedings of the 14th international conference on advanced information systems engineering, vol 2348 of lecture notes in computer science, pp 452–466

  • Bilke A, Neumann F (2005) Schema matching using duplicates. In: Proceedings of the 21st international conference on data engineering, pp 69–80

  • Block N (1986) Advertisement for a semantics for psychology. In: Midwest studies in philosophy. Studies in the Philosophy of Mind. University of Minnesota Press

  • Boghossian P (2003) Epistemic analyticity: a defense. In: Glock H-J, Glür K, Keil G (eds) Grazer philosophische studien, fifty years of quine’s two dogmas. Rodopi, Amsterdam, pp 15–35

  • Cabré CMT (2000) Elements for a theory of terminology, towards an alternative paradigm. In: Terminology/2000, vol 6, no 1. John Benjamins Publishing Company, Amsterdam

  • Carey S (1985) Conceptual change in childhood. MIT Press, Cambridge

    Google Scholar 

  • Cheng CP, Lau GT, Law KH, Pan J, Jones A (2008) Regulation retrieval using industry specific taxonomies. Artif Intell Law 16:277–303

    Google Scholar 

  • Danon L, Díaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. Theory Exp J Stat Mech 2005:09008

  • Davis E (1990) Representation of commonsense knowledge. Morgan Kaufmann, San Mateo

  • de Souza KXS, Davis J (2004) Aligning ontologies and evaluating concept similarities. Lecture notes in computer science. Springer, Berlin, On the move to meaningful internet systems 2004

  • Declerck T, Krieger HU, Thomas SM, Buitelaar P, O’Riain S, Wunner T, Maguet G, McCrae J, Spohr D, Montiel-Ponsoda E (2010) Ontology-based multilingual access to financial reports for sharing business knowledge across Europe. In: Rooz J, Ivanyos J (eds) Internal financial control assessment applying multilingual ontology framework. HVG Press, Budapest

    Google Scholar 

  • Doan AH, Madhavan J, Domingos P, Halevy A (2004) Ontology matching: a machine learning approach. In: Staab S, Studer R (eds) Handbook on ontologies, chapter 18. Springer, Berlin, pp 385–404

    Chapter  Google Scholar 

  • Durst-Andersen P (2011) Linguistic supertypes: a cognitive-semiotic theory of human communication. De Gruyter Mouton, Berlin

    Book  Google Scholar 

  • Ehrig M (2007) Ontology alignment: bridging the semantic gap. Springer, New York

    Google Scholar 

  • Euzenat J (1994) Brief overview of t-tree: the tropes taxonomy building tool. In: Proceeding of the 4th ASIS SIG/CR workshop on classification research, pp 69–87

  • Euzenat J, Shvaiko P (2007) Ontology matching. Springer, Berlin

    MATH  Google Scholar 

  • Euzenat J, Valtchev P (2004) Similarity-based ontology alignment in owl-lite. In: Proceedings of the 15th European conference on artificial intelligence (ECAI),Valencia, Spain, pp 333–337

  • Field H (1977) Logic meaning and conceptual role. J Philos 69:379–408

    MathSciNet  Google Scholar 

  • Fodor J, Lepore E (1992) Holism: a shopper’s guide. Blackwell, Cambridge

    Google Scholar 

  • Ganter B, Wille R (1997) Formal concept analysis: mathematical foundations, 1st edn. Springer, New York. ISBN 3540627715

  • Glückstad FK, Mørup M (2012a) Flexible- or Strict Taxonomic Organization?: impact on culturally-specific knowledge transfer. In: Proceedings of the 10th international conference on terminology and knowledge engineering, Madrid, Spain

  • Glückstad FK, Mørup M (2012b) Application of the Infinite Relational Model combined with the Bayesian Model of Generalization for effective cross-cultural knowledge transfer. In: Proceedings of the 26th annual conference of the japanese society for artificial intelligence (JSAI 2012), Yamaguchi, Japan

  • Glückstad FK, Mørup M (2012c) Feature-based Ontology Mapping from an Information Receivers’ Viewpoint. In: Proceedings of the 9th international workshop on natural language processing and cognitive science (NLPCS 2012), ICEIS 2012, Wroclaw, Poland

  • Glückstad FK, Herlau T, Schmidt MN, Mørup M (2013) Unsupervised knowledge structuring: application of Infinite Relational Models to the FCA visualization. In: Proceedings of the 9th international conference on signal image technology and internet based systems (SITIS 2013), Kyoto, Japan

  • Goodman ND, Tenenbaum JB, Feldman J, Griffiths TL (2008) A rational analysis of rule-based concept learning. In: Cognitive Science. 1, 32, pp 108–154

  • Gruber T (1992) Toward principles for the design of ontologies used for knowledge sharing. Int J Hum Comput Stud 43:907–928

    Google Scholar 

  • Haack S (2003) Defending science within reason. Prometheus, Amherst

  • Hansen TJ, Mørup M, Hansen LK (2011) Non-parametric co-clustering of large scale sparse bipartite networks on the gpu. In: IEEE international workshop on machine learning for signal processing (MLSP), IEEE

  • Hastie T, Tibshirani R, Friedman JH (2001) The elements of statistical learning: data mining, inference, and prediction

  • Hempel CG (1985) Thoughts on the limitations of discovery by computer. In: Schaffner K (eds) Logic of discovery and diagnosis in medicine. University of California Press, Berkeley, pp 115–122

    Google Scholar 

  • Herlau T, Mørup M, Schmidt MN, Hansen LK (2012) Modelling dense relational data. In: IEEE international workshop on machine learning for signal processing (MLSP), Santander, Spain

  • Huang HH, Kuo YH (2010) Cross-lingual document representation and semantic similarity measure: a fuzzy set and rough set approach. In: IEEE transaction on fuzzy systems, vol 18, p 6

  • Ichise R, Takeda H, Honiden S (2003) Integrating multiple internet directories by instance-based learning. In: Proceedings 18th international joint conference on artificial intelligence, pp 22–30

  • Ichise R, Takeda H, Honiden S (2004) Discovering relationships among catalogs. In: Proceedings of the 7th international conference on discovery science, in lecture book titles in computer science, vol 3245, Padova, Italy, pp 371–379

  • Jaccard P (1901) Distribution de la flore alpine dans le bassin des dranses et dans quelques regions voisines. Bulletin de la societe vaudoise des sciences naturelles 37:241–272

    Google Scholar 

  • Kageura K (2002) Dynamics of terminology

  • Kemp C, Goodman ND, Tenenbaum JB (2008) Learning and using relational theories. In: Advances in neural information processing systems 20

  • Kemp C, Shafto P, Tenenbaum JB (2012) An integrated account of generalization across objects and features. Cognitive Psychol 64:35–73

    Google Scholar 

  • Kemp C, Tenenbaum JB (2009) Structured statistical models of inductive reasoning. Psychol Rev 116(1):20–58

    Google Scholar 

  • Kemp C, Tenenbaum JB, Griffiths TL, Yamada T, Ueda N (2006) Learning systems of concepts with an infinite relational model. In: The twenty-first national conference on artificial intelligence

  • Kemp C, Tenenbaum JB, Niyogi S, Griffiths TL (2010) A probablistic model of theory formation. Cognition 114:165–196

    Google Scholar 

  • Lacher M, Grog G (2001) Facilitating the exchange of explicit knowledge through ontology mappings. In: Proceedings of the international Florida artificial intelligence research society conference, pp 305–309

  • Lindahl L (2004) Deduction and justification in the law: the role of regal terms and concepts. Ration Juris, pp 182–201

  • Madsen BN, Thomsen HE, Vikner C (2004) Principles of a system for terminological concept modelling. In: Proceedings of the 4th international conference on language resources and evaluation, ELRA, pp 15–19

  • Masolo C, Borgo S, Gangemi A, Guarino N, Oltramari A (2003) WonderWeb deliverable D18 ontology library (final). Technical report, IST Project 2001-33052 WonderWeb: ontology infrastructure for the semantic web

  • Mitra P, Noy N, Jaiswal A (2005) Ontology mapping discovery with uncertainty. In: Proceedings of the 4th international semantic web conference (ISWC), in lecture booktitles in computer science, vol 3729, Galway, Ireland, pp 537–547

  • Mørup M, Madsen KH, Dogonowski AM, Siebner H, Hansen LK (2010) Infinite relational modeling of functional connectivity in resting state fmri. In: Proceedings of neural information processing systems

  • Murphy GL (2004) The big book of concepts. The MIT Press, Cambridge

    Google Scholar 

  • Murphy GL, Medin DL (1985) The role of theories in conceptual coherence, pp 289–316

  • Peirce CS (2006) The categories. In: Haack S (ed) Pragmatism, old and new. Prometheus, Amherst, pp 177–208

  • Peirce CS (2010) Collected papers of Charles Sanders Peirce I–VIII. Cambridge University Press, Cambridge

    Google Scholar 

  • Pitman J (2002) Combinatorial stochastic processes. In: Book titles for Saint Flour Summer School

  • Psillos S (2000) Rudolf carnap’s theoretical concepts in science. Stud Hist Philos Sci: 151–172

  • Quilian MR (1968) Semantic memory. In: Minsky M (ed) Semantic information processing. MIT Press, Cambridge

  • Ramsey FP (1991) On truth: original manuscript materials, 1927–1929 from the Ramsey Collection At the University of Pittsburgh. Kluwer, Dordrecht

  • Ross A (1957) Tu-tu. Scand Stud Law, pp 139–153

  • Salton G (1989) Automatic text processing: the transformation, analysis, and retrieval of information by computer. Addison-Wesley Longman Publishing Co., Inc, Boston

    Google Scholar 

  • Sartor G (2009) Legal concepts as inferential nodes and ontological categories. Artif Intell Law 17:217–251

    Google Scholar 

  • Sperber D, Wilson D (1986) Relevance: communication and cognition. Blackwell, Oxford

  • Stumme G, Mädche A (2001) Fca-merge: bottom-up merging of ontologies. In: Proceedings of 17th international joint conference on artificial intelligence (IJAI), pp 225–234

  • Tenenbaum JB, Griffiths TL (2001) Generalization, similarity, and bayesian inference. Behav Brain Sci 4:629–640

    Google Scholar 

  • Thagard P (1992) Conceptual revolutions. Princeton Unviersity Press, Princeton

    Google Scholar 

  • Tversky A (1977) Features of similarity. Psychol Rev 4:327–352

    Google Scholar 

  • Wang J, Wen JR, Lochovsky F, Ma WY (2004) Instance-based schema matching for web databases by domain-specific query probing. In: Proceedings of the 30th international conference on very large data bases, pp 408–419

  • Wellman HM, Gelman SA (1992) Cognitive development: foundational theories of core domains. Ann Rev Psychol: 227–375

  • Woodfield A (1987) On the very idea of acquiring a concept. Philosophical perspectives on developmental psychology. Basil Blackwell, Oxford

    Google Scholar 

  • Wüster E (1959) Das worten der weld, schaubildlich und terminologisch dargestellt

  • Xu Z, Tresp V, Yu K, Kriegel HP (2006) Infinite hidden relational models. In: Proceedings of 22nd conference on uncertainty in artificial intelligence, Cambridge, MA

  • Yevtushenko SA (2000) System of data analysis “concept explorer” (in russian). In: Proceedings of the 7th national conference on artificial intelligence KII-2000, Russia, pp 127–134

Download references

Acknowledgments

We would like to express our thanks to Profs. Bodil Nistrup Madsen and Hanne Erdman Thomsen for their feedbacks related to the theory of Terminological Ontology as well as to two anonymous reviewers who provided valuable and encouraging comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fumiko Kano Glückstad.

Appendices

Appendix 1: Members of the concept clusters and the feature clusters

See Figs. 17, 18, 19, 20, 21, and 22.

Fig. 17
figure 17

Labels for concept clusters obtained by the n-IRM: Jaccard

Fig. 18
figure 18

Labels for feature clusters obtained by the IRM: Jaccard (BMG)

Fig. 19
figure 19

Labels for concept clusters obtained by the n-IRM: BMG—JP as background knowledge (BMG)

Fig. 20
figure 20

Labels for feature clusters obtained by the IRM: BMG—JP as background knowledge (BMG)

Fig. 21
figure 21

Labels for concept clusters obtained by the n-IRM: BMG—DK as background knowledge (BMG)

Fig. 22
figure 22

Labels for feature clusters obtained by the IRM: BMG—DK as background knowledge (BMG)

Appendix 2: Ontology construction methods

2.1 Formal concept analysis

The FCA (Ganter and Wille 1997) is the method that analyzes a relation connecting objects and their features. A context C where a formal concept occurs is defined as C = (GMI). In this definition, G and M represent a set of objects and a set of features, respectively. I refers to relations between G and M. In Fig. 12, the context Japanese educational system is represented as G: (J1, J2, J3, ….. J13), M: (Jf1, Jf2, Jf3,….. Jf12), and their relations I. Each element g (e.g., J2) of G is expressed as \(g \in G\). If this \(g \in G\) has a feature m (e.g., Jf2) that is a member of M (expressed as \(m \in M\)), this relation is represented as gIm. When all members of a set of objects A (J5, J8) that is part of G (\(A \subseteq G\)) shares a set of features (Jf5, Jf6, Jf7) in Fig. 12, it is defined as \(\acute{A} = \left\{m \in M\;|\;gIm\;for\;all\;g\;\in\;A \right\}\). In the same way, when a set of objects (J5, J6, J7) are shared by all members of a set of features B (Jf7, Jf10, Jf12) that is part of M (\(B \subseteq M\)), it is expressed as \(\acute{B} = \left\{g\;\in\;G\;|\;gIm\;for\;all\;m\;\in\;B \right\}\). A formal concept existing in the context (GMI) is expressed as (AB) defined by \(A \subseteq G, B \subseteq M, \acute{A} = B, \acute{B} = A\). Here, A and B are respectively called the extent and the intent of the concept (AB). The set of all concepts existing in the context (GMI) is drawn as a Gallois lattice as shown in Figs. 12 and 13.

2.2 Terminological ontology

The method of Terminological Ontology (TO; Madsen et al. 2004) is originated from the theory of terminology. The theory of terminology was first introduced by Wüster (1959). The original objective of terminology by Wüster (1959) was to eliminate ambiguity from technical languages by means of standardization of terminology in order to make the terms efficient tools of communication (Cabré 2000). The traditional theory of terminology thus addresses the relation between concepts and terms, starting from concepts and focusing on the present state of the conceptual structure and its representation (Kageura 2002).

The uniqueness of TO is its feature specifications and subdivision criteria (Madsen et al. 2004). The principles and constrains defined for the applications of feature specifications are described in detail in Madsen et al. (2004). The most important principle is that a concept must inherit all feature specifications (i.e., features) of its superordinate concepts. Another important key point is that subdivision criteria are strictly defined as dimensions and dimension values (Madsen et al. 2004). It means that a given dimension can only occur for specifying features on sister concepts and a given dimension value can only appear on one of these sister concepts (Madsen et al. 2004). A dimension and its dimension values are registered as (DIMENSION : [value1, value2, …]). In the case of Fig. 23, one dimension specification under the concept “JP education” can be represented as (PHASE : [under school age, compulsory]). This dimension specification subdivides the concept “JP education” into two sub concepts “preschool education” and “compulsory” which respectively possess the features, [PHASE: under school age] and [PHASE: compulsory]. Finally, a concept must be distinguished from each of its nearest superordinate concepts as well as from each of its sister concepts by at least one feature specification (Madsen et al. 2004).

Fig. 23
figure 23

Terminological ontology principles

These strict principles, however, generate some difficulties in constructing an ontology when some feature specifications are considered as very important in several places in the ontology. For example, features such as [FOUNDATION: self governing] [FOUNDATION: municipality] might occur in two different occasions such as under “elementary education” and under “lower secondary education” in Fig. 23. As a solution, Madsen et al. (2004) argue that this problem is solved by creating nodes, “e: private” and “e: municipality” respectively possessing the features [FOUNDATION: self governing] and [FOUNDATION: municipality] at a higher level of the ontology as depicted in Fig. 23. Accordingly, subordinate concepts, “public elementary school” and “public lower secondary school” can both inherit [FOUNDATION: municipality] because of the polyhierarchical structure.

These strict rules are not directly applicable to the present work, since the information extracted from the cross-categorization approach only consists of the concept clusters and the feature clusters, which are rather fuzzy sets of concepts and features. In order to apply these strict principles of TO to the present work, the rules have been modified as follows:

  1. 1.

    A feature cluster inherited from a superordinate concept cluster can only occur on its descendant concept clusters

  2. 2.

    A non-inherited feature cluster can only occur in one concept cluster and its descendant concept clusters in an ontology

  3. 3.

    A concept cluster must be distinguished from each of its nearest superordinate concept clusters as well as from each of its sister concept clusters by at least one feature cluster.

  4. 4.

    For fulfilling these rules, polyhierarchical inheritance of feature clusters and generation of pseudo concept clusters are allowed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glückstad, F.K., Herlau, T., Schmidt, M.N. et al. Cross-categorization of legal concepts across boundaries of legal systems: in consideration of inferential links. Artif Intell Law 22, 61–108 (2014). https://doi.org/10.1007/s10506-013-9150-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10506-013-9150-2

Keywords

Navigation