On AGM for non-classical logics (Q535331): 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: First degree entailments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relevance Sensitive Non-Monotonic Inference on Belief Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relevance sensitive belief structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate belief revision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5728439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory contraction through base contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3107917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two modellings for theory change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversing the Levi identity / 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: Local change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional calculus for contradictory deductive systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional relevance through letter-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paraconsistent theory of belief revision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning and revision in hybrid representation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base Revision for Ontology Debugging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning via approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized change and the meaning of rationality postulates / rank
 
Normal rank

Latest revision as of 01:41, 4 July 2024

scientific article
Language Label Description Also known as
English
On AGM for non-classical logics
scientific article

    Statements

    On AGM for non-classical logics (English)
    0 references
    0 references
    11 May 2011
    0 references
    The purpose of this paper is to review some of the work that has been done adapting the AGM theory of belief change to contexts where the background logic is non-classical. It is not intended as an exhaustive survey of the field; for example, it does not discuss the case of intuitionistic logic. But it does cover quite a broad range of constructions. As the author remarks, the AGM partial meet account already has some generality; it applies not only to classical consequence but to any compact supraclassical consequence satisfying disjunction in the premises. The paper begins by reviewing some results on what remains of the AGM account if we simply generalize those conditions. However, the greater part of the review concerns specific non-classical logics for belief change. They are of two main groups: those with a computational motivation, and those with a relevantist rationale. From a computational point of view, the goal is to develop a formal account of belief change that cuts down on the complexity of calculating the background classical consequence relation. A first step in this direction was to restrict attention to belief bases, and a second step was to develop criteria for ignoring part of the base, so that classical consequence is applied only to a distinguished subset whose choice is conditioned by the proposition that is being eliminated or introduced. Another way of tackling the problem is to restrict the language in which the belief sets or bases, and the inserted or discarded formulae, may be expressed. The main candidates here are languages using only Horn clauses, and various kinds of description logic. The author explains the main proposals from the literature, with their known properties, but does not attempt to assess the extent to which complexity savings really ensue. The paper also reports on several constructions that have been carried out from a relevantist perspective. There the goal is to replace the background classical consequence by one or another of the various paraconsistent logics of the literature, under which inconsistent sets of statements need not imply all statements of the language. The review is clear, balanced and well-organized, making it a valuable point of entry for those wishing to take up the challenge of doing belief change non-classically, whether for computational or philosophical reasons.
    0 references
    0 references
    AGM
    0 references
    belief change
    0 references
    nonclassical logic
    0 references
    partial meet contraction
    0 references
    0 references