Translating the Japanese Presupposed Ultimate Fact Theory into Logic Programming

Authors:
Ken Satoh;Masahiro Kubota;Yoshiaki Nishigai;Chiaki Takano
Affiliations:
National Institute of Informatics;National Institute of Informatics;National Institute of Informatics;National Institute of Informatics
Venue:
Proceedings of the 2009 conference on Legal Knowledge and Information Systems: JURIX 2009: The Twenty-Second Annual Conference
Year:
2009

Citing 9
Cited 1

A reasoning system for legal analogy

Machine intelligence 14
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Modelling Defeasibility in Law: Logic or Procedure?

Fundamenta Informaticae - Deontic Logic in Computer Science
Formalising arguments about the burden of persuasion

Proceedings of the 11th international conference on Artificial intelligence and law
The Carneades model of argument and burden of proof

Artificial Intelligence
Presumptions and Burdens of Proof

Proceedings of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference
More on Presumptions and Burdens of Proof

Proceedings of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
A unified framework for representation and development of dialectical proof procedures in argumentation

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

PROLEG: an implementation of the presupposed ultimate fact theory of japanese civil code by PROLOG technology

JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Japanese “theory of presupposed ultimate facts” (called “Yoken-jijitsu-ron” in Japanese) for interpreting the Japanese civil code has been underway for over forty years mainly by judges in the Japanese Legal Training Institute, but not yet formalized in a mathematical way. This paper attempts to mathematically formalize this theory and presents the correspondence between the theory and logic programming with “negation as failure”. It is quite surprising that Japanese judges independently developed such a theory without knowing about logic programming.