有限论 meaning in Chinese

finitism

Huang zhuo ( computer software & theory ) directed by zhang jian the algorithms and tools to solve first - order logic model searching ( folms ) problem with finite domain size are studied in this thesis . the satisfiability ( sat ) problem in the prepositional logic and folms are classic problems of computer science , which are important in theory and have wide applications in a lot of real - world problems
命题逻辑可满足性( sat )问题和有限论域一阶逻辑模型搜索( folms )问题是计算机理论科学中的经典问题，不仅在理论上有着重要的地位，而且在许多实际问题中得到了广泛的应用。