Loading [MathJax]/jax/output/SVG/jax.js
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Yu Xiangdong. Some Hard Examples for the Resolution Method[J]. Journal of Computer Science and Technology, 1990, 5(3): 302-304.
Citation: Yu Xiangdong. Some Hard Examples for the Resolution Method[J]. Journal of Computer Science and Technology, 1990, 5(3): 302-304.

Some Hard Examples for the Resolution Method

More Information
  • Published Date: July 09, 1990
  • Given n propositional variables,let K_n(i,j),0≤i≤j≤n,be the set (or disjunction )of all conjunctions of i literals of which exactly j literais are negative.Dunham and Wang conjectured that it may require exponential time to decide that every disjunction K_n (i,j)is not valid by the resolution method.This paper gives a proof of the conjecture and then exhibits a new counterexample to the feasibility of the resolution or con- sensus method.
  • Brartford Dunham and Hao Wang, Towards feasible solution of the tautology problem, Ann. Math. Logic, 10 (1976), 117-154.

Catalog

    Article views (18) PDF downloads (1105) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return