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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

Cardinality constraints or, more generally, weight constraints are wellrecognized as an important extension of answer-set programming. Clearly, allcommon algorithmic tasks related to programs with cardinality or weightconstraints - like checking the consistency of a program - are intractable.Many intractable problems in the area of knowledge representation and reasoninghave been shown to become linear time tractable if the treewidth of theprograms or formulas under consideration is bounded by some constant. The goalof this paper is to apply the notion of treewidth to programs with cardinalityor weight constraints and to identify tractable fragments. It will turn outthat the straightforward application of treewidth to such class of programsdoes not suffice to obtain tractability. However, by imposing furtherrestrictions, tractability can be achieved.

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough