an:01243222
Zbl 0921.03013
Mundici, Daniele; Olivetti, Nicola
Resolution and model building in the infinite-valued calculus of ??ukasiewicz
EN
Theor. Comput. Sci. 200, No. 1-2, 335-366 (1998).
00051014
1998
j
03B35 03B50
decision algorithm; resolution procedure; infinite-valued calculus of ??ukasiewicz; model building; complexity
The paper presents a resolution procedure for the infinite-valued calculus of ??ukasiewicz. Problems of resolution, model building and their complexity are discussed. The notion of \(\Theta\)-satisfiability is introduced. Then the authors prove that the \(\Theta\)-satisfiability problem is NP-complete. In the particular case of a finite set of Horn-clauses the authors provide decision and model building algorithms that are polynomial. The same is proved for a finite set of Krom-clauses.
N.Zamov (Kazan')