A new calculus for semantic matching

Bütow B, Giegerich R, Ohlebusch E, Thesing S (1995)
In: Programming languages: implementations, logics and programs. 7th international symposium ; proceedings. Hermenegildo M, Swierstra SD (Eds); Lecture Notes in Computer Science, 982. Berlin: Springer: 81-96.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Bütow, Bernd; Giegerich, RobertUniBi; Ohlebusch, Enno; Thesing, Stephan
Herausgeber*in
Hermenegildo, Manuel; Swierstra, S. Doaitse
Abstract / Bemerkung
In this paper, we present Reverse Restructuring, a new calculus for solving the semantic matching problem. For narrowing, advanced selection rules are commonly seen as an appropriate method to reduce the search space. Our approach to design a special calculus for special goals is another way of reducing the efficiency defects of narrowing. Reverse Restructuring constructs derivations in the reverse direction by guessing terms from which an already known term might be derived. To this end, the rules of the underlying term rewriting system are also applied in the reverse-direction, i.e. from right to left. We show the soundness and completeness of this calculus and demonstrate its efficiency for an important class of problems.
Erscheinungsjahr
1995
Titel des Konferenzbandes
Programming languages: implementations, logics and programs. 7th international symposium ; proceedings
Band
982
Seite(n)
81-96
Konferenz
PLILP '95
Konferenzort
Utrecht, The Netherlands
Konferenzdatum
1995-09-20 – 1995-09-22
ISBN
3-540-60359-X
Page URI
https://pub.uni-bielefeld.de/record/1639513

Zitieren

Bütow B, Giegerich R, Ohlebusch E, Thesing S. A new calculus for semantic matching. In: Hermenegildo M, Swierstra SD, eds. Programming languages: implementations, logics and programs. 7th international symposium ; proceedings. Lecture Notes in Computer Science. Vol 982. Berlin: Springer; 1995: 81-96.
Bütow, B., Giegerich, R., Ohlebusch, E., & Thesing, S. (1995). A new calculus for semantic matching. In M. Hermenegildo & S. D. Swierstra (Eds.), Lecture Notes in Computer Science: Vol. 982. Programming languages: implementations, logics and programs. 7th international symposium ; proceedings (pp. 81-96). Berlin: Springer.
Bütow, B., Giegerich, R., Ohlebusch, E., and Thesing, S. (1995). “A new calculus for semantic matching” in Programming languages: implementations, logics and programs. 7th international symposium ; proceedings, Hermenegildo, M., and Swierstra, S. D. eds. Lecture Notes in Computer Science, vol. 982, (Berlin: Springer), 81-96.
Bütow, B., et al., 1995. A new calculus for semantic matching. In M. Hermenegildo & S. D. Swierstra, eds. Programming languages: implementations, logics and programs. 7th international symposium ; proceedings. Lecture Notes in Computer Science. no.982 Berlin: Springer, pp. 81-96.
B. Bütow, et al., “A new calculus for semantic matching”, Programming languages: implementations, logics and programs. 7th international symposium ; proceedings, M. Hermenegildo and S.D. Swierstra, eds., Lecture Notes in Computer Science, vol. 982, Berlin: Springer, 1995, pp.81-96.
Bütow, B., Giegerich, R., Ohlebusch, E., Thesing, S.: A new calculus for semantic matching. In: Hermenegildo, M. and Swierstra, S.D. (eds.) Programming languages: implementations, logics and programs. 7th international symposium ; proceedings. Lecture Notes in Computer Science. 982, p. 81-96. Springer, Berlin (1995).
Bütow, Bernd, Giegerich, Robert, Ohlebusch, Enno, and Thesing, Stephan. “A new calculus for semantic matching”. Programming languages: implementations, logics and programs. 7th international symposium ; proceedings. Ed. Manuel Hermenegildo and S. Doaitse Swierstra. Berlin: Springer, 1995.Vol. 982. Lecture Notes in Computer Science. 81-96.