In this article, we are going to present the issue concerning the tautology for the three-valued logic of beliefs – LB3. The aim of the paper is to present a machine implementation of tautology analysis for the given logic. Due to the presented analysis, we can classify a given LB3 language formula as: tautology, contradiction, or a satisfiable function. We also present the method for decoding LB3 logic expressions, since machine implementation of any aspects related to logical systems require proper coding.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.