A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
orn Demolombe, R., An efficient strategy for non-Horn deductive databases, Theoretical Computer Science 78 (1991) 245-259. Many efficient strategies have been presented in the literature to derive answers to queries in the context of Deductive Databases. Most of them deal with definite Horn clauses. More recently, strategies have been defined to deal with non-Horn clauses but they adopt the Generalized Closed World Assumption to reduce incompleteness. In this paper we present an efficientdoi:10.1016/0304-3975(51)90010-2 fatcat:ads47vptqva7hdv4fjw3f36h5i