In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic. We generalize the notion of contraction to arbitrary finitary propositional logics, and we show how to switch from a syntactic-based approach to a semantic one. This allows to build a solid bridge between the validity of AGM postulates in a propositional logic and specific algebraic properties of its intended algebraic counterpart. Such a connection deserves particular attention when we deal with maxichoice contractions, as studied in the final part of the paper
This paper focuses on the extension of AGM that allows change for a belief base by a set of sentenc...
In this article, we propose an axiomatic characterization for ensconcement-based contraction functio...
In the AGM paradigm for belief revision, epistemic states are represented by logically closed sets o...
In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic....
The standard (AGM) approach to belief change assumes that the underlying logic is at least as strong...
Classic entrenchment-based contraction is not ap-plicable to many useful logics, such as description...
In this paper we study AGM contraction and revision of rules usinginput/output logical theories. We ...
Previous works have shown that the AGM theory cannot be used as the basis for defining contraction o...
The classical AGM account (Alchourrón, Gärdenfors and Makinson [1985]) of belief revision is an acco...
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the pri...
In classical, AGM-style belief change, it is assumed that the underlying logic contains classical pr...
AbstractThe approach of Alchourrón, Gärdenfors and Makinson to belief contraction is treated algebra...
The theory of belief revision studies the way in which an agent changes its beliefs as it acquires n...
Multiple contraction consists in giving up several beliefs at once. The treatments of multiple contr...
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base...
This paper focuses on the extension of AGM that allows change for a belief base by a set of sentenc...
In this article, we propose an axiomatic characterization for ensconcement-based contraction functio...
In the AGM paradigm for belief revision, epistemic states are represented by logically closed sets o...
In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic....
The standard (AGM) approach to belief change assumes that the underlying logic is at least as strong...
Classic entrenchment-based contraction is not ap-plicable to many useful logics, such as description...
In this paper we study AGM contraction and revision of rules usinginput/output logical theories. We ...
Previous works have shown that the AGM theory cannot be used as the basis for defining contraction o...
The classical AGM account (Alchourrón, Gärdenfors and Makinson [1985]) of belief revision is an acco...
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the pri...
In classical, AGM-style belief change, it is assumed that the underlying logic contains classical pr...
AbstractThe approach of Alchourrón, Gärdenfors and Makinson to belief contraction is treated algebra...
The theory of belief revision studies the way in which an agent changes its beliefs as it acquires n...
Multiple contraction consists in giving up several beliefs at once. The treatments of multiple contr...
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base...
This paper focuses on the extension of AGM that allows change for a belief base by a set of sentenc...
In this article, we propose an axiomatic characterization for ensconcement-based contraction functio...
In the AGM paradigm for belief revision, epistemic states are represented by logically closed sets o...