DOCSLIB.ORG

2018 Canliidocs 10575 2018 Canliidocs 10575 LEGAL KNOWLEDGE and INFORMATION SYSTEMS 2018 Canliidocs 10575

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
2018 Canliidocs 10575 2018 Canliidocs 10575 LEGAL KNOWLEDGE and INFORMATION SYSTEMS 2018 Canliidocs 10575 2018 CanLIIDocs 10575 2018 CanLIIDocs 10575 LEGAL KNOWLEDGE AND INFORMATION SYSTEMS 2018 CanLIIDocs 10575 Frontiers in Artificial Intelligence and Applications The book series Frontiers in Artificial Intelligence and Applications (FAIA) covers all aspects of theoretical and applied Artificial Intelligence research in the form of monographs, selected doctoral dissertations, handbooks and proceedings volumes. The FAIA series contains several sub-series, including ‘Information Modelling and Knowledge Bases’ and ‘Knowledge-Based Intelligent Engineering Systems’. It also includes the biennial European Conference on Artificial Intelligence (ECAI) proceedings volumes, and other EurAI (European Association for Artificial 2018 CanLIIDocs 10575 Intelligence, formerly ECCAI) sponsored publications. The series has become a highly visible platform for the publication and dissemination of original research in this field. Volumes are selected for inclusion by an international editorial board of well-known scholars in the field of AI. All contributions to the volumes in the series have been peer reviewed. The FAIA series is indexed in ACM Digital Library; DBLP; EI Compendex; Google Scholar; Scopus; Web of Science: Conference Proceedings Citation Index – Science (CPCI-S) and Book Citation Index – Science (BKCI-S); Zentralblatt MATH. Series Editors: J. Breuker, N. Guarino, J.N. Kok, J. Liu, R. López de Mántaras, R. Mizoguchi, M. Musen, S.K. Pal and N. Zhong Volume 313 Recently published in this series Vol. 312. T. Endrjukaite, A. Dudko, H. Jaakkola, B. Thalheim, Y. Kiyoki and N. Yoshida (Eds.), Information Modelling and Knowledge Bases XXX Vol. 311. M. Coeckelbergh, J. Loh, M. Funk, J. Seibt and M. Nørskov (Eds.), Envisioning Robots in Society – Power, Politics, and Public Space – Proceedings of Robophilosophy 2018 / TRANSOR 2018 Vol. 310. N. Petkov, N. Strisciuglio and C. Travieso-González (Eds.), Applications of Intelligent Systems – Proceedings of the 1st International APPIS Conference 2018 Vol. 309. A.J. Tallón-Ballesteros and K. Li (Eds.), Fuzzy Systems and Data Mining IV – Proceedings of FSDM 2018 Vol. 308. Z. Falomir, K. Gibert and E. Plaza (Eds.), Artificial Intelligence Research and Development – Current Challenges, New Trends and Applications Vol. 307. K. Muischnek and K. Müürisep (Eds.), Human Language Technologies – The Baltic Perspective – Proceedings of the Eighth International Conference Baltic HLT 2018 Vol. 306. S. Borgo, P. Hitzler and O. Kutz (Eds.), Formal Ontology in Information Systems – Proceedings of the 10th International Conference (FOIS 2018) Vol. 305. S. Modgil, K. Budzynska and J. Lawrence (Eds.), Computational Models of Argument – Proceedings of COMMA 2018 ISSN 0922-6389 (print) ISSN 1879-8314 (online) Legal Knowledge and Information Systems JURIX 2018: The Thirty-first Annual Conference 2018 CanLIIDocs 10575 Edited by Monica Palmirani University of Bologna, CIRSFID, Italy Amsterdam • Berlin • Washington, DC © 2018 The authors and IOS Press. This book is published online with Open Access and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0). ISBN 978-1-61499-934-8 (print) ISBN 978-1-61499-935-5 (online) Library of Congress Control Number: 2018963896 Publisher IOS Press BV 2018 CanLIIDocs 10575 Nieuwe Hemweg 6B 1013 BG Amsterdam Netherlands fax: +31 20 687 0019 e-mail: [email protected] For book sales in the USA and Canada: IOS Press, Inc. 6751 Tepper Drive Clifton, VA 20124 USA Tel.: +1 703 830 6300 Fax: +1 703 830 2300 [email protected] LEGAL NOTICE The publisher is not responsible for the use which might be made of the following information. PRINTED IN THE NETHERLANDS v Preface We are delighted to present the proceedings volume of the 31st International Confer- ence on Legal Knowledge and Information Systems (JURIX 2018). For more than three decades, JURIX has organized an annual international conference for academics and practitioners, recently also including demos and a hackathon. The intention is to 2018 CanLIIDocs 10575 create a virtuous exchange of knowledge between theoretical research and applications in concrete legal use-cases. JURIX is also a good community where different skills work together to advance research by way of cross-fertilisation between law and com- puter technologies. The JURIX conferences have been held under the auspices of the Dutch Founda- tion for Legal Knowledge Based Systems (www.jurix.nl). It has been hosted in a varie- ty of European locations, extending the borders of its action and becoming an interna- tional conference in virtue of the the various nationalities of its participants and at- tendees. The 2018 edition of JURIX, which runs from December 12 to 14, is hosted by the Faculty of Law and the Department of Artificial Intelligence in the Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence of the Faculty of Science and Engineering of the University of Groningen. JURIX 2018 is organised in coopera- tion with the Dutch Research School for Information and Knowledge Systems (SIKS). Special thanks go to Jeanne Mifsud Bonnici, Henry Prakken, and Bart Verheij and to their team for inviting us, hosting the event, and making this conference possible (http://jurix2018.ai.rug.nl). For this edition we have received 72 submissions by 221 authors from 26 coun- tries; 17 of these submissions were selected for publication as full papers (10 pages each) and 11 as short papers (five pages each), for a total of 28 presentations. We were inclusive in making our selection, but the competition stiff and the submissions were put through a rigorous review process with an acceptance rate of 38.8%. Borderline submissions, including those that received widely divergent marks, were accepted as short papers only. The accepted papers have been grouped under six headings: (i) Machine Learning for the Legal Domain, a session presenting different methodologies and theoretical models applied to legislative texts and case-law (seven full papers and two short pa- pers); (ii) Legal Reasoning and Argumentation, a session that ranges from theoretical aspects and demonstrations (three full papers and four short papers); (iii) Legal Knowledge Extraction, a session that presents natural-language processing of text for detecting terms, principles, concepts, evidence, rules, and named entities, and also speech in chatbots (two full papers and two short papers); (iv) Legal Knowledge Re- trieval, a session focused on the answer-and-query approach (two full papers); (v) Le- gal Knowledge Modelling and Visualization, devoted to Semantic Web techniques, such as legal thesauri and ontologies (three full papers and one short paper); and (vi) Legal Blockchain, a session that has been growing in significance for several years in the workshop area, and now gains entry into the main conference (two full papers, one short paper). vi This year we are honoured to have Marie-Francine Moens, full professor in the Department of Computer Science at Katholieke Universiteit Leuven, director of the Language Intelligence and Information Retrieval (LIIR) Research Lab, member of the Human Computer Interaction Group, and head of the Informatics section. She is a well- known researcher who experiments with novel methods for automated content recogni- tion in text and multimedia, using statistical machine learning and exploiting insights from linguistic and cognitive theory. She has also successfully applied these techniques to the legal domain. Also noteworthy is that the ethical aspects are increasingly relevant in big data and AI applications. For this reason we have asked to Jeroen van den Hoven to provide us with an overview of the ethical issues that emerge in connection with the use of emerg- 2018 CanLIIDocs 10575 ing technologies. He is full professor of Ethics and Technology at the Delft University of Technology and editor in chief of Ethics and Information Technology. We are very grateful to them for having accepted our invitation and for their inter- esting and inspiring talks. Since 2013, JURIX has also hosted the Doctoral Consortium, now in its sixth edi- tion. This initiative aims to attract and promote Ph.D. researchers in the area of AI & Law so as to enrich the community with original and fresh contributions. Many thanks are owed to Pompeu Casanovas, Ugo Pagallo, and Giovanni Sartor for organising the consortium this year, helped by other senior scholars. As the previous editions, also this year the conference is growing richer with six co-located workshops. With long-running workshop like AICOL and LDA, we are continuing the TeReCom event and are hosting four new initiatives: XAILA, Legal Design, ManyLaws, and Legal Data Analytic Hackathon. The Workshop on Artificial Intelligence and the Complexity of Legal Systems (AICOL), now in its tenth edition, is a stable event whose aim is to cut across multiple disciplines so as to examine the complexity of legal systems. The LDA workshop on Legal Data Analysis of the Central European Institute of Legal Informatics (CEILI), at its fifth edition, is devoted to the representation and analysis of legal data and docu- ments, and to reasoning on such data and documents, using corpora and information systems. The second edition of the Workshop on Technologies for Regulatory Compliance provides a forum for discussion of research on technologies for regulatory compliance on the basis of Semantic Web and Artificial Intelligence techniques. This workshop is supported by the LYNX European project: Building
Load more

Recommended publications
  • Lexical Rules in Constraint-Based Grammars
    Lexical Rules in Constraint-based Grammars Ted Briscoe* Ann Copestake t University of Cambridge CSLI, Stanford University Lexical rules have been used to cover a very diverse range of phenomena in constraint-based grammars. Examination of the full range of rules proposed shows that Carpenter's (1991) postu- lated upper bound on the length of list-valued attributes such as SUBCAT in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint-based formalisms utilizing HPSG-style lexical rules. We argue that it is preferable to subdivide such rules into a class of semiproductive lexically governed genuinely lexical rules, and a class offully productive unary syntactic rules. We develop a restricted approach to lexical rules in a typed default feature structure (TDFS) framework (Lascarides et al. 1995; Lascarides and Copestake 1999), which has enough expressivity to state, for example, rules of verb diathesis alternation, but which does not allow arbitrary manipulation of list-valued features. An interpretation of such lexical rules within a probabilistic version of a TDFS-based linguistic (lexical and grammatical) theory allows us to capture the semiproductive nature of genuinely lexical rules, steering an intermediate course between fully generative or purely abbreviatory rules. We illustrate the utility of this approach with a treatment of dative constructions within a linguistic framework that borrows insights from the constraint-based theories: HPSG, UCG, (Zeevat, Klein, and Calder 1987) and construction grammar (Goldberg 1995). We end by outlin- ing how our approach to lexical rules allows for a treatment of passive and recursive affixation, which are generally assumed to require unrestricted list manipulation operations.
    [Show full text]
  • Effective Statistical Models for Syntactic and Semantic Disambiguation
    EFFECTIVE STATISTICAL MODELS FOR SYNTACTIC AND SEMANTIC DISAMBIGUATION a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy Kristina Nikolova Toutanova September 2005 c Copyright by Kristina Nikolova Toutanova 2005 All Rights Reserved ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Christopher D. Manning (Principal Adviser) I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Andrew Y. Ng I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Daniel Jurafsky Approved for the University Committee on Graduate Studies. iii iv Abstract This thesis focuses on building effective statistical models for disambiguation of so- phisticated syntactic and semantic natural language (NL) structures. We advance the state of the art in several domains by (i) choosing representations that encode domain knowledge more effectively and (ii) developing machine learning algorithms that deal with the specific properties of NL disambiguation tasks { sparsity of training data and large, structured spaces of hidden labels. For the task of syntactic disambiguation, we propose a novel representation of parse trees that connects the words of the sentence with the hidden syntactic struc- ture in a direct way.
    [Show full text]
  • Tilburg University Evaluation of Lexical Representation Formalisms
    Tilburg University Evaluation of lexical representation formalisms Daelemans, W.M.P.; van der Linden, H.J.B.M. Publication date: 1992 Document Version Publisher's PDF, also known as Version of record Link to publication in Tilburg University Research Portal Citation for published version (APA): Daelemans, W. M. P., & van der Linden, H. J. B. M. (1992). Evaluation of lexical representation formalisms. (ITK Research Memo). Institute for Language Technology and Artifical IntelIigence, Tilburg University. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Download date: 26. sep. 2021 CBM ~~J R ~`~~ ~J~i 8419 ~ ,~~ ; ~~~ 1992 ~o~~~~~~~~~P~~ IIIInI~uuIIII II 14 J ~ I NINIIIVIII~IINllllll~l 1 INST!TUTE FOR LANGUAGE TECHNOLOGY AND ARTIFICIAL INTELLIGENCE INSTITUUT VOOR TAAL- EN KENNISTECHNOLOGIE ITK Research Memo february 1992 Evaluation of Lexical Representation Formalisms Walter Daelemans 8z Erik-Jan van der Linden No. 14 We wish to thank Hans Bcers with whom we worked on DATR.
    [Show full text]
  • Cv Website.Pdf (151.44
    Aur´elieHerbelot Center for Mind / Brain Sciences, University of Trento [email protected] Research interests Computational linguistics: formal semantics, distributional semantics, reference phenomena, models of quantification and genericity, integration of perception and language in semantics. Education 2006{2010 PhD in computer science, University of Cambridge, UK. Supervisor: Ann Copestake Dissertation Title: Underspecified quantification 2005{2006 MPhil in Computer Speech, Text and Internet Technology, University of Cambridge, UK. Supervisor: Ann Copestake Dissertation Title: Acquiring ontological relationships from corpora 2000{2005 BSc Hons in Information Technology and Computing (1:1), Open University, UK. 1997{1998 MA in Literature and Linguistics (`Mention tr`esbien'), Universit´e de Savoie, France. Awarded with `F´elicitationsdu jury' (praise of the committee). 1994{1997 BA in Literature and Linguistics, Universit´ede Savoie, France. Grants and scholarships 2018 NVIDIA recipient of a hardware grant for a TESLA GPU. 2017 Marie Curie Individual Fellowship (24 months, e158,121.60). Success rate 15%. Project score: 95:6%. 2016 Mozilla `MOSS mission partner' award for my open-source project PeARS (Peer-to-peer Agent for Reciprocated Search). $15,500. 2016 NVIDIA recipient of a hardware grant for a TESLA GPU. 2011-2013 Humboldt Research Fellowship for Postdoctoral Researchers from the Alexander von Humboldt Foundation, Germany. ≈ e65,000. 2005{2010 Full MPhil and PhD scholarships from the Engineering and Physical Sciences Research Council (EPSRC), UK. 1 Positions held / industry work Academic positions 2018- Assistant professor (ricercatore), Centre for Mind/Brain Sciences, University of Trento, Italy. 2017-2018 Marie Curie-Sk lodowska Fellow, Department of Translation and Language Sciences, Universitat Pompeu Fabra, Barcelona, Spain.
    [Show full text]
  • Multiword Expressions a Pain in the Neck For
    This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multiword expressions : a pain in the neck for NLP. Sag, Ivan A.; Baldwin, Timothy.; Bond, Francis.; Author(s) Copestake, Ann.; Flickinger, Dan. Sag, I. A., Baldwin, T., Bond, F., Copestake, A., & Flickinger, D. (2002). Multiword expressions: A pain in the neck for NLP. Proceedings of Computational Linguistics Citation and Intelligent Text Processing: Third International Conference: CICLing-2002, Lecture Notes in Computer Science, 2276, 1-15. Date 2002 URL http://hdl.handle.net/10220/6828 © 2002 Springer. This is the author created version of a work that has been peer reviewed and accepted for publication by Proceedings of Computational Linguistics and Intelligent Text Processing: Third International Conference: CICLing-2002, LNCS, Springer. It Rights incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [DOI: http://dx.doi.org/10.1007/3-540-45715-1_1]. Multiword Expressions: A Pain in the Neck for NLP? Ivan A. Sag1, Timothy Baldwin1, Francis Bond2, Ann Copestake3, and Dan Flickinger1 1 CSLI, Ventura Hall, Stanford University Stanford, CA 94305 USA fsag,tbaldwin,[email protected] 2 NTT Communication Science Labs., 2-4 Hikaridai Seika-cho, Soraku-gun, Kyoto, Japan 619-0237 [email protected] 3 University of Cambridge, Computer Laboratory, William Gates Building JJ Thomson Avenue, Cambridge CB3 OFD, UK [email protected] Abstract. Multiword expressions are a key problem for the develop- ment of large-scale, linguistically sound natural language processing tech- nology.
    [Show full text]
  • A Bibliography of Books, Theses, Articles, and Technical Reports in Or on Head-Driven Phrase Structure Grammar
    A Bibliography of Books, Theses, Articles, and Technical Reports in or on Head-Driven Phrase Structure Grammar Compiled by Mike Calcagno, Andreas Kathol, and Carl Pollard Version of September 1993 Adger, David. 1989. Sign-Based Morphology: Applications to Noun-Incorporation. Master's thesis, Uni- versity of Edinburgh. Arnold, Doug and Louise Sadler. 1992. Non-Modifying Adjectives in HPSG. In Working Papers in Language Processing 35. Department of Languages and Linguistics, University of Essex. Backofen, Rolf, Harald Trost, and Hans Uzskoreit. 1991. Linked Typed Feature Formalisms and Termino- logical Knowledge Representation Languages in Natural Language Front Ends. DFKI Research Report 91-28. Balari, Sergio. 1991. Why German is not a Null-Subject Language. CLAUS Report 12, University of the Saarland, Saarbriicken. Balari, Sergio. 1991. Information-Based Linguistics and Head-Driven Phrase Structure. In Miguel Filgueiras, Lufs Damas, Nelma Moreira, and Ana Paula Tomas, eds., Natural Language Processing. Berlin: Springer, 55-101. Balari, Sergio. 1992. Feature Structures, Linguistic Information, and Grammatica/ Theory. Doctoral dissertation, Autonomous University of Barcelona. Balari, Sergio. 1992 .. Agreement and 0-roles: Towards an Account of Null Subjects in HPSG, CLAUS Report 25, University of the Saarland, Saarbriicken. Balari, Sergio. In press. Sujetos nulos en HPSG. In Carlos Martin Vide, ed., Proceedings of the VII Cong~so de Lenguajes N aturales y Lenguajes Forma/es. Barcelona: Vic. Balari, Sergio. In press. Two Types of Agreement. In Catalan Working Papers in Linguistics 2. Au- tonomous University of Barcelona. Bird, Steven. 1990. Constraint-Based Phonology. Doctoral 1issertation, University of Edinburgh. (To be published in Studies in Language, Logic, and Information.) Bird, Steven.
    [Show full text]
  • DATR: a Language for Lexical Knowledge Representation
    DATR: A Language for Lexical Knowledge Representation Roger Evans* Gerald Gazdar t University of Brighton University of Sussex Much recent research on the design of natural language lexicons has made use of nonmonotonic inheritance networks as originally developed for general knowledge representation purposes in Artificial Intelligence. DATR is a simple, spartan language for defining nonmonotonic inher- itance networks with path~value equations, one that has been designed specifically for lexical knowledge representation. In keeping with its intendedly minimalist character, it lacks many of the constructs embodied either in general-purpose knowledge representation languages or in contemporary grammar formalisms. The present paper shows that the language is nonetheless sufficiently expressive to represent concisely the structure of lexical information at a variety of levels of linguistic analysis. The paper provides an informal example-based introduction to DATR and to techniques for its use, including finite-state transduction, the encoding of DA Gs and lexical rules, and the representation of ambiguity and alternation. Sample analyses of phenomena such as inflectional syncretism and verbal subcategorization are given that show how the language can be used to squeeze out redundancy from lexical descriptions. 1. Introduction Irregular lexemes are standardly regular in some respect. Most are just like regular lexemes except that they deviate in one or two characteristics. What is needed is a natural way of saying "this lexeme is regular except for this property." One obvious approach is to use nonmonotonicity and inheritance machinery to capture such lexical irregularity (and subregularity), and much recent research into the design of represen- tation languages for natural language lexicons has thus made use of nonmonotonic inheritance networks (or "semantic nets") as originally developed for more general representation purposes in Artificial Intelligence.
    [Show full text]
  • Chapter 2 the Evolution of HPSG Dan Flickinger Stanford University Carl Pollard Ohio State Universtiy Tom Wasow Stanford University
    Chapter 2 The evolution of HPSG Dan Flickinger Stanford University Carl Pollard Ohio State Universtiy Tom Wasow Stanford University HPSG was developed to express insights from theoretical linguistics in a precise formalism that was computationally tractable. It drew ideas from a wide variety of traditions in linguistics, logic, and computer science. Its chief architects were Carl Pollard and Ivan Sag, and its most direct precursors were Generalized Phrase Structure Grammar and Head Grammar. The theory has been applied in the con- struction of computational systems for the analysis of a variety of languages; a few of these systems have been used in practical applications. This chapter sketches the history of the development and application of the theory. Introduction From its inception in 1983, HPSG was intended to serve as a framework for the formulation and implementation of natural language grammars which are (i) lin- guistically motivated, (ii) formally explicit, and (iii) computationally tractable. These desiderata are reflective of HPSG’s dual origins as an academic linguis- tic theory and as part of an industrial grammar implementation project with an eye toward potential practical applications. Here (i) means that the grammars are intended as scientific theories about the languages in question, and thatthe analyses the grammars give rise to are transparently relatable to the predictions Dan Flickinger, Carl Pollard & Tom Wasow. 2018. The evolution of HPSG. in Stefan Müller, Anne Abeillé, Robert D. Borsley & Jean- Pierre Koenig (eds.), Head-Driven Phrase Structure Grammar: The handbook, 7–40. Berlin: Lan- guage Science Press. DOI:⁇ Dan Flickinger, Carl Pollard & Tom Wasow (empirical consequences) of those theories.
    [Show full text]
  • Applying Natural Language Processing Techniques to Speech Prostheses
    From: AAAI Technical Report FS-96-05. Compilation copyright © 1996, AAAI (www.aaai.org). All rights reserved. Applying Natural Language Processing Techniques to Speech Prostheses Ann Copestake Center for the Study of Language and Information (CSLI) Ventura Hall, Stanford University, Stanford, CA94305-4115 aac@csli,stanford, edu Abstract simply because of the time which is taken but because the delays completely disrupt the usual processes of In this paper, we discuss the application of Natural Language Processing (NLP) techniques to improving turn-taking. Thus the other speaker finds it hard to speechprostheses for people with severe motordisabil- avoid interrupting the prosthesis user. ities. Manypeople whoare unable to speak because of This problem can be alleviated in two ways: by im- physical disability utilize text-to-speech generators as proving the design of the interface (keyboard, head prosthetic devices. However,users of speech prosthe- stick, head pointer, eye tracker etc) or by minimizing ses very often have moregeneral loss of motor control the input that is required for a given output. Wewill and, despite aids such as word prediction, inputting concentrate on the latter aspect here, although there the text is slow and difficult. For typical users, cur- is some interdependence and we will briefly mention rent speechprostheses have output rates whichare less some aspects of this below. than a tenth of the speed of normalspeech. Weare ex- Techniques which have been used for minimizing in- ploring various techniques whichcould improverates, put include the following: without sacrificing flexibility of content. Here we de- scribe the statistical wordprediction techniques used in a communicatordeveloped at CSLIand someexper- Abbreviations, icons and alternative languages iments on improving prediction performance.
    [Show full text]