Göm menyn
Files: Description Format
Fulltext, revised PDF (requires Acrobat Reader)
Fulltext, revised PostScript (requires a PostScript Reader)
  Fulltext, original PDF (requires Acrobat Reader)
  Fulltext, original PostScript (requires a PostScript Reader)
Authors: Tom Costello and John McCarthy
Article title: Useful Counterfactuals
Publ. type: Article
Volume: 4
Article No: 12
Language: English
Abstract [en]: Counterfactual conditional sentences can be useful in artificial intelligence. In particular, they allow reasoners to learn from experiences that they did not quite have. The truth of a counterfactual and the conclusions that can be drawn from a counterfactual are theory dependent, and different theories are useful in different circumstances.

A simple class of useful counterfactuals involves a change of one component of a point in a space provided with a cartesian product structure. We call these cartesian counterfactuals. Cartesian counterfactuals can be modeled by assignment and contents functions as in program semantics. We also study the more general tree-structured counterfactuals.

Publisher: Linköping University Electronic Press
Year: 1999
Available: 1999-08-16 and 2000-12-21
No. of pages: 24
Series: Linköping Electronic Articles in Computer and Information Science
ISSN: 1401-9841

Responsible for this page: Peter Berkesand
Last updated: 2017-02-21