#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1993

1995

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Allen Van Gelder, Yumi K. Tsuji
- Cliques, Coloring, and Satisfiability
- 1993

A new algorithm for testing satissability of propositional formulas in conjunctive normal form (CNF) is described. It applies reasoning in the form of certain resolution operations, and identiication of equivalent literals. Resolution produces growth in the size of the formula, but within a global quadratic bound; most previous methods avoid operations that… (More)

A new algorithm for testing satis ability of propositional formulas in conjunctive normal form (CNF) is described. It applies reasoning in the form of certain resolution operations, and identi cation of equivalent literals. Resolution produces growth in the size of the formula, but within a global quadratic bound; most previous methods avoid operations that… (More)

Recent successes with incomplete satis ability procedures raise numerous issues about their uses and evaluation. Most such procedures search for \yes" answers, and give up if they do not nd one. The need for \no" answers as well is addressed. It is shown that a recent approximation algorithm of Yannakakis can produce \no" answers only in somewhat trivial… (More)

- ‹
- 1
- ›