Ceteris paribus logic in counterfactual reasoning
Not on the map. Why?
Abstract (arXiv)
The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the relational structure of a model according to a ceteris paribus clause one forces out, in a natural manner, those possible worlds which do not satisfy the requirements of the clause. We develop a ceteris paribus logic for counterfactual reasoning capable of performing such actions, and offer several alternative (relaxed) interpretations of ceteris paribus. We apply this framework in a way which allows us to reason counterfactually without having our similarity order skewed by unlikely events. This continues the investigation of formal ceteris paribus reasoning, which has previously been applied to preferences, logics of game forms, and questions in decision-making, among other areas.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Jun 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2021A unified logical framework for explanations in classifier systemscited by 15
- 2024Permissible Knowledge Poolingcited by 0
- 2024Permissible Knowledge Pooling4 Apr 2024
- 2021A unified logical framework for explanations in classifier systems30 May 2021