AI/ML

Decrement Operators in Belief Change. (arXiv:1905.08347v1 [cs.AI])

While research on iterated revision is predominant in the field of iterated
belief change, the class of iterated contraction operators received more
attention in recent years. In this article, we examine a non-prioritized
generalisation of iterated contraction. In particular, the class of weak
decrement operators is introduced, which are operators that by multiple steps
achieve the same as a contraction. Inspired by Darwiche and Pearl’s work on
iterated revision the subclass of decrement operators is defined. For both,
decrement and weak decrement operators, postulates are presented and for each
of them a representation theorem in the framework of total preorders is given.
Furthermore, we present two types of decrement operators which have a unique
representative.

Source link




Related posts

Australian brands to turn websites black and white in cybersecurity campaign

Newsemia

The Importance of Edge Machine Learning – Analytics Insight

Newsemia

Your DMS Is A Graveyard Of Dead Information – Radiant Law on KM

Newsemia

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy