Implementing Japanese Presupposed Ultimate Fact Theory in Logic Programming

我们开发了一种名为PROLEG的程序设计语言，该语言采用了日本民事诉讼的预设最终事实理论（JUF理论）。我们描述了JUF理论教材中的各种问题，并验证了PROLEG推理过程与律师推理过程的等价性。此外，我们发现PROLEG可以用于其他法律领域，如宪法和刑法，以描述这些领域的各种案件。我们还实现了PROLEG推理过程的可视化调试工具，相当于JUF理论中的“框图”。

We develop a programming language called PROLEG which implements Japanese Presupposed Ultimate Fact Theory (JUF theory) for civil litigation. We described various questions in a text book of JUF theory and verified equivalence of PROLEG reasoning process and lawyer's reasnoning process. Moreover, we found that PROLEG can be used for other law domains such as constitutional law and penal code to describe various cases in these domains. We also implemented a visual debug tool for PROLEG reasoning process which is equivalent to "block diagram" in JUF theory.