摘要
由给定的多值逻辑系统中的一组公式,...,,出发,构造出了一组有理数域上的多项式PS,使得是,...,的逻辑结论,当且仅当PS定义的代数簇为空集,当且仅当PS生成的理想是平凡理想.从而,利用特征列方法和Groebner基方法,给出了判定是否,...,逻辑结论的两种算法.
A polynomial system PS over the rational number field is constructed from the formula...,in a given many-valued logic system such that follows from ...,iff the algebraic variety defined by PS is empty, iff the idealenerated by PS is trivial. Two algorithms to decide whether follows from,...,are thus developed by employing characteristic set method and Groebner basismethod.
出处
《计算机学报》
EI
CSCD
北大核心
1996年第10期773-779,共7页
Chinese Journal of Computers
基金
博士后科学基金
关键词
多值逻辑
机器证明
代数法
Many-valued logics, algebraic varieties,characteristic set method,Groebner basis method