Access Restriction

Author Gallier, Jean ♦ Narendran, Paliath ♦ Raatz, Stan ♦ Snyder, Wayne
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Knuth-Bendix procedure ♦ NP-completeness ♦ Automated theorem proving ♦ Equational reasoning ♦ Matings ♦ Unification
Abstract In this paper, it is shown that the method of matings due toAndrews and Bibel can be extended to (first-order) languages withequality. A decidable version of<?Pub Fmt italic>E<?Pub Fmt /italic>-unification called<?Pub Fmt italic>rigid E-unification<?Pub Fmt /italic> is introduced,and it is shown that the method of equational matings remains completewhen used in conjunction with rigid<?Pub Fmt italic>E<?Pub Fmt /italic>-unification. Checking that a familyof mated sets is an equational mating is equivalent to the followingrestricted kind of<?Pub Fmt italic>E<?Pub Fmt /italic>-unification.<?Pub Fmt italic>Problem<?Pub Fmt /italic> Given E&ar;=<fen lp="cub">Ei∣1≤i≤n<rp post="cub">
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 39
Issue Number 2
Page Count 54
Starting Page 377
Ending Page 430

Open content in new tab

   Open content in new tab
Source: ACM Digital Library