We have been doing research on "juris-informatics" which is application of informatics to legal domain. The name is made from a hope that we will make a similar impact to "bio-informatics" and show some related results to "juris-informatics" As a part of research of "juris-infrmatics", we implement "Japanese Ultimate Fact (JUF) thery" to simulate judge's reasoning at a civil court. JUF theory is a tool for judges to make a judgement based
on burden of proof under incomplete information. We show correspondence of burden of proof and negation as failure in logic programming and we introduce a system called PROLEG which we developed using the
correspondence. PROLEG consists of general rules and exceptions which directly reflect lawyers' knowledge structure in legal reasoning. Then, we show that the representation power of PROLEG is same as Answer Set
Programming and that PROLEG could be applied to any other legal domains where general rules and exceptions co-exist.

 

Bp. TLSV