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

Singleton arc consistency is an important type of local consistency which hasbeen recently shown to solve all constraint satisfaction problems (CSPs) overconstraint languages of bounded width. We aim to characterise all classes ofCSPs defined by a forbidden pattern that are solved by singleton arcconsistency and closed under removing constraints. We identify five newpatterns whose absence ensures solvability by singleton arc consistency, fourof which are provably maximal and three of which generalise 2-SAT. Combinedwith simple counter-examples for other patterns, we make significant progresstowards a complete classification.

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns