Blockage contraction (Q2377189): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the logic of theory change: Partial meet contraction and revision functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Change in Abstract Argumentation Frameworks: Adding an Argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: AGM 25 years. Twenty-five years of research in belief change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple kernel contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of multiple contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery recovered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two modellings for theory change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief contraction without recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory contraction and base contraction unified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A textbook of belief dynamics. Theory change and database updating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specified meet contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subjunctives, dispositions and chances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic withdrawal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Severe withdrawal (and recovery) / rank
 
Normal rank

Latest revision as of 13:53, 6 July 2024

scientific article
Language Label Description Also known as
English
Blockage contraction
scientific article

    Statements

    Blockage contraction (English)
    0 references
    0 references
    28 June 2013
    0 references
    In the AGM theory of partial meet belief change, as also in several modellings for qualitative uncertain inference, each output is constructed as the intersection of preferred maximal (or otherwise distinguished) items satisfying desired conditions. In his paper [``On why the best should always meet'', Econ. Philos. 16, 287--313 (2000)], \textit{T. Sandqvist} remarked that, from an intuitive point of view, intersection might not preserve preferential status; perhaps the meet of a class of most preferred maximal items might be less favourable than the meet of some other collection of less preferred items. In the paper under review, the author takes up the challenge that this remark presents, by seeking to reconstruct a formal theory of belief contraction (leaving aside, for the present, revision and uncertain inference) without using intersections. This work is done by specifying a range of potential outcomes for any contraction and a `blocking' relation between them that is reminiscent of the `attack' relation of Dung-style argumentation theory, although ending up with quite different properties. The author articulates conditions on the blocking relation that suffice to guarantee a unique finitely-based belief set as the outcome of contracting a formula (or set of formulae) from a given finitely-based belief set. The resulting class of `blockage contraction operations' overlaps with the class of all AGM partial meet operations, without either class being included in the other. A syntactic characterization is provided for the blockage contraction operations, with a corresponding representation theorem, thus creating a quite novel `non-meet' modelling for belief contraction.
    0 references
    belief change
    0 references
    contraction
    0 references
    AGM
    0 references

    Identifiers