Counterfactual reasoning based on revising assumptions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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 languageEnglish
Title of host publicationMIT Press
Publication statusPublished - 1 Jan 1991
EventLOGIC PROGRAMMING : PROCEEDINGS OF THE 1991 INTERNATIONAL SYMPOSIUM -
Duration: 1 Jan 1991 → …

Conference

ConferenceLOGIC PROGRAMMING : PROCEEDINGS OF THE 1991 INTERNATIONAL SYMPOSIUM
Period1/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