As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We attempt to present and compare two methods for representing cases in constraint satisfaction networks. The tension between top-down and bottom-up strategy as regards construction of models of reasoning has long tradition in the literature on AI. The same distinction applies to representations of legal argumentation. Our proposal compares the application of top-down and bottom-up strategy to representation of a chosen judgment of the Court of Justice of the European Union in constraint satisfaction networks. The first (top-down) approach is inspired by systems of defeasible logic and argumentation frameworks. The second approach makes use of bottom-up strategy and is more firmly grounded in the text of the court's decision. The two methods lead to very similar results and yield interesting conclusions concerning the structure of the CJEU reasoning.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.