Belief Change without Compactness

نویسندگان

چکیده


 Dealing with dynamics is a vital problem in Artificial Intelligence (AI). An intelligent system should be able to perceive and interact its environment perform tasks satisfactorily. To do so, it must sense external actions that might interfere tasks, demanding the agent self-adapt dynamics. In AI, field studies how rational change knowledge order respond new piece of information known as Belief Change. It assumes an agent’s specified underlying logic satisfies some properties including compactness: if entailed by set X formulae, then this also finite subset X. Several logics applications however, not respect property. This case many temporal such LTL CTL. Extending Change these would provide ways devise self-adaptive systems could real time. big challenge AI areas planning, reasoning sensing actions. belief beyond classical spectrum has been shown tough challenge, existing approaches usually put constraints upon system, which are either too restrictive or dispense so desired behaviour present. summary thesis “Belief without Compactness” Jandson S Ribeiro. The extends accommodate non-compact logics, keeping rationality criteria imposing extra constraints. We complete semantic perspectives for extending three main pillars: AGM paradigm, KM paradigm Non-monotonic Reasoning.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Foundational Belief Change* Foundational Belief Change

anonymous referee for the Journal of Philosophical Logic for their insightful comments on earlier versions of this paper. I also thank Prasanta Bandy-opadhyay, Jim Cain, Francis Jeery Pelletier and Ted Sider for their sugges tions and encouragement, and acknowledge the help of my friend Ramkrish-nan Nambimadom in the construction of a crucial proof. Abstract: This paper is concerned with the co...

متن کامل

Hierarchic Superposition: Completeness without Compactness

Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise t...

متن کامل

Coherence and Conservatism in the Dynamics of Belief II: Iterated Belief Change without Dispositional Coherence

Part I of this paper Rott has argued that doxastic states should be repre sented as revision functions that take sequences of sentences of arbitrary nite length as arguments and return belief sets that is sets of sentences closed under some background logic Cn as a result We have interpreted the well known rationality postulates for belief change given by Alchourr on G ardenfors and Makinson an...

متن کامل

Extremal points without compactness in L(μ)

We investigate the existence of extremal points and the KreinMIlman representation A = co ExtA of bounded convex subsets of L(μ) which are only closed with respect to the topology of μ -a.e. convergence.

متن کامل

The Compactness of Belief Revision and Update Operators

One of the main challenges in the formal modeling of common-sense reasoning is the ability to cope with the dynamic nature of the world. Among the approaches put forward to address this problem are belief revision and update. Given a knowledge base T , representing our knowledge of the “state of affairs” of the world of interest, we are often led to trust another piece of information P , possib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Clei Electronic Journal

سال: 2021

ISSN: ['0717-5000']

DOI: https://doi.org/10.19153/cleiej.24.1.4