Balancing of Legal Principles and Constraint Satisfaction

被引:9
作者
Araszkiewicz, Michal [1 ]
机构
[1] Jagiellonian Univ, Dept Legal Theory, Fac Law & Adm, Krakow, Poland
来源
LEGAL KNOWLEDGE AND INFORMATION SYSTEMS | 2010年 / 223卷
关键词
Balancing; Coherence; Constraint satisfaction; Rules and Principles Theory; the Weight Formula; COHERENCE; MODEL;
D O I
10.3233/978-1-60750-682-9-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Robert Alexy is one of the main advocates of the so-called Rules and Principles Theory (hereafter: RPT). According to the RPT, legal norms can be divided into legal rules and legal principles. One of the main criteria for this distinction is - Alexy argues - that legal rules are applied by means of the Subsumption Formula, while legal principles - by means of the so-called Weight Formula (hereafter: WF). The WF offers an important insight into the structure of the process of balancing in legal reasoning. Alexy's proposal leads to many doubts and questions, however. The aim of the paper is to examine the appropriateness of the WF and the problem of balancing in legal reasoning from the perspective inspired by the constraint satisfaction theory of coherence, developed by Paul Thagard. My claim is that this theory enables us to elucidate many problematic features of the WF and to recast the structure of legal balancing in more transparent and efficient manner. The existing workable algorithms designed for computing other kinds of coherence-based reasoning (for instance, explanatory reasoning or analogical reasoning), make possible to adopt the programs employing these algorithms for computation of coherence in balancing of principles. However, the analysis presented here is mainly conceptual and it has only preparatory character in relation with the possible computational implementations in the future.
引用
收藏
页码:7 / 16
页数:10
相关论文
共 50 条
[31]   Algebraic Approach to Promise Constraint Satisfaction [J].
Bulin, Jakub ;
Krokhin, Andrei ;
Oprsal, Jakub .
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, :602-613
[32]   Constraint satisfaction with bounded treewidth revisited [J].
Samer, Marko ;
Szeider, Stefan .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (02) :103-114
[33]   Using constraint satisfaction for view update [J].
Shu, H .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2000, 15 (02) :147-173
[34]   Algorithms for Distributed Constraint Satisfaction: A Review [J].
Makoto Yokoo ;
Katsutoshi Hirayama .
Autonomous Agents and Multi-Agent Systems, 2000, 3 :185-207
[35]   Constraint satisfaction methods for applications in engineering [J].
Gelle, E ;
Faltings, BV ;
Clément, DE ;
Smith, IFC .
ENGINEERING WITH COMPUTERS, 2000, 16 (02) :81-95
[36]   Constraint satisfaction techniques in planning and scheduling [J].
Roman Barták ;
Miguel A. Salido ;
Francesca Rossi .
Journal of Intelligent Manufacturing, 2010, 21 :5-15
[37]   Algorithms for distributed constraint satisfaction: A review [J].
Yokoo, M ;
Hirayama, K .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2000, 3 (02) :185-207
[38]   A COMPLEXITY DICHOTOMY FOR POSET CONSTRAINT SATISFACTION [J].
Kompatscher, Michael ;
Trung Van Pham .
JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2018, 5 (08) :1663-1695
[39]   CONSTRAINT SATISFACTION - ALGORITHMS AND COMPLEXITY ANALYSIS [J].
HOWER, W .
INFORMATION PROCESSING LETTERS, 1995, 55 (03) :171-178
[40]   PRIMING: CONSTRAINT SATISFACTION AND INTERACTIVE COMPETITION [J].
Schroeder, Tobias ;
Thagard, Paul .
SOCIAL COGNITION, 2014, 32 :152-167