Abstract
An information theoretic view is introduced into the discussion of knowledge representation. Information is defined to a description as the difference between the entropies the system contains before and after the description is given. Properties that should be attributed to knowledge representation are discussed taking this view into account. Then, it is shown that an extension of first order predicate logic has these properties and is therefore suited for knowledge representa tion. A formula in this logic involves data structures in such a way that the data structures can be manipulated without having any in fluence upon this formula and, nevertheless, the formula evaluates correctly the data structures it refers to.
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 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.
