English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we investigate the hybrid tractability of binary QuantifiedConstraint Satisfaction Problems (QCSPs). First, a basic tractable class ofbinary QCSPs is identified by using the broken-triangle property. In thisclass, the variable ordering for the broken-triangle property must be same asthat in the prefix of the QCSP. Second, we break this restriction to allow thatexistentially quantified variables can be shifted within or out of theirblocks, and thus identify some novel tractable classes by introducing thebroken-angle property. Finally, we identify a more generalized tractable class,i.e., the min-of-max extendable class for QCSPs.

Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems