| Modelling legal reasoning in a mathematical environment through model theoretic semantics |
| Full text |
Pdf
(321 KB)
|
| Source
|
International Conference on Artificial Intelligence and Law
archive
Proceedings of the 9th international conference on Artificial intelligence and law
table of contents
Scotland, United Kingdom
SESSION: Logical models
table of contents
Pages: 195 - 203
Year of Publication: 2003
ISBN:1-58113-747-8
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 27, Citation Count: 2
|
|
|
ABSTRACT
We introduce a mathematical model of legal reasoning using an underlying conditional logic semantics, to allow its tractability in some special cases. The main idea is to capture the entailment of legal consequences through a model of 0-1 programming. For such task, first we model legal reasoning with Lehmann's Lexicographic semantics and then we translate it to an instance of weighted MAXSAT problem, in order to compute the logical consequences of legal reasoning. Hence, combinatorial optimization algorithms can be used to yield the legal consequences of defeasible reasoning over legal conditional knowledge bases.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
A. Aarnio, R. Alexy, and A. Peczenik. The foundation of legal reasoning. Rechtstheorie, 12:133--158, 1981.
|
 |
2
|
|
 |
3
|
|
| |
4
|
V. Chandru and J. N. Hooker. Optimization Methods for Logical Inference. Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., 1999.
|
 |
5
|
|
| |
6
|
|
| |
7
|
B. Garcia. New tractable classes for default reasoning from conditional knowledge bases. To appear.
|
| |
8
|
|
| |
9
|
J. Gu, P. W. Purdom, J. Franco, and B. W. Wah. Algorithms for the satisfiability (SAT) problem: a survey. In D. Du, J. Gu, and P. M. Pardalos, editors, Satisfiability Problem: Theory and Applications, volume 35 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 19--152. American Mathematical Society, 1997.
|
| |
10
|
|
| |
11
|
|
| |
12
|
R. G. Jeroslow. Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam, 1988.
|
| |
13
|
V. Kagan, A. Nerode, and V. S. Subrahmanian. Computing definite logic programs by partial instantiation. Annals of Pure and Applied Logic, 67(1--3):161--182, 1994.
|
| |
14
|
D. Lehmann. Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence, 15(1):61--82, 1995.
|
| |
15
|
|
| |
16
|
P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research report A47, Helsinki University of Technology, 1997.
|
| |
17
|
S. Toulmin. The Uses of Argument. Cambridge University Press, 1958.
|
| |
18
|
H. P. Williams. Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A), 21:118--123, 1976.
|
|