Abstract
In this paper we continue the series of papers by V. V. Rybakov devoted to properties of multi-valueted logics and where he propose a new approach for modelling knowledge and reasoning of agents in a multi-agent system. We prove that the satisfiability problem is decidable in a temporal multi-valueted logic based on Z
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: Journal of Siberian Federal University. Mathematics & Physics
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.
