On the Logical Foundations of Compound Predicate Formulae for Legal Knowledge Representation

Author: Yoshino H.

Source: Artificial Intelligence and Law, Volume 5, Numbers 1-2, March 1997 , pp. 77-96(20)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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 will attempt 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.

Keywords: legal reasoning; CISG; knowledge representation; logic; compound predicate formula

Language: English

Document Type: Regular paper

Affiliations: 1: Meiji Gakuin University, 1-2-37, Shirokanedai, Minato-ku, Tokyo, Japan (E-mail: yoshino@mh.meijigakuin.ac.jp)

Publication date: 1997-03-01

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page