### Abstract

We present a semantics for counterfactual implication relative to positive programs with integrity constraints and protected rules (unrevisable). A counterfactual truth evaluation is presented based on Contradiction Removal Semantics. We show the adequacy of CRS to define the notion of similarity needed for defining counterfactual truth. The concepts introduced by CRS are adequate to support the revision process required by contravening hypotheses when evaluating counterfactuals.

Original language | English |
---|---|

Title of host publication | MIT Press |

Publication status | Published - 1 Jan 1991 |

Event | LOGIC PROGRAMMING : PROCEEDINGS OF THE 1991 INTERNATIONAL SYMPOSIUM - Duration: 1 Jan 1991 → … |

### Conference

Conference | LOGIC PROGRAMMING : PROCEEDINGS OF THE 1991 INTERNATIONAL SYMPOSIUM |
---|---|

Period | 1/01/91 → … |

### Keywords

- Automata theory
- Theorem proving
- Contravening hypothesis
- Constraint theory
- Computational linguistics
- Semantics
- Logic programming
- Integrity Constraints
- Revising assumptions
- Protected rules

## Fingerprint Dive into the research topics of 'Counterfactual reasoning based on revising assumptions'. Together they form a unique fingerprint.

## Cite this

Pereira, L. M., & Alferes, J. J. A. (1991). Counterfactual reasoning based on revising assumptions. In

*MIT Press*