Results 1  10
of
2,971
Tight Thresholds for The Pure Literal Rule
 Digital System Research
, 1997
"... We consider the threshold for the solvability of random kSAT formulas (for k # 3) using the pure literal rule. We demonstrate how this threshold can be found by using differential equations to determine the appropriate limiting behavior of the pure literal rule. 1 Introduction We consider the pr ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We consider the threshold for the solvability of random kSAT formulas (for k # 3) using the pure literal rule. We demonstrate how this threshold can be found by using differential equations to determine the appropriate limiting behavior of the pure literal rule. 1 Introduction We consider
Average Time for the Full Pure Literal Rule
"... The simplified pure literal algorithm solves satisfiability problems by choosing variables in a fixed order and then generating subproblems for various values of the chosen variable. If some value satisfies every relation that depends on the chosen variable, then only the subproblem for that preferr ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
for that preferred value is generated. Otherwise, a subproblem is generated for every value of the variable. The full pure literal algorithm chooses variables that have a preferred value before choosing those that do not. A recurrence equation is found for the average time used by the full pure literal rule
The Probability of Pure Literals
"... We describe an error in earlier probabilistic analyses of the pure literal heuristic as a procedure for solving kSAT . All probabilistic analyses are in the constant degree model in which a random instance C of kSAT consists of m clauses selected independently and uniformly (with replacement) from ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
) from the set of all kclauses over n variables. We provide a new analysis for k = 2. Specifically, we show with probability approaching 1 as m goes to 1 one can apply the pure literal rule repeatedly to a random instance of 2SAT until the number of clauses is "small" provided n=m ? 1
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
Enhancing Maximum Satisfiability Algorithms with Pure Literal Strategies
 In 11th Canadian Conference on Artificial Intelligence, AI'96
, 1996
"... . Maximum satisfiability (MAXSAT) is an extension of satisfiability (SAT), in which a partial solution is sought that satisfies the maximum number of clauses in a logical formula. In recent years there has been an growing interest in this and other types of overconstrained problems. Branch and bou ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
and bound extensions of the DavisPutnam algorithm can return guaranteed optimal solutions to these problems. Earlier work did not make use of a pure literal rule because it appeared to be inefficient here, as for traditional SAT. However, arguments can be adduced to show that pure literals are likely
On the Satisfiability and Maximum Satisfiability of Random 3CNF Formulas
"... We analyze the pure literal rule heuristic for computing a satisfying assignment to a random 3CNF formula with n variables. We show that the pure literal rule by itself nds satisfying assignments for almost all 3CNF formulas with up to 1:63n clauses, but it fails for more than 1:7n clauses. As an ..."
Abstract

Cited by 92 (6 self)
 Add to MetaCart
We analyze the pure literal rule heuristic for computing a satisfying assignment to a random 3CNF formula with n variables. We show that the pure literal rule by itself nds satisfying assignments for almost all 3CNF formulas with up to 1:63n clauses, but it fails for more than 1:7n clauses
Mining Association Rules with Item Constraints
"... The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a speci ..."
Abstract

Cited by 289 (0 self)
 Add to MetaCart
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a
Should there be a threestrikes rule against pure discovery learning
 American Psychologist
, 2004
"... The author’s thesis is that there is sufficient research evidence to make any reasonable person skeptical about the benefits of discovery learning—practiced under the guise of cognitive constructivism or social constructivism—as a preferred instructional method. The author reviews research on discov ..."
Abstract

Cited by 241 (0 self)
 Add to MetaCart
on discovery of problemsolving rules culminating in the 1960s, discovery of conservation strategies culminating in the 1970s, and discovery of LOGO programming strategies culminating in the 1980s. In each case, guided discovery was more effective than pure discovery in helping students learn and transfer
STRUCTURE OF RANDOM rSAT BELOW THE PURE LITERAL THRESHOLD
"... It is well known that there is a sharp density threshold for a random rSAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a random formula is with high probability (whp) unsatisfiable, t ..."
Abstract
 Add to MetaCart
It is well known that there is a sharp density threshold for a random rSAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a random formula is with high probability (whp) unsatisfiable
Results 1  10
of
2,971