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

Belief revision is the task of modifying a knowledge base when newinformation becomes available, while also respecting a number of desirableproperties. Classical belief revision schemes have been already specialised to\emph{binary decision diagrams} (BDDs), the classical formalism to compactlyrepresent propositional knowledge. These results also apply to \emph{ordered}BDDs (OBDDs), a special class of BDDs, designed to guarantee canonicity. Yet,those revisions cannot be applied to \emph{sentential decision diagrams}(SDDs), a typically more compact but still canonical class of Boolean circuits,which generalizes OBDDs, while not being a subclass of BDDs. Here we fill thisgap by deriving a general revision algorithm for SDDs based on a syntacticcharacterisation of Dalal revision. A specialised procedure for DNFs is alsopresented. Preliminary experiments performed with randomly generated knowledgebases show the advantages of directly perform revision within SDD formalism.

Belief Revision in Sentential Decision Diagrams