Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). This paper proposes a new θ-subsumption algorithm that is able to return the set of all substitutions by which such a relation holds between two clauses without performing backtracking. Differently from others proposed in the literature, it can be extended to perform resolution, also in theories containing recursive clauses.
CITATION STYLE
Ferilli, S., Di Mauro, N., Basile, T. M. A., & Esposito, F. (2003). θ-subsumption and resolution: A new algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2871, pp. 384–391). Springer Verlag. https://doi.org/10.1007/978-3-540-39592-8_53
Mendeley helps you to discover research relevant for your work.