
AbstractA resolution proof procedure that operates on well-formed formulae with all quantifiers in place is presented. Extension of the unification algorithm ρ Q-unification (i.e. with quantifiers in place) is also discussed. The procedure involves a single inference rule called WFF-resolution which is proved to be sound and complete.
Theoretical Computer Science, Computer Science(all)
Theoretical Computer Science, Computer Science(all)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
