The New Democratic Revolution in Music during the Play Experience of the Ideological and Political Education Function

Article Preview

Abstract:

After a deep investigation on the maximum terms space of the clause set, the concept of the partial maximum terms space of the clause set, which the maximum terms of the clause set decomposed, is brought forward. By investigating the extension rule, this paper introduces the concept of the satisfiability and the unsatisfiability of the partial maximum terms space, and gives an algorithm determining the satisfiability of a partial space of the maximum terms - algorithm PSER (Partial Semi-Extension Rule). Then, the TP problem is decomposed into several sub-problems independent of each other, which can be solved by the given parallel computing method PPSER (Parallel Partial Semi-Extension Rule).

You might also be interested in these eBooks

Info:

Periodical:

Pages:

6602-6605

Citation:

Online since:

May 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Massart Thierry, Meuter Cedric, V B Laurent. On the complexity of partial order trace model checking, Inform. Process. Lett. 106 (2008) 120-126.

DOI: 10.1016/j.ipl.2007.10.013

Google Scholar

[2] M. Davis, H. Putnam. A computing procedure for quantification theory. Journal of ACM, 7(3)(1960) 201-215.

Google Scholar

[3] Dechter R, Rish I. Directional resolution: the davis-putnam procedure. Proceeding of 4th International Conference on Principles of KR&R, Bonn, Germany: Morgan Kaufmann, (1994) 134-145.

Google Scholar

[4] M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving. Communications of the ACM, 5 (1962) 394-397.

DOI: 10.1145/368273.368557

Google Scholar