Add to ORKGThis paper presents a study of the satis ability of random Horn formulae and a search for a phase transition. This is a problem similar to the Satis ability problem, but, unlike the latter, Horn satis ability is tractable and thus it is easier to collect experimental data for large instances. We are also interested in Horn formulae because of their relation to nite automata. We study random Horn formulae generated according to a variation of the xed-clause-length distribution model
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Here we study linear programming applied to the random K-SAT problem, a fundamental problem in compu...
This paper studies the phase transition in random Horn satisfiability: under the random model $\Omeg...
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT res...
AbstractIn this paper we examine a variant, k-HSAT, of the well-known Satisfiability problem, wherei...
We present a probabilistic analysis of random mixed Horn formulas (MHF), i.e., formulas in conjuncti...
In this talk I will both give a review of the behaviour of random k-sat formulae and present some n...
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-s...
Recently, a number of non-uniform random satisfiability models have been proposed that are closer to...
We present a new type of sat problem called the k-GD-SAT, which generalizes k-sat and GD-sat. In k-G...
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-s...
AbstractThe sharp Satisfiability threshold is well known for random k-SAT formulas and is due to cer...
This is an experimental investigation of three combinatorial problems. I examined the average-case c...
We focus on the random generation of SAT instances that have computational properties that are simil...
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Here we study linear programming applied to the random K-SAT problem, a fundamental problem in compu...
This paper studies the phase transition in random Horn satisfiability: under the random model $\Omeg...
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT res...
AbstractIn this paper we examine a variant, k-HSAT, of the well-known Satisfiability problem, wherei...
We present a probabilistic analysis of random mixed Horn formulas (MHF), i.e., formulas in conjuncti...
In this talk I will both give a review of the behaviour of random k-sat formulae and present some n...
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-s...
Recently, a number of non-uniform random satisfiability models have been proposed that are closer to...
We present a new type of sat problem called the k-GD-SAT, which generalizes k-sat and GD-sat. In k-G...
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-s...
AbstractThe sharp Satisfiability threshold is well known for random k-SAT formulas and is due to cer...
This is an experimental investigation of three combinatorial problems. I examined the average-case c...
We focus on the random generation of SAT instances that have computational properties that are simil...
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. I...
Here we study linear programming applied to the random K-SAT problem, a fundamental problem in compu...