On the logical foundations of compound predicate formulae for legal knowledge representation

Artificial Intelligence and Law 5 (1-2):77-96 (1997)
  Copy   BIBTEX

Abstract

In order to represent legal knowledge adequately, it is vital to create a formal device that can freely construct an individual concept directly from a predicate expression. For this purpose, a Compound Predicate Formula (CPF) is formulated for use in legal expert systems. In this paper, we willattempt to explain the nature of CPFs by rigorous logical foundation, i.e., establishing their syntax and semantics precisely through the use of appropriate examples. We note the advantages of our system over other such systems and discuss the significance of CPFs with regard to the formalization of legal reasonings using examples from the United Nations Convention for the International Sale of Goods.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hard cases: A procedural approach. [REVIEW]Jaap C. Hage, Ronald Leenes & Arno R. Lodder - 1993 - Artificial Intelligence and Law 2 (2):113-167.
The european conflicts guide.Robin Widdison, Francis Pritchard & William Robinson - 1992 - Artificial Intelligence and Law 1 (4):291-304.
Formalizing multiple interpretation of legal knowledge.Andreas Hamfelt - 1995 - Artificial Intelligence and Law 3 (4):221-265.
Model for knowledge and legal expert systems.Anja Oskamp - 1992 - Artificial Intelligence and Law 1 (4):245-274.

Analytics

Added to PP
2009-01-28

Downloads
111 (#157,380)

6 months
24 (#114,813)

Historical graph of downloads
How can I increase my downloads?