John Franco - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2022

Auditing a Software-Defined Cross Domain Solution ArchitectureNathan Daughety, Marcus Pendleton, Rebeca Perez, Shouhuai Xu, John Franco. csr2 2022: 96-103 [doi]

2021

vCDS: A Virtualized Cross Domain Solution ArchitectureNathan Daughety, Marcus Pendleton, Shouhuai Xu, Laurent Njilla, John Franco. milcom 2021: 61-68 [doi]

A History of SatisfiabilityJohn Franco, John Martin. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability - Second Edition. Volume 336 of Frontiers in Artificial Intelligence and Applications, pages 3-74, IOS Press, 2021. [doi]

2018

A Peek at the Cryptol LanguageJohn Franco. isaim 2018: [doi]

2014

Application of constraints to formal verification and artificial intelligenceMiroslav N. Velev, John Franco. AMAI, 70(4):313-314, 2014. [doi]

2011

Preface to the special issueJohn Franco. AMAI, 61(3):155-157, 2011. [doi]

ID* Lite: improved D* Lite algorithmWeiya Yue, John Franco, Weiwei Cao, Hongwei Yue. SAC 2011: 1364-1369 [doi]

2010

Probabilistic Analysis of Satisfiability AlgorithmsJohn Franco, Yves Crama, Peter L. Hammer. In Yves Crama, Peter L. Hammer, editors, Boolean Models and Methods in Mathematics, Computer Science, and Engineering. pages 99-159, Cambridge University Press, 2010. [doi]

2009

A History of SatisfiabilityJohn Franco, John Martin. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pages 3-74, IOS Press, 2009. [doi]

1999

Algorithms for the Satisfiability (SAT) ProblemJun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah. In Ding-Zhu Du, Panos M. Pardalos, editors, Handbook of Combinatorial Optimization. pages 379-572, Springer, 1999. [doi]

1996

Relative size of certain polynomial time solvable subclasses of satisfiabilityJohn Franco. dimacs 1997: 211-224

Algorithms for the satisfiability (SAT) problem: A surveyJun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah. dimacs 1997: 19-152

1988

Probabilistic performance of a heuristic for the satisfiability problemJohn Franco, Yuan Chuan Ho. DAM, 22(1):35-51, 1988. [doi]

1987

Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemJohn Franco, Jacob Manuel Plotkin, John W. Rosenthal. DAM, 17(3):295-299, 1987. [doi]

1986

An approximation algorithm for the maximum independent set problem in cubic planar graphsElarbi Choukhmane, John Franco. networks, 16(4):349-356, 1986. [doi]

1984

Probabilistic analysis of the pure literal heuristic for the satisfiability problemJohn Franco. anor, 1(3):273-289, 1984. [doi]

Duality, finite improvement and efficiently solved optimization problemsJohn Franco. sigact, 16(1):62, 1984. [doi]

Duality, finite improvement and efficiently solved optimization problemsJohn Franco. sigact, 15(4):62, 1984. [doi]

1983

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemJohn Franco, Marvin C. Paull. DAM, 5(1):77-87, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL