John Franco

Affiliations: 
Computer Science University of Cincinnati, Cincinnati, OH 
Area:
Computer Science, Logic
Google:
"John Franco"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Velev MN, Franco J. (2014) Application of constraints to formal verification and artificial intelligence Annals of Mathematics and Artificial Intelligence. 70: 313-314
Franco J. (2011) Preface to the special issue Annals of Mathematics and Artificial Intelligence. 61: 155-157
Yue W, Franco J. (2010) A new way to reduce computing in navigation algorithm Engineering Letters. 18
Franco J, Swaminathan R. (2003) On good algorithms for determining unsatisfiability of propositional formulas Discrete Applied Mathematics. 130: 129-138
Franco J, Gelder AV. (2003) A perspective on certain polynomial-time solvable classes of satisfiability Discrete Applied Mathematics. 125: 177-214
Franco J. (2001) Results related to threshold phenomena research in satisfiability: Lower bounds Theoretical Computer Science. 265: 147-157
Franco J. (2000) Some interesting research directions in satisfiability Annals of Mathematics and Artificial Intelligence. 28: 7-15
Franco J, Goldsmith J, Schlipf J, et al. (1999) An algorithm for the class of pure implicational formulas Discrete Applied Mathematics. 96: 89-106
Franco J, Swaminathan RP. (1997) Average case results for satisfiability algorithms under the random-clause-width model Annals of Mathematics and Artificial Intelligence. 20: 357-391
Franco J. (1993) On the occurrence of null clauses in random instances of satisfiability Discrete Applied Mathematics. 41: 203-209
See more...