Abstract
Our aim is to present here a proposal of counterfactual truth value evaluation, based on a notion of relevance, which we compare to classical counterfactual evaluation. Informally we demand that the truth value of the counterfactual (or conditional) implication p > q should depend on the existence of a deduction of q that requires the truth of p, in some appropriate nearest world. We believe that relevance of counterfactuals is important in A.I. and illustrate that with examples.
Preview
Unable to display preview. Download preview PDF.
References
Lewis, D., Counterfactuals, Harvard University Press, Cambridge, MA. Revised edition, 1986.
Ginsberg, Matthew L., Counterfactuals, Artificial Intelligence 30 (1986), pp. 35–79.
Ginsberg, Matthew L., Smith, David E., Reasoning about Action I:A Possible Worlds Approach Artificial Intelligence 35, pp. 165–195, 1988.
Nute, Donald, Conditional Logic, in Handbook of Philosophical Logic Vol. 2, pp. 387–439, (eds. D. Guenthner and D. Gabbay), D. Reidel, 1986.
Gärdenfors, P., Conditionals and changes of belief, Acta Philos. Fennica 30 (1978), pp. 381–404.
Anderson and Belnap, Entailment: The Logic of Relevance and Necessity, Princeton University Press, 1975.
Read, S., Relevant Logic, Basil Blackwell, 1988.
Routley, F.R. et al. Relevant Logics and their rivals, Atascadero, California, 1982.
Dunn, J.M., Relevant Logic and Entailment, in Handbook of Philosophical Logic, Vol 3, pp. 177–224, (eds. D. Guenthner and D. Gabbay), D. Reidel, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pereira, L.M., Aparício, J.N. (1989). Relevant counterfactuals. In: Martins, J.P., Morgado, E.M. (eds) EPIA 89. EPIA 1989. Lecture Notes in Computer Science, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51665-4_78
Download citation
DOI: https://doi.org/10.1007/3-540-51665-4_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51665-1
Online ISBN: 978-3-540-46743-4
eBook Packages: Springer Book Archive