Abstract
In this chapter, elements of a general closure semantics for deduction rules in knowledge bases are developed. We define the notions of a grounded,stable grounded and stable generated closure, and show that every ampliative deductive knowledge base has a grounded closure. This and further results in Section 15.3 on the general immediate consequence operator have been established in joint work together with M.A. Khamsi and D. Misane.
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 callDisclaimer: 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.
