### Abstract

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 → … |

### Fingerprint

### Keywords

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

### Cite this

*MIT Press*

}

*MIT Press.*LOGIC PROGRAMMING : PROCEEDINGS OF THE 1991 INTERNATIONAL SYMPOSIUM, 1/01/91.

**Counterfactual reasoning based on revising assumptions.** / Pereira, L.M.; Alferes, José Júlio Alves.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Counterfactual reasoning based on revising assumptions

AU - Pereira, L.M.

AU - Alferes, José Júlio Alves

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

KW - Automata theory

KW - Theorem proving

KW - Contravening hypothesis

KW - Constraint theory

KW - Computational linguistics

KW - Semantics

KW - Logic programming

KW - Integrity Constraints

KW - Revising assumptions

KW - Protected rules

UR - http://www.scopus.com/record/display.uri?eid=2-s2.0-0026271559&origin=resultslist&sort=plf-f&src=s&st1

M3 - Conference contribution

BT - MIT Press

ER -