Theorem proving using equational matings and rigid E -unification
Work
Year: 1992
Type: article
Abstract: In this paper, it is shown that the method of matings due to Andrews and Bibel can be extended to (first-order) languages with equality. A decidable version of E -unification called rigid E-unificatio... more
Source: Journal of the ACM
Institutions Rutgers, The State University of New Jersey, Boston University, University of Pennsylvania, University at Albany, State University of New York
Cites: 39
Cited by: 41
Related to: 10
FWCI: 3.81
Citation percentile (by year/subfield): 87.38
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze