Abstract
In this paper we investigate phase transitions in the random 3-SAT problem but we move from the usual setting of classical logic to the more general setting of multiple-valued logics. We deal with regular CNF formulas and use a generalized Davis-Putnam (DP) procedure for testing their satisfiability. We establish the location of the threshold for different cardinalities of the truth value set and show experimentally that the location of the threshold increases logarithmically in the cardinality of the truth value set. We also provide a theoretical explanation of this fact. The DP procedure and the classical random 3-SAT problem appear to be a particular case of our approach.
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.
