Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
Journal of Combinatorial Theory Series A
On the probabilistic performance of algorithms for the satisfiability problem
Information Processing Letters
Journal of the ACM (JACM)
Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Many hard examples for resolution
Journal of the ACM (JACM)
A satisfiability tester for non-clausal propositional calculus
Information and Computation
Polynomially solvable satisfiability problems
Information Processing Letters
Probabilistic performance of a heuristic for the satisfiability problem
Discrete Applied Mathematics
Exponential average time for the pure literal rule
SIAM Journal on Computing
A note on Dowling and Gallier's top-down algorithm for propositional horn satisfiability
Journal of Logic Programming
Information Sciences: an International Journal
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Elimination of infrequent variables improves average case performance of satisfiability algorithms
SIAM Journal on Computing
A hierarchy of tractable satisfiability problems
Information Processing Letters
On generalized Horn formulas and k-resolution
Theoretical Computer Science
A Complexity Index for Satisfiability Problems
SIAM Journal on Computing
Recognition of q-Horn formulae in linear time
Discrete Applied Mathematics
On finding solutions for extended Horn formulas
Information Processing Letters
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A threshold for unsatisfiability
Journal of Computer and System Sciences
SIAM Journal on Computing
A general upper bound for the satisfiability threshold of random r-SAT formulae
Journal of Algorithms
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
An algorithm for the class of pure implicational formulas
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Elliptic approximations of propositional formulae
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
The scaling window of the 2-SAT transition
Random Structures & Algorithms
The Complexity of the Falsifiability Problem for Pure Implicational Formulas
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The satisfiability problem and algorithms for solving it have received greatly increased attention in the last few years. This interest comes from a variety of disciplines such as Computer Science, Operations Research, Graph Theory, and Physics, among others. This paper shows some of the current interesting directions in satisfiability research from these disciplines and presents some possible future directions.