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

Logic Programs with Ordered Disjunction (LPODs) extend classical logicprograms with the capability of expressing alternatives with decreasing degreesof preference in the heads of program rules. Despite the fact that theoperational meaning of ordered disjunction is clear, there exists an importantopen issue regarding its semantics. In particular, there does not exist apurely model-theoretic approach for determining the most preferred models of anLPOD. At present, the selection of the most preferred models is performed usinga technique that is not based exclusively on the models of the program and incertain cases produces counterintuitive results. We provide a novel,model-theoretic semantics for LPODs, which uses an additional truth value inorder to identify the most preferred models of a program. We demonstrate thatthe proposed approach overcomes the shortcomings of the traditional semanticsof LPODs. Moreover, the new approach can be used to define the semantics of anatural class of logic programs that can have both ordered and classicaldisjunctions in the heads of clauses. This allows programs that can express notonly strict levels of preferences but also alternatives that are equallypreferred. This work is under consideration for acceptance in TPLP.

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction