#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1986

2008

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ming-Te Chao, John V. Franco
- Inf. Sci.
- 1990

Two algorithms for the k-Satissability problem are presented and a probabilistic analysis is performed. The analysis is based on an instance distribution which is parameterized to simulate a variety of sample characteristics. The algorithms assign values to literals appearing in a given instance of k-Satissability, one at a time, until a solution is found… (More)

- Ming-Te Chao, John V. Franco
- SIAM J. Comput.
- 1986

An algorithm for the 3-Satissability problem is presented and a probabilistic analysis is performed. The analysis is based on an instance distribution which is parameterized to simulate a variety of sample characteristics. The algorithm assigns values to variables appearing in a given instance of 3-Satissability, one at a time, using the unit clause… (More)

- John V. Franco, Allen Van Gelder
- Discrete Applied Mathematics
- 2003

The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we find that, in some… (More)

- John V. Franco
- Theor. Comput. Sci.
- 2001

- John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
- Inf. Process. Lett.
- 1995

In this note we present a simple quadratic-time algorithm for solving the satissability problem for a special class of boolean formulas. This class properly contains the class of extended Horn formulas 1] and balanced formulas 2, 4]. Previous algorithms for these classes require testing membership in the classes. However, the problem of recognizing balanced… (More)

- John V. Franco
- SIAM J. Comput.
- 1991

We consider pre-processing a random instance I of CNF Satissability in order to remove infrequent variables (those which appear once or twice in an instance) from I. The model used to generate random instances is the popular random-clause-sizemodel with parametersn, the number of clauses, r, the number of Boolean variables from which clauses are composed,… (More)

- John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
- Discrete Applied Mathematics
- 1999

Heusch introduced the notion of pure implicational formulas. He showed that the falsiiability problem for pure implicational formulas with k negations is solvable in time O(n k). Such falsiiability results are easily transformed to satissability results on CNF formulas. We show that the falsiiability problem for pure implicational formulas is solvable in… (More)

- Michal Kouril, John V. Franco
- SAT
- 2005

We show how to aggressively add uninferred constraints, in a controlled manner, to formulas for finding Van der Waerden numbers during search. We show that doing so can improve the performance of standard SAT solvers on these formulas by orders of magnitude. We obtain a new and much greater lower bound for one of the Van der Waerden numbers, specifically a… (More)

The scope of certain well-studied polynomial-time solvable classes of Satis ability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we nd that, in some sense,… (More)

- David S. Wise, John V. Franco
- J. Parallel Distrib. Comput.
- 1990