Abstract
In this paper we propose a general-purpose first-order automated reasoning framework based on the notion of a definite formula and on a non-clausal variant of SLD-resolution. This framework provides a universal Horn clause-like representation of knowledge for classical as well as a range of non-classical first-order logics. It provides a resolution-style method for automated reasoning with theories of definite formulas.
Get full access to this article
View all access options for this article.