Abstract
In this paper, we describe an improvement of a calculation procedure of logic programs. The procedure proposed before is the combination of a replacement procedure of logical formulae and a transformation procedure of equations to disjunctive normal form, and it can calculate logical consequences of the completion of any given first-order logic program (FLP), which is equivalent to the FLP in two-valued logic, soundly and completely in three-valued logic. The new procedure is also the combination of them, but the transformation procedure is improved to be able to calculate two-valued logical consequences of the FLP more than the old one. We prove that it can calculate logical consequences of a completed program, which is not equivalent to the completion of the FLP, soundly and completely in three-valued logic.
Sign-in/Register to access full text options 
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 callMore From: Transactions of the Japanese Society for Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
