Complexities of homomorphism and isomorphism for definite logic programs

Journal of Computer Science and Technology

Volumn 20, Issue 6, 2005, Pages 758-762

  Xu, Dao Yun ^a   Tao, Zhi Hong ^b  

^a GUIZHOU UNIVERSITY   (China)

^b PEKING UNIVERSITY   (China)

Author keywords

Complexity; Decision problem; Homomorphism; Isomorphism; Logic program

Indexed keywords

DECISION THEORY; GRAPH THEORY; LARGE SCALE SYSTEMS; MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPLEXITY; DECISION PROBLEM; HOMOMORPHISM; ISOMORPHISM; LOGIC PROGRAM;

LOGIC PROGRAMMING;

EID: 31344434149     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-005-0758-x     Document Type: Article

References (18)

1. Cook S A, Reckhow R A. The relative efficiency of propositional proof system. Journal of Symbolic Logic, 1979, 44(1): 36-50, 2001.
2. Krishnamurthy B. Short proofs for tricky formulas. Acta Information, 1985, 22: 253-275.
3. Szeider S. How to Prove Unsatisfiability by Homomorphisms. Elsevier Preprint.
4. Szeider S. NP-completeness of refutability by literal-once resolution. Lecture Notes in Artificial Intelligence 2083, Springer Verlag, Draft version, 2001.
5. Urquhart A. The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1995, 1(4): 425-467.
6. Urquhart A. The symmetry rule in propositional logic. Discrete Applied Mathematics, 1999, 96-97: 177-193.
7. Davis M, Putnam H. A computing procedure for quantification theory. Journal of the ACM, 1960, 7: 201-215.
8. Daoyun Xu. On the complexity of renamings and homomorphisms for minimal unsatisnable formulas [Dissertation]. Nanjing University, 2002.
9. Szeider S. Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics, 2003, 130(2): 351-356.
10. Papadimitriou C H, Wolfe D. The complexity of facets resolved. Journal of Computer and System Sciences, 1988, 37(1): 2-13.
11. Aharoni R. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. Journal of Combinatorial Theory, Series A, 1996, 43(A): 196-204.
12. G Davydov, I Davydova, H Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 1998, 23(3-4): 229-245.
13. Fleischner H, Kullmann O, Szeider S. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clausevariable difference. Theoretical Computer Science, 2002, 289(1): 503-516.
14. H Kleine Büning, Xishun Zhao. Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Information Processing Letters, 2002, 84(3): 147-151.
15. H Kleine Büning, Daoyun Xu. The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Annals of Mathematics and Artificial Intelligence, 2005, 43(1-4): 113-127.
16. Köbler J, Schöning J, Toran J. The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser Verlag, 1993.
17. Hell P, Nešetřil J. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 1990, 48: 92-110.
18. Bondy J A, Murty U S R. Graph Theory with Applications. London: Macmillan, 1976.