11 citations · 13 across the 4 of their papers we have counts for
4 papers · 1 filter
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
Jian Gao, Minghao Yin, Junping Zhou
In this paper, we investigate the hybrid tractability of binary Quantified Constraint Satisfaction Problems (QCSPs). First, a basic tractable class of binary QCSPs is identified by…
New Worst-Case Upper Bound for X3SAT
Junping Zhou, Minghao Yin
The rigorous theoretical analyses of algorithms for exact 3-satisfiability (X3SAT) have been proposed in the literature. As we know, previous algorithms for solving X3SAT have been…
New Worst-Case Upper Bound for #XSAT
Junping Zhou, Minghao Yin
An algorithm running in O(1.1995n) is presented for counting models for exact satisfiability formulae(#XSAT). This is faster than the previously best algorithm which runs in O(1.21…
Phase Transitions of Plan Modification in Conformant Planning
Junping Zhou, Minghao Yin
We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problem…