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

Uncertainty in Logic Programming has been investigated during the lastdecades, dealing with various extensions of the classical LP paradigm anddifferent applications. Existing proposals rely on different approaches, suchas clause annotations based on uncertain truth values, qualification values asa generalization of uncertain truth values, and unification based on proximityrelations. On the other hand, the CLP scheme has established itself as apowerful extension of LP that supports efficient computation over specializeddomains while keeping a clean declarative semantics. In this report we proposea new scheme SQCLP designed as an extension of CLP that supports qualificationvalues and proximity relations. We show that several previous proposals can beviewed as particular cases of the new scheme, obtained by partialinstantiation. We present a declarative semantics for SQCLP that is based onobservables, providing fixpoint and proof-theoretical characterizations ofleast program models as well as an implementation-independent notion of goalsolutions.

Fixpoint & Proof-theoretic Semantics for CLP with Qualification and Proximity