The theoretical characterizations on the triangular-form thixotropy-loop tests of an LDPE melt （PE-FSB- 23D022/Q200） were conducted in the present paper by using a new thixotropy model, which is constituted by the u...The theoretical characterizations on the triangular-form thixotropy-loop tests of an LDPE melt （PE-FSB- 23D022/Q200） were conducted in the present paper by using a new thixotropy model, which is constituted by the upper convected Maxwell model and a rate-type kinetic equation. The new thixotropic Maxwell model can partially describe well three reported thixotropy-loop experiments by comparison with the previous calculations of the variant form of the thixotropy-type Huang model. It is noted that the stress deviations between the experiments and the predictions of the new thixotropic Maxwell model are much slighter than those deviations obtained by using the variant Huang model at the same condition, although both models include five parameters. The constitution of the new thixotropic Maxwell model is more reasonable than that of the variant Huang model.展开更多
Checking if a program has an answer set, and if so, compute its answer sets are just some of the important problems In answer set logic progremming. Solving these problems using Gelfond and Llfschltz＇s original defin...Checking if a program has an answer set, and if so, compute its answer sets are just some of the important problems In answer set logic progremming. Solving these problems using Gelfond and Llfschltz＇s original definition of answer sets Is not an easy task. Alternative charaoterlzatlons of answer sets for nested logic programs by Erdem and Llfschltz, Lee and Llfschltz, and You at el. are based on the completion semantics and various notions of tlghtnese. However, the notion of tightness Is a local notion In the sense that for different answer sets there are, In general, different level mappings capturing their tlghtnese. This makes It hard to be used In the deelgn of algorithms for computing answer sets. This paper proposes a charecterization of answer sets based on sets of generetlng rules. From this charaoterlzation new algorithms are derived for computing answer sets and for performing some other reasoning teaks. As an application of the charecterlzatlon a sufficient and necessary condition for the equivalence between answer set sementics and completion semantics has been proven, and a basic theorem Is shown on computing answer sets for nested logic programs baaed on an extended notion of loop formulas. These results on tlghtnese and loop formulas are more general than that in You and Lin＇a work.展开更多
基金This work was financially supported by the National Natural Science Foundation of China (No. 10402024).
文摘The theoretical characterizations on the triangular-form thixotropy-loop tests of an LDPE melt （PE-FSB- 23D022/Q200） were conducted in the present paper by using a new thixotropy model, which is constituted by the upper convected Maxwell model and a rate-type kinetic equation. The new thixotropic Maxwell model can partially describe well three reported thixotropy-loop experiments by comparison with the previous calculations of the variant form of the thixotropy-type Huang model. It is noted that the stress deviations between the experiments and the predictions of the new thixotropic Maxwell model are much slighter than those deviations obtained by using the variant Huang model at the same condition, although both models include five parameters. The constitution of the new thixotropic Maxwell model is more reasonable than that of the variant Huang model.
基金Supported partially by the National Natural Science Foundation of China (Grant No. 60573009)Stadholder Foundation of Guizhou Province (Grant No. 2005(212)
文摘Checking if a program has an answer set, and if so, compute its answer sets are just some of the important problems In answer set logic progremming. Solving these problems using Gelfond and Llfschltz＇s original definition of answer sets Is not an easy task. Alternative charaoterlzatlons of answer sets for nested logic programs by Erdem and Llfschltz, Lee and Llfschltz, and You at el. are based on the completion semantics and various notions of tlghtnese. However, the notion of tightness Is a local notion In the sense that for different answer sets there are, In general, different level mappings capturing their tlghtnese. This makes It hard to be used In the deelgn of algorithms for computing answer sets. This paper proposes a charecterization of answer sets based on sets of generetlng rules. From this charaoterlzation new algorithms are derived for computing answer sets and for performing some other reasoning teaks. As an application of the charecterlzatlon a sufficient and necessary condition for the equivalence between answer set sementics and completion semantics has been proven, and a basic theorem Is shown on computing answer sets for nested logic programs baaed on an extended notion of loop formulas. These results on tlghtnese and loop formulas are more general than that in You and Lin＇a work.
