Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Information Sciences: an International Journal
American Mathematical Monthly
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
A threshold for unsatisfiability
Journal of Computer and System Sciences
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The SAT problem of signed CNF formulas
Labelled deduction
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Phase Transitions in the Regular Random 3-SAT Problem
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Optimal myopic algorithms for random 3-SAT
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The 2-SAT Problem of Regular Signed CNF Formulas
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
New Logical and Complexity Results for Signed-SAT
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
The Interface between P and NP in Signed CNF Formulas
ISMVL '04 Proceedings of the 34th International Symposium on Multiple-Valued Logic
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
Mick gets some (the odds are on his side) (satisfiability)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Solving non-Boolean satisfiability problems with stochastic local search
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics
A Better Algorithm for Random $k$-SAT
SIAM Journal on Computing
| Hi-index | 5.23 |
Interval-k-SAT (k-iSAT) is a generalization of classical k-SAT where the variables can take values in [0,1] (instead of {0,1}) and the literals are of the form x@?I, for intervals I@?[0,1]. It falls within the class of signed satisfiability problems. We propose an algorithm for 3-iSAT, and analyze it on uniformly random formulas. The algorithm follows the Unit Clause paradigm, enhanced by a (very limited) backtracking option. Using Wormald@?s ODE method, we prove that, if m/n=