A typed resolution principle for deduction with conditional typing theory

Artificial Intelligence 75 (2):161-194 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,692,869)

6 months
5 (#1,035,390)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
Linear resolution with selection function.Robert Kowalski & Donald Kuehner - 1971 - Artificial Intelligence 2 (3-4):227-260.
A semantic backward chaining proof system.Xumin Nie & David A. Plaisted - 1992 - Artificial Intelligence 55 (1):109-128.

Add more references