CPF as a Tool for Constructing a Legal Knowledge Base

1998 ◽  
Vol 2 (1) ◽  
pp. 12-15
Author(s):  
Seiichiro Sakurai ◽  
Keyword(s):  
Knowledge Acquisition ◽  
Logic Programming ◽  
Knowledge Base ◽  
Programming Language ◽  
Legal Knowledge ◽  
Logic Programming Language

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.

scholarly journals From Interpreter to Logic Engine by Defunctionalization

2003 ◽  
Vol 10 (25) ◽  
Author(s):  
Dariusz Biernacki ◽  
Olivier Danvy
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Operational Semantics ◽  
Lambda Calculus ◽  
Transition System ◽  
Abstract Machine ◽  
Logic Programming Language ◽  
Delimited Continuations ◽  
Simple Logic ◽  
Control Operators

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5.

Sign in / Sign up

Export Citation Format

Share Document