A new calculus for semantic matching

Bütow B, Giegerich R, Ohlebusch E, Thesing S (1995)
In: PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS. 982. SPRINGER-VERLAG BERLIN: 81-96.

Conference Paper | Published | English

No fulltext has been uploaded

Author
; ; ;
Abstract
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.
Publishing Year
ISSN
PUB-ID

Cite this

Bütow B, Giegerich R, Ohlebusch E, Thesing S. A new calculus for semantic matching. In: PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS. Vol 982. SPRINGER-VERLAG BERLIN; 1995: 81-96.
Bütow, B., Giegerich, R., Ohlebusch, E., & Thesing, S. (1995). A new calculus for semantic matching. PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS, 982, 81-96.
Bütow, B., Giegerich, R., Ohlebusch, E., and Thesing, S. (1995). “A new calculus for semantic matching” in PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS, vol. 982, (SPRINGER-VERLAG BERLIN), 81-96.
Bütow, B., et al., 1995. A new calculus for semantic matching. In PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS. no.982 SPRINGER-VERLAG BERLIN, pp. 81-96.
B. Bütow, et al., “A new calculus for semantic matching”, PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS, vol. 982, SPRINGER-VERLAG BERLIN, 1995, pp.81-96.
Bütow, B., Giegerich, R., Ohlebusch, E., Thesing, S.: A new calculus for semantic matching. PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS. 982, p. 81-96. SPRINGER-VERLAG BERLIN (1995).
Bütow, Bernd, Giegerich, Robert, Ohlebusch, Enno, and Thesing, Stephan. “A new calculus for semantic matching”. PROGRAMMING LANGUAGES: IMPLEMENTATIONS, LOGICS AND PROGRAMS. SPRINGER-VERLAG BERLIN, 1995.Vol. 982. 81-96.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar