Electronic Resource
Springer
Journal of automated reasoning
7 (1991), S. 563-585
ISSN:
1573-0670
Keywords:
Conditionals
;
relevance
;
logic programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract In this paper we present a fragment of (positive) relevant logic which can be computed by a straightforward extension to SLD resolution while allowing full nesting of implications. These two requirements lead quite naturally to a fragment in which the major feature is an ambiguous ‘user-level’ conjunction which is interpreted intensionally in ‘query’ positions and extensionally in ‘assertion’ positions. These restrictions allow a simple and efficient extension to SLD resolution (and more particularly, the PROLOG evaluation scheme) with quite minor loss in expressive power.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01880329
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |