Belief Base Revision for Further Improvement of Unified Answer Set Programming
A belief base revision is developed. The belief base is represented using Unified Answer Set Programs which is capable of representing imprecise and uncertain information and perform nonomonotonic reasoning with them. The base revision operator is developed using Removed Set Revision strategy. The operator is characterized with respect to the postulates for base revisions operator satisfies.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Stochastic Belief Revision and Update and their Combination
I propose a framework for an agent to change its probabilistic beliefs when a new piece of propositional information $\alpha$ is observed. Traditionally, belief change occurs by either a revision process or by an update …
On Definite Iterated Belief Revision with Belief Algebras
Traditional logic-based belief revision research focuses on designing rules to constrain the behavior of revision operators. Frameworks have been proposed to characterize iterated revision rules, but they are often too l…
Ordinal Conditional Functions for Nearly Counterfactual Revision
We are interested in belief revision involving conditional statements where the antecedent is almost certainly false. To represent such problems, we use Ordinal Conditional Functions that may take infinite values. We mod…
counterfactualOn Limited Non-Prioritised Belief Revision Operators with Dynamic Scope
The research on non-prioritized revision studies revision operators which do not accept all new beliefs. In this paper, we contribute to this line of research by introducing the concept of dynamic-limited revision, which…
SentenceCognitive Bias and Belief Revision
In this paper we formalise three types of cognitive bias within the framework of belief revision: confirmation bias, framing bias, and anchoring bias. We interpret them generally, as restrictions on the process of iterat…