Jie-Hong Roland Jiang — accepted AI-conference papers

2026

Model Counting for Dependency Quantified Boolean Formulas

Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan

AAAI 2026technical

Dependency Quantified Boolean Formulas (DQBF) generalize QBF by explicitly specifying which universal variables each existential variable depends on, instead of relying on a linear quantifier order. The satisfiability problem of DQBF is NEXP-complete, and many hard problems can be succinctly encoded

Cited by 0 Source ↗PDF ↗Scholar ↗

2025

Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking

Hiroshi Unno, Takeshi Tsukada, Jie-Hong Roland Jiang

AAAI 2025technical

The satisfiability (SAT) problem of higher-order quantified Boolean formula (HOQBF) emerged as a natural generalization of SAT, quantified SAT, and second-order quantified SAT. It allows succinct encoding of k-EXPTIME problems beyond the reach of prior Boolean satisfiability formulations, but its…

Cited by 0 Source ↗PDF ↗code ↗Scholar ↗