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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The introduction of negation in rule bodies of logic program s ay lead to semantic ambiguities: Normal programs can have more than one stable model and the three-valued well-fo unded model may leave the truth status of some ground atoms undetermined. We show that this kind of ambiguity can b e naturally combined with ambiguities caused by incomplete information. We define generalized notions of st able and well-founded models which allow to combine recursion, negation and incomplete information within a un iform framework. The well-founded approximation is composed of two not necessarily identical anti-monotonic o perators. A general characterization of the best wellfounded approximation is given. Programs with disjunctions, maybe tuples and null values ar studied as examples of logic programs with incomplete information. What concerns null values, our approach can al so be seen as a generalization of Biskup’s proposal for relational databases.

Disjunctive Rules and Null Values: Logic Programs with Incomplete Information