New phase transitions for formulas in Łukasiewicz logic

Mohamed EL HALABY, Areeg ABDALLA

PDF(321 KB)
PDF(321 KB)
Front. Comput. Sci. ›› 2020, Vol. 14 ›› Issue (6) : 146403. DOI: 10.1007/s11704-020-9168-z
LETTER

New phase transitions for formulas in Łukasiewicz logic

Author information +
History +

Cite this article

Download citation ▾
Mohamed EL HALABY, Areeg ABDALLA. New phase transitions for formulas in Łukasiewicz logic. Front. Comput. Sci., 2020, 14(6): 146403 https://doi.org/10.1007/s11704-020-9168-z

References

[1]
Bofill M, Manyà F, Vidal A, Villaret M. New complexity results for łukasiewicz logic. Soft Computing, 2019, 23(7): 2187–2197
CrossRef Google scholar
[2]
Chu Y, Luo C, Cai S, You H. Empirical investigation of stochastic local search for maximum satisfiability. Frontiers of Computer Science, 2019, 13(1): 86–98
CrossRef Google scholar
[3]
El Halaby M. Solving maxsat by successive calls to a sat solver. In: Proceedings of SAI Intelligent Systems Conference. 2016, 428–452
CrossRef Google scholar
[4]
Demirović E, Musliu N, Winter F. Modeling and solving staff scheduling with partial weighted maxsat. Annals of Operations Research, 2019, 275(1): 79–99
CrossRef Google scholar
[5]
Nadel A. Solving maxsat with bit-vector optimization. In: Proceedings of International Conference on Theory and Applications of Satisfiability Testing. 2018, 54–72
CrossRef Google scholar
[6]
De Moura L, Bjørner N. Z3: an efficient smt solver. In: Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems. 2008. 337–340
CrossRef Google scholar
[7]
El Halaby M, Abdalla A. Fuzzy maximum satisfiability. In: Proceedings of the 10th International Conference on Informatics and Systems. 2016, 50–55
CrossRef Google scholar

RIGHTS & PERMISSIONS

2020 Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature
AI Summary AI Mindmap
PDF(321 KB)

Accesses

Citations

Detail

Sections
Recommended

/