Vellino, A.: 1989, `The Complexity of Automated Reasoning'. Ph.D. thesis, University of Toronto. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Evaluating Optimised Decision Procedures for.. - Horrocks.. (2002) (Correct)
....sub trees obtained by adding either # or to L(x) are then searched. Because the two subtrees are strictly disjoint, there is no possibility of wasted search as in syntactic branching. There are other methods for reducing repeated work in tableaux procedures, including improved analytic tableaux [43]. An additional advantage of using a DPLL based search technique is that a great deal is known about the implementation and optimisation of this algorithm. In particular, both unit resolution and heuristic guided search can be used to try to minimise the size of the search tree. Unit resolution ....
Vellino, A.: 1989, `The Complexity of Automated Reasoning'. Ph.D. thesis, University of Toronto.
Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1996) (60 citations) (Correct)
....as challenging test material for developers of SAT procedures (see Selman et al. 1992, for example) The SAT procedure we used for our tests is the Davis Putnam procedure, which we describe below. We believe this was a good choice for two reasons: First, it is basically a variant of resolution (Vellino 1989; Galil 1977) the most widely used general reasoning method in AI; second, almost all empirical work on SAT testing has used one or another refinement of this method, which facilitates comparison. We suspect that our results on hard and easy areas generalize to all SAT procedures. The rest of ....
Vellino, A. (1989). The complexity of automated reasoning. Ph.D. thesis, Dept. of Philosophy, University of Toronto, Toronto, Canada, 1989.
Evaluating Optimised Decision Procedures for.. - Horrocks.. (1999) (Correct)
....sub trees obtained by adding either or : to L(x) are then searched. Because the two subtrees are strictly disjoint, there is no possibility of wasted search as in syntactic branching. There are other methods for reducing repeated work in tableaux procedures, including improved analytic tableaux [43]. An additional advantage of using a DPLL based search technique is that a great deal is known about the implementation and optimisation of this algorithm. In particular, both unit resolution and heuristic guided search can be used to try to minimise the size of the search tree. Unit resolution ....
Vellino, A.: 1989, `The Complexity of Automated Reasoning'. Ph.D. thesis, University of Toronto.
Planning as Satisfiability - Kautz, Selman (1992) (121 citations) (Correct)
....6= z 2 oe :dest(z 1 ; i) dest(z 2 ; i) Table 1 shows the dramatic reduction in size made possible by the shift to 2 place predicates. The most widely used algorithm for solving satisfiability problems is the DavisPutnam procedure [Davis and Putnam, 1960] which is in essence a resolution method [Vellino, 1989]. This algorithm incrementally builds up a truth assignment and backtracks when it determines the assignment does not satisfy the formula. It also simplifies the clauses as it goes along by deleting literals which are false in the current partial assignment, and when a clause containing a single ....
A. Vellino. The complexity of automated reasoning. Ph.D. thesis, Department of Philosophy, University of Toronto, Toronto, Canada, 1989.
A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, Mitchell (1992) (393 citations) (Correct)
....GSAT on several classes of formulas: random formulas, graph coloring encodings, N queens encodings, and Boolean induction problems. For purposes of comparison, we ran the tests with the Davis Putnam procedure (DP) Davis and Putnam 1960) The DP procedure DP is in essence a resolution procedure (Vellino 1989). It performs a backtracking search in the space of all truth assignments, incrementally assigning values to formulas GSAT DP vars clauses M FLIPS tries time choices depth time 50 215 250 6.4 0.4s 77 11 1.4s 70 301 350 11.4 0.9s 42 15 15s 100 430 500 42.5 6s 84 Theta 10 3 19 2.8m 120 516 600 ....
Vellino, A. (1989) The complexity of automated reasoning.
Hard and Easy Distributions of SAT Problems - Mitchell, Selman, Levesque (1992) (298 citations) (Correct)
....test material for developers of SAT procedures (see Selman et al. 1992, for example) The SAT procedure we used for our tests is the DavisPutnam procedure, which we describe below. We believe this was a good choice for two reasons: First, it has been shown to be a variant of resolution (Vellino 1989, Galil 1977) the most widely used general reasoning method in AI; second, almost all empirical work on SAT testing has used one or another refinement of this method, which facilitates comparison. We suspect that our results on hard and easy areas generalize to all SAT procedures, but this ....
Vellino, A. (1989). The complexity of automated reasoning.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC