Year-end Sale % OFF 
Abstract
In this paper, a logic program is considered as the union of a set of rules and an axiom which defines basic predicates and functions, and a procedure to calculate logic programs is considered as the combination of a replacement procedure with the bodies of the rules and a proof procedure with respect to the axiom. It is proved that a goal is a logical consequence of Δ ∪ Γ if and only if there exists n such that the logical formula obtained by replacing atomic formulae in the goal n times is a logical consequence of Δ, where Γ is the set of the rules, and Δ is the axiom. Moreover, conditions concerning Γ and Δ are described.
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.
