New phase transitions for formulas in Łukasiewicz logic

Mohamed EL HALABY , Areeg ABDALLA

Front. Comput. Sci. ›› 2020, Vol. 14 ›› Issue (6) : 146403

PDF (321KB)
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 +
PDF (321KB)

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 DOI:10.1007/s11704-020-9168-z

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

Bofill M, Manyà F, Vidal A, Villaret M. New complexity results for łukasiewicz logic. Soft Computing, 2019, 23(7): 2187–2197

[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

[3]

El Halaby M. Solving maxsat by successive calls to a sat solver. In: Proceedings of SAI Intelligent Systems Conference. 2016, 428–452

[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

[5]

Nadel A. Solving maxsat with bit-vector optimization. In: Proceedings of International Conference on Theory and Applications of Satisfiability Testing. 2018, 54–72

[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

[7]

El Halaby M, Abdalla A. Fuzzy maximum satisfiability. In: Proceedings of the 10th International Conference on Informatics and Systems. 2016, 50–55

RIGHTS & PERMISSIONS

Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature

AI Summary AI Mindmap
PDF (321KB)

Supplementary files

Article highlights

938

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/