New phase transitions for formulas in Lukasiewicz logic  

作　　者：Mohamed EL HALABY Areeg ABDALLA 

机构地区：[1]Department of Mathematics,Faculty of Science,Cairo University,Giza 12613,Egypt

出　　处：《Frontiers of Computer Science》2020年第6期197-199,共3页中国计算机科学前沿（英文版）

摘　　要：1 Introduction L-clausal forms is an interesting class of formulas in Eukasiewicz logic that was shown to be NP-complete[1].These formulas are defined over the following Lukasiewicz operations:negation-x=1-x strong disjunction x■y=min{1,x+y},strong conjunction x⊙y=max{x+y-1,0}and weak disjunction x■y=max{x,y}.

关 键 词：FORMULAS TRANSITIONS LUKASIEWICZ 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]