Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In: LPAR-01, Springer (2001) 362--376 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Qubos: Deciding Quantified Boolean Logic using Propositional.. - Ayari, Basin (2002) (Correct)
....quanti er expansion are also used in Williams et al. 20] to optimize di erent computation tasks like the calculation of xed points. Most QBL algorithms generalize the Davis Putnam procedure to operate on formulae transformed into quanti ed clausal normal form. Cadoli et al. 6] and Rintanen [16, 15] present di erent heuristic extensions of the Davis Putnam method. Cadoli et al. s techniques were tuned for randomly generated problems and Rintanen s strategies were specially designed for planning problems whose quanti ers have a xed 989 structure. Other work includes that of Letz [10] and ....
....18 abort abort 592 72 6 20 abort abort 1064 107 5.7 22 abort abort 1951 154 5 24 abort abort 3153 215 4 Mutex (invalid, 2) 16 abort abort 0 0 5 32 abort abort 0 0 2 64 abort abort 0 0 1 128 abort abort 1 0 0.7 Table 1. Examples from the BMC library We carried out comparisons with the Qbf [16] and Semprop [10] systems, which are both state of the art systems based on extensions of Davis Putnam. The runtimes (on a 750 Mhz Sun Ultra Sparc workstation) depicted in the tables below are user time (in seconds) reported by the operating system for all computation required. Times greater than ....
[Article contains additional citation context not shown here]
Jussi Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quanti ed Boolean formulae. In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Arti cial Intelligence and Reasoning, volume 2250 of LNCS. Springer-Verlag, Berlin, 2001.
Qubos: Deciding Quantified Boolean Logic using Propositional.. - Ayari, Basin (2002) (Correct)
....quantifier expansion are also used in Williams et al. 20] to optimize di#erent computation tasks like the calculation of fixed points. Most QBL algorithms generalize the Davis Putnam procedure to operate on formulae transformed into quantified clausal normal form. Cadoli et al. 6] and Rintanen [16, 15] present di#erent heuristic extensions of the Davis Putnam method. Cadoli et al. s techniques were tuned for randomly generated problems and Rintanen s strategies were specially designed for planning problems whose quantifiers have a fixed ### structure. Other work includes that of Letz [10] and ....
....72 6 20 abort abort 1064 107 5.7 22 abort abort 1951 154 5 24 abort abort 3153 215 4 Mutex (invalid, #2 ) 8 abort 20 0 0 11 16 abort abort 0 0 5 32 abort abort 0 0 2 64 abort abort 0 0 1 128 abort abort 1 0 0.7 Table 1. Examples from the BMC library We carried out comparisons with the Qbf [16] and Semprop [10] systems, which are both state of the art systems based on extensions of Davis Putnam. The runtimes (on a 750 Mhz Sun Ultra Sparc workstation) depicted in the tables below are user time (in seconds) reported by the operating system for all computation required. Times greater than ....
[Article contains additional citation context not shown here]
Jussi Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of LNCS. Springer-Verlag, Berlin, 2001.
Using Stochastic Local Search to Solve Quantified Boolean.. - Gent, Hoos, Rowley, Smyth (2003) (1 citation) (Correct)
No context found.
Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In: LPAR-01, Springer (2001) 362--376
Using Stochastic Local Search to Solve Quantified - Boolean Formulae Ian (2003) (1 citation) (Correct)
No context found.
Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In: LPAR-01, Springer (2001) 362--376
Using Stochastic Local Search to Solve Quantified Boolean.. - Gent, Hoos, Rowley, Smyth (2003) (1 citation) (Correct)
No context found.
J. Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In LPAR-01, pages 362--376. Springer, 2001.
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