Abstract
The logical difference between knowledge bases is an important issue for the dynamic update of knowledge base. Computing the logical difference for knowledge bases is intractable in general, and its result is not necessarily category in the sense that the logical difference between two theories in a class is possibly not in the same class any more. This paper proves that computing logical difference between Horn theories is easier than that of CNF theories, and its result is still Horn expressible, though some deciding problems relating to logical difference are still intractable for Horn theories. A preliminary experiment illustrates an interesting phenomenon for the size of logical differences.
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: DEStech Transactions on Computer Science and Engineering
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.
