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 条
[41]   CONSTRAINT SATISFACTION PARAMETERIZED BY SOLUTION SIZE [J].
Bulatov, Andrei A. ;
Marx, Daniel .
SIAM JOURNAL ON COMPUTING, 2014, 43 (02) :573-616
[42]   The complexity of constraint satisfaction games and QCSP [J].
Boerner, F. ;
Bulatov, A. ;
Chen, H. ;
Jeavons, P. ;
Krokhin, A. .
INFORMATION AND COMPUTATION, 2009, 207 (09) :923-944
[43]   The Complexity of Temporal Constraint Satisfaction Problems [J].
Bodirsky, Manuel ;
Kara, Jan .
STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, :29-38
[44]   Constraint satisfaction in large language models [J].
Jacobs, Cassandra L. ;
MacDonald, Maryellen C. .
LANGUAGE COGNITION AND NEUROSCIENCE, 2024, 39 (10) :1231-1248
[45]   Constraint satisfaction techniques in planning and scheduling [J].
Bartak, Roman ;
Salido, Miguel A. ;
Rossi, Francesca .
JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (01) :5-15
[46]   A new approach for weighted constraint satisfaction [J].
Lau H.C. .
Constraints, 2002, Kluwer Academic Publishers (07) :151-165
[47]   Stability of Solutions in Constraint Satisfaction Problems [J].
Climent, Laura ;
Salido, Miguel A. ;
Barber, Federico .
ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2009, 202 :301-309
[48]   Using constraint satisfaction in genetic algorithms [J].
Kowalczyk, R .
ANZIIS 96 - 1996 AUSTRALIAN NEW ZEALAND CONFERENCE ON INTELLIGENT INFORMATION SYSTEMS, PROCEEDINGS, 1996, :272-275
[49]   A hybrid approach to Distributed Constraint Satisfaction [J].
Lee, David ;
Arana, Ines ;
Ahriz, Hatem ;
Hui, Kit-Ying .
ARTIFICIAL INTELLIGENCE: METHODOLOGY, SYSTEMS, AND APPLICATIONS, 2008, 5253 :375-379
[50]   Semilocal density functionals and constraint satisfaction [J].
Perdew, John P. ;
Sun, Jianwei ;
Martin, Richard M. ;
Delley, Bernard .
INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 2016, 116 (11) :847-851