Search

Your search keyword '"Tu, Kuan-Hua"' showing total 10 results
Start Over Author "Tu, Kuan-Hua"
10 results on '"Tu, Kuan-Hua"'

1. Homing Sequence Derivation with Quantified Boolean Satisfiability

Author

Wang, Hung-En, Tu, Kuan-Hua, Jiang, Jie-Hong R., Kushik, Natalia, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Yevtushenko, Nina, editor, Cavalli, Ana Rosa, editor, and Yenigün, Hüsnü, editor

Published
2017
Full Text
View/download PDF

2. QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

Author

Tu, Kuan-Hua, Hsu, Tzu-Chien, Jiang, Jie-Hong R., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Heule, Marijn, editor, and Weaver, Sean, editor

Published
2015
Full Text
View/download PDF

3. Homing Sequence Derivation With Quantified Boolean Satisfiability

Author

Tu Kuan-Hua, Wang Hung-En, Kushik Natalia, R Jiang Jie-Hong, and Nina Yevtushenko

Subjects
Combinatorics, Computational Theory and Mathematics, Hardware and Architecture, Computer science, Boolean satisfiability problem, Software, Theoretical Computer Science, Sequence (medicine), Homing (hematopoietic)
Published
2022

7. Quantifier Elimination in Stochastic Boolean Satisfiability

Author

Hao-Ren Wang and Kuan-Hua Tu and Jie-Hong Roland Jiang and Christoph Scholl, Wang, Hao-Ren, Tu, Kuan-Hua, Jiang, Jie-Hong Roland, Scholl, Christoph, Hao-Ren Wang and Kuan-Hua Tu and Jie-Hong Roland Jiang and Christoph Scholl, Wang, Hao-Ren, Tu, Kuan-Hua, Jiang, Jie-Hong Roland, and Scholl, Christoph

Abstract

Stochastic Boolean Satisfiability (SSAT) generalizes quantified Boolean formulas (QBFs) by allowing quantification over random variables. Its generality makes SSAT powerful to model decision or optimization problems under uncertainty. On the other hand, the generalization complicates the computation in its counting nature. In this work, we address the following two questions: 1) Is there an analogy of quantifier elimination in SSAT, similar to QBF? 2) If quantifier elimination is possible for SSAT, can it be effective for SSAT solving? We answer them affirmatively, and develop an SSAT decision procedure based on quantifier elimination. Experimental results demonstrate the unique benefits of the new method compared to the state-of-the-art solvers.

Published
2022
Full Text
View/download PDF

8. Quantifier Elimination in Stochastic Boolean Satisfiability

Author

Wang, Hao-Ren, Tu, Kuan-Hua, Jiang, Jie-Hong Roland, and Scholl, Christoph

Subjects
Decision Procedure, Theory of computation → Constraint and logic programming, Theory of computation → Automated reasoning, Quantifier Elimination, Stochastic Boolean Satisfiability
Abstract

Stochastic Boolean Satisfiability (SSAT) generalizes quantified Boolean formulas (QBFs) by allowing quantification over random variables. Its generality makes SSAT powerful to model decision or optimization problems under uncertainty. On the other hand, the generalization complicates the computation in its counting nature. In this work, we address the following two questions: 1) Is there an analogy of quantifier elimination in SSAT, similar to QBF? 2) If quantifier elimination is possible for SSAT, can it be effective for SSAT solving? We answer them affirmatively, and develop an SSAT decision procedure based on quantifier elimination. Experimental results demonstrate the unique benefits of the new method compared to the state-of-the-art solvers., LIPIcs, Vol. 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), pages 23:1-23:17

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results