Abstract
ABSTRACT The purpose of this paper is to make some pratically relevant results in automated theorem proving available to many-valued logics with suitable modifications. We are working with a notion of many-valued first-order clauses which any finitely- valued logic formula can be translated into and that has been used several times in the literature, but in an ad hoc way. We give a many-valued version of polarity which in turn leads to natural many-valued counterparts of Horn formulas, hyperresolution, and a Davis—Putnam procedure. We show that the many-valued generalizations share many of the desirable properties of the classical versions. Our results justify and generalize several earlier results on theorem proving in many-valued logics.
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.
