Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On the logical foundations of compound predicate formulae for legal knowledge representation
Yoshino H. Artificial Intelligence and Law5 (1/2):77-96,1997.Type:Article
Date Reviewed: May 1 1999

The law is known as an abstract domain, with the interplay betweencomplex concepts at the heart of its logic. On the other hand, the lawis also concerned with the most minute of particulars, with each detailcontributing to the overall case. This duality led Yoshino, who headed ahuge legal expert systems effort, to a problem in knowledgerepresentation: How can we speak abstractly about relations betweenrelations and at the same time speak concretely of the particularrelations that are the objects of other relations?

This is a bit abstract, so let me clarify it with an example fromhis project, which was to formalize reasoning for the United NationsConvention for the International Sale of Goods. Article 16(1) of theconvention stipulates that “a revocation of an offer becomeseffective if and only if the revocation reaches the offeree before hehas dispatched an acceptance of the offer.” Notice thatdispatching is a relation between a person, a revocation, and a time; arevocation, in turn, is a relation between an offer and a person; and anoffer is a relation between two persons and a particular deal. So wehave a hierarchy of relations, with relations higher up in the hierarchyneeding to refer concretely to relations that are lower in thehierarchy. Thus, although the revocation is by a person of an offer, theoffer is a particular one between a particular offerer and offeree for aparticular bargain.

First-order logic is inadequate to represent a hierarchy ofrelations when concrete references to instances of relations are needed.Following some work of Davidson, Yoshino introduces a simple and elegantsolution. Each time a relation is instantiated, a uniqueidentifier--a name--is generated and becomes thek+1th argument of the otherwise k-ary predicate. The result, which Yoshino calls acompound predicate formula, meets the need. The paper also introducescases and gives a formal syntax and semantics for compound predicateformulas.

The paper should interest both those whose primary areaof research is knowledge representation and those whose primary goal isapplying logic. Although the technique was developed in and for thelegal context, it is generally applicable.

Reviewer:  Joseph S. Fulda Review #: CR127279 (99050387)
Bookmark and Share
  Featured Reviewer  
 
Relation Systems (I.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Relation Systems": Date
Case-based reasoning
Kolodner J., Morgan Kaufmann Publishers Inc., San Francisco, CA, 1993. Type: Book (9781558602373)
Oct 1 1995
Deduction Graphs: An Algorithm and Applications
Yang C. IEEE Transactions on Software Engineering 15(1): 60-67, 1989. Type: Article
Sep 1 1989
Beginning VB 2008 databases: from novice to professional
Agarwal V., Huddleston J., Apress, Berkeley, CA, 2008.  409, Type: Book (9781590599471)
Jul 21 2008
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy