共 20 条
[1]
Alekhnovich M, 2002, ANN IEEE SYMP FOUND, P593, DOI 10.1109/SFCS.2002.1181983
[2]
COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE
[J].
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS,
1987, 8 (02)
:277-284
[5]
Multi-resolution on compressed sets of clauses
[J].
12TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS,
2000,
:2-10
[6]
Chen H, 2004, FRONT ARTIF INTEL AP, V110, P161
[7]
Chen HB, 2005, LECT NOTES COMPUT SC, V3634, P232, DOI 10.1007/11538363_17
[8]
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
[J].
2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS),
2012,
:205-214
[9]
Clarke EM, 1999, MODEL CHECKING, P1
[10]
Dalmau V., 2006, LNCS, P223