
Editorial Boards and Program Committees 


1.  
Workshop CoOrganizer, 1st, 2nd, 3rd Workshops on Satisfiability,
Sienna, Italy (1996), Paderborn, Germany (1998), Renessee, The
Netherlands (2000). 

2.  
Program Committee and Chair, 5th International Symposium on the
Theory and Applications of Satisfiability Testing,
Cincinnati, Ohio (2002). 

3.  
Program Committee, 6th and 7th Conference on the
Theory and Applications of Satisfiability Testing,
St. Marguerita, Italy (2003), and Vancouver, Canada (2004). 

4.  
Steering Committee, 8th and 9th Conference on the
Theory and Applications of Satisfiability Testing,
St. Andrews, Scotland (2005), and Seattle, Washington (2006). 

5.  
Theory editor, Encyclopedia of Computer Science and Engineering,
Wiley (to appear in 2007). 

6.  
Associate editor, Journal on Satisfiability, Boolean Modeling, and
Computation, University of Delft, IOS Press, ISSN: 15740617 

7.  
Assistant editor, Annals of Mathematics and Artificial
Intelligence, SpringerLink, ISSN: 10122443 

8.  
Guest editor, "Satisfiability Testing," Annals of Mathematics and
Artificial Intelligence 43(1), 2005, SpringerLink,
ISSN: 10122443 

9.  
Program Committee, 6th, 7th, 8th, 9th International Symposium on
Math and Artificial Intelligence, Ft. Lauderdale, Florida (2000, 2002,
2004, 2006). 

   

Refereed Publications 


1.  
"Extending existential quantification in conjunctions of BDDs,"
with S. Weaver and J.S. Schlipf. Journal of Satisfiability,
Boolean Modeling, and Computation 1:89110, IOS Press, 2006.


2.  
"Resolution tunnels for improved SAT solver performance,"
with M. Kouril. In Proceedings of the 8th
International Conference on Theory and Applications of Satisfiability
Testing, Lecture Notes in Computer Science 3569:143158,
Springer, 2005.


3.  
"Typical case complexity of Satisfiability algorithms and the
threshold phenomenon." Discrete Applied Mathematics
153:89123, Elsevier, 2005.


4.  
"A sharp threshold for the renameable Horn and qHorn
properties," with H. Daudè and N. Creignou.
Discrete Applied Mathematics 153:4857, Elsevier, 2005.


5.  
"Functioncomplete lookahead in support of efficient SAT search
heuristics," with M. Kouril, J.S. Schlipf, S. Weaver, M.
Dransfield, and W.M. Vanfleet. Journal of Universal Computer
Science 10:16551692, 2004. 

6.  
"SBSAT: a statebased, BDDbased Satisfiability solver,"
with M. Kouril, J.S. Schlipf, J. Ward, S. Weaver, M.
Dransfield, and W.M. Vanfleet. In Proceedings of the 6th
International Conference on Theory and Applications of Satisfiability
Testing, Lecture Notes in Computer Science 2919:398410,
Springer, 2003.


7.  
"A perspective on certain polynomial time classes of
Satisfiability," with A. Van Gelder. Discrete
Applied Mathematics 125:177214, Elsevier, 2003.


8.  
"Results related to threshold phenomena research in Satisfiability:
lower bounds." Theoretical Computer Science
265:147157, Elsevier, 2001.


9.  
"Algorithms for the Satisfiability problem: a survey," with J. Gu,
P.W. Purdom, and B. Wah. DIMACS Series on
Discrete Mathematics and Theoretical Computer Science 35:19151,
American Mathematical Society, 1997.


10.  
"On finding solutions to extended Horn sets," with J. Schlipf,
F. Annexstein, and R. Swaminathan. Information Processing
Letters 54:133137, NorthHolland, 1995.


11.  
"Elimination of infrequent variables improves average case
performance of Satisfiability algorithms." SIAM Journal
on Computing 20:11191127, SIAM, 1991.


12.  
"Probabilistic analysis of a generalization of the
unitclause literal selection heuristic for the ksatisfiability
problem," with M.T. Chao. Information Sciences
51:289314, Elsevier, 1990.


13.  
"Probabilistic analysis of two heuristics for the 3Satisfiability
problem," with M.T. Chao. SIAM Journal on Computing
15:11061118, SIAM, 1986.


14.  
"Probabilistic analysis of the DavisPutnam procedure for solving
the satisfiability problem," with M. Paull. Discrete Applied
Mathematics 5:7787, Elsevier, 1983.


   

Patent 


1.  
"Method and system for nonlinear state based satisfiability,"
with W.M. Vanfleet, M. Dransfield, J.S. Schlipf, US Patent 6,912,700
(June 28, 2005). 

   

Awards 


1.  
"Satisfiability Algorithm Research and Development to Enhance
Formal Verification Tools," with John Schlipf. Department of Defense,
MDA90402C1162, 10/1/019/30/04, $561,000.


2.  
"Satisfiability Algorithm Research and Development to Enhance
Formal Verification Tools," with John Schlipf. Department of Defense,
MDA90499C4547, 7/1/999/30/01, $493,000.


3.  
"Complexity of Algorithms for Problems in Propositional Logic,"
with John Schlipf, Office of Naval Research, N000149410382,
1/1/943/31/97, $260,000.

