Abstract
The k-SAT problem for Ł-clausal forms has been found to be NP-complete if \(k\ge 3\). Similar to Boolean formulas in Conjunctive Normal Form (CNF), Ł-clausal forms are important from a theoretical and practical point of views for their expressive power, easy-hard-easy pattern as well as having a phase transition phenomena. In this paper, we investigate predicting the satisfiability of Ł-clausal forms by training different classifiers (Neural Network, Linear SVC, Logistic Regression, Random Forest and Decision Tree) on features extracted from randomly generated formulas. Firstly, a random instance generator is presented and used to generate instances in the phase transition area over 3-valued and 7-valued Lukasiewicz logic. Next, numeric and graph features were extracted from both datasets. Then, different classifiers were trained and the best classifier (Neural Network) was selected for hyper-parameter tuning, after which the mean of the cross-validation scores (CVS) increased from 92.5% to 95.2%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The proof involves reducing Boolean 3-SAT to the SAT problem for Ł-clausal forms.
References
Biere, A., Heule, M., van Maaren, H. (eds.): Handbook of satisfiability. IOS Press, Amsterdam (2009)
Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)
Marques-Silva, J.: Practical applications of boolean satisfiability. In: 9th International Workshop on Discrete Event Systems, pp. 74–80, IEEE (2008)
Zadeh, L.: Fuzzy sets. Inf. Control 8(3), 338–353 (1965)
Rushdi, M., Rushdi, M., Zarouan, M., Ahmad, W.: Satisfiability in intuitionistic fuzzy logic with realistic tautology. Kuwait J. Sci. 45(2), 15–21 (2018)
El Halaby, M., Abdalla, A.: Fuzzy maximum satisfiability. In: Proceedings of the 10th International Conference on Informatics and Systems, pp. 50–55. ACM (2016)
Brys, T., Drugan, M., Bosman, P., De Cock, M., Nowé, A.: Solving satisfiability in fuzzy logics by mixing CMA-ES. In: Proceedings of the 15th Conference on Genetic and Evolutionary Computation, pp. 1125–1132. ACM (2013)
Brys, T., Drugan, M., Bosman, P., De Cock, M., Nowé, A.: Local search and restart strategies for satisfiability solving in fuzzy logics. In: 2013 IEEE International Workshop on Genetic and Evolutionary Fuzzy Systems (GEFS), pp. 52–59. IEEE (2013)
Soler, J., Manyà, F.: A bit-vector approach to satisfiability testing in finitely-valued logics. In: 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 270–275. IEEE (2016)
Bofill, M., Manyà, F., Vidal, A., Villaret, M.: New complexity results for łukasiewicz logic. Soft. Comput. 23(7), 2187–2197 (2019)
Devlin, D., O’Sullivan, B.: Satisfiability as a classification problem. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (2008)
Darwiche, A.: New advances in compiling CNF to decomposable negation normal form. In: Proceedings of the 16th European Conference on Artificial Intelligence, pp. 318–322. IOS Press (2004)
Mironov, I., Zhang, L.: Applications of sat solvers to cryptanalysis of hash functions. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 102–115. Springer (2006)
Yager, R., Zadeh, L. (eds.): An Introduction to Fuzzy Logic Applications in Intelligent Systems, vol. 165. Springer, New York (2012)
De Silva, C.: Intelligent control: fuzzy logic applications. CRC Press, Boca Raton (2018)
Srivastava, P., Bisht, D.: Recent trends and applications of fuzzy logic. In: Advanced Fuzzy Logic Approaches in Engineering Science, pp. 327–340. IGI Global (2019)
Xu, L., Hoos, H., Leyton-Brown, K.: Predicting satisfiability at the phase transition. In: 26th AAAI Conference on Artificial Intelligence (2012)
De Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337–340. Springer, Heidelberg (2008)
Koller, D., Friedman, N., Džeroski, S., Sutton, C., McCallum, A., Pfeffer, A., Abbeel, P., Wong, M., Heckerman, D., Meek, C., Neville, J.: Introduction to statistical relational learning. MIT press (2007)
Favalli, M., Dalpasso, M.: Applications of boolean satisfiability to verification and testing of switch-level circuits. J. Electron. Test. 30(1), 41–55 (2014)
Vizel, Y., Weissenbacher, G., Malik, S.: Boolean satisfiability solvers and their applications in model checking. Proc. IEEE 103(11), 2021–2035 (2015)
Aloul, F., El-Tarhuni, M.: Multipath detection using boolean satisfiability techniques. J. Comput. Netw. Commun. 2011 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
El Halaby, M., Abdalla, A. (2020). Learning the Satisfiability of Ł-clausal Forms. In: Arai, K., Kapoor, S., Bhatia, R. (eds) Intelligent Computing. SAI 2020. Advances in Intelligent Systems and Computing, vol 1229. Springer, Cham. https://doi.org/10.1007/978-3-030-52246-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-52246-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-52245-2
Online ISBN: 978-3-030-52246-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)