Adding unsafe constraints to improve Satisfiability performance

Boolean Functions and Their Applications

Rutgers University, January, 2009.

Slides

Adding unsafe constraints to improve Satisfiability performance

5th Workshop on Constraints in Formal Verification

At the International Joint Conference on Automated Reasoning, Sydney, Australia, August, 2008.

Slides

Probability in the analysis of CNF Satisfiability algorithms and properties

Workshop on Satisfiability: Assessing the Progress

Martitime Institute, Linthicum, Maryland, March, 2008.

Slides

Experiences in the Research and Development of a Non-Clausal SAT Solver

Workshop on Search and Logic: Answer Set Programming and SAT

Part of the Federated Logic Conference, Seattle, Washington, 2006.

Slides

Resolution tunnels to improve SAT solver perfomance

Guangzhou Symposium on Satisfiability in Logic-Based Modeling

Guangzhou, China, September, 2006.

Slides

Resolution tunnels to improve SAT solver perfomance

8th International Symposium on Theory and Applications of Satisfiability Testing

St. Andrews, Scotland, June, 2005.

Probabilistic analysis of algorithms for SAT

Guangzhou Symposium on Satisfiability and its Applications

Sun Yat-Sen University, Guangzhou, China, September, 2004.

Slides

Probability in the analysis of CNF Satisfiability algorithms and properties

LICS Workshop: Typical Case Complexity and Phase Transitions

Ottawa, Canada, 2003

Slides

SBSAT: A state-based Satisfiability solver

6th Internation Symposium on the Theory and Applications of Satisfiability Testing

Portofino, Italy, 2003.

Slides

A Java framework for collaborative service sharing in a P2P network

16th International Conference on Parallel and Distributed Computing Systems

Reno, Nevada, 2003.

A state-based satisfiability solver

7th International Symposium on Artificial Intelligence and Mathematics

Ft. Lauderdale, Florida, 2002.

Algorithms for logic-based abduction

5th International Symposium on the Theory and Applications of Satisfiability Testing

Cincinnati, Ohio, 2002.

Optimizing a Satisfiability engine for BDD input

2nd Annual High Confidence Software and Systems Conference

Maritime Institute, Linthicum, Maryland, 2002.

A state-based SAT solver for non-linear classes of Satisfiability

7th International Workshop on Microprocessor Test and Verification

Austin, Texas, 2002.

Introduction to a state-based Satisfiability solver

1st Annual High Confidence Software and Systems Conference

Maritime Institute, Linthicum, Maryland, 2001.

Thresholds and Algorithms for Satisfiability

Topical Conference on NP-Hardness and Phase Transitions

The Abdus Salam International Centre for Theoretical Physics, Trieste, Italy, 1999.

Finding Optimal Boolean Classifiers

Conference on Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems

Center for Applied Optimization, University of Florida, 1999.

Finding Optimal Boolean Classifiers

2nd Workshop on Satisfiability

Schloß Eringerfeld, Germany, 1998.

Relative size of certain polynomial time solvable subclasses of satisfiability

DIMACS Randomization Methods in Algorithm Design Workshop

Princeton University, Princeton, New Jersey, 1997.

Relative size of certain polynomial time solvable subclasses of satisfiability

16th International Symposium on Mathematical Programming

Lausanne, Switzerland, 1997.

An Improved Algorithm for Determining the Falsifiability of Implicational Logic

4th International Symposium on Artificial Intelligence and Mathematics

Ft. Lauderdale, Florida, 1996.

Relative size of certain polynomial time solvable subclasses of satisfiability

DIMACS Workshop on Satisfiability

Rutgers University, New Jersey, 1996.

Computing the well-founded semantics faster

14th European Symposium on Operations Research

Jerusalem, Israel, 1995.

Computing well-founded semantics faster

INFORMS annual meeting

New Orleans, Louisiana, 1995.

On finding solutions to extended Horn sets

Timberline conference on the interface between OR and AI

Portland, Oregon, 1995.

Average case results for Satisfiability under the random-clause-width model

15th International Symposium on Mathematical Programming

University of Michigan, Ann Arbor, 1994.

Improved average case results for the Satisfiability problem

3rd International Symposium on Artificial Intelligence and Mathematics

Ft. Lauderdale, Florida, 1994.

Environmental decision support systems

PSAM-II

San Diego, California, 1994.

Integrated Computer Assisted Site Evaluation (ICASE): a data visualization system for characterization of hazardous waste sites

National Association of Remedial Project Managers, 8th Annual Meeting

Seattle, Washington, 1993.

A data visualization system for bioremediation analysis

USEPA Symposium on Bioremediation of Hazardous Wastes: Research, Development, and Field Evaluation

Dallas, Texas, 1993.

Graphical Remedial Assessment and Cost Evaluation

EDUCOM '93

Cincinnati, Ohio, 1993.

Distributed implementation of algorithms for Satisfiability problems

DIMACS challenge workshop

Rutgers, New Jersey, 1993.

Boolean Satisfiability

ORSA/TIMS annual meeting

Chicago, Illinois, 1993.

Graphical Remedial Assessment and Cost Evaluation (GRACE): A Hydrologic and Economic-Based Environmental Design Tool

104th National Annual Meeting of the Geological Society of America

Cincinnati, Ohio, 1992.

Unique Satisfiability of Horn sets can be solved in nearly linear time

Dagstuhl workshop on Computer Science Logic

Dagstuhl, Germany, 1992.

Graphical remedial assessment and cost evalutation

Third Annual Pittsburgh Hazardous Waste and Hazardous Materials Management Conference

Pittsburgh, Pennsylvania, 1992.

Unique satisfiability for Horn sets can be solved in nearly linear time

Seventh Advanced Research Institute in Discrete Applied Mathematics

New Brunswick, New Jersey, 1992.

Alogrithms for Satisfiability

Workshop on Logic and Complexity

Prague, Czechoslovakia, 1991.

Probabilistic analysis of algorithms for stuck-at test generation in PLAs

First meeting IFIP-TC Working Group 7.6

Den Haag, The Netherlands, 1991.

Work preserving emulations of shuffle-exchange networks by linear arrays

Sixth Advanced Research Institute in Discrete Applied Mathematics

New Brunswick, New Jersey, 1991.

Elimination of Infrequent Variables Improves the Average Performance of Satisfiability Algorithms

Third IFORS Conference

Athens, Greece, 1990.

On the probabilistic performance of algorithms for the Satisfiability problem

14th Symposium on Operations Research

Ulm, Germany, 1989.

Probabilistic Analysis of Algorithms for the Satisfiability Problem

Workshop on Mathematical Methods in Artificial Intelligence

FAW, Ulm, Germany, 1988.

Probabilistic analysis of the unit clause and maximum occurring literal selection heuristics for the 3-Satisfiability problem

Conference of Approximately Solved Problems

Columbia University, New York, 1985.

An approximation algorithm for the maximum independent set problem in cubic planar graphs

Conference of Approximately Solved Problems

Columbia University, New York, 1985.