Abstract
To construct a legal knowledge base, knowledge engineers must incorporate implicit lawyer expertise. Knowledge acquisition problems still arise in legal domains. If a lawyer can construct a legal knowledge base, the problem may be solved. CPF, a logic programming language, is proposed for lawyers to express legal knowledge. Since CPF is still complicated for lawyers, however, knowledge base written by lawyers may not be executable. This paper describes a method to construct an executable knowledge base from an unexecutable knowledge base written by lawyers. Since the most expressions written by lawyers are retained, the constructed knowledge base is comprehensible to lawyers.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
